{"total":17,"rows":[{"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":"2204.05618","title":"When Should We Prefer Offline Reinforcement Learning Over Behavioral Cloning?","created":"2022-04-12","cited_by_count":89,"area":"offlinerl"},{"id":"2208.05767","title":"Distributionally Robust Model-Based Offline Reinforcement Learning with Near-Optimal Sample Complexity","created":"2022-08-11","cited_by_count":87,"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":"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":"2304.07278","title":"Minimax-Optimal Reward-Agnostic Exploration in Reinforcement Learning","created":"2023-04-14","cited_by_count":15,"area":"offlinerl"},{"id":"2105.06029","title":"Optimal Uniform OPE and Model-based Offline Reinforcement Learning in Time-Homogeneous, Reward-Free and Task-Agnostic Settings","created":"2021-05-13","cited_by_count":14,"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":"2208.11040","title":"Strategic Decision-Making in the Presence of Information Asymmetry: Provably Efficient RL with Algorithmic Instruments","created":"2022-08-23","cited_by_count":9,"area":"offlinerl"},{"id":"2310.20663","title":"Offline RL with Observation Histories: Analyzing and Improving Sample Complexity","created":"2023-10-31","cited_by_count":7,"area":"offlinerl"},{"id":"2305.13289","title":"Achieving the Asymptotically Optimal Sample Complexity of Offline Reinforcement Learning: A DRO-Based Approach","created":"2023-05-22","cited_by_count":3,"area":"offlinerl"},{"id":"2506.20904","title":"Optimal Single-Policy Sample Complexity and Transient Coverage for Average-Reward Offline RL","created":"2025-06-26","cited_by_count":3,"area":"offlinerl"},{"id":"2111.08066","title":"Exploiting Action Impact Regularity and Exogenous State Variables for Offline Reinforcement Learning","created":"2021-11-15","cited_by_count":2,"area":"offlinerl"},{"id":"2310.01616","title":"Sample-Efficiency in Multi-Batch Reinforcement Learning: The Need for Dimension-Dependent Adaptivity","created":"2023-10-02","cited_by_count":2,"area":"offlinerl"}],"next_cursor":null}