SlowGuess/NeurIPS_2023_OCR huggingface dataset:
[53] Andrea Tirinzoni, Aymen Al Marjani, and Emilie Kaufmann. Near instance-optimal pac reinforcement learning for deterministic mdps. Advances in Neural Information Processing Systems (NeurIPS), 35:8785-8798, 2022.
[54] Andrew Wagenmaker and Kevin G Jamieson. Instance-dependent near-optimal policy identification in linear mdps via online experiment design. Advances in Neural Information Processing Systems (NeurIPS), 35:5968-5981, 2022.
[55] Andrew J. Wagenmaker, Max Simchowitz, and Kevin Jamieson. Beyond no regret: Instance-dependent pac reinforcement learning. In Conference on Learning Theory, pages 358-418. PMLR, 2022.
[56] Yuanhao Wang, Kefan Dong, Xiaoyu Chen, and Liwei Wang. Q-learning with ucb exploration is sample efficient for infinite-horizon mdp. In International Conference on Learning Representations, 2019.
[57] Christopher John Cornish Hellaby Watkins. Learning from delayed rewards. PhD thesis, Cambridge University, Cambridge, England, 1989.
[58] Jeremy Wyatt. Exploration and inference in learning from reinforcement. PhD thesis, University of Edinburgh, Edinburgh, England, 1998.
[59] Tianpei Yang, Hongyao Tang, Chenjia Bai, Jinyi Liu, Jianye Hao, Zhaopeng Meng, Peng Liu, and Zhen Wang. Exploration in deep reinforcement learning: a comprehensive survey. arXiv preprint arXiv:2109.06668, 2021.
[60] Andrea Zanette, Mykel J Kochenderfer, and Emma Brunskill. Almost horizon-free structure-aware best policy identification with a generative model. In Advances in Neural Information Processing Systems (NeurIPS), volume 32, 2019.