Fetching the paper…
Reading the bibliography…
In high stake applications, active experimentation may be considered too risky and thus data are often collected passively.
Complexity and cooperation in q-learning
Steven D Whitehead · 1991
Earlier work this paper cites.
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Michael Mitzenmacher and Eli Upfal · 2005
Earlier work this paper cites.
Minimax PAC bounds on the sample complexity of reinforcement learning with a generative model
Mohammad Gheshlaghi Azar, Rémi Munos, and Hilbert J Kappen · 2013
Earlier work this paper cites.
Markov decision processes: discrete stochastic dynamic programming
Martin L Puterman · 2014
Earlier work this paper cites.
Toward minimax off-policy value estimation
L. Li, R. Munos, and Cs. Szepesvári · 2015
Earlier work this paper cites.
Doubly robust off-policy value evaluation for reinforcement learning
Nan Jiang and Lihong Li · 2016
Earlier work this paper cites.
Using options and covariance testing for long horizon off-policy policy evaluation
Zhaohan Daniel Guo, Philip S Thomas, and Emma Brunskill · 2017
Earlier work this paper cites.
Breaking the curse of horizon: Infinite-horizon off-policy estimation
Qiang Liu, Lihong Li, Ziyang Tang, and Dengyong Zhou · 2018
Earlier work this paper cites.
Near-optimal time and sample complexities for solving Markov decision processes with a generative model
Aaron Sidford, Mengdi Wang, Xian Wu, Lin F. Yang, and Yinyu Ye · 2018
Earlier work this paper cites.
Provably efficient q-learning with low switching cost
Yu Bai, Tengyang Xie, Nan Jiang, and Yu-Xiang Wang · 2019
Earlier work this paper cites.
Information-theoretic considerations in batch reinforcement learning
Jinglin Chen and Nan Jiang · 2019
Earlier work this paper cites.
Way off-policy batch deep reinforcement learning of implicit human preferences in dialog
Natasha Jaques, Asma Ghandeharioun, Judy Hanwen Shen, Craig Ferguson, Agata Lapedriza, Noah Jones, Shixiang Gu, and Rosalind Picard · 2019
Earlier work this paper cites.
Stabilizing off-policy q-learning via bootstrapping error reduction
Aviral Kumar, Justin Fu, George Tucker, and Sergey Levine · 2019
Earlier work this paper cites.
Safe policy improvement with baseline bootstrapping
Romain Laroche, Paul Trichelair, and Remi Tachet Des Combes · 2019
Earlier work this paper cites.
Off-policy policy gradient with state distribution correction
Yao Liu, Adith Swaminathan, Alekh Agarwal, and Emma Brunskill · 2019
Earlier work this paper cites.
Behavior regularized offline reinforcement learning
Yifan Wu, George Tucker, and Ofir Nachum · 2019
Earlier work this paper cites.
A variant of the Wang-Foster-Kakade lower bound for the discounted setting
Philip Amortila, Nan Jiang, and Tengyang Xie · 2020
Earlier work this paper cites.
Is plug-in solver sample-efficient for feature-based reinforcement learning?
Qiwen Cui and Lin Yang · 2020
Cited alongside, same era.
D4rl: Datasets for deep data-driven reinforcement learning
Justin Fu, Aviral Kumar, Ofir Nachum, George Tucker, and Sergey Levine · 2020
Cited alongside, same era.
Rl unplugged: A suite of benchmarks for offline reinforcement learning
Caglar Gulcehre, Ziyu Wang, Alexander Novikov, Tom Le Paine, Sergio Gomez Colmenarejo, Konrad Zolna, Rishabh Agarwal, Josh Merel, Daniel Mankowitz, Cosmin Paduraru, et al · 2020
Cited alongside, same era.
Reward-free exploration for reinforcement learning
Chi Jin, Akshay Krishnamurthy, Max Simchowitz, and Tiancheng Yu · 2020
Cited alongside, same era.
MOReL: Model-based offline reinforcement learning
Rahul Kidambi, Aravind Rajeswaran, Praneeth Netrapalli, and Thorsten Joachims · 2020
Cited alongside, same era.
The importance of pessimism in fixed-dataset policy optimization
Jacob Buckman, Carles Gelada, and Marc G. Bellemare · 2021
Closest in time.
Infinite-horizon offline reinforcement learning with linear function approximation: Curse of dimensionality and algorithm
Lin Chen, Bruno Scherrer, and Peter L. Bartlett · 2021
Closest in time.
A provably efficient algorithm for linear markov decision process with low switching cost
Minbo Gao, Tianle Xie, Simon S Du, and Lin F Yang · 2021
Closest in time.
Is pessimism provably efficient for offline RL?
Ying Jin, Zhuoran Yang, and Zhaoran Wang · 2021
Closest in time.
Adaptive reward-free exploration
Emilie Kaufmann, Pierre Ménard, Omar Darwiche Domingues, Anders Jonsson, Edouard Leurent, and Michal Valko · 2021
Closest in time.
The difficulty of passive learning in deep reinforcement learning
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Conservative q-learning for offline reinforcement learning
Aviral Kumar, Aurick Zhou, George Tucker, and Sergey Levine · 2020
Cited alongside, same era.
Bandit algorithms
Tor Lattimore and Csaba Szepesvári · 2020
Cited alongside, same era.
Learning with good feature representations in bandits and in RL with a generative model
Tor Lattimore, Csaba Szepesvári, and Gellért Weisz · 2020
Cited alongside, same era.
Offline reinforcement learning: Tutorial, review, and perspectives on open problems
Sergey Levine, Aviral Kumar, George Tucker, and Justin Fu · 2020
Cited alongside, same era.
Breaking the sample size barrier in model-based reinforcement learning with a generative model
Gen Li, Yuting Wei, Yuejie Chi, Yuantao Gu, and Yuxin Chen · 2020
Cited alongside, same era.
Batch policy learning in average reward Markov decision processes
Peng Liao, Zhengling Qi, and Susan Murphy · 2020
Cited alongside, same era.
Provably good batch off-policy reinforcement learning without great exploration
Yao Liu, Adith Swaminathan, Alekh Agarwal, and Emma Brunskill · 2020
Cited alongside, same era.
Georg Ostrovski, Pablo Samuel Castro, and Will Dabney · 2021
Closest in time.
Neorl: A near real-world benchmark for offline reinforcement learning
Rongjun Qin, Songyi Gao, Xingyuan Zhang, Zhen Xu, Shengkai Huang, Zewen Li, Weinan Zhang, and Yang Yu · 2021
Closest in time.
Bridging offline reinforcement learning and imitation learning: A tale of pessimism
Paria Rashidinejad, Banghua Zhu, Cong Ma, Jiantao Jiao, and Stuart Russell · 2021
Closest in time.
Nearly horizon-free offline reinforcement learning
Tongzheng Ren, Jialian Li, Bo Dai, Simon S Du, and Sujay Sanghavi · 2021
Closest in time.
Masatoshi Uehara, Masaaki Imaizumi, Nan Jiang, Nathan Kallus, Wen Sun, and Tengyang Xie · 2021
Closest in time.
What are the statistical limits of offline RL with linear function approximation?
Ruosong Wang, Dean P. Foster, and Sham M. Kakade · 2021
Closest in time.
On the optimality of batch policy optimization algorithms
Chenjun Xiao, Yifan Wu, Tor Lattimore, Bo Dai, Jincheng Mei, Lihong Li, Csaba Szepesvári, and Dale Schuurmans · 2021
Closest in time.
Batch value-function approximation with only realizability
Tengyang Xie and Nan Jiang · 2021
Closest in time.
Ming Yin and Yu-Xiang Wang · 2021
Closest in time.
COMBO: conservative offline model-based policy optimization
Tianhe Yu, Aviral Kumar, Rafael Rafailov, Aravind Rajeswaran, Sergey Levine, and Chelsea Finn · 2021
Closest in time.
Exponential lower bounds for batch reinforcement learning: Batch RL can be exponentially harder than online RL
Andrea Zanette · 2021
Closest in time.
Near optimal reward-free reinforcement learning
Zihan Zhang, Simon Du, and Xiangyang Ji · 2021
Closest in time.