{"total":487,"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":"2102.00815","title":"Bellman Eluder Dimension: New Rich Classes of RL Problems, and Sample-Efficient Algorithms","created":"2021-02-01","cited_by_count":223,"area":null},{"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.14555","title":"V-Learning -- A Simple, Efficient, Decentralized Algorithm for Multiagent RL","created":"2021-10-27","cited_by_count":114,"area":null},{"id":"2204.02372","title":"Jump-Start Reinforcement Learning","created":"2022-04-05","cited_by_count":112,"area":null},{"id":"2112.04553","title":"Recent Advances in Reinforcement Learning in Finance","created":"2021-12-08","cited_by_count":110,"area":null},{"id":"2101.04233","title":"Independent Policy Gradient Methods for Competitive Reinforcement Learning","created":"2021-01-11","cited_by_count":101,"area":null},{"id":"2204.08967","title":"When Is Partially Observable Reinforcement Learning Not Scary?","created":"2022-04-19","cited_by_count":100,"area":null},{"id":"2102.05406","title":"Non-stationary Reinforcement Learning without Prior Knowledge: An Optimal Black-box Approach","created":"2021-02-10","cited_by_count":98,"area":null},{"id":"2102.06548","title":"Is Q-Learning Minimax Optimal? A Tight Sample Complexity Analysis","created":"2021-02-12","cited_by_count":92,"area":null},{"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":"2509.06941","title":"Outcome-based Exploration for LLM Reasoning","created":"2025-09-08","cited_by_count":83,"area":"lr"},{"id":"2110.03239","title":"Understanding Domain Randomization for Sim-to-real Transfer","created":"2021-10-07","cited_by_count":80,"area":null},{"id":"2109.00157","title":"A Survey of Exploration Methods in Reinforcement Learning","created":"2021-09-01","cited_by_count":73,"area":null},{"id":"2405.19320","title":"Value-Incentivized Preference Optimization: A Unified Approach to Online and Offline RLHF","created":"2024-05-29","cited_by_count":73,"area":"alignment"},{"id":"2102.04540","title":"Last-iterate Convergence of Decentralized Optimistic Gradient Descent/Ascent in Infinite-horizon Competitive Markov Games","created":"2021-02-08","cited_by_count":69,"area":null},{"id":"2110.04184","title":"When Can We Learn General-Sum Markov Games with a Large Number of Players Sample-Efficiently?","created":"2021-10-08","cited_by_count":67,"area":null},{"id":"2210.09579","title":"Unpacking Reward Shaping: Understanding the Benefits of Reward Engineering on Sample Complexity","created":"2022-10-18","cited_by_count":62,"area":null},{"id":"2103.04047","title":"Reinforcement Learning, Bit by Bit","created":"2021-03-06","cited_by_count":59,"area":null},{"id":"2505.16984","title":"UFT: Unifying Supervised and Reinforcement Fine-Tuning","created":"2025-05-22","cited_by_count":59,"area":"lr"},{"id":"2109.06668","title":"Exploration in Deep Reinforcement Learning: From Single-Agent to Multiagent Domain","created":"2021-09-14","cited_by_count":58,"area":null},{"id":"2102.01567","title":"A Lyapunov Theory for Finite-Sample Guarantees of Asynchronous Q-Learning and TD-Learning Variants","created":"2021-02-02","cited_by_count":57,"area":null},{"id":"2212.06132","title":"Nearly Minimax Optimal Reinforcement Learning for Linear Markov Decision Processes","created":"2022-12-12","cited_by_count":57,"area":null},{"id":"2102.01748","title":"Near-Optimal Offline Reinforcement Learning via Double Variance Reduction","created":"2021-02-02","cited_by_count":56,"area":"offlinerl"},{"id":"2102.03765","title":"Tactical Optimism and Pessimism for Deep Reinforcement Learning","created":"2021-02-07","cited_by_count":55,"area":null},{"id":"2103.12923","title":"Cautiously Optimistic Policy Optimization and Exploration with Linear Function Approximation","created":"2021-03-24","cited_by_count":53,"area":null},{"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":"2107.08346","title":"Policy Optimization in Adversarial MDPs: Improved Exploration via Dilated Bonuses","created":"2021-07-18","cited_by_count":52,"area":null},{"id":"2205.11507","title":"Computationally Efficient Horizon-Free Reinforcement Learning for Linear Mixture MDPs","created":"2022-05-23","cited_by_count":52,"area":null},{"id":"2207.07150","title":"Making Linear MDPs Practical via Contrastive Representation Learning","created":"2022-07-14","cited_by_count":52,"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":"2109.06332","title":"Achieving Zero Constraint Violation for Constrained Reinforcement Learning via Primal-Dual Approach","created":"2021-09-13","cited_by_count":50,"area":null},{"id":"2102.04692","title":"Fine-Grained Gap-Dependent Bounds for Tabular MDPs via Adaptive Multi-Step Bootstrap","created":"2021-02-09","cited_by_count":49,"area":null},{"id":"2106.07841","title":"Randomized Exploration for Reinforcement Learning with General Value Function Approximation","created":"2021-06-15","cited_by_count":49,"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":"2106.03352","title":"The Power of Exploiter: Provable Multi-Agent RL in Large State Spaces","created":"2021-06-07","cited_by_count":48,"area":null},{"id":"2103.01312","title":"UCB Momentum Q-learning: Correcting the bias without forgetting","created":"2021-03-01","cited_by_count":46,"area":null},{"id":"2101.12745","title":"Improved Variance-Aware Confidence Sets for Linear Bandits and Linear Mixture MDP","created":"2021-01-29","cited_by_count":45,"area":null},{"id":"2102.04132","title":"Near-optimal Representation Learning for Linear Bandits and Linear RL","created":"2021-02-08","cited_by_count":45,"area":null},{"id":"2110.03580","title":"A Model Selection Approach for Corruption Robust Reinforcement Learning","created":"2021-10-07","cited_by_count":45,"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":"2102.05261","title":"Simple Agent, Complex Environment: Efficient Reinforcement Learning with Agent States","created":"2021-02-10","cited_by_count":43,"area":null},{"id":"2107.14702","title":"Towards General Function Approximation in Zero-Sum Markov Games","created":"2021-07-30","cited_by_count":43,"area":null},{"id":"2111.03947","title":"Exponential Bellman Equation and Improved Regret Bounds for Risk-Sensitive Reinforcement Learning","created":"2021-11-06","cited_by_count":43,"area":null},{"id":"2402.09401","title":"Reinforcement Learning from Human Feedback with Active Queries","created":"2024-02-14","cited_by_count":43,"area":"alignment"},{"id":"2106.02757","title":"Heuristic-Guided Reinforcement Learning","created":"2021-06-05","cited_by_count":42,"area":null},{"id":"2110.05682","title":"Provably Efficient Reinforcement Learning in Decentralized General-Sum Markov Games","created":"2021-10-12","cited_by_count":42,"area":null},{"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":"2108.02717","title":"Beyond No Regret: Instance-Dependent PAC Reinforcement Learning","created":"2021-08-05","cited_by_count":41,"area":null},{"id":"2101.00494","title":"A Provably Efficient Algorithm for Linear Markov Decision Process with Low Switching Cost","created":"2021-01-02","cited_by_count":40,"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.04117","title":"The best of both worlds: stochastic and adversarial episodic MDPs with unknown transition","created":"2021-06-08","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":"2111.13119","title":"Interesting Object, Curious Agent: Learning Task-Agnostic Exploration","created":"2021-11-25","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":"2211.16327","title":"On the Power of Foundation Models","created":"2022-11-29","cited_by_count":37,"area":null},{"id":"2103.14077","title":"Nearly Horizon-Free Offline Reinforcement Learning","created":"2021-03-25","cited_by_count":36,"area":"offlinerl"},{"id":"2110.05707","title":"On Improving Model-Free Algorithms for Decentralized Multi-Agent Reinforcement Learning","created":"2021-10-12","cited_by_count":36,"area":null},{"id":"2208.09515","title":"Spectral Decomposition Representation for Reinforcement Learning","created":"2022-08-19","cited_by_count":36,"area":null},{"id":"2305.10697","title":"The Blessing of Heterogeneity in Federated Q-Learning: Linear Speedup and Beyond","created":"2023-05-18","cited_by_count":36,"area":null},{"id":"2307.16212","title":"Robust Multi-Agent Reinforcement Learning with State Uncertainty","created":"2023-07-30","cited_by_count":36,"area":null},{"id":"2107.13545","title":"Fully Autonomous Real-World Reinforcement Learning with Applications to Mobile Manipulation","created":"2021-07-28","cited_by_count":35,"area":null},{"id":"2104.11186","title":"Stochastic Shortest Path: Minimax, Parameter-Free and Towards Horizon-Free Regret","created":"2021-04-22","cited_by_count":34,"area":null},{"id":"2107.01264","title":"Beyond Value-Function Gaps: Improved Instance-Dependent Regret Bounds for Episodic Reinforcement Learning","created":"2021-07-02","cited_by_count":34,"area":null},{"id":"2207.02575","title":"Instance-Dependent Near-Optimal Policy Identification in Linear MDPs via Online Experiment Design","created":"2022-07-06","cited_by_count":33,"area":null},{"id":"2303.08059","title":"Fast Rates for Maximum Entropy Exploration","created":"2023-03-14","cited_by_count":33,"area":null},{"id":"2102.04168","title":"Provable Model-based Nonlinear Bandit and Reinforcement Learning: Shelve Optimism, Embrace Virtual Curvature","created":"2021-02-08","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":"2103.00445","title":"Ensemble Bootstrapping for Q-Learning","created":"2021-02-28","cited_by_count":31,"area":null},{"id":"2203.02628","title":"Target Network and Truncation Overcome The Deadly Triad in $Q$-Learning","created":"2022-03-05","cited_by_count":31,"area":null},{"id":"2206.11889","title":"Provably Efficient Model-Free Constrained RL with Linear Function Approximation","created":"2022-06-23","cited_by_count":31,"area":null},{"id":"2209.15634","title":"A General Framework for Sample-Efficient Function Approximation in Reinforcement Learning","created":"2022-09-30","cited_by_count":31,"area":null},{"id":"2102.05800","title":"Robust Policy Gradient against Strong Data Corruption","created":"2021-02-11","cited_by_count":30,"area":null},{"id":"2103.13056","title":"Minimax Regret for Stochastic Shortest Path","created":"2021-03-24","cited_by_count":30,"area":null},{"id":"2206.11489","title":"Nearly Minimax Optimal Reinforcement Learning with Linear Function Approximation","created":"2022-06-23","cited_by_count":30,"area":null},{"id":"2110.04471","title":"Provably Efficient Black-Box Action Poisoning Attacks Against Reinforcement Learning","created":"2021-10-09","cited_by_count":29,"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":"2202.00150","title":"Learning Infinite-Horizon Average-Reward Markov Decision Processes with Constraints","created":"2022-01-31","cited_by_count":29,"area":null},{"id":"2206.05900","title":"Provable Benefit of Multitask Representation Learning in Reinforcement Learning","created":"2022-06-13","cited_by_count":29,"area":null},{"id":"2212.00603","title":"Near Sample-Optimal Reduction-based Policy Learning for Average Reward MDP","created":"2022-12-01","cited_by_count":29,"area":null},{"id":"2305.08841","title":"A Theoretical Analysis of Optimistic Proximal Policy Optimization in Linear Markov Decision Processes","created":"2023-05-15","cited_by_count":29,"area":null},{"id":"2305.18246","title":"Provable and Practical: Efficient Exploration in Reinforcement Learning via Langevin Monte Carlo","created":"2023-05-29","cited_by_count":29,"area":null},{"id":"2306.16394","title":"Sharper Model-free Reinforcement Learning for Average-reward Markov Decision Processes","created":"2023-06-28","cited_by_count":29,"area":null},{"id":"2102.05284","title":"Finding the Stochastic Shortest Path with Low Regret: The Adversarial Cost and Unknown Transition Case","created":"2021-02-10","cited_by_count":28,"area":null},{"id":"2102.08940","title":"Near-optimal Policy Optimization Algorithms for Learning Adversarial Linear Mixture MDPs","created":"2021-02-17","cited_by_count":28,"area":null},{"id":"2105.08024","title":"Sample-Efficient Reinforcement Learning Is Feasible for Linearly Realizable MDPs with Limited Revisiting","created":"2021-05-17","cited_by_count":28,"area":null},{"id":"2306.03186","title":"Flipping Coins to Estimate Pseudocounts for Exploration in Reinforcement Learning","created":"2023-06-05","cited_by_count":28,"area":null},{"id":"2105.03863","title":"Towards Theoretical Understandings of Robust Markov Decision Processes: Sample Complexity and Asymptotics","created":"2021-05-09","cited_by_count":27,"area":null},{"id":"2203.12922","title":"Horizon-Free Reinforcement Learning in Polynomial Time: the Power of Stationary Policies","created":"2022-03-24","cited_by_count":27,"area":null},{"id":"2206.01315","title":"Sample-Efficient Reinforcement Learning of Partially Observable Markov Games","created":"2022-06-02","cited_by_count":27,"area":null},{"id":"2302.03673","title":"Breaking the Curse of Multiagents in a Large State Space: RL in Markov Games with Independent Linear Function Approximation","created":"2023-02-07","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":"2105.06022","title":"Principled Exploration via Optimistic Bootstrapping and Backward Induction","created":"2021-05-13","cited_by_count":26,"area":null},{"id":"2206.04282","title":"Sample-Efficient Reinforcement Learning in the Presence of Exogenous Information","created":"2022-06-09","cited_by_count":26,"area":null},{"id":"2309.01922","title":"Regret Analysis of Policy Gradient Algorithm for Infinite Horizon Average Reward Markov Decision Processes","created":"2023-09-05","cited_by_count":26,"area":null},{"id":"2404.03578","title":"Distributionally Robust Reinforcement Learning with Interactive Data Collection: Fundamental Hardness and Near-Optimal Algorithms","created":"2024-04-04","cited_by_count":26,"area":"deeprl"},{"id":"2102.07404","title":"Almost Optimal Algorithms for Two-player Zero-Sum Linear Mixture Markov Games","created":"2021-02-15","cited_by_count":25,"area":null}],"next_cursor":"100"}