{"total":45,"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":"2102.05858","title":"Achieving Near Instance-Optimality and Minimax-Optimality in Stochastic and Adversarial Linear Bandits Simultaneously","created":"2021-02-11","cited_by_count":48,"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":"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":"2107.01264","title":"Beyond Value-Function Gaps: Improved Instance-Dependent Regret Bounds for Episodic Reinforcement Learning","created":"2021-07-02","cited_by_count":34,"area":null},{"id":"2206.13063","title":"On the Complexity of Adversarial Decision Making","created":"2022-06-27","cited_by_count":33,"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":"2302.09739","title":"A Blackbox Approach to Best of Both Worlds in Bandits and Beyond","created":"2023-02-20","cited_by_count":30,"area":null},{"id":"2206.00873","title":"Nearly Optimal Best-of-Both-Worlds Algorithms for Online Learning with Feedback Graphs","created":"2022-06-02","cited_by_count":26,"area":null},{"id":"2207.14211","title":"Regret Minimization and Convergence to Equilibria in General-sum Markov Games","created":"2022-07-28","cited_by_count":24,"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":"2102.06875","title":"Improved Corruption Robust Algorithms for Episodic Reinforcement Learning","created":"2021-02-13","cited_by_count":20,"area":null},{"id":"2102.09864","title":"An Algorithm for Stochastic and Adversarial Bandits with Switching Costs","created":"2021-02-19","cited_by_count":19,"area":null},{"id":"2207.14550","title":"Best-of-Both-Worlds Algorithms for Partial Monitoring","created":"2022-07-29","cited_by_count":19,"area":null},{"id":"2209.13841","title":"Online Policy Optimization for Robust MDP","created":"2022-09-28","cited_by_count":19,"area":null},{"id":"2201.11921","title":"Adaptive Best-of-Both-Worlds Algorithm for Heavy-Tailed Multi-Armed Bandits","created":"2022-01-28","cited_by_count":18,"area":null},{"id":"2206.00557","title":"A Near-Optimal Best-of-Both-Worlds Algorithm for Online Learning with Feedback Graphs","created":"2022-06-01","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":"2103.12487","title":"Improved Analysis of the Tsallis-INF Algorithm in Stochastically Constrained Adversarial Bandits and Stochastic Bandits with Adversarial Corruptions","created":"2021-03-23","cited_by_count":15,"area":null},{"id":"2302.12370","title":"Best-of-Three-Worlds Linear Bandit Algorithm with Variance-Adaptive Regret Bounds","created":"2023-02-24","cited_by_count":14,"area":null},{"id":"2208.12584","title":"Socially Fair Reinforcement Learning","created":"2022-08-26","cited_by_count":13,"area":null},{"id":"2206.06810","title":"Adversarially Robust Multi-Armed Bandit Algorithm with Variance-Dependent Regret Bounds","created":"2022-06-14","cited_by_count":12,"area":null},{"id":"2303.06825","title":"Best-of-three-worlds Analysis for Linear Bandits with Follow-the-regularized-leader Algorithm","created":"2023-03-13","cited_by_count":12,"area":null},{"id":"2403.00715","title":"Adaptive Learning Rate for Follow-the-Regularized-Leader: Competitive Analysis and Best-of-Both-Worlds","created":"2024-03-01","cited_by_count":11,"area":null},{"id":"2502.17625","title":"Instance-Dependent Regret Bounds for Learning Two-Player Zero-Sum Games with Bandit Feedback","created":"2025-02-24","cited_by_count":10,"area":null},{"id":"2410.03284","title":"uniINF: Best-of-Both-Worlds Algorithm for Parameter-Free Heavy-Tailed MABs","created":"2024-10-04","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":"2405.10027","title":"The Real Price of Bandit Information in Multiclass Classification","created":"2024-05-16","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":"2107.09572","title":"Best-of-All-Worlds Bounds for Online Learning with Feedback Graphs","created":"2021-07-20","cited_by_count":4,"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.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":"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":"2207.05437","title":"Simultaneously Learning Stochastic and Adversarial Bandits under the Position-Based Model","created":"2022-07-12","cited_by_count":2,"area":null},{"id":"2305.02527","title":"Reinforcement Learning with Delayed, Composite, and Partially Anonymous Reward","created":"2023-05-04","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":"2602.01295","title":"Best-of-Both-Worlds for Heavy-Tailed Markov Decision Processes","created":"2026-02-01","cited_by_count":1,"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":"2509.00179","title":"Playing Markov Games Without Observing Payoffs","created":"2025-08-29","cited_by_count":0,"area":null},{"id":"2608.15996","title":"Toward Optimal Second-Order Path-Length Guarantee for Adversarial Multi-Armed Bandits","created":"2026-08-17","cited_by_count":0,"area":null}],"next_cursor":null}