{"total":20,"rows":[{"id":"2107.06226","title":"Pessimistic Model-based Offline Reinforcement Learning under Partial Coverage","created":"2021-07-13","cited_by_count":164,"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":"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":"2206.00810","title":"Offline Reinforcement Learning with Differential Privacy","created":"2022-06-02","cited_by_count":20,"area":"offlinerl"},{"id":"2403.09621","title":"Minimax Optimal and Computationally Efficient Algorithms for Distributionally Robust Offline Reinforcement Learning","created":"2024-03-14","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":"2307.11352","title":"Model-based Offline Reinforcement Learning with Count-based Conservatism","created":"2023-07-21","cited_by_count":16,"area":"offlinerl"},{"id":"2405.02181","title":"Imitation Learning in Discounted Linear MDPs without exploration assumptions","created":"2024-05-03","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":"2403.12946","title":"Sample Complexity of Offline Distributionally Robust Linear Markov Decision Processes","created":"2024-03-19","cited_by_count":14,"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":"2407.07631","title":"Pessimism Meets Risk: Risk-Sensitive Offline Reinforcement Learning","created":"2024-07-10","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":"2406.03812","title":"How does Inverse RL Scale to Large State Spaces? A Provably Efficient Approach","created":"2024-06-06","cited_by_count":5,"area":"offlinerl"},{"id":"2304.12886","title":"What can online reinforcement learning with function approximation benefit from general coverage conditions?","created":"2023-04-25","cited_by_count":4,"area":"offlinerl"},{"id":"2604.13966","title":"Provably Efficient Offline-to-Online Value Adaptation with General Function Approximation","created":"2026-04-15","cited_by_count":0,"area":"offlinerl"}],"next_cursor":null}