{"total":200,"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":"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":"2509.06941","title":"Outcome-based Exploration for LLM Reasoning","created":"2025-09-08","cited_by_count":83,"area":"lr"},{"id":"2205.11140","title":"Human-in-the-loop: Provably Efficient Preference-based Reinforcement Learning with General Function Approximation","created":"2022-05-23","cited_by_count":81,"area":null},{"id":"2110.03239","title":"Understanding Domain Randomization for Sim-to-real Transfer","created":"2021-10-07","cited_by_count":80,"area":null},{"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":"2212.06132","title":"Nearly Minimax Optimal Reinforcement Learning for Linear Markov Decision Processes","created":"2022-12-12","cited_by_count":57,"area":null},{"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":"2103.12923","title":"Cautiously Optimistic Policy Optimization and Exploration with Linear Function Approximation","created":"2021-03-24","cited_by_count":53,"area":null},{"id":"2107.02237","title":"Efficient First-Order Contextual Bandits: Prediction, Allocation, and Triangular Discrimination","created":"2021-07-05","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":"2205.06811","title":"Nearly Optimal Algorithms for Linear Contextual Bandits with Adversarial Corruptions","created":"2022-05-13","cited_by_count":51,"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":"2309.17382","title":"Reason for Future, Act for Now: A Principled Framework for Autonomous LLM Agents with Provable Sample Efficiency","created":"2023-09-29","cited_by_count":46,"area":"wm"},{"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":"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":"2102.05261","title":"Simple Agent, Complex Environment: Efficient Reinforcement Learning with Agent States","created":"2021-02-10","cited_by_count":43,"area":null},{"id":"2211.04974","title":"Leveraging Offline Data in Online Reinforcement Learning","created":"2022-11-09","cited_by_count":42,"area":"offlinerl"},{"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":"2106.11960","title":"Variance-Aware Off-Policy Evaluation with Linear Function Approximation","created":"2021-06-22","cited_by_count":34,"area":null},{"id":"2206.13063","title":"On the Complexity of Adversarial Decision Making","created":"2022-06-27","cited_by_count":33,"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":"2206.07659","title":"Model-based RL with Optimistic Posterior Sampling: Structural Conditions and Sample Complexity","created":"2022-06-15","cited_by_count":32,"area":null},{"id":"2302.03201","title":"Near-Minimax-Optimal Risk-Sensitive Reinforcement Learning with CVaR","created":"2023-02-07","cited_by_count":32,"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":"2107.02371","title":"Weighted Gaussian Process Bandits for Non-stationary Environments","created":"2021-07-06","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":"2301.08215","title":"Tight Guarantees for Interactive Decision Making with the Decision-Estimation Coefficient","created":"2023-01-19","cited_by_count":30,"area":null},{"id":"2302.06606","title":"Breaking the Curse of Multiagency: Provably Efficient Decentralized Multi-Agent RL with Function Approximation","created":"2023-02-13","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":"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":"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":"2207.14800","title":"Contrastive UCB: Provably Efficient Contrastive Self-Supervised Learning in Online Reinforcement Learning","created":"2022-07-29","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},{"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":"2206.04640","title":"Regret Bounds for Information-Directed Reinforcement Learning","created":"2022-06-09","cited_by_count":24,"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":"2201.07052","title":"Differentially Private Reinforcement Learning with Linear Function Approximation","created":"2022-01-18","cited_by_count":22,"area":null},{"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":"2310.00968","title":"Variance-Aware Regret Bounds for Stochastic Contextual Dueling Bandits","created":"2023-10-02","cited_by_count":22,"area":null},{"id":"2110.12615","title":"Linear Contextual Bandits with Adversarial Corruptions","created":"2021-10-25","cited_by_count":21,"area":null},{"id":"2206.00810","title":"Offline Reinforcement Learning with Differential Privacy","created":"2022-06-02","cited_by_count":20,"area":"offlinerl"},{"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":"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":"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":"2110.14798","title":"Reinforcement Learning in Linear MDPs: Constant Regret and Representation Selection","created":"2021-10-27","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":"2303.17110","title":"Contextual Combinatorial Bandits with Probabilistically Triggered Arms","created":"2023-03-30","cited_by_count":18,"area":null},{"id":"2306.09210","title":"Optimal Exploration for Model-Based RL in Nonlinear Systems","created":"2023-06-15","cited_by_count":18,"area":null},{"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":"2301.13087","title":"Improved Regret for Efficient Online Reinforcement Learning with Linear Function Approximation","created":"2023-01-30","cited_by_count":17,"area":null},{"id":"2302.04375","title":"A Near-Optimal Algorithm for Safe Reinforcement Learning Under Instantaneous Hard Constraints","created":"2023-02-08","cited_by_count":17,"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":"2203.03684","title":"Learn to Match with No Regret: Reinforcement Learning in Markov Matching Markets","created":"2022-03-07","cited_by_count":16,"area":null},{"id":"2204.09787","title":"Reinforcement Learning from Partial Observation: Linear Function Approximation with Provable Sample Efficiency","created":"2022-04-20","cited_by_count":16,"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":"2307.11352","title":"Model-based Offline Reinforcement Learning with Count-based Conservatism","created":"2023-07-21","cited_by_count":16,"area":"offlinerl"},{"id":"2409.20521","title":"Upper and Lower Bounds for Distributionally Robust Off-Dynamics Reinforcement Learning","created":"2024-09-30","cited_by_count":16,"area":"deeprl"},{"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":"2208.14837","title":"Batch-Size Independent Regret Bounds for Combinatorial Semi-Bandits with Probabilistically Triggered Arms or Independent Arms","created":"2022-08-31","cited_by_count":15,"area":null},{"id":"2302.06834","title":"Improved Regret Bounds for Linear Adversarial MDPs via Linear Optimization","created":"2023-02-14","cited_by_count":15,"area":null},{"id":"2304.08944","title":"Provably Feedback-Efficient Reinforcement Learning via Active Reward Learning","created":"2023-04-18","cited_by_count":15,"area":null},{"id":"2405.02181","title":"Imitation Learning in Discounted Linear MDPs without exploration assumptions","created":"2024-05-03","cited_by_count":15,"area":"offlinerl"},{"id":"2502.06363","title":"Improved Regret Analysis in Gaussian Process Bandits: Optimality for Noiseless Reward, RKHS norm, and Non-Stationary Variance","created":"2025-02-10","cited_by_count":15,"area":null},{"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":"2106.11612","title":"Uniform-PAC Bounds for Reinforcement Learning with Linear Function Approximation","created":"2021-06-22","cited_by_count":14,"area":null},{"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":"2112.09859","title":"Improved No-Regret Algorithms for Stochastic Shortest Path with Linear MDP","created":"2021-12-18","cited_by_count":14,"area":null},{"id":"2306.06836","title":"Tackling Heavy-Tailed Rewards in Reinforcement Learning with Function Approximation: Minimax Optimal and Instance-Dependent Regret Bounds","created":"2023-06-12","cited_by_count":14,"area":null},{"id":"2307.02842","title":"Provably Efficient Iterated CVaR Reinforcement Learning with Function Approximation and Human Feedback","created":"2023-07-06","cited_by_count":14,"area":"alignment"},{"id":"2308.14642","title":"Rate-Optimal Policy Optimization for Linear Markov Decision Processes","created":"2023-08-28","cited_by_count":14,"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":"2403.12946","title":"Sample Complexity of Offline Distributionally Robust Linear Markov Decision Processes","created":"2024-03-19","cited_by_count":14,"area":"offlinerl"},{"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":"2202.03334","title":"Policy Optimization for Stochastic Shortest Path","created":"2022-02-07","cited_by_count":13,"area":null},{"id":"2205.14211","title":"KL-Entropy-Regularized RL with a Generative Model is Minimax Optimal","created":"2022-05-27","cited_by_count":13,"area":null},{"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":"2212.13540","title":"Model-Based Reinforcement Learning with Multinomial Logistic Function Approximation","created":"2022-12-27","cited_by_count":13,"area":null},{"id":"2305.11032","title":"Optimistic Natural Policy Gradient: a Simple Efficient Policy Optimization Framework for Online RL","created":"2023-05-18","cited_by_count":13,"area":null},{"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":"2205.01257","title":"Norm-Agnostic Linear Bandits","created":"2022-05-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":"2112.01585","title":"Differentially Private Exploration in Reinforcement Learning with Linear Representation","created":"2021-12-02","cited_by_count":11,"area":null},{"id":"2205.13450","title":"Variance-Aware Sparse Linear Bandits","created":"2022-05-26","cited_by_count":11,"area":null},{"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":"2211.14250","title":"Model-Free Reinforcement Learning with the Decision-Estimation Coefficient","created":"2022-11-25","cited_by_count":11,"area":null},{"id":"2203.12577","title":"Minimax Regret for Cascading Bandits","created":"2022-03-23","cited_by_count":10,"area":null},{"id":"2405.17061","title":"Provably Efficient Reinforcement Learning with Multinomial Logit Function Approximation","created":"2024-05-27","cited_by_count":10,"area":"deeprl"},{"id":"2106.11692","title":"A Reduction-Based Framework for Conservative Bandits and Reinforcement Learning","created":"2021-06-22","cited_by_count":9,"area":null},{"id":"2302.10796","title":"Provably Efficient Exploration in Quantum Reinforcement Learning with Logarithmic Worst-Case Regret","created":"2023-02-21","cited_by_count":9,"area":null},{"id":"2305.06446","title":"Cooperative Multi-Agent Reinforcement Learning: Asynchronous Communication and Linear Function Approximation","created":"2023-05-10","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":"2409.16197","title":"Second Order Bounds for Contextual Bandits with Function Approximation","created":"2024-09-24","cited_by_count":9,"area":null}],"next_cursor":"100"}