Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

26

NIPS
2008

favoriteEmaildiscussreport

98views Information Technology» more NIPS 2008»

Near-optimal Regret Bounds for Reinforcement Learning

14 years 9 days ago

Near-optimal Regret Bounds for Reinforcement Learning

Download eprints.pascal-network.org

Peter Auer, Thomas Jaksch, Ronald Ortner

Real-time Traffic

Information Technology | NIPS 2008 |

claim paper

Related Content

» NearOptimal Reinforcement Learning in Polynomial Time

» An Asymptotically Optimal Bandit Algorithm for Bounded Support Models

» Optimism in Reinforcement Learning Based on KullbackLeibler Divergence

» Performance Bounded Reinforcement Learning in Strategic Interactions

» PAC modelfree reinforcement learning

» Finitetime Analysis of the Multiarmed Bandit Problem

» A hierarchical approach to efficient reinforcement learning in deterministic domains

» Contextual Bandit Learning with Predictable Rewards

» Tree Exploration for Bayesian RL Exploration

Post Info
More Details (n/a)

Added	30 Oct 2010
Updated	30 Oct 2010
Type	Conference
Year	2008
Where	NIPS
Authors	Peter Auer, Thomas Jaksch, Ronald Ortner

Comments (0)