{"total":52,"rows":[{"id":"2202.04129","title":"Independent Policy Gradient for Large-Scale Markov Potential Games: Sharper Rates, Function Approximation, and Game-Agnostic Convergence","created":"2022-02-08","cited_by_count":57,"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":"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":"2310.14550","title":"Corruption-Robust Offline Reinforcement Learning with General Function Approximation","created":"2023-10-23","cited_by_count":31,"area":"offlinerl"},{"id":"2305.08841","title":"A Theoretical Analysis of Optimistic Proximal Policy Optimization in Linear Markov Decision Processes","created":"2023-05-15","cited_by_count":29,"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":"2301.12942","title":"Refined Regret for Adversarial MDPs with Linear Function Approximation","created":"2023-01-30","cited_by_count":19,"area":null},{"id":"2309.00814","title":"Bypassing the Simulator: Near-Optimal Adversarial Linear Contextual Bandits","created":"2023-09-02","cited_by_count":19,"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":"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":"2405.02181","title":"Imitation Learning in Discounted Linear MDPs without exploration assumptions","created":"2024-05-03","cited_by_count":15,"area":"offlinerl"},{"id":"2308.14642","title":"Rate-Optimal Policy Optimization for Linear Markov Decision Processes","created":"2023-08-28","cited_by_count":14,"area":null},{"id":"2112.10935","title":"Nearly Optimal Policy Optimization with Stable at Any Time Guarantee","created":"2021-12-21","cited_by_count":13,"area":null},{"id":"2202.03334","title":"Policy Optimization for Stochastic Shortest Path","created":"2022-02-07","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":"2410.02275","title":"Optimal Strong Regret and Violation in Constrained MDPs via Policy Optimization","created":"2024-10-03","cited_by_count":12,"area":"deeprl"},{"id":"2405.07637","title":"Near-Optimal Regret in Linear MDPs with Aggregate Bandit Feedback","created":"2024-05-13","cited_by_count":10,"area":"deeprl"},{"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":"2403.04568","title":"Improved Algorithm for Adversarial Linear Mixture MDPs with Bandit Feedback and Unknown Transition","created":"2024-03-07","cited_by_count":6,"area":"deeprl"},{"id":"2505.21841","title":"An Optimistic Algorithm for online CMDPS with Anytime Adversarial Constraints","created":"2025-05-28","cited_by_count":6,"area":"deeprl"},{"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":"2407.03065","title":"Warm-up Free Policy Optimization: Improved Regret in Linear Markov Decision Processes","created":"2024-07-03","cited_by_count":5,"area":"deeprl"},{"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":"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":"2403.03219","title":"LC-Tsallis-INF: Generalized Best-of-Both-Worlds Linear Contextual Bandits","created":"2024-03-05","cited_by_count":4,"area":null},{"id":"2508.11931","title":"An Improved Algorithm for Adversarial Linear Contextual Bandits via Reduction","created":"2025-08-16","cited_by_count":4,"area":null},{"id":"2402.07082","title":"Refined Sample Complexity for Markov Games with Independent Linear Function Approximation","created":"2024-02-11","cited_by_count":3,"area":"deeprl"},{"id":"2502.05974","title":"Decision Making in Hybrid Environments: A Model Aggregation Approach","created":"2025-02-09","cited_by_count":3,"area":null},{"id":"2403.00930","title":"Scale-free Adversarial Reinforcement Learning","created":"2024-03-01","cited_by_count":2,"area":"deeprl"},{"id":"2411.06739","title":"Beating Adversarial Low-Rank MDPs with Unknown Transition and Bandit Feedback","created":"2024-11-11","cited_by_count":2,"area":null},{"id":"2507.11706","title":"Reinforcement Learning from Adversarial Preferences in Tabular MDPs","created":"2025-07-15","cited_by_count":2,"area":"deeprl"},{"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":"2602.13700","title":"Optimal Regret for Policy Optimization in Contextual Bandits","created":"2026-02-14","cited_by_count":2,"area":null},{"id":"2602.13706","title":"Near-Optimal Regret for Policy Optimization in Contextual MDPs with General Offline Function Approximation","created":"2026-02-14","cited_by_count":2,"area":null},{"id":"2405.00950","title":"Provably Efficient Reinforcement Learning for Adversarial Restless Multi-Armed Bandits with Unknown Transitions and Bandit Feedback","created":"2024-05-02","cited_by_count":1,"area":"deeprl"},{"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":"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.22810","title":"Multi-agent imitation learning with function approximation: Linear Markov games and beyond","created":"2026-02-26","cited_by_count":1,"area":"offlinerl"},{"id":"2606.14929","title":"Policy Regret for Embedding Model Routing: Contextual Bandits with Low-Rank Experts","created":"2026-06-12","cited_by_count":1,"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":"2409.18439","title":"State-free Reinforcement Learning","created":"2024-09-27","cited_by_count":0,"area":"deeprl"},{"id":"2505.07303","title":"Online Episodic Convex Reinforcement Learning","created":"2025-05-12","cited_by_count":0,"area":"deeprl"},{"id":"2605.11535","title":"Primal-Dual Policy Optimization for Linear CMDPs with Adversarial Losses","created":"2026-05-12","cited_by_count":0,"area":"deeprl"},{"id":"2605.26585","title":"Near-Optimal Regret in Adversarial Kernel Bandits","created":"2026-05-26","cited_by_count":0,"area":null},{"id":"2609.23127","title":"Provably Efficient Reinforcement Learning in Continuous-Time Episodic MDPs with Poisson Decision Epochs","created":"2026-09-19","cited_by_count":0,"area":"deeprl"},{"id":"2610.17818","title":"Follow the Perturbed Leader for Linear Bandits: $\\sqrt{T}$ Regret over General Convex Sets","created":"2026-10-13","cited_by_count":0,"area":null}],"next_cursor":null}