{"total":20,"rows":[{"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":"2110.04652","title":"Representation Learning for Online and Offline RL in Low-rank MDPs","created":"2021-10-09","cited_by_count":129,"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":"2210.04157","title":"The Role of Coverage in Online Reinforcement Learning","created":"2022-10-09","cited_by_count":83,"area":"offlinerl"},{"id":"2203.05804","title":"Near-optimal Offline Reinforcement Learning with Linear Representation: Leveraging Variance Information with Pessimism","created":"2022-03-11","cited_by_count":65,"area":"offlinerl"},{"id":"2205.15512","title":"Nearly Minimax Optimal Offline Reinforcement Learning with Linear Function Approximation: Single-Agent MDP and Markov Game","created":"2022-05-31","cited_by_count":55,"area":"offlinerl"},{"id":"2211.04974","title":"Leveraging Offline Data in Online Reinforcement Learning","created":"2022-11-09","cited_by_count":42,"area":"offlinerl"},{"id":"2209.06620","title":"Distributionally Robust Offline Reinforcement Learning with Linear Function Approximation","created":"2022-09-14","cited_by_count":32,"area":"offlinerl"},{"id":"2305.10282","title":"Reward-agnostic Fine-tuning: Provable Statistical Benefits of Hybrid Reinforcement Learning","created":"2023-05-17","cited_by_count":16,"area":"offlinerl"},{"id":"2106.11935","title":"Provably Efficient Representation Selection in Low-rank Markov Decision Processes: From Online to Offline RL","created":"2021-06-22","cited_by_count":12,"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":"2310.01380","title":"Pessimistic Nonlinear Least-Squares Value Iteration for Offline Reinforcement Learning","created":"2023-10-02","cited_by_count":9,"area":"offlinerl"},{"id":"2401.03301","title":"On Sample-Efficient Offline Reinforcement Learning: Data Diversity, Posterior Sampling, and Beyond","created":"2024-01-06","cited_by_count":6,"area":"offlinerl"},{"id":"2406.11686","title":"The Role of Inherent Bellman Error in Offline Reinforcement Learning with Linear Function Approximation","created":"2024-06-17","cited_by_count":4,"area":"offlinerl"},{"id":"2405.16809","title":"Trajectory Data Suffices for Statistically Efficient Learning in Offline RL with Linear $q^\\pi$-Realizability and Concentrability","created":"2024-05-27","cited_by_count":3,"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"},{"id":"2405.13755","title":"Offline RL via Feature-Occupancy Gradient Ascent","created":"2024-05-22","cited_by_count":2,"area":"offlinerl"},{"id":"2508.07746","title":"A Tutorial: An Intuitive Explanation of Offline Reinforcement Learning Theory","created":"2025-08-11","cited_by_count":1,"area":"offlinerl"},{"id":"2605.06470","title":"Hitting Time Isomorphism for Multi-Stage Planning with Foundation Policies","created":"2026-05-07","cited_by_count":1,"area":"offlinerl"},{"id":"2510.03494","title":"Trajectory Data Suffices for Statistically Efficient Policy Evaluation in Fixed-Horizon Offline RL with Linear $q^\\pi$-Realizability and Concentrability","created":"2025-10-03","cited_by_count":0,"area":"offlinerl"}],"next_cursor":null}