Near-optimal Representation Learning for Linear Bandits and Linear RL
暂无分享,去创建一个
Xiaoyu Chen | Liwei Wang | Chi Jin | Jiachen Hu | Lihong Li | Xiaoyu Chen | Lihong Li | Chi Jin | Liwei Wang | Jiachen Hu
[1] Xiangyang Ji,et al. Is Reinforcement Learning More Difficult Than Bandits? A Near-optimal Algorithm Escaping the Curse of Horizon , 2021, COLT.
[2] Tong Zhang,et al. A Framework for Learning Predictive Structures from Multiple Tasks and Unlabeled Data , 2005, J. Mach. Learn. Res..
[3] Liangpei Zhang,et al. Joint Collaborative Representation With Multitask Learning for Hyperspectral Image Classification , 2014, IEEE Transactions on Geoscience and Remote Sensing.
[4] Andrea Bonarini,et al. Sharing Knowledge in Multi-Task Deep Reinforcement Learning , 2020, ICLR.
[5] Rich Caruana,et al. Multitask Learning , 1998, Encyclopedia of Machine Learning and Data Mining.
[6] Mengdi Wang,et al. Sample-Optimal Parametric Q-Learning Using Linearly Additive Features , 2019, ICML.
[7] Thomas P. Hayes,et al. Stochastic Linear Optimization under Bandit Feedback , 2008, COLT.
[8] Koby Crammer,et al. Linear Multi-Resource Allocation with Semi-Bandit Feedback , 2015, NIPS.
[9] Ruslan Salakhutdinov,et al. Actor-Mimic: Deep Multitask and Transfer Reinforcement Learning , 2015, ICLR.
[10] Wojciech Czarnecki,et al. Multi-task Deep Reinforcement Learning with PopArt , 2018, AAAI.
[11] Xiaodong Liu,et al. Multi-Task Deep Neural Networks for Natural Language Understanding , 2019, ACL.
[12] Yee Whye Teh,et al. Distral: Robust multitask reinforcement learning , 2017, NIPS.
[13] Wei Chu,et al. Contextual Bandits with Linear Payoff Functions , 2011, AISTATS.
[14] Yuan Zhou,et al. Nearly Minimax-Optimal Regret for Linearly Parameterized Bandits , 2019, COLT.
[15] Pascal Vincent,et al. Representation Learning: A Review and New Perspectives , 2012, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[16] Tor Lattimore,et al. High-Dimensional Sparse Linear Bandits , 2020, NeurIPS.
[17] Nan Jiang,et al. Contextual Decision Processes with low Bellman rank are PAC-Learnable , 2016, ICML.
[18] Sanjeev Arora,et al. Provable Representation Learning for Imitation Learning via Bi-level Optimization , 2020, ICML.
[19] Yingkai Li,et al. Tight Regret Bounds for Infinite-armed Linear Contextual Bandits , 2019, AISTATS.
[20] Massimiliano Pontil,et al. The Benefit of Multitask Representation Learning , 2015, J. Mach. Learn. Res..
[21] Jonathan Baxter,et al. A Model of Inductive Bias Learning , 2000, J. Artif. Intell. Res..
[22] Ruosong Wang,et al. Is Long Horizon Reinforcement Learning More Difficult Than Short Horizon Reinforcement Learning? , 2020, ArXiv.
[23] Vijay S. Pande,et al. Massively Multitask Networks for Drug Discovery , 2015, ArXiv.
[24] Alan Fern,et al. Multi-task reinforcement learning: a hierarchical Bayesian approach , 2007, ICML '07.
[25] Csaba Szepesvari,et al. Bandit Algorithms , 2020 .
[26] Michael I. Jordan,et al. Is Q-learning Provably Efficient? , 2018, NeurIPS.
[27] Rémi Munos,et al. Bandit Theory meets Compressed Sensing for high dimensional Stochastic Linear Bandit , 2012, AISTATS.
[28] Csaba Szepesvári,et al. Improved Algorithms for Linear Stochastic Bandits , 2011, NIPS.
[29] Peter Auer,et al. Using Confidence Bounds for Exploitation-Exploration Trade-offs , 2003, J. Mach. Learn. Res..
[30] Michael I. Jordan,et al. Provably Efficient Reinforcement Learning with Linear Function Approximation , 2019, COLT.
[31] Mengdi Wang,et al. Reinforcement Leaning in Feature Space: Matrix Bandit, Kernels, and Regret Bound , 2019, ICML.
[32] Ambuj Tewari,et al. Low-Rank Generalized Linear Bandit Problems , 2020, AISTATS.
[33] Katja Hofmann,et al. Decoding multitask DQN in the world of Minecraft , 2019 .
[34] Wei Hu,et al. Provable Benefits of Representation Learning in Linear Bandits , 2020, ArXiv.
[35] Mykel J. Kochenderfer,et al. Provably Efficient Reward-Agnostic Navigation with Linear Value Iteration , 2020, NeurIPS.
[36] Peter Stone,et al. Transfer Learning for Reinforcement Learning Domains: A Survey , 2009, J. Mach. Learn. Res..
[37] Sebastian Thrun,et al. Learning to Learn: Introduction and Overview , 1998, Learning to Learn.
[38] Alessandro Lazaric,et al. Learning Near Optimal Policies with Low Inherent Bellman Error , 2020, ICML.
[39] Sham M. Kakade,et al. Few-Shot Learning via Learning the Representation, Provably , 2020, ICLR.
[40] Quanquan Gu,et al. Nearly Minimax Optimal Reinforcement Learning for Linear Mixture Markov Decision Processes , 2020, COLT.
[41] Rémi Munos,et al. Minimax Regret Bounds for Reinforcement Learning , 2017, ICML.
[42] Mengdi Wang,et al. Model-Based Reinforcement Learning with Value-Targeted Regression , 2020, L4DC.
[43] Robert D. Nowak,et al. Bilinear Bandits with Low-rank Structure , 2019, ICML.
[44] King-Sun Fu,et al. IEEE Transactions on Pattern Analysis and Machine Intelligence Publication Information , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[45] Michael I. Jordan,et al. Provable Meta-Learning of Linear Representations , 2020, ICML.
[46] Csaba Szepesvári,et al. Online-to-Confidence-Set Conversions and Application to Sparse Stochastic Bandits , 2012, AISTATS.
[47] Lihong Li,et al. Sample Complexity of Multi-task Reinforcement Learning , 2013, UAI.
[48] Tor Lattimore,et al. Learning with Good Feature Representations in Bandits and in RL with a Generative Model , 2020, ICML.
[49] John N. Tsitsiklis,et al. Linearly Parameterized Bandits , 2008, Math. Oper. Res..
[50] Quanquan Gu,et al. Provably Efficient Reinforcement Learning for Discounted MDPs with Feature Mapping , 2020, ICML.