{"total":23,"rows":[{"id":"2106.02684","title":"Learning Policies with Zero or Bounded Constraint Violation for Constrained MDPs","created":"2021-06-04","cited_by_count":80,"area":null},{"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":"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":"2103.01312","title":"UCB Momentum Q-learning: Correcting the bias without forgetting","created":"2021-03-01","cited_by_count":46,"area":null},{"id":"2307.13586","title":"Settling the Sample Complexity of Online Reinforcement Learning","created":"2023-07-25","cited_by_count":45,"area":null},{"id":"2107.04050","title":"Efficient Model-Based Multi-Agent Mean-Field Reinforcement Learning","created":"2021-07-08","cited_by_count":38,"area":null},{"id":"2104.11186","title":"Stochastic Shortest Path: Minimax, Parameter-Free and Towards Horizon-Free Regret","created":"2021-04-22","cited_by_count":34,"area":null},{"id":"2105.14363","title":"On the Theory of Reinforcement Learning with Once-per-Episode Feedback","created":"2021-05-29","cited_by_count":32,"area":null},{"id":"2103.13056","title":"Minimax Regret for Stochastic Shortest Path","created":"2021-03-24","cited_by_count":30,"area":null},{"id":"2102.06924","title":"Online Apprenticeship Learning","created":"2021-02-13","cited_by_count":29,"area":null},{"id":"2106.08377","title":"Implicit Finite-Horizon Approximation and Efficient Optimal Algorithms for Stochastic Shortest Path","created":"2021-06-15","cited_by_count":23,"area":null},{"id":"2112.10599","title":"Differentially Private Regret Minimization in Episodic Markov Decision Processes","created":"2021-12-20","cited_by_count":23,"area":null},{"id":"2210.08349","title":"When to Update Your Model: Constrained Model-based Reinforcement Learning","created":"2022-10-15","cited_by_count":14,"area":null},{"id":"2102.03400","title":"Confidence-Budget Matching for Sequential Budgeted Learning","created":"2021-02-05","cited_by_count":12,"area":null},{"id":"2110.15843","title":"Adaptive Discretization in Online Reinforcement Learning","created":"2021-10-29","cited_by_count":12,"area":null},{"id":"2209.14414","title":"Optimistic Posterior Sampling for Reinforcement Learning with Few Samples and Tight Guarantees","created":"2022-09-28","cited_by_count":12,"area":null},{"id":"2207.12463","title":"Provably Efficient Fictitious Play Policy Optimization for Zero-Sum Markov Games with Structured Transitions","created":"2022-07-25","cited_by_count":9,"area":null},{"id":"2306.00324","title":"Achieving Fairness in Multi-Agent Markov Decision Processes Using Reinforcement Learning","created":"2023-06-01","cited_by_count":8,"area":null},{"id":"2306.07001","title":"Cancellation-Free Regret Bounds for Lagrangian Approaches in Constrained Markov Decision Processes","created":"2023-06-12","cited_by_count":7,"area":null},{"id":"2205.15376","title":"Reinforcement Learning with a Terminator","created":"2022-05-30","cited_by_count":4,"area":null},{"id":"2105.02135","title":"UVIP: Model-Free Approach to Evaluate Reinforcement Learning Algorithms","created":"2021-05-05","cited_by_count":1,"area":null},{"id":"2601.20694","title":"Is Pure Exploitation Sufficient in Exogenous MDPs with Linear Function Approximation?","created":"2026-01-28","cited_by_count":0,"area":null}],"next_cursor":null}