{"total":111,"rows":[{"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":"2103.10897","title":"Bilinear Classes: A Structural Framework for Provable Generalization in RL","created":"2021-03-19","cited_by_count":178,"area":null},{"id":"2101.02195","title":"Provably Efficient Reinforcement Learning with Linear Function Approximation Under Adaptivity Constraints","created":"2021-01-06","cited_by_count":124,"area":null},{"id":"2405.16158","title":"Bigger, Regularized, Optimistic: scaling for compute and sample-efficient continuous control","created":"2024-05-25","cited_by_count":108,"area":"deeprl"},{"id":"2210.04157","title":"The Role of Coverage in Online Reinforcement Learning","created":"2022-10-09","cited_by_count":83,"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":"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":"2212.06132","title":"Nearly Minimax Optimal Reinforcement Learning for Linear Markov Decision Processes","created":"2022-12-12","cited_by_count":57,"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":"2205.11507","title":"Computationally Efficient Horizon-Free Reinforcement Learning for Linear Mixture MDPs","created":"2022-05-23","cited_by_count":52,"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":"2101.08862","title":"Breaking the Deadly Triad with a Target Network","created":"2021-01-21","cited_by_count":47,"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":"2111.03289","title":"Improved Regret Analysis for Variance-Adaptive Linear Bandits and Horizon-Free Linear Mixture MDPs","created":"2021-11-05","cited_by_count":44,"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":"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":"2103.12690","title":"An Exponential Lower Bound for Linearly-Realizable MDPs with Constant Suboptimality Gap","created":"2021-03-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":"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":"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":"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":"2209.06620","title":"Distributionally Robust Offline Reinforcement Learning with Linear Function Approximation","created":"2022-09-14","cited_by_count":32,"area":"offlinerl"},{"id":"2208.10904","title":"A Provably Efficient Model-Free Posterior Sampling Method for Episodic Reinforcement Learning","created":"2022-08-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":"2206.11489","title":"Nearly Minimax Optimal Reinforcement Learning with Linear Function Approximation","created":"2022-06-23","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.05900","title":"Provable Benefit of Multitask Representation Learning in Reinforcement Learning","created":"2022-06-13","cited_by_count":29,"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":"2310.03225","title":"Safe Exploration in Reinforcement Learning: A Generalized Formulation and Algorithms","created":"2023-10-05","cited_by_count":28,"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":"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},{"id":"2108.05533","title":"Efficient Local Planning with Linear Function Approximation","created":"2021-08-12","cited_by_count":23,"area":null},{"id":"2110.12727","title":"Learning Stochastic Shortest Path with Linear Function Approximation","created":"2021-10-25","cited_by_count":23,"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":"2305.18258","title":"Maximize to Explore: One Objective Function Fusing Estimation, Planning, and Exploration","created":"2023-05-29","cited_by_count":20,"area":null},{"id":"2104.06970","title":"Understanding the Eluder Dimension","created":"2021-04-14","cited_by_count":19,"area":null},{"id":"2102.02049","title":"On Query-efficient Planning in MDPs under Linear Realizability of the Optimal State-value Function","created":"2021-02-03","cited_by_count":18,"area":null},{"id":"2102.07301","title":"Nearly Minimax Optimal Regret for Learning Infinite-horizon Average-reward MDPs with Linear Function Approximation","created":"2021-02-15","cited_by_count":18,"area":null},{"id":"2202.04970","title":"Off-Policy Fitted Q-Evaluation with Differentiable Function Approximators: Z-Estimation and Inference Theory","created":"2022-02-10","cited_by_count":18,"area":null},{"id":"2202.10678","title":"Sequential Information Design: Markov Persuasion Process and Its Efficient Reinforcement Learning","created":"2022-02-22","cited_by_count":18,"area":null},{"id":"2110.08984","title":"Optimistic Policy Optimization is Provably Efficient in Non-stationary MDPs","created":"2021-10-18","cited_by_count":16,"area":null},{"id":"2507.11847","title":"Generalized Linear Bandits: Almost Optimal Regret with One-Pass Update","created":"2025-07-16","cited_by_count":16,"area":null},{"id":"2105.01593","title":"Regret Bounds for Stochastic Shortest Path Problems with Linear Function Approximation","created":"2021-05-04","cited_by_count":15,"area":null},{"id":"2311.15238","title":"A Nearly Optimal and Low-Switching Algorithm for Reinforcement Learning with General Function Approximation","created":"2023-11-26","cited_by_count":14,"area":null},{"id":"2104.07794","title":"An $L^2$ Analysis of Reinforcement Learning in High Dimensions with Kernel and Neural Network Approximation","created":"2021-04-15","cited_by_count":13,"area":null},{"id":"2106.11519","title":"Agnostic Reinforcement Learning with Low-Rank MDPs and Rich Observations","created":"2021-06-22","cited_by_count":13,"area":null},{"id":"2110.10133","title":"Locally Differentially Private Reinforcement Learning for Linear Mixture Markov Decision Processes","created":"2021-10-19","cited_by_count":13,"area":null},{"id":"2212.13540","title":"Model-Based Reinforcement Learning with Multinomial Logistic Function Approximation","created":"2022-12-27","cited_by_count":13,"area":null},{"id":"2110.15843","title":"Adaptive Discretization in Online Reinforcement Learning","created":"2021-10-29","cited_by_count":12,"area":null},{"id":"2206.01588","title":"Decentralized Optimistic Hyperpolicy Mirror Descent: Provably No-Regret Learning in Markov Games","created":"2022-06-03","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":"2209.07376","title":"Understanding Deep Neural Function Approximation in Reinforcement Learning via $\\epsilon$-Greedy Exploration","created":"2022-09-15","cited_by_count":11,"area":null},{"id":"2111.04894","title":"Safe Policy Optimization with Local Generalized Linear Function Approximations","created":"2021-11-09","cited_by_count":10,"area":null},{"id":"2302.13493","title":"The Provable Benefits of Unsupervised Data Sharing for Offline Reinforcement Learning","created":"2023-02-27","cited_by_count":10,"area":"offlinerl"},{"id":"2405.17061","title":"Provably Efficient Reinforcement Learning with Multinomial Logit Function Approximation","created":"2024-05-27","cited_by_count":10,"area":"deeprl"},{"id":"2107.06466","title":"Going Beyond Linear RL: Sample Efficient Neural Function Approximation","created":"2021-07-14","cited_by_count":9,"area":null},{"id":"2302.12456","title":"Logarithmic Switching Cost in Reinforcement Learning beyond Linear MDPs","created":"2023-02-24","cited_by_count":9,"area":null},{"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":"2303.10165","title":"Optimal Horizon-Free Reward-Free Exploration for Linear Mixture MDPs","created":"2023-03-17","cited_by_count":7,"area":null},{"id":"2306.10694","title":"On the Model-Misspecification in Reinforcement Learning","created":"2023-06-19","cited_by_count":7,"area":null},{"id":"2405.20165","title":"Randomized Exploration for Reinforcement Learning with Multinomial Logistic Function Approximation","created":"2024-05-30","cited_by_count":7,"area":"deeprl"},{"id":"2509.08660","title":"Replicable Reinforcement Learning with Linear Function Approximation","created":"2025-09-10","cited_by_count":7,"area":"deeprl"},{"id":"2106.07814","title":"Sample Efficient Reinforcement Learning In Continuous State Spaces: A Perspective Beyond Linearity","created":"2021-06-15","cited_by_count":6,"area":null},{"id":"2109.05546","title":"Improved Algorithms for Misspecified Linear Markov Decision Processes","created":"2021-09-12","cited_by_count":6,"area":null},{"id":"2306.14468","title":"A General Framework for Sequential Decision-Making under Adaptivity Constraints","created":"2023-06-26","cited_by_count":6,"area":null},{"id":"2310.19527","title":"On the Theory of Risk-Aware Agents: Bridging Actor-Critic and Economics","created":"2023-10-30","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":"2404.12648","title":"Sample-efficient Learning of Infinite-horizon Average-reward MDPs with General Function Approximation","created":"2024-04-19","cited_by_count":6,"area":null},{"id":"2410.23498","title":"Kernel-Based Function Approximation for Average Reward Reinforcement Learning: An Optimist No-Regret Algorithm","created":"2024-10-30","cited_by_count":6,"area":"deeprl"},{"id":"2506.13672","title":"The Courage to Stop: Overcoming Sunk Cost Fallacy in Deep Reinforcement Learning","created":"2025-06-16","cited_by_count":6,"area":"deeprl"},{"id":"2107.00685","title":"Gap-Dependent Bounds for Two-Player Markov Games","created":"2021-07-01","cited_by_count":5,"area":null},{"id":"2206.00796","title":"Stabilizing Q-learning with Linear Architectures for Provably Efficient Learning","created":"2022-06-01","cited_by_count":5,"area":null},{"id":"2402.02700","title":"Sample Complexity Characterization for Linear Contextual MDPs","created":"2024-02-05","cited_by_count":5,"area":"deeprl"},{"id":"2411.03107","title":"Near-Optimal Dynamic Regret for Adversarial Linear Mixture MDPs","created":"2024-11-05","cited_by_count":5,"area":null},{"id":"2111.03469","title":"Perturbational Complexity by Distribution Mismatch: A Systematic Analysis of Reinforcement Learning in Reproducing Kernel Hilbert Space","created":"2021-11-05","cited_by_count":4,"area":null},{"id":"2204.10349","title":"Provably Efficient Kernelized Q-Learning","created":"2022-04-21","cited_by_count":4,"area":null},{"id":"2302.09703","title":"Reinforcement Learning with Function Approximation: From Linear to Nonlinear","created":"2023-02-20","cited_by_count":4,"area":null},{"id":"2302.11634","title":"Provably Efficient Reinforcement Learning via Surprise Bound","created":"2023-02-22","cited_by_count":4,"area":null},{"id":"2305.08359","title":"Horizon-free Reinforcement Learning in Adversarial Linear Mixture MDPs","created":"2023-05-15","cited_by_count":4,"area":null},{"id":"2311.07876","title":"Learning Adversarial Low-rank Markov Decision Processes with Unknown Transition and Full-information Feedback","created":"2023-11-14","cited_by_count":4,"area":null},{"id":"2303.16998","title":"Does Sparsity Help in Learning Misspecified Linear Bandits?","created":"2023-03-29","cited_by_count":3,"area":null},{"id":"2310.18919","title":"Posterior Sampling with Delayed Feedback for Reinforcement Learning with Linear Function Approximation","created":"2023-10-29","cited_by_count":3,"area":null},{"id":"2310.19861","title":"Posterior Sampling for Competitive RL: Function Approximation and Partial Observation","created":"2023-10-30","cited_by_count":3,"area":null},{"id":"2404.10745","title":"Achieving Constant Regret in Linear Markov Decision Processes","created":"2024-04-16","cited_by_count":3,"area":"deeprl"},{"id":"2502.09780","title":"Incentivize without Bonus: Provably Efficient Model-based Online Multi-agent RL for Markov Games","created":"2025-02-13","cited_by_count":3,"area":null},{"id":"2310.11515","title":"Value-Biased Maximum Likelihood Estimation for Model-based Reinforcement Learning in Discounted Linear MDPs","created":"2023-10-17","cited_by_count":2,"area":null},{"id":"2403.01636","title":"Sample Efficient Myopic Exploration Through Multitask Reinforcement Learning with Diverse Tasks","created":"2024-03-03","cited_by_count":2,"area":"deeprl"},{"id":"2405.17832","title":"Mollification Effects of Policy Gradient Methods","created":"2024-05-28","cited_by_count":2,"area":"deeprl"},{"id":"2406.13633","title":"Infinite-Horizon Reinforcement Learning with Multinomial Logistic Function Approximation","created":"2024-06-19","cited_by_count":2,"area":"deeprl"},{"id":"2512.18957","title":"Online Robust Reinforcement Learning with General Function Approximation","created":"2025-12-22","cited_by_count":2,"area":"deeprl"},{"id":"2106.07203","title":"Online Sub-Sampling for Reinforcement Learning with General Function Approximation","created":"2021-06-14","cited_by_count":1,"area":null},{"id":"2107.05849","title":"Model Selection for Generic Reinforcement Learning","created":"2021-07-13","cited_by_count":1,"area":null},{"id":"2207.02992","title":"Model Selection in Reinforcement Learning with General Function Approximations","created":"2022-07-06","cited_by_count":1,"area":null},{"id":"2210.10278","title":"A Reinforcement Learning Approach in Multi-Phase Second-Price Auction Design","created":"2022-10-19","cited_by_count":1,"area":null},{"id":"2301.10993","title":"Multi-Agent Congestion Cost Minimization With Linear Function Approximations","created":"2023-01-26","cited_by_count":1,"area":null},{"id":"2310.06243","title":"Sample-Efficient Multi-Agent RL: An Optimization Perspective","created":"2023-10-10","cited_by_count":1,"area":null}],"next_cursor":"100"}