{"total":53,"rows":[{"id":"2205.10330","title":"A Review of Safe Reinforcement Learning: Methods, Theory and Applications","created":"2022-05-20","cited_by_count":181,"area":null},{"id":"2109.06332","title":"Achieving Zero Constraint Violation for Constrained Reinforcement Learning via Primal-Dual Approach","created":"2021-09-13","cited_by_count":50,"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":"2206.11889","title":"Provably Efficient Model-Free Constrained RL with Linear Function Approximation","created":"2022-06-23","cited_by_count":31,"area":null},{"id":"2202.00150","title":"Learning Infinite-Horizon Average-Reward Markov Decision Processes with Constraints","created":"2022-01-31","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":"2206.02346","title":"Convergence and sample complexity of natural policy gradient primal-dual methods for constrained MDPs","created":"2022-06-06","cited_by_count":27,"area":null},{"id":"2304.09362","title":"Long-Term Fairness with Unknown Dynamics","created":"2023-04-19","cited_by_count":27,"area":null},{"id":"2111.00552","title":"Policy Optimization for Constrained MDPs with Provable Fast Global Convergence","created":"2021-10-31","cited_by_count":23,"area":null},{"id":"2203.15589","title":"On Kernelized Multi-Armed Bandits with Constraints","created":"2022-03-29","cited_by_count":23,"area":null},{"id":"2303.05733","title":"Provably Efficient Model-Free Algorithms for Non-stationary CMDPs","created":"2023-03-10","cited_by_count":21,"area":null},{"id":"2302.01275","title":"ReLOAD: Reinforcement Learning with Optimistic Ascent-Descent for Last-Iterate Convergence in Constrained MDPs","created":"2023-02-02","cited_by_count":20,"area":null},{"id":"2109.05439","title":"Concave Utility Reinforcement Learning with Zero-Constraint Violations","created":"2021-09-12","cited_by_count":19,"area":null},{"id":"2302.04375","title":"A Near-Optimal Algorithm for Safe Reinforcement Learning Under Instantaneous Hard Constraints","created":"2023-02-08","cited_by_count":17,"area":null},{"id":"2206.05357","title":"Anchor-Changing Regularized Natural Policy Gradient for Multi-Objective Reinforcement Learning","created":"2022-06-10","cited_by_count":15,"area":null},{"id":"2305.17568","title":"Scalable Primal-Dual Actor-Critic Method for Safe Multi-Agent RL with General Utilities","created":"2023-05-27","cited_by_count":15,"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":"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":"2112.05198","title":"Reinforcement Learning with Almost Sure Constraints","created":"2021-12-09","cited_by_count":11,"area":null},{"id":"2302.06064","title":"Provably Safe Reinforcement Learning with Step-wise Violation Constraints","created":"2023-02-13","cited_by_count":11,"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":"2206.14057","title":"Safe Exploration Incurs Nearly No Additional Sample Complexity for Reward-free RL","created":"2022-06-28","cited_by_count":10,"area":null},{"id":"2312.00561","title":"A safe exploration approach to constrained Markov decision processes","created":"2023-12-01","cited_by_count":10,"area":null},{"id":"2306.07818","title":"A Primal-Dual-Critic Algorithm for Offline Constrained Reinforcement Learning","created":"2023-06-13","cited_by_count":9,"area":null},{"id":"2308.15006","title":"Directional Optimism for Safe Linear Bandits","created":"2023-08-29","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":"2306.07749","title":"Provably Learning Nash Policies in Constrained Markov Potential Games","created":"2023-06-13","cited_by_count":7,"area":null},{"id":"2312.14470","title":"Safe Reinforcement Learning with Instantaneous Constraints: The Role of Aggressive Exploration","created":"2023-12-22","cited_by_count":7,"area":null},{"id":"2301.11547","title":"Safe Posterior Sampling for Constrained MDPs with Bounded Constraint Violation","created":"2023-01-27","cited_by_count":6,"area":null},{"id":"2207.06147","title":"A Near-Optimal Primal-Dual Method for Off-Policy Learning in CMDP","created":"2022-07-13","cited_by_count":5,"area":null},{"id":"2302.02426","title":"Online Nonstochastic Control with Adversarial and Static Constraints","created":"2023-02-05","cited_by_count":5,"area":null},{"id":"2306.06265","title":"Near-optimal Conservative Exploration in Reinforcement Learning under Episode-wise Constraints","created":"2023-06-09","cited_by_count":5,"area":null},{"id":"2506.13244","title":"No-Regret Learning Under Adversarial Resource Constraints: A Spending Plan Is All You Need!","created":"2025-06-16","cited_by_count":5,"area":null},{"id":"2402.08062","title":"Avoiding Catastrophe in Online Learning by Asking for Help","created":"2024-02-12","cited_by_count":4,"area":null},{"id":"2508.05441","title":"Tail-Risk-Safe Monte Carlo Tree Search under PAC-Level Guarantees","created":"2025-08-07","cited_by_count":4,"area":null},{"id":"2212.01505","title":"Constrained Reinforcement Learning via Dissipative Saddle Flow Dynamics","created":"2022-12-03","cited_by_count":3,"area":null},{"id":"2405.15090","title":"Pure Exploration for Constrained Best Mixed Arm Identification with a Fixed Budget","created":"2024-05-23","cited_by_count":2,"area":null},{"id":"2501.05591","title":"Session-Level Dynamic Ad Load Optimization using Offline Robust Reinforcement Learning","created":"2025-01-09","cited_by_count":2,"area":null},{"id":"2502.11673","title":"Best of Both Worlds: Regret Minimization versus Minimax Play","created":"2025-02-17","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":"2602.14580","title":"Replicable Constrained Bandits","created":"2026-02-16","cited_by_count":2,"area":null},{"id":"2111.05670","title":"DeCOM: Decomposed Policy for Constrained Cooperative Multi-Agent Reinforcement Learning","created":"2021-11-10","cited_by_count":1,"area":null},{"id":"2209.03596","title":"An Empirical Evaluation of Posterior Sampling for Constrained Reinforcement Learning","created":"2022-09-08","cited_by_count":1,"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":"2403.05786","title":"Optimistic Safety for Online Convex Optimization with Unknown Linear Constraints","created":"2024-03-09","cited_by_count":1,"area":null},{"id":"2502.14043","title":"Safe Learning Under Irreversible Dynamics via Asking for Help","created":"2025-02-19","cited_by_count":1,"area":null},{"id":"2309.15395","title":"Model-Free, Regret-Optimal Best Policy Identification in Online CMDPs","created":"2023-09-27","cited_by_count":0,"area":null},{"id":"2309.15737","title":"Provably Efficient Exploration in Constrained Reinforcement Learning:Posterior Sampling Is All You Need","created":"2023-09-27","cited_by_count":0,"area":null},{"id":"2510.14884","title":"Learning When Not to Learn: Risk-Sensitive Abstention in Bandits with Unbounded Rewards","created":"2025-10-16","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":"2603.22348","title":"Learning Safely Without Knowing the World:COMPASS-Hedge","created":"2026-03-22","cited_by_count":0,"area":null},{"id":"2605.06227","title":"Price of Fairness in Short-Term and Long-Term Algorithmic Selections","created":"2026-05-07","cited_by_count":0,"area":null},{"id":"2609.34840","title":"Nociception as a Control Primitive: Afferent Channels and Nociceptive Memory for Agents Deployed in One Body","created":"2026-09-28","cited_by_count":0,"area":null}],"next_cursor":null}