{"total":16,"rows":[{"id":"2405.02181","title":"Imitation Learning in Discounted Linear MDPs without exploration assumptions","created":"2024-05-03","cited_by_count":15,"area":"offlinerl"},{"id":"2310.05422","title":"Reward-Consistent Dynamics Models are Strongly Generalizable for Offline Reinforcement Learning","created":"2023-10-09","cited_by_count":12,"area":"offlinerl"},{"id":"2502.13900","title":"Optimistically Optimistic Exploration for Provably Efficient Infinite-Horizon Reinforcement and Imitation Learning","created":"2025-02-19","cited_by_count":12,"area":"offlinerl"},{"id":"2411.00610","title":"Provably and Practically Efficient Adversarial Imitation Learning with General Function Approximation","created":"2024-11-01","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":"2502.19859","title":"IL-SOAR : Imitation Learning with Soft Optimistic Actor cRitic","created":"2025-02-27","cited_by_count":5,"area":"offlinerl"},{"id":"2503.13162","title":"Efficient Imitation under Misspecification","created":"2025-03-17","cited_by_count":5,"area":"offlinerl"},{"id":"2505.19946","title":"Inverse Q-Learning Done Right: Offline Imitation Learning in $Q^\\pi$-Realizable MDPs","created":"2025-05-26","cited_by_count":5,"area":"offlinerl"},{"id":"2505.17610","title":"Learning Equilibria from Data: Provably Efficient Multi-Agent Imitation Learning","created":"2025-05-23","cited_by_count":4,"area":"offlinerl"},{"id":"2405.16668","title":"Provably Efficient Off-Policy Adversarial Imitation Learning with Convergence Guarantees","created":"2024-05-26","cited_by_count":2,"area":"offlinerl"},{"id":"2510.09487","title":"Near-Optimal Second-Order Guarantees for Model-Based Adversarial Imitation Learning","created":"2025-10-10","cited_by_count":2,"area":"offlinerl"},{"id":"2605.01778","title":"Adversarial Imitation Learning with General Function Approximation: Theoretical Analysis and Practical Algorithms","created":"2026-05-03","cited_by_count":1,"area":"offlinerl"},{"id":"2603.22713","title":"Non-Adversarial Imitation Learning Provably Free of Compounding Errors: The Value Flow Mechanism","created":"2026-03-24","cited_by_count":0,"area":"offlinerl"},{"id":"2605.12000","title":"Split the Differences, Pool the Rest: Provably Efficient Multi-Objective Imitation","created":"2026-05-12","cited_by_count":0,"area":"offlinerl"},{"id":"2606.22056","title":"Provably Efficient Policy-Reward Co-Pretraining for Adversarial Imitation Learning","created":"2026-06-20","cited_by_count":0,"area":"offlinerl"},{"id":"2609.35698","title":"Provable Benefits of Regularization: Fast Rates for Adversarial Imitation Learning","created":"2026-09-28","cited_by_count":0,"area":"offlinerl"}],"next_cursor":null}