{"total":124,"rows":[{"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":"2106.04895","title":"Policy Finetuning: Bridging Sample-Efficient Offline and Online Reinforcement Learning","created":"2021-06-09","cited_by_count":158,"area":"offlinerl"},{"id":"2112.04553","title":"Recent Advances in Reinforcement Learning in Finance","created":"2021-12-08","cited_by_count":110,"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":"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":"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":"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":"2110.03580","title":"A Model Selection Approach for Corruption Robust Reinforcement Learning","created":"2021-10-07","cited_by_count":45,"area":null},{"id":"2202.07511","title":"Pessimistic Minimax Value Iteration: Provably Efficient Equilibrium Learning from Offline Datasets","created":"2022-02-15","cited_by_count":44,"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":"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":"2205.14571","title":"Provable Benefits of Representational Transfer in Reinforcement Learning","created":"2022-05-29","cited_by_count":38,"area":null},{"id":"2111.06784","title":"A Minimax Learning Approach to Off-Policy Evaluation in Confounded Partially Observable Markov Decision Processes","created":"2021-11-12","cited_by_count":36,"area":null},{"id":"2106.06239","title":"Safe Reinforcement Learning with Linear Function Approximation","created":"2021-06-11","cited_by_count":35,"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":"2202.06385","title":"Sample-Efficient Reinforcement Learning with loglog(T) Switching Cost","created":"2022-02-13","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":"2302.03201","title":"Near-Minimax-Optimal Risk-Sensitive Reinforcement Learning with CVaR","created":"2023-02-07","cited_by_count":32,"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":"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":"2103.13056","title":"Minimax Regret for Stochastic Shortest Path","created":"2021-03-24","cited_by_count":30,"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":"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":"2102.06924","title":"Online Apprenticeship Learning","created":"2021-02-13","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":"2306.11700","title":"Last-Iterate Convergent Policy Gradient Primal-Dual Methods for Constrained MDPs","created":"2023-06-20","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":"2111.11485","title":"A Free Lunch from the Noise: Provable and Practical Exploration for Representation Learning","created":"2021-11-22","cited_by_count":24,"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":"2103.04972","title":"Provably Efficient Cooperative Multi-Agent Reinforcement Learning with Function Approximation","created":"2021-03-08","cited_by_count":23,"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.10735","title":"Dynamic Bottleneck for Robust Self-Supervised Exploration","created":"2021-10-20","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":"2206.14332","title":"Active Exploration via Experiment Design in Markov Chains","created":"2022-06-29","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":"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":"2102.12661","title":"Online Learning for Unknown Partially Observable MDPs","created":"2021-02-25","cited_by_count":17,"area":null},{"id":"2207.05837","title":"Learning Bellman Complete Representations for Offline Policy Evaluation","created":"2022-07-12","cited_by_count":17,"area":"offlinerl"},{"id":"2209.15382","title":"Linear Convergence for Natural Policy Gradient with Log-linear Policy Parametrization","created":"2022-09-30","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":"2205.13476","title":"Embed to Control Partially Observed Systems: Representation Learning with Provable Sample Efficiency","created":"2022-05-26","cited_by_count":16,"area":null},{"id":"2206.03383","title":"On the Role of Discount Factor in Offline Reinforcement Learning","created":"2022-06-07","cited_by_count":16,"area":"offlinerl"},{"id":"2212.04680","title":"Near-Optimal Differentially Private Reinforcement Learning","created":"2022-12-09","cited_by_count":16,"area":null},{"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":"2105.08285","title":"Sublinear Least-Squares Value Iteration via Locality Sensitive Hashing","created":"2021-05-18","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":"2107.07410","title":"PC-MLP: Model-based Reinforcement Learning with Policy Cover Guided Exploration","created":"2021-07-15","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":"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":"2206.00165","title":"Byzantine-Robust Online and Offline Distributed Reinforcement Learning","created":"2022-06-01","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":"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":"2206.02887","title":"Sample Complexity of Nonparametric Off-Policy Evaluation on Low-Dimensional Manifolds using Deep Networks","created":"2022-06-06","cited_by_count":12,"area":null},{"id":"2108.08765","title":"Provably Efficient Generative Adversarial Imitation Learning for Online and Offline Setting with Linear Function Approximation","created":"2021-08-19","cited_by_count":11,"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":"2112.12320","title":"Model Selection in Batch Policy Optimization","created":"2021-12-23","cited_by_count":11,"area":null},{"id":"2202.01850","title":"A Robust Phased Elimination Algorithm for Corruption-Tolerant Gaussian Process Bandits","created":"2022-02-03","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":"2103.09847","title":"Infinite-Horizon Offline Reinforcement Learning with Linear Function Approximation: Curse of Dimensionality and Algorithm","created":"2021-03-17","cited_by_count":10,"area":"offlinerl"},{"id":"2301.12579","title":"Sample Efficient Deep Reinforcement Learning via Local Planning","created":"2023-01-29","cited_by_count":10,"area":null},{"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":"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":"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":"2202.01292","title":"Improved Regret for Differentially Private Exploration in Linear MDP","created":"2022-02-02","cited_by_count":8,"area":null},{"id":"2302.00727","title":"Sample Complexity of Kernel-Based Q-Learning","created":"2023-02-01","cited_by_count":8,"area":null},{"id":"2302.14004","title":"Optimistic Planning by Regularized Dynamic Programming","created":"2023-02-27","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":"2305.15546","title":"Regret-Optimal Model-Free Reinforcement Learning for Discounted MDPs with Short Burn-In Time","created":"2023-05-24","cited_by_count":8,"area":null},{"id":"2306.12356","title":"Provably Efficient Representation Learning with Tractable Planning in Low-Rank POMDP","created":"2023-06-21","cited_by_count":8,"area":null},{"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":"2102.07663","title":"Causal Markov Decision Processes: Learning Good Interventions Efficiently","created":"2021-02-15","cited_by_count":7,"area":null},{"id":"2206.02326","title":"Asymptotic Instance-Optimal Algorithms for Interactive Decision Making","created":"2022-06-06","cited_by_count":7,"area":null},{"id":"2302.01477","title":"A Reduction-based Framework for Sequential Decision Making with Delayed Feedback","created":"2023-02-03","cited_by_count":7,"area":null},{"id":"2307.11044","title":"On the Convergence of Bounded Agents","created":"2023-07-20","cited_by_count":7,"area":null},{"id":"2405.15050","title":"Reinforcement Learning for Infinite-Horizon Average-Reward Linear MDPs via Approximation by Discounted-Reward MDPs","created":"2024-05-23","cited_by_count":7,"area":"deeprl"},{"id":"2109.05546","title":"Improved Algorithms for Misspecified Linear Markov Decision Processes","created":"2021-09-12","cited_by_count":6,"area":null},{"id":"2206.00099","title":"Provably and Practically Efficient Neural Contextual Bandits","created":"2022-05-31","cited_by_count":6,"area":null},{"id":"2302.04376","title":"Efficient Planning in Combinatorial Action Spaces with Applications to Cooperative Multi-Agent Reinforcement Learning","created":"2023-02-08","cited_by_count":6,"area":null},{"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":"2107.05187","title":"Polynomial Time Reinforcement Learning in Factored State MDPs with Linear Value Functions","created":"2021-07-12","cited_by_count":4,"area":null},{"id":"2201.08732","title":"Meta Learning MDPs with Linear Transition Models","created":"2022-01-21","cited_by_count":4,"area":null},{"id":"2201.13170","title":"Cooperative Online Learning in Stochastic and Adversarial MDPs","created":"2022-01-31","cited_by_count":4,"area":null},{"id":"2302.03608","title":"Online Reinforcement Learning with Uncertain Episode Lengths","created":"2023-02-07","cited_by_count":4,"area":null},{"id":"2302.04374","title":"Near-Optimal Adversarial Reinforcement Learning with Switching Costs","created":"2023-02-08","cited_by_count":4,"area":null},{"id":"2303.04833","title":"Finding Regularized Competitive Equilibria of Heterogeneous Agent Macroeconomic Models with Reinforcement Learning","created":"2023-02-24","cited_by_count":4,"area":null},{"id":"2402.01111","title":"Near-Optimal Reinforcement Learning with Self-Play under Adaptivity Constraints","created":"2024-02-02","cited_by_count":4,"area":"deeprl"}],"next_cursor":"100"}