{"total":28,"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":"2212.06132","title":"Nearly Minimax Optimal Reinforcement Learning for Linear Markov Decision Processes","created":"2022-12-12","cited_by_count":57,"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":"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":"2106.10268","title":"MADE: Exploration via Maximizing Deviation from Explored Regions","created":"2021-06-18","cited_by_count":40,"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":"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":"2205.14572","title":"No-regret Learning in Repeated First-Price Auctions with Budget Constraints","created":"2022-05-29","cited_by_count":9,"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":"2308.01490","title":"Minimax Optimal Q Learning with Nearest Neighbors","created":"2023-08-03","cited_by_count":8,"area":null},{"id":"2505.02069","title":"Neural Logistic Bandits","created":"2025-05-04","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":"2204.10349","title":"Provably Efficient Kernelized Q-Learning","created":"2022-04-21","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":"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":"2510.06540","title":"Scalable Policy-Based RL Algorithms for POMDPs","created":"2025-10-08","cited_by_count":4,"area":null},{"id":"2209.09419","title":"Multi-armed Bandit Learning on a Graph","created":"2022-09-20","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":"2307.07666","title":"Efficient Action Robust Reinforcement Learning with Probabilistic Policy Execution Uncertainty","created":"2023-07-15","cited_by_count":2,"area":null},{"id":"2106.08771","title":"Reinforcement Learning for Markovian Bandits: Is Posterior Sampling more Scalable than Optimism?","created":"2021-06-16","cited_by_count":1,"area":null},{"id":"2211.15205","title":"CIM: Constrained Intrinsic Motivation for Sparse-Reward Continuous Control","created":"2022-11-28","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":"2405.08253","title":"Thompson Sampling for Infinite-Horizon Discounted Decision Processes","created":"2024-05-14","cited_by_count":0,"area":null},{"id":"2408.08934","title":"A Factored MDP Approach To Moving Target Defense With Dynamic Threat Modeling and Cost Efficiency","created":"2024-08-16","cited_by_count":0,"area":null},{"id":"2605.24261","title":"Optimizing Digital Therapeutic Interventions: Online Learning under Endogenous Adherence","created":"2026-05-22","cited_by_count":0,"area":null}],"next_cursor":null}