495 search results - page 24 / 99 » Approximation algorithms for budgeted learning problems |
ATAL
2009
Springer
14 years 3 months ago
2009
Springer
Reinforcement learning algorithms that use eligibility traces, such as Sarsa(λ), have been empirically shown to be effective in learning good estimated-state-based policies in pa...
ICML
2000
IEEE
14 years 9 months ago
2000
IEEE
We explore combining reinforcement learning with a hand-crafted local controller in a manner suggested by the chaotic control algorithm of Vincent, Schmitt and Vincent (1994). A c...
JMLR
2008
13 years 8 months ago
2008
We describe and analyze an algorithmic framework for online classification where each online trial consists of multiple prediction tasks that are tied together. We tackle the prob...
ICML
2009
IEEE
14 years 9 months ago
2009
IEEE
We cast model-free reinforcement learning as the problem of maximizing the likelihood of a probabilistic mixture model via sampling, addressing both the infinite and finite horizo...
ICML
2010
IEEE
13 years 9 months ago
2010
IEEE
Many structured prediction tasks involve complex models where inference is computationally intractable, but where it can be well approximated using a linear programming relaxation...