701 search results - page 68 / 141 » Self Bounding Learning Algorithms |
143
Voted
ICML
2010
IEEE
15 years 3 months ago
2010
IEEE
Many applications require optimizing an unknown, noisy function that is expensive to evaluate. We formalize this task as a multiarmed bandit problem, where the payoff function is ...
155
click to vote
COLT
2010
Springer
15 years 18 days ago
2010
Springer
We describe online algorithms for learning a rotation from pairs of unit vectors in Rn . We show that the expected regret of our online algorithm compared to the best fixed rotati...
70
Voted
ICML
2010
IEEE
15 years 3 months ago
2010
IEEE
Abstract--Reinforcement learning (RL) research typically develops algorithms for helping an RL agent best achieve its goals-however they came to be defined--while ignoring the rela...
93
Voted
NIPS
2004
15 years 4 months ago
2004
We propose a "soft greedy" learning algorithm for building small conjunctions of simple threshold functions, called rays, defined on single real-valued attributes. We al...
112
Voted
FOCS
2010
IEEE
15 years 18 days ago
2010
IEEE
We present a new algorithm for learning a convex set in n-dimensional space given labeled examples drawn from any Gaussian distribution. The complexity of the algorithm is bounded ...