{"total":201,"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":"2110.04652","title":"Representation Learning for Online and Offline RL in Low-rank MDPs","created":"2021-10-09","cited_by_count":129,"area":"offlinerl"},{"id":"2108.08812","title":"Provable Benefits of Actor-Critic Methods for Offline Reinforcement Learning","created":"2021-08-19","cited_by_count":110,"area":"offlinerl"},{"id":"2112.04553","title":"Recent Advances in Reinforcement Learning in Finance","created":"2021-12-08","cited_by_count":110,"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":"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":"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":"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":"2101.08862","title":"Breaking the Deadly Triad with a Target Network","created":"2021-01-21","cited_by_count":47,"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":"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":"2102.10769","title":"MobILE: Model-Based Imitation Learning From Observation Alone","created":"2021-02-22","cited_by_count":44,"area":"offlinerl"},{"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":"2207.05738","title":"PAC Reinforcement Learning for Predictive State Representations","created":"2022-07-12","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":"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":"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":"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":"2105.12272","title":"Provable Representation Learning for Imitation with Contrastive Fourier Features","created":"2021-05-26","cited_by_count":34,"area":"offlinerl"},{"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":"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":"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":"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":"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":"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":"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":"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":"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":"2111.13807","title":"Offline Neural Contextual Bandits: Pessimism, Optimization and Generalization","created":"2021-11-27","cited_by_count":25,"area":"offlinerl"},{"id":"2402.15399","title":"Distributionally Robust Off-Dynamics Reinforcement Learning: Provable Efficiency with Linear Function Approximation","created":"2024-02-23","cited_by_count":25,"area":"deeprl"},{"id":"2011.04019","title":"Sparse Feature Selection Makes Batch Reinforcement Learning More Sample Efficient","created":"2020-11-08","cited_by_count":24,"area":"offlinerl"},{"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":"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":"2106.03039","title":"Multi-facet Contextual Bandits: A Neural Network Perspective","created":"2021-06-06","cited_by_count":20,"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":"2306.07745","title":"Kernelized Reinforcement Learning with Order Optimal Regret Bounds","created":"2023-06-13","cited_by_count":20,"area":null},{"id":"2301.12942","title":"Refined Regret for Adversarial MDPs with Linear Function Approximation","created":"2023-01-30","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":"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":"2110.14798","title":"Reinforcement Learning in Linear MDPs: Constant Regret and Representation Selection","created":"2021-10-27","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":"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":"2110.08984","title":"Optimistic Policy Optimization is Provably Efficient in Non-stationary MDPs","created":"2021-10-18","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":"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":"2105.08285","title":"Sublinear Least-Squares Value Iteration via Locality Sensitive Hashing","created":"2021-05-18","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.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":"2406.16121","title":"Diffusion Spectral Representation for Reinforcement Learning","created":"2024-06-23","cited_by_count":15,"area":"diffusion"},{"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":"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":"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":"2405.20984","title":"Bayesian Design Principles for Offline-to-Online Reinforcement Learning","created":"2024-05-31","cited_by_count":14,"area":"offlinerl"},{"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.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":"2206.00165","title":"Byzantine-Robust Online and Offline Distributed Reinforcement Learning","created":"2022-06-01","cited_by_count":13,"area":null},{"id":"2208.12483","title":"Dynamic Regret of Online Markov Decision Processes","created":"2022-08-26","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":"2310.18687","title":"Unsupervised Behavior Extraction via Random Intent Priors","created":"2023-10-28","cited_by_count":13,"area":"offlinerl"},{"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":"2210.00750","title":"Offline Reinforcement Learning with Differentiable Function Approximation is Provably Efficient","created":"2022-10-03","cited_by_count":12,"area":"offlinerl"},{"id":"2210.02087","title":"Bilinear Exponential Family of MDPs: Frequentist Regret Bound with Tractable Exploration and Planning","created":"2022-10-05","cited_by_count":12,"area":null},{"id":"2402.08991","title":"Towards Robust Model-Based Reinforcement Learning Against Adversarial Corruption","created":"2024-02-14","cited_by_count":12,"area":"deeprl"},{"id":"2406.12241","title":"More Efficient Randomized Exploration for Reinforcement Learning via Approximate Sampling","created":"2024-06-18","cited_by_count":12,"area":"deeprl"},{"id":"2407.10448","title":"Spectral Representation for Causal Estimation with Hidden Confounders","created":"2024-07-15","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":"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":"2201.11965","title":"Provably Efficient Primal-Dual Reinforcement Learning for CMDPs with Non-stationary Objectives and Constraints","created":"2022-01-28","cited_by_count":10,"area":null},{"id":"2203.08248","title":"Non-Linear Reinforcement Learning in Large Action Spaces: Structural Conditions and Sample-efficiency of Posterior Sampling","created":"2022-03-15","cited_by_count":10,"area":null},{"id":"2311.12244","title":"Provable Representation with Efficient Planning for Partial Observable Reinforcement Learning","created":"2023-11-20","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":"2406.05064","title":"Pretraining Decision Transformers with Reward Prediction for In-Context Multi-task Structured Bandit Learning","created":"2024-06-07","cited_by_count":10,"area":"offlinerl"}],"next_cursor":"100"}