{"total":18,"rows":[{"id":"2012.15085","title":"Is Pessimism Provably Efficient for Offline RL?","created":"2020-12-30","cited_by_count":364,"area":"offlinerl"},{"id":"2103.12021","title":"Bridging Offline Reinforcement Learning and Imitation Learning: A Tale of Pessimism","created":"2021-03-22","cited_by_count":279,"area":"offlinerl"},{"id":"2106.04895","title":"Policy Finetuning: Bridging Sample-Efficient Offline and Online Reinforcement Learning","created":"2021-06-09","cited_by_count":158,"area":"offlinerl"},{"id":"2108.08812","title":"Provable Benefits of Actor-Critic Methods for Offline Reinforcement Learning","created":"2021-08-19","cited_by_count":110,"area":"offlinerl"},{"id":"2202.13890","title":"Pessimistic Q-Learning for Offline Reinforcement Learning: Towards Optimal Sample Complexity","created":"2022-02-28","cited_by_count":85,"area":"offlinerl"},{"id":"2110.08695","title":"Towards Instance-Optimal Offline Reinforcement Learning with Pessimism","created":"2021-10-17","cited_by_count":78,"area":"offlinerl"},{"id":"2102.01748","title":"Near-Optimal Offline Reinforcement Learning via Double Variance Reduction","created":"2021-02-02","cited_by_count":56,"area":"offlinerl"},{"id":"2102.02981","title":"Finite Sample Analysis of Minimax Offline Reinforcement Learning: Completeness, Fast Rates and First-Order Efficiency","created":"2021-02-05","cited_by_count":56,"area":"offlinerl"},{"id":"2106.06630","title":"Corruption-Robust Offline Reinforcement Learning","created":"2021-06-11","cited_by_count":51,"area":"offlinerl"},{"id":"2103.13883","title":"Risk Bounds and Rademacher Complexity in Batch Reinforcement Learning","created":"2021-03-25","cited_by_count":42,"area":"offlinerl"},{"id":"2103.14077","title":"Nearly Horizon-Free Offline Reinforcement Learning","created":"2021-03-25","cited_by_count":36,"area":"offlinerl"},{"id":"2102.00479","title":"Fast Rates for the Regret of Offline Reinforcement Learning","created":"2021-01-31","cited_by_count":26,"area":"offlinerl"},{"id":"2302.02571","title":"Offline Learning in Markov Games with General Function Approximation","created":"2023-02-06","cited_by_count":18,"area":"offlinerl"},{"id":"2210.00750","title":"Offline Reinforcement Learning with Differentiable Function Approximation is Provably Efficient","created":"2022-10-03","cited_by_count":12,"area":"offlinerl"},{"id":"2103.09847","title":"Infinite-Horizon Offline Reinforcement Learning with Linear Function Approximation: Curse of Dimensionality and Algorithm","created":"2021-03-17","cited_by_count":10,"area":"offlinerl"},{"id":"2203.12786","title":"Bellman Residual Orthogonalization for Offline Reinforcement Learning","created":"2022-03-24","cited_by_count":10,"area":"offlinerl"},{"id":"2301.11426","title":"Model-based Offline Reinforcement Learning with Local Misspecification","created":"2023-01-26","cited_by_count":5,"area":"offlinerl"},{"id":"2202.02850","title":"Stochastic Gradient Descent with Dependent Data for Offline Reinforcement Learning","created":"2022-02-06","cited_by_count":2,"area":"offlinerl"}],"next_cursor":null}