3 search results - page 1 / 1 » Nearly optimal exploration-exploitation decision thresholds |
CORR
2006
Springer
13 years 11 months ago
2006
Springer
While in general trading off exploration and exploitation in reinforcement learning is hard, under some formulations relatively simple solutions exist. Optimal decision thresholds ...
ML
2002
ACM
13 years 10 months ago
2002
ACM
We present new algorithms for reinforcement learning, and prove that they have polynomial bounds on the resources required to achieve near-optimal return in general Markov decisio...
FOCS
2008
IEEE
14 years 5 months ago
2008
IEEE
We show a tight lower bound of Ω(N log log N) on the number of transmissions required to compute several functions (including the parity function and the majority function) in a...