701 search results - page 45 / 141 » Self Bounding Learning Algorithms |
WSOM
2009
Springer
14 years 4 months ago
2009
Springer
Bag of features is a well established technique for the visual categorisation of objects, categories of objects and textures. One of the most important part of this technique is co...
COLT
2000
Springer
14 years 2 months ago
2000
Springer
We give the first rigorous upper bounds on the error of temporal difference (td) algorithms for policy evaluation as a function of the amount of experience. These upper bounds pr...
JMM2
2008
13 years 9 months ago
2008
Unsupervised or Self-Organized learning algorithms have become very popular for discovery of significant patterns or features in the input data. The three prominent algorithms name...
COLT
2007
Springer
14 years 3 months ago
2007
Springer
Bounded parameter Markov Decision Processes (BMDPs) address the issue of dealing with uncertainty in the parameters of a Markov Decision Process (MDP). Unlike the case of an MDP, t...
COLT
2010
Springer
13 years 7 months ago
2010
Springer
Bandit convex optimization is a special case of online convex optimization with partial information. In this setting, a player attempts to minimize a sequence of adversarially gen...