{"total":56,"rows":[{"id":"2106.02039","title":"Offline Reinforcement Learning as One Big Sequence Modeling Problem","created":"2021-06-03","cited_by_count":644,"area":"wm"},{"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":"2107.06226","title":"Pessimistic Model-based Offline Reinforcement Learning under Partial Coverage","created":"2021-07-13","cited_by_count":164,"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":"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":"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":"2110.04645","title":"Breaking the Sample Complexity Barrier to Regret-Optimal Model-Free Reinforcement Learning","created":"2021-10-09","cited_by_count":53,"area":null},{"id":"2305.16589","title":"The Curious Price of Distributional Robustness in Reinforcement Learning with a Generative Model","created":"2023-05-26","cited_by_count":52,"area":null},{"id":"2106.06630","title":"Corruption-Robust Offline Reinforcement Learning","created":"2021-06-11","cited_by_count":51,"area":"offlinerl"},{"id":"2203.07368","title":"The Efficacy of Pessimism in Asynchronous Q-Learning","created":"2022-03-14","cited_by_count":42,"area":null},{"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":"2106.11960","title":"Variance-Aware Off-Policy Evaluation with Linear Function Approximation","created":"2021-06-22","cited_by_count":34,"area":null},{"id":"2203.13935","title":"Offline Reinforcement Learning Under Value and Density-Ratio Realizability: The Power of Gaps","created":"2022-03-25","cited_by_count":34,"area":"offlinerl"},{"id":"2206.00159","title":"Provably Efficient Offline Multi-agent Reinforcement Learning via Strategy-wise Bonus","created":"2022-06-01","cited_by_count":30,"area":"offlinerl"},{"id":"2211.00716","title":"Optimal Conservative Offline RL with General Function Approximation via Augmented Lagrangian","created":"2022-11-01","cited_by_count":29,"area":"offlinerl"},{"id":"2104.02293","title":"On the Optimality of Batch Policy Optimization Algorithms","created":"2021-04-06","cited_by_count":28,"area":null},{"id":"2201.03522","title":"When is Offline Two-Player Zero-Sum Markov Game Solvable?","created":"2022-01-10","cited_by_count":28,"area":null},{"id":"2106.03207","title":"Mitigating Covariate Shift in Imitation Learning via Offline Data Without Great Coverage","created":"2021-06-06","cited_by_count":26,"area":"offlinerl"},{"id":"2111.11097","title":"UMBRELLA: Uncertainty-Aware Model-Based Offline Reinforcement Learning Leveraging Planning","created":"2021-11-22","cited_by_count":23,"area":"offlinerl"},{"id":"2211.13208","title":"On Instance-Dependent Bounds for Offline Reinforcement Learning with Linear Function Approximation","created":"2022-11-23","cited_by_count":22,"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":"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":"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":"2206.00177","title":"On Gap-dependent Bounds for Offline Reinforcement Learning","created":"2022-06-01","cited_by_count":13,"area":"offlinerl"},{"id":"2206.06426","title":"Provably Efficient Offline Reinforcement Learning with Trajectory-Wise Reward","created":"2022-06-13","cited_by_count":13,"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":"2210.08642","title":"Data-Efficient Pipeline for Offline Reinforcement Learning with Limited Data","created":"2022-10-16","cited_by_count":12,"area":"offlinerl"},{"id":"2305.19529","title":"Offline Meta Reinforcement Learning with In-Distribution Online Adaptation","created":"2023-05-31","cited_by_count":12,"area":"offlinerl"},{"id":"2305.06446","title":"Cooperative Multi-Agent Reinforcement Learning: Asynchronous Communication and Linear Function Approximation","created":"2023-05-10","cited_by_count":9,"area":null},{"id":"2305.15546","title":"Regret-Optimal Model-Free Reinforcement Learning for Discounted MDPs with Short Burn-In Time","created":"2023-05-24","cited_by_count":8,"area":null},{"id":"2404.11509","title":"VC Theory for Inventory Policies","created":"2024-04-17","cited_by_count":8,"area":"deeprl"},{"id":"2410.07574","title":"Gap-Dependent Bounds for Q-Learning using Reference-Advantage Decomposition","created":"2024-10-10","cited_by_count":8,"area":"deeprl"},{"id":"2210.14420","title":"Optimizing Pessimism in Dynamic Treatment Regimes: A Bayesian Learning Approach","created":"2022-10-26","cited_by_count":7,"area":null},{"id":"2310.18715","title":"Robust Offline Reinforcement learning with Heavy-Tailed Rewards","created":"2023-10-28","cited_by_count":7,"area":"offlinerl"},{"id":"2307.00405","title":"Provably Efficient UCB-type Algorithms For Learning Predictive State Representations","created":"2023-07-01","cited_by_count":6,"area":null},{"id":"2207.06147","title":"A Near-Optimal Primal-Dual Method for Off-Policy Learning in CMDP","created":"2022-07-13","cited_by_count":5,"area":null},{"id":"2301.11426","title":"Model-based Offline Reinforcement Learning with Local Misspecification","created":"2023-01-26","cited_by_count":5,"area":"offlinerl"},{"id":"2302.03770","title":"Provably Efficient Offline Goal-Conditioned Reinforcement Learning with General Function Approximation and Single-Policy Concentrability","created":"2023-02-07","cited_by_count":5,"area":"offlinerl"},{"id":"2310.06268","title":"Bi-Level Offline Policy Optimization with Limited Exploration","created":"2023-10-10","cited_by_count":5,"area":"offlinerl"},{"id":"2501.19300","title":"Offline Learning for Combinatorial Multi-armed Bandits","created":"2025-01-31","cited_by_count":5,"area":null},{"id":"2206.01085","title":"Incorporating Explicit Uncertainty Estimates into Deep Offline Reinforcement Learning","created":"2022-06-02","cited_by_count":4,"area":"offlinerl"},{"id":"2106.00589","title":"Improving Long-Term Metrics in Recommendation Systems using Short-Horizon Reinforcement Learning","created":"2021-06-01","cited_by_count":2,"area":null},{"id":"2106.09973","title":"The Curse of Passive Data Collection in Batch Reinforcement Learning","created":"2021-06-18","cited_by_count":2,"area":null},{"id":"2506.04626","title":"Regret-Optimal Q-Learning with Low Cost for Single-Agent and Federated Reinforcement Learning","created":"2025-06-05","cited_by_count":2,"area":"deeprl"},{"id":"2210.13396","title":"Offline congestion games: How feedback type affects data coverage requirement","created":"2022-10-24","cited_by_count":1,"area":null},{"id":"2306.08810","title":"Deep Generative Models for Decision-Making and Control","created":"2023-06-15","cited_by_count":1,"area":null},{"id":"2309.16188","title":"Stackelberg Batch Policy Learning","created":"2023-09-28","cited_by_count":1,"area":"offlinerl"},{"id":"2312.11863","title":"Neural Network Approximation for Pessimistic Offline Reinforcement Learning","created":"2023-12-19","cited_by_count":1,"area":"offlinerl"},{"id":"2205.13950","title":"Non-Markovian policies occupancy measures","created":"2022-05-27","cited_by_count":0,"area":null},{"id":"2411.07514","title":"Robust Offline Reinforcement Learning for Non-Markovian Decision Processes","created":"2024-11-12","cited_by_count":0,"area":"offlinerl"},{"id":"2609.30391","title":"From Weak Data to Strong Policy: Q-Targets Enable Provable In-Context Reinforcement Learning","created":"2026-09-24","cited_by_count":0,"area":"deeprl"}],"next_cursor":null}