Context-Dependent Upper-Confidence Bounds for Directed Exploration
暂无分享,去创建一个
Martha White | Adam White | Matthew Schlegel | Raksha Kumaraswamy | Adam White | Martha White | Raksha Kumaraswamy | M. Schlegel
[1] Jürgen Schmidhuber,et al. Efficient model-based exploration , 1998 .
[2] Lihong Li,et al. Online exploration in least-squares policy iteration , 2009, AAMAS.
[3] Ronald Ortner,et al. Online Regret Bounds for Undiscounted Continuous Reinforcement Learning , 2012, NIPS.
[4] Shirley Dex,et al. JR 旅客販売総合システム(マルス)における運用及び管理について , 1991 .
[5] Peter Auer,et al. Logarithmic Online Regret Bounds for Undiscounted Reinforcement Learning , 2006, NIPS.
[6] Peter Stone,et al. Gaussian Processes for Sample Efficient Reinforcement Learning with RMAX-like Exploration , 2010, ECML/PKDD.
[7] M. Littman,et al. Exploration via Model-based Interval Estimation , 2004 .
[8] Catholijn M. Jonker,et al. Efficient exploration with Double Uncertain Value Networks , 2017, ArXiv.
[9] Peter Auer,et al. Near-optimal Regret Bounds for Reinforcement Learning , 2008, J. Mach. Learn. Res..
[10] Peter Stone,et al. Model-Based Exploration in Continuous State Spaces , 2007, SARA.
[11] Csaba Szepesvári,et al. Bayesian Optimal Control of Smoothly Parameterized Systems: The Lazy Posterior Sampling Algorithm , 2014, ArXiv.
[12] Lihong Li,et al. PAC model-free reinforcement learning , 2006, ICML.
[13] Benjamin Van Roy,et al. (More) Efficient Reinforcement Learning via Posterior Sampling , 2013, NIPS.
[14] Michael L. Littman,et al. Multi-resolution Exploration in Continuous Spaces , 2008, NIPS.
[15] Shie Mannor,et al. Shallow Updates for Deep Reinforcement Learning , 2017, NIPS.
[16] Martha White,et al. Interval Estimation for Reinforcement-Learning Algorithms in Continuous-State Domains , 2010, NIPS.
[17] Jonathan P. How,et al. Sample Efficient Reinforcement Learning with Gaussian Processes , 2014, ICML.
[18] Ronen I. Brafman,et al. R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning , 2001, J. Mach. Learn. Res..
[19] Steven J. Bradtke,et al. Linear Least-Squares algorithms for temporal difference learning , 2004, Machine Learning.
[20] Benjamin Van Roy,et al. Why is Posterior Sampling Better than Optimism for Reinforcement Learning? , 2016, ICML.
[21] Marcin Andrychowicz,et al. Parameter Space Noise for Exploration , 2017, ICLR.
[22] Martha White,et al. Unifying Task Specification in Reinforcement Learning , 2016, ICML.
[23] Alborz Geramifard,et al. Dyna-Style Planning with Linear Function Approximation and Prioritized Sweeping , 2008, UAI.
[24] Rich Sutton,et al. A Deeper Look at Planning as Learning from Replay , 2015, ICML.
[25] Richard S. Sutton,et al. Reinforcement Learning: An Introduction , 2005, IEEE Transactions on Neural Networks.
[26] Tommi S. Jaakkola,et al. Convergence Results for Single-Step On-Policy Reinforcement-Learning Algorithms , 2000, Machine Learning.
[27] Jason Pazis,et al. PAC Optimal Exploration in Continuous Space Markov Decision Processes , 2013, AAAI.
[28] Csaba Szepesvári,et al. Algorithms for Reinforcement Learning , 2010, Synthesis Lectures on Artificial Intelligence and Machine Learning.
[29] Csaba Szepesvári,et al. Model-based reinforcement learning with nearly tight exploration complexity bounds , 2010, ICML.
[30] Michail G. Lagoudakis,et al. Least-Squares Policy Iteration , 2003, J. Mach. Learn. Res..
[31] Richard S. Sutton,et al. Learning to predict by the methods of temporal differences , 1988, Machine Learning.
[32] Paul Bourgine,et al. Exploration of Multi-State Environments: Local Measures and Back-Propagation of Uncertainty , 1999, Machine Learning.
[33] Wei Chu,et al. Contextual Bandits with Linear Payoff Functions , 2011, AISTATS.
[34] Kenji Kawaguchi,et al. Bounded Optimal Exploration in MDP , 2016, AAAI.
[35] K. Miller. On the Inverse of the Sum of Matrices , 1981 .
[36] Leslie Pack Kaelbling,et al. Learning in embedded systems , 1993 .
[37] Andrew W. Moore,et al. Reinforcement Learning: A Survey , 1996, J. Artif. Intell. Res..
[38] Ambuj Tewari,et al. REGAL: A Regularization based Algorithm for Reinforcement Learning in Weakly Communicating MDPs , 2009, UAI.
[39] John Langford,et al. Exploration in Metric State Spaces , 2003, ICML.
[40] Michael Kearns,et al. Near-Optimal Reinforcement Learning in Polynomial Time , 2002, Machine Learning.
[41] Marc G. Bellemare,et al. Count-Based Exploration with Neural Density Models , 2017, ICML.
[42] Benjamin Van Roy,et al. Deep Exploration via Bootstrapped DQN , 2016, NIPS.
[43] Wei Chu,et al. A contextual-bandit approach to personalized news article recommendation , 2010, WWW '10.
[44] J. Meyer. Generalized Inversion of Modified Matrices , 1973 .
[45] Benjamin Van Roy,et al. Generalization and Exploration via Randomized Value Functions , 2014, ICML.
[46] Justin A. Boyan,et al. Technical Update: Least-Squares Temporal Difference Learning , 2002, Machine Learning.