{"total":177,"rows":[{"id":"2408.08152","title":"DeepSeek-Prover-V1.5: Harnessing Proof Assistant Feedback for Reinforcement Learning and Monte-Carlo Tree Search","created":"2024-08-15","cited_by_count":197,"area":"lr"},{"id":"2103.07945","title":"Learning One Representation to Optimize All Rewards","created":"2021-03-14","cited_by_count":115,"area":null},{"id":"2201.13425","title":"Don't Change the Algorithm, Change the Data: Exploratory Data for Offline Reinforcement Learning","created":"2022-01-31","cited_by_count":96,"area":"offlinerl"},{"id":"2306.14111","title":"Is RLHF More Difficult than Standard RL?","created":"2023-06-25","cited_by_count":96,"area":"alignment"},{"id":"2210.04157","title":"The Role of Coverage in Online Reinforcement Learning","created":"2022-10-09","cited_by_count":83,"area":"offlinerl"},{"id":"2102.07035","title":"Model-free Representation Learning and Exploration in Low-rank MDPs","created":"2021-02-14","cited_by_count":82,"area":null},{"id":"2206.08332","title":"BYOL-Explore: Exploration by Bootstrapped Prediction","created":"2022-06-16","cited_by_count":73,"area":null},{"id":"2101.07123","title":"Learning Successor States and Goal-Dependent Values: A Mathematical Viewpoint","created":"2021-01-18","cited_by_count":70,"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":"2201.11206","title":"Reward-Free RL is No Harder Than Reward-Aware RL in Linear Markov Decision Processes","created":"2022-01-26","cited_by_count":49,"area":null},{"id":"2204.03991","title":"The Complexity of Markov Equilibrium in Stochastic Games","created":"2022-04-08","cited_by_count":49,"area":null},{"id":"2310.19668","title":"DrM: Mastering Visual Reinforcement Learning through Dormant Ratio Minimization","created":"2023-10-30","cited_by_count":47,"area":null},{"id":"2307.13586","title":"Settling the Sample Complexity of Online Reinforcement Learning","created":"2023-07-25","cited_by_count":45,"area":null},{"id":"2108.02717","title":"Beyond No Regret: Instance-Dependent PAC Reinforcement Learning","created":"2021-08-05","cited_by_count":41,"area":null},{"id":"2102.11494","title":"Sample-Efficient Learning of Stackelberg Equilibria in General-Sum Games","created":"2021-02-23","cited_by_count":40,"area":null},{"id":"2106.10268","title":"MADE: Exploration via Maximizing Deviation from Explored Regions","created":"2021-06-18","cited_by_count":40,"area":null},{"id":"2302.10371","title":"Variance-Dependent Regret Bounds for Linear Bandits and Reinforcement Learning: Adaptivity and Computational Efficiency","created":"2023-02-21","cited_by_count":40,"area":null},{"id":"2107.14226","title":"Learning more skills through optimistic exploration","created":"2021-07-29","cited_by_count":38,"area":null},{"id":"2112.03432","title":"First-Order Regret in Reinforcement Learning with Linear Function Approximation: A Robust Estimation Approach","created":"2021-12-07","cited_by_count":38,"area":null},{"id":"2205.14571","title":"Provable Benefits of Representational Transfer in Reinforcement Learning","created":"2022-05-29","cited_by_count":38,"area":null},{"id":"2202.03060","title":"The Importance of Non-Markovianity in Maximum State Entropy Exploration","created":"2022-02-07","cited_by_count":35,"area":null},{"id":"2303.08059","title":"Fast Rates for Maximum Entropy Exploration","created":"2023-03-14","cited_by_count":33,"area":null},{"id":"2101.02055","title":"Geometric Entropic Exploration","created":"2021-01-06","cited_by_count":32,"area":null},{"id":"2105.14363","title":"On the Theory of Reinforcement Learning with Once-per-Episode Feedback","created":"2021-05-29","cited_by_count":32,"area":null},{"id":"2202.06385","title":"Sample-Efficient Reinforcement Learning with loglog(T) Switching Cost","created":"2022-02-13","cited_by_count":32,"area":null},{"id":"2306.12371","title":"Optimistic Active Exploration of Dynamical Systems","created":"2023-06-21","cited_by_count":32,"area":null},{"id":"2107.05216","title":"A Simple Reward-free Approach to Constrained Reinforcement Learning","created":"2021-07-12","cited_by_count":30,"area":null},{"id":"2206.03446","title":"Learning in Observable POMDPs, without Computationally Intractable Oracles","created":"2022-06-07","cited_by_count":30,"area":null},{"id":"2110.06394","title":"Reward-Free Model-Based Reinforcement Learning with Linear Function Approximation","created":"2021-10-12","cited_by_count":29,"area":null},{"id":"2206.10770","title":"On the Statistical Efficiency of Reward-Free Exploration in Non-Linear RL","created":"2022-06-21","cited_by_count":27,"area":null},{"id":"2207.08645","title":"Active Exploration for Inverse Reinforcement Learning","created":"2022-07-18","cited_by_count":27,"area":"offlinerl"},{"id":"2305.15703","title":"The Benefits of Being Distributional: Small-Loss Bounds for Reinforcement Learning","created":"2023-05-25","cited_by_count":27,"area":null},{"id":"2102.08492","title":"Reward Poisoning in Reinforcement Learning: Attacks Against Unknown Learners in Unknown Environments","created":"2021-02-16","cited_by_count":26,"area":null},{"id":"2201.11861","title":"The Challenges of Exploration for Offline Reinforcement Learning","created":"2022-01-27","cited_by_count":26,"area":"offlinerl"},{"id":"2305.18505","title":"Provable Reward-Agnostic Preference-Based Reinforcement Learning","created":"2023-05-29","cited_by_count":25,"area":"alignment"},{"id":"2112.13521","title":"Can Reinforcement Learning Find Stackelberg-Nash Equilibria in General-Sum Markov Games with Myopic Followers?","created":"2021-12-27","cited_by_count":24,"area":null},{"id":"2202.06450","title":"Towards Deployment-Efficient Reinforcement Learning: Lower Bound and Optimality","created":"2022-02-14","cited_by_count":24,"area":null},{"id":"2209.14990","title":"Partially Observable RL with B-Stability: Unified Structural Condition and Sharp Sample-Efficient Algorithms","created":"2022-09-29","cited_by_count":24,"area":null},{"id":"2408.05804","title":"A Single Goal is All You Need: Skills and Exploration Emerge from Contrastive RL without Rewards, Demonstrations, or Subgoals","created":"2024-08-11","cited_by_count":23,"area":null},{"id":"2102.03192","title":"Provably Efficient Algorithms for Multi-Objective Competitive RL","created":"2021-02-05","cited_by_count":22,"area":null},{"id":"2304.12966","title":"Towards Theoretical Understanding of Inverse Reinforcement Learning","created":"2023-04-25","cited_by_count":21,"area":"offlinerl"},{"id":"2305.15284","title":"Replicable Reinforcement Learning","created":"2023-05-24","cited_by_count":21,"area":null},{"id":"2309.15178","title":"Zero-Shot Reinforcement Learning from Low Quality Data","created":"2023-09-26","cited_by_count":21,"area":null},{"id":"2311.05067","title":"Accelerating Exploration with Unlabeled Prior Data","created":"2023-11-09","cited_by_count":21,"area":null},{"id":"2110.09771","title":"On Reward-Free RL with Kernel and Neural Function Approximations: Single-Agent MDP and Markov Game","created":"2021-10-19","cited_by_count":20,"area":null},{"id":"2206.00810","title":"Offline Reinforcement Learning with Differential Privacy","created":"2022-06-02","cited_by_count":20,"area":"offlinerl"},{"id":"2301.13446","title":"Sharp Variance-Dependent Bounds in Reinforcement Learning: Best of Both Worlds in Stochastic and Deterministic Environments","created":"2023-01-31","cited_by_count":19,"area":null},{"id":"2107.09912","title":"Design of Experiments for Stochastic Contextual Linear Bandits","created":"2021-07-21","cited_by_count":18,"area":null},{"id":"2302.02252","title":"Reinforcement Learning in Low-Rank MDPs with Density Features","created":"2023-02-04","cited_by_count":18,"area":null},{"id":"2112.08746","title":"Unsupervised Reinforcement Learning in Multiple Environments","created":"2021-12-16","cited_by_count":17,"area":null},{"id":"2203.09251","title":"Near Instance-Optimal PAC Reinforcement Learning for Deterministic MDPs","created":"2022-03-17","cited_by_count":17,"area":null},{"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":"2402.14528","title":"ACE : Off-Policy Actor-Critic with Causality-Aware Entropy Regularization","created":"2024-02-22","cited_by_count":16,"area":"deeprl"},{"id":"2110.03743","title":"Reinforcement Learning in Reward-Mixing MDPs","created":"2021-10-07","cited_by_count":15,"area":"alignment"},{"id":"2304.07278","title":"Minimax-Optimal Reward-Agnostic Exploration in Reinforcement Learning","created":"2023-04-14","cited_by_count":15,"area":"offlinerl"},{"id":"2304.08944","title":"Provably Feedback-Efficient Reinforcement Learning via Active Reward Learning","created":"2023-04-18","cited_by_count":15,"area":null},{"id":"2407.17466","title":"Traversing Pareto Optimal Policies: Provably Efficient Multi-Objective Reinforcement Learning","created":"2024-07-24","cited_by_count":15,"area":"deeprl"},{"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":"2110.03244","title":"Near-Optimal Reward-Free Exploration for Linear Mixture MDPs with Plug-in Solver","created":"2021-10-07","cited_by_count":14,"area":null},{"id":"2303.10859","title":"Improved Sample Complexity for Reward-free Reinforcement Learning under Low-rank MDPs","created":"2023-03-20","cited_by_count":14,"area":null},{"id":"2402.12570","title":"Offline Multi-task Transfer RL with Representational Penalization","created":"2024-02-19","cited_by_count":14,"area":"offlinerl"},{"id":"2403.11574","title":"Offline Multitask Representation Learning for Reinforcement Learning","created":"2024-03-18","cited_by_count":14,"area":null},{"id":"2208.01899","title":"Understanding Adversarial Imitation Learning in Small Sample Regime: A Stage-coupled Analysis","created":"2022-08-03","cited_by_count":13,"area":"offlinerl"},{"id":"2210.00701","title":"Near-Optimal Deployment Efficiency in Reward-Free Reinforcement Learning with Linear Function Approximation","created":"2022-10-03","cited_by_count":13,"area":null},{"id":"2310.00817","title":"Learning to Make Adherence-Aware Advice","created":"2023-10-01","cited_by_count":13,"area":null},{"id":"2106.04316","title":"Exploration and preference satisfaction trade-off in reward-free learning","created":"2021-06-08","cited_by_count":12,"area":"alignment"},{"id":"2202.06545","title":"Provably Efficient Causal Model-Based Reinforcement Learning for Systematic Generalization","created":"2022-02-14","cited_by_count":12,"area":null},{"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.12719","title":"Learning General World Models in a Handful of Reward-Free Deployments","created":"2022-10-23","cited_by_count":12,"area":"wm"},{"id":"2103.00360","title":"Exploration and Incentives in Reinforcement Learning","created":"2021-02-28","cited_by_count":11,"area":null},{"id":"2302.06064","title":"Provably Safe Reinforcement Learning with Step-wise Violation Constraints","created":"2023-02-13","cited_by_count":11,"area":null},{"id":"2307.04354","title":"Policy Finetuning in Reinforcement Learning via Design of Experiments using Offline Data","created":"2023-07-10","cited_by_count":11,"area":null},{"id":"2408.07461","title":"Problem Solving Through Human-AI Preference-Based Cooperation","created":"2024-08-14","cited_by_count":11,"area":null},{"id":"2108.05439","title":"Gap-Dependent Unsupervised Exploration for Reinforcement Learning","created":"2021-08-11","cited_by_count":10,"area":null},{"id":"2206.14057","title":"Safe Exploration Incurs Nearly No Additional Sample Complexity for Reward-free RL","created":"2022-06-28","cited_by_count":10,"area":null},{"id":"2303.12287","title":"Hardness of Independent Learning and Sparse Equilibrium Computation in Markov Games","created":"2023-03-22","cited_by_count":10,"area":null},{"id":"2310.06793","title":"Spectral Entry-wise Matrix Estimation for Low-Rank Reinforcement Learning","created":"2023-10-10","cited_by_count":10,"area":null},{"id":"2305.01521","title":"Unlocking the Power of Representations in Long-term Novelty-based Exploration","created":"2023-05-02","cited_by_count":9,"area":null},{"id":"2308.11272","title":"FoX: Formation-aware exploration in multi-agent reinforcement learning","created":"2023-08-22","cited_by_count":9,"area":null},{"id":"2310.06113","title":"When is Agnostic Reinforcement Learning Statistically Tractable?","created":"2023-10-09","cited_by_count":9,"area":null},{"id":"2206.03348","title":"Specification-Guided Learning of Nash Equilibria with High Social Welfare","created":"2022-06-06","cited_by_count":8,"area":null},{"id":"2303.05606","title":"Variance-aware robust reinforcement learning with linear function approximation under heavy-tailed rewards","created":"2023-03-09","cited_by_count":8,"area":null},{"id":"2306.13601","title":"Active Coverage for PAC Reinforcement Learning","created":"2023-06-23","cited_by_count":8,"area":null},{"id":"2403.05385","title":"Switching the Loss Reduces the Cost in Batch (Offline) Reinforcement Learning","created":"2024-03-08","cited_by_count":8,"area":"offlinerl"},{"id":"2405.17796","title":"Offline Oracle-Efficient Learning for Contextual MDPs via Layerwise Exploration-Exploitation Tradeoff","created":"2024-05-28","cited_by_count":8,"area":null},{"id":"2408.11943","title":"Advances in Preference-based Reinforcement Learning: A Review","created":"2024-08-21","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":"2411.03810","title":"Hybrid Transfer Reinforcement Learning: Provable Sample Efficiency from Shifted-Dynamics Data","created":"2024-11-06","cited_by_count":8,"area":"deeprl"},{"id":"2205.10316","title":"Complex behavior from intrinsic motivation to occupy action-state path space","created":"2022-05-20","cited_by_count":7,"area":null},{"id":"2303.10165","title":"Optimal Horizon-Free Reward-Free Exploration for Linear Mixture MDPs","created":"2023-03-17","cited_by_count":7,"area":null},{"id":"2310.08558","title":"Offline Retraining for Online RL: Decoupled Policy Learning to Mitigate Exploration Bias","created":"2023-10-12","cited_by_count":7,"area":"offlinerl"},{"id":"2410.08870","title":"Can we hop in general? A discussion of benchmark selection and design using the Hopper environment","created":"2024-10-11","cited_by_count":7,"area":"deeprl"},{"id":"2202.11079","title":"Reward-Free Policy Space Compression for Reinforcement Learning","created":"2022-02-22","cited_by_count":6,"area":null},{"id":"2206.02675","title":"Effects of Safety State Augmentation on Safe Exploration","created":"2022-06-06","cited_by_count":6,"area":null},{"id":"2403.10738","title":"Horizon-Free Regret for Linear Markov Decision Processes","created":"2024-03-15","cited_by_count":6,"area":"deeprl"},{"id":"2406.01389","title":"RL in Latent MDPs is Tractable: Online Guarantees via Off-Policy Evaluation","created":"2024-06-03","cited_by_count":6,"area":null},{"id":"2406.02295","title":"How to Explore with Belief: State Entropy Maximization in POMDPs","created":"2024-06-04","cited_by_count":6,"area":"deeprl"},{"id":"2406.13909","title":"Beyond Optimism: Exploration With Partially Observable Rewards","created":"2024-06-20","cited_by_count":6,"area":"deeprl"},{"id":"2110.09507","title":"Provable Hierarchy-Based Meta-Reinforcement Learning","created":"2021-10-18","cited_by_count":5,"area":null}],"next_cursor":"100"}