3694 search results - page 224 / 739 » Stochastic complexity in learning |
191
click to vote
AAAI
1996
15 years 7 months ago
1996
Procedural representations of control policies have two advantages when facing the scale-up problem in learning tasks. First they are implicit, with potential for inductive genera...
208
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
For artificial entities to achieve high degrees of autonomy they will need to display appropriate adaptability. In this sense adaptability includes representational flexibility gu...
150
click to vote
JMLR
2002
15 years 5 months ago
2002
We extend the classical algorithms of Valiant and Haussler for learning compact conjunctions and disjunctions of Boolean attributes to allow features that are constructed from the...
163
click to vote
ICCV
2009
IEEE
15 years 3 months ago
2009
IEEE
The use of Mercer kernel methods in statistical learning theory provides for strong learning capabilities, as seen in kernel principal component analysis and support vector machin...
159
click to vote
AAAI
2000
15 years 7 months ago
2000
As applications for artificially intelligent agents increase in complexity we can no longer rely on clever heuristics and hand-tuned behaviors to develop their programming. Even t...