{"total":65,"rows":[{"id":"2102.05406","title":"Non-stationary Reinforcement Learning without Prior Knowledge: An Optimal Black-box Approach","created":"2021-02-10","cited_by_count":98,"area":null},{"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":"2107.08346","title":"Policy Optimization in Adversarial MDPs: Improved Exploration via Dilated Bonuses","created":"2021-07-18","cited_by_count":52,"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":"2106.04117","title":"The best of both worlds: stochastic and adversarial episodic MDPs with unknown transition","created":"2021-06-08","cited_by_count":40,"area":null},{"id":"2112.00885","title":"DOPE: Doubly Optimistic and Pessimistic Exploration for Safe Reinforcement Learning","created":"2021-12-01","cited_by_count":35,"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":"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.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":"2102.05284","title":"Finding the Stochastic Shortest Path with Low Regret: The Adversarial Cost and Unknown Transition Case","created":"2021-02-10","cited_by_count":28,"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":"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":"2201.13172","title":"Near-Optimal Regret for Adversarial MDP with Delayed Bandit Feedback","created":"2022-01-31","cited_by_count":22,"area":null},{"id":"2106.06279","title":"Model-Free Learning for Two-Player Zero-Sum Partially Observable Markov Games with Perfect Recall","created":"2021-06-11","cited_by_count":21,"area":null},{"id":"2102.06875","title":"Improved Corruption Robust Algorithms for Episodic Reinforcement Learning","created":"2021-02-13","cited_by_count":20,"area":null},{"id":"2209.13841","title":"Online Policy Optimization for Robust MDP","created":"2022-09-28","cited_by_count":19,"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":"2203.06803","title":"Learning Markov Games with Adversarial Opponents: Efficient Algorithms and Fundamental Limits","created":"2022-03-14","cited_by_count":17,"area":null},{"id":"2205.13451","title":"Follow-the-Perturbed-Leader for Adversarial Markov Decision Processes with Bandit Feedback","created":"2022-05-26","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":"2302.09408","title":"Best of Both Worlds Policy Optimization","created":"2023-02-18","cited_by_count":17,"area":null},{"id":"2205.15827","title":"Robust Anytime Learning of Markov Decision Processes","created":"2022-05-31","cited_by_count":16,"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":"2305.08629","title":"A Unified Analysis of Nonstochastic Delayed Feedback for Combinatorial Semi-Bandits, Linear Bandits, and MDPs","created":"2023-05-15","cited_by_count":15,"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.00212","title":"Provably Efficient Generalized Lagrangian Policy Optimization for Safe Multi-Agent Reinforcement Learning","created":"2023-05-31","cited_by_count":14,"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":"2208.12483","title":"Dynamic Regret of Online Markov Decision Processes","created":"2022-08-26","cited_by_count":13,"area":null},{"id":"2208.12584","title":"Socially Fair Reinforcement Learning","created":"2022-08-26","cited_by_count":13,"area":null},{"id":"2310.11550","title":"Towards Optimal Regret in Adversarial Linear MDPs with Bandit Feedback","created":"2023-10-17","cited_by_count":13,"area":null},{"id":"2102.00490","title":"Online Markov Decision Processes with Aggregate Bandit Feedback","created":"2021-01-31","cited_by_count":10,"area":null},{"id":"2304.14326","title":"A Best-of-Both-Worlds Algorithm for Constrained MDPs with Long-Term Constraints","created":"2023-04-27","cited_by_count":9,"area":null},{"id":"2312.15427","title":"Semi-Bandit Learning for Monotone Stochastic Optimization","created":"2023-12-24","cited_by_count":8,"area":null},{"id":"2402.03077","title":"Markov Persuasion Processes: Learning to Persuade from Scratch","created":"2024-02-05","cited_by_count":8,"area":null},{"id":"2301.10500","title":"Banker Online Mirror Descent: A Universal Approach for Delayed Online Bandit Learning","created":"2023-01-25","cited_by_count":7,"area":null},{"id":"2305.07911","title":"Delay-Adapted Policy Optimization and Improved Regret for Adversarial MDP with Delayed Bandit Feedback","created":"2023-05-13","cited_by_count":6,"area":null},{"id":"2306.00861","title":"Non-stationary Reinforcement Learning under General Function Approximation","created":"2023-06-01","cited_by_count":6,"area":null},{"id":"2411.03107","title":"Near-Optimal Dynamic Regret for Adversarial Linear Mixture MDPs","created":"2024-11-05","cited_by_count":5,"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.04374","title":"Near-Optimal Adversarial Reinforcement Learning with Switching Costs","created":"2023-02-08","cited_by_count":4,"area":null},{"id":"2305.08359","title":"Horizon-free Reinforcement Learning in Adversarial Linear Mixture MDPs","created":"2023-05-15","cited_by_count":4,"area":null},{"id":"2306.01121","title":"Differentially Private Episodic Reinforcement Learning with Heavy-tailed Rewards","created":"2023-06-01","cited_by_count":4,"area":null},{"id":"2311.07876","title":"Learning Adversarial Low-rank Markov Decision Processes with Unknown Transition and Full-information Feedback","created":"2023-11-14","cited_by_count":4,"area":null},{"id":"2502.05974","title":"Decision Making in Hybrid Environments: A Model Aggregation Approach","created":"2025-02-09","cited_by_count":3,"area":null},{"id":"2205.09056","title":"Slowly Changing Adversarial Bandit Algorithms are Efficient for Discounted MDPs","created":"2022-05-18","cited_by_count":2,"area":null},{"id":"2304.00232","title":"Restarted Bayesian Online Change-point Detection for Non-Stationary Markov Decision Processes","created":"2023-04-01","cited_by_count":2,"area":null},{"id":"2505.20010","title":"Data-Dependent Regret Bounds for Constrained MABs","created":"2025-05-26","cited_by_count":2,"area":null},{"id":"2510.08882","title":"An Improved Model-Free Decision-Estimation Coefficient with Applications in Adversarial MDPs","created":"2025-10-10","cited_by_count":2,"area":null},{"id":"2510.17103","title":"Adapting to Stochastic and Adversarial Losses in Episodic MDPs with Aggregate Bandit Feedback","created":"2025-10-20","cited_by_count":2,"area":null},{"id":"2305.10744","title":"Online Resource Allocation in Episodic Markov Decision Processes","created":"2023-05-18","cited_by_count":1,"area":null},{"id":"2312.01587","title":"Scalable and Independent Learning of Nash Equilibrium Policies in $n$-Player Stochastic Games with Unknown Independent Chains","created":"2023-12-04","cited_by_count":1,"area":null},{"id":"2405.02188","title":"Optimistic Regret Bounds for Online Learning in Adversarial Markov Decision Processes","created":"2024-05-03","cited_by_count":1,"area":null},{"id":"2407.05793","title":"A Primal-Dual Online Learning Approach for Dynamic Pricing of Sequentially Displayed Complementary Items under Sale Constraints","created":"2024-07-08","cited_by_count":1,"area":null},{"id":"2511.22283","title":"The Hidden Cost of Approximation in Online Mirror Descent","created":"2025-11-27","cited_by_count":1,"area":null},{"id":"2602.01295","title":"Best-of-Both-Worlds for Heavy-Tailed Markov Decision Processes","created":"2026-02-01","cited_by_count":1,"area":null},{"id":"2602.16363","title":"Improved Bounds for Reward-Agnostic and Reward-Free Exploration","created":"2026-02-18","cited_by_count":1,"area":null},{"id":"2109.14811","title":"Surveillance Evasion Through Bayesian Reinforcement Learning","created":"2021-09-30","cited_by_count":0,"area":null},{"id":"2304.00155","title":"Online Reinforcement Learning in Markov Decision Process Using Linear Programming","created":"2023-03-31","cited_by_count":0,"area":null},{"id":"2407.05704","title":"Narrowing the Gap between Adversarial and Stochastic MDPs via Policy Optimization","created":"2024-07-08","cited_by_count":0,"area":null},{"id":"2412.14075","title":"Online MDP with Transition Prototypes: A Robust Adaptive Approach","created":"2024-12-18","cited_by_count":0,"area":null},{"id":"2506.19038","title":"Online Learning for Dynamic Vickrey-Clarke-Groves Mechanism in Unknown Environments","created":"2025-06-23","cited_by_count":0,"area":null},{"id":"2602.14543","title":"Truly Adapting to Adversarial Constraints in Constrained MABs","created":"2026-02-16","cited_by_count":0,"area":null},{"id":"2610.01181","title":"Fully Online Decentralized Learning in Stochastic Games with Unknown Independent Chains","created":"2026-10-01","cited_by_count":0,"area":null}],"next_cursor":null}