{"total":23,"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":"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":"2102.01748","title":"Near-Optimal Offline Reinforcement Learning via Double Variance Reduction","created":"2021-02-02","cited_by_count":56,"area":"offlinerl"},{"id":"2211.04974","title":"Leveraging Offline Data in Online Reinforcement Learning","created":"2022-11-09","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":"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":"2306.06563","title":"Provably Efficient Adversarial Imitation Learning with Unknown Transitions","created":"2023-06-11","cited_by_count":16,"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.08238","title":"Near-Optimal Regret Bounds for Multi-batch Reinforcement Learning","created":"2022-10-15","cited_by_count":13,"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":"2108.08765","title":"Provably Efficient Generative Adversarial Imitation Learning for Online and Offline Setting with Linear Function Approximation","created":"2021-08-19","cited_by_count":11,"area":"offlinerl"},{"id":"2402.05876","title":"Federated Offline Reinforcement Learning: Collaborative Single-Policy Coverage Suffices","created":"2024-02-08","cited_by_count":11,"area":"offlinerl"},{"id":"2209.07288","title":"Optimistic Curiosity Exploration and Conservative Exploitation with Linear Reward Shaping","created":"2022-09-15","cited_by_count":6,"area":"offlinerl"},{"id":"2408.04526","title":"Hybrid Reinforcement Learning Breaks Sample Size Barriers in Linear MDPs","created":"2024-08-08","cited_by_count":6,"area":"offlinerl"},{"id":"2306.08364","title":"Provably Efficient Offline Reinforcement Learning with Perturbed Data Sources","created":"2023-06-14","cited_by_count":3,"area":"offlinerl"},{"id":"2503.11339","title":"Contextual Similarity Distillation: Ensemble Uncertainties with a Single Model","created":"2025-03-14","cited_by_count":3,"area":"offlinerl"},{"id":"2408.12307","title":"Leveraging Unlabeled Data Sharing through Kernel Function Approximation in Offline Reinforcement Learning","created":"2024-08-22","cited_by_count":2,"area":"offlinerl"},{"id":"2509.03790","title":"What Fundamental Structure in Reward Functions Enables Efficient Sparse-Reward Learning?","created":"2025-09-04","cited_by_count":2,"area":"offlinerl"},{"id":"2505.21119","title":"Universal Value-Function Uncertainties","created":"2025-05-27","cited_by_count":1,"area":"offlinerl"},{"id":"2602.23974","title":"Pessimistic Auxiliary Policy for Offline Reinforcement Learning","created":"2026-02-27","cited_by_count":0,"area":"offlinerl"}],"next_cursor":null}