{"total":193,"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":"2210.06718","title":"Hybrid RL: Using Both Offline and Online Data Can Make RL Efficient","created":"2022-10-13","cited_by_count":161,"area":null},{"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":"2204.08967","title":"When Is Partially Observable Reinforcement Learning Not Scary?","created":"2022-04-19","cited_by_count":100,"area":null},{"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":"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":"2102.04939","title":"RL for Latent MDPs: Regret Guarantees and a Lower Bound","created":"2021-02-09","cited_by_count":70,"area":null},{"id":"2110.00871","title":"Feel-Good Thompson Sampling for Contextual Bandits and Reinforcement Learning","created":"2021-10-02","cited_by_count":66,"area":null},{"id":"2103.04047","title":"Reinforcement Learning, Bit by Bit","created":"2021-03-06","cited_by_count":59,"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":"2202.00063","title":"Efficient Reinforcement Learning in Block MDPs: A Model-free Representation Learning Approach","created":"2022-01-31","cited_by_count":51,"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":"2210.01400","title":"Linear Convergence of Natural Policy Gradient Methods with Log-Linear Policies","created":"2022-10-04","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":"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":"2107.14702","title":"Towards General Function Approximation in Zero-Sum Markov Games","created":"2021-07-30","cited_by_count":43,"area":null},{"id":"2207.05738","title":"PAC Reinforcement Learning for Predictive State Representations","created":"2022-07-12","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":"2106.10268","title":"MADE: Exploration via Maximizing Deviation from Explored Regions","created":"2021-06-18","cited_by_count":40,"area":null},{"id":"2202.03983","title":"Provable Reinforcement Learning with a Short-Term Memory","created":"2022-02-08","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":"2205.14571","title":"Provable Benefits of Representational Transfer in Reinforcement Learning","created":"2022-05-29","cited_by_count":38,"area":null},{"id":"2206.12020","title":"Provably Efficient Reinforcement Learning in Partially Observable Dynamical Systems","created":"2022-06-24","cited_by_count":35,"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":"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":"2212.05949","title":"Corruption-Robust Algorithms with Uncertainty Weighting for Nonlinear Contextual Bandits and Markov Decision Processes","created":"2022-12-12","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":"2109.04024","title":"On the Approximation of Cooperative Heterogeneous Multi-Agent Reinforcement Learning (MARL) using Mean Field Control (MFC)","created":"2021-09-09","cited_by_count":32,"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":"2206.09421","title":"Guarantees for Epsilon-Greedy Reinforcement Learning with Function Approximation","created":"2022-06-19","cited_by_count":31,"area":null},{"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":"2304.09853","title":"Bridging RL Theory and Practice with the Effective Horizon","created":"2023-04-19","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":"2206.03446","title":"Learning in Observable POMDPs, without Computationally Intractable Oracles","created":"2022-06-07","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":"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":"2110.08847","title":"Provable RL with Exogenous Distractors via Multistep Inverse Dynamics","created":"2021-10-17","cited_by_count":28,"area":null},{"id":"2110.02128","title":"NeurWIN: Neural Whittle Index Network For Restless Bandits Via Deep RL","created":"2021-10-05","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":"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":"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":"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":"2206.04282","title":"Sample-Efficient Reinforcement Learning in the Presence of Exogenous Information","created":"2022-06-09","cited_by_count":26,"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":"2202.06450","title":"Towards Deployment-Efficient Reinforcement Learning: Lower Bound and Optimality","created":"2022-02-14","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":"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":"2108.05533","title":"Efficient Local Planning with Linear Function Approximation","created":"2021-08-12","cited_by_count":23,"area":null},{"id":"2304.05889","title":"Representation Learning with Multi-Step Inverse Kinematics: An Efficient and Optimal Approach to Rich-Observation RL","created":"2023-04-12","cited_by_count":22,"area":null},{"id":"2207.13081","title":"Future-Dependent Value-Based Off-Policy Evaluation in POMDPs","created":"2022-07-26","cited_by_count":21,"area":null},{"id":"2104.01120","title":"Linear Systems can be Hard to Learn","created":"2021-04-02","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":"2206.02072","title":"Deciding What to Model: Value-Equivalent Sampling for Reinforcement Learning","created":"2022-06-04","cited_by_count":19,"area":null},{"id":"2211.15457","title":"Hypernetworks for Zero-shot Transfer in Reinforcement Learning","created":"2022-11-28","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":"2105.14016","title":"Sample-Efficient Reinforcement Learning for Linearly-Parameterized MDPs with a Generative Model","created":"2021-05-28","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":"2301.13857","title":"Learning in POMDPs is Sample-Efficient with Hindsight Observability","created":"2023-01-31","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":"2310.00806","title":"Bayesian Design Principles for Frequentist Sequential Learning","created":"2023-10-01","cited_by_count":18,"area":null},{"id":"2212.12809","title":"Understanding the Complexity Gains of Single-Task RL with a Curriculum","created":"2022-12-24","cited_by_count":17,"area":null},{"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":"2310.16173","title":"On the Convergence and Sample Complexity Analysis of Deep Q-Networks with $\\epsilon$-Greedy Exploration","created":"2023-10-24","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":"2201.09736","title":"Tensor and Matrix Low-Rank Value-Function Approximation in Reinforcement Learning","created":"2022-01-21","cited_by_count":16,"area":null},{"id":"2210.01907","title":"A Self-Play Posterior Sampling Algorithm for Zero-Sum Markov Games","created":"2022-10-04","cited_by_count":16,"area":null},{"id":"2307.03997","title":"Efficient Model-Free Exploration in Low-Rank MDPs","created":"2023-07-08","cited_by_count":16,"area":null},{"id":"2103.12726","title":"Policy Information Capacity: Information-Theoretic Measure for Task Complexity in Deep Reinforcement Learning","created":"2021-03-23","cited_by_count":15,"area":null},{"id":"2212.08765","title":"Latent Variable Representation for Reinforcement Learning","created":"2022-12-17","cited_by_count":15,"area":null},{"id":"2302.01333","title":"Lower Bounds for Learning in Revealing POMDPs","created":"2023-02-02","cited_by_count":15,"area":null},{"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":"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":"2305.11283","title":"On the Statistical Efficiency of Mean-Field Reinforcement Learning with General Function Approximation","created":"2023-05-18","cited_by_count":14,"area":null},{"id":"2308.14642","title":"Rate-Optimal Policy Optimization for Linear Markov Decision Processes","created":"2023-08-28","cited_by_count":14,"area":null},{"id":"2310.11428","title":"Butterfly Effects of SGD Noise: Error Amplification in Behavior Cloning and Autoregression","created":"2023-10-17","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.11574","title":"Offline Multitask Representation Learning for Reinforcement Learning","created":"2024-03-18","cited_by_count":14,"area":null},{"id":"2103.11559","title":"Provably Correct Optimization and Exploration with Non-linear Policies","created":"2021-03-22","cited_by_count":13,"area":null},{"id":"2104.07822","title":"Estimating and Improving Dynamic Treatment Regimes With a Time-Varying Instrumental Variable","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}],"next_cursor":"100"}