Near-Optimal Adversarial Reinforcement Learning with Switching Costs

8 February 2023

Papers citing "Near-Optimal Adversarial Reinforcement Learning with Switching Costs"

16 / 16 papers shown

Title
Nearly Optimal Algorithms for Linear Contextual Bandits with Adversarial Corruptions Jiafan He Dongruo Zhou Tong Zhang Quanquan Gu 100 47 0 13 May 2022
Linear Contextual Bandits with Adversarial Corruptions Heyang Zhao Dongruo Zhou Quanquan Gu AAML 85 24 0 25 Oct 2021
Policy Optimization in Adversarial MDPs: Improved Exploration via Dilated Bonuses Haipeng Luo Chen-Yu Wei Chung-Wei Lee 89 45 0 18 Jul 2021
Achieving Near Instance-Optimality and Minimax-Optimality in Stochastic and Adversarial Linear Bandits Simultaneously Chung-Wei Lee Haipeng Luo Chen-Yu Wei Mengxiao Zhang Xiaojin Zhang 81 49 0 11 Feb 2021
Provably Efficient Exploration in Policy Optimization Qi Cai Zhuoran Yang Chi Jin Zhaoran Wang 58 281 0 12 Dec 2019
Learning Adversarial MDPs with Bandit Feedback and Unknown Transition Chi Jin Tiancheng Jin Haipeng Luo S. Sra Tiancheng Yu 75 104 0 03 Dec 2019
Corruption-robust exploration in episodic reinforcement learning Thodoris Lykouris Max Simchowitz Aleksandrs Slivkins Wen Sun 70 105 0 20 Nov 2019
Online Optimization with Predictions and Non-convex Losses Yiheng Lin Gautam Goel Adam Wierman 60 42 0 10 Nov 2019
Reinforcement Learning in Healthcare: A Survey Chao Yu Jiming Liu S. Nemati LM&MA OffRL 183 570 0 22 Aug 2019
Bandits with Feedback Graphs and Switching Costs R. Arora T. V. Marinov M. Mohri 73 22 0 29 Jul 2019
Provably Efficient Reinforcement Learning with Linear Function Approximation Chi Jin Zhuoran Yang Zhaoran Wang Michael I. Jordan 98 557 0 11 Jul 2019
Non-Stationary Reinforcement Learning: The Blessing of (More) Optimism Wang Chi Cheung D. Simchi-Levi Ruihao Zhu OffRL 58 7 0 07 Jun 2019
Beyond Online Balanced Descent: An Optimal Algorithm for Smoothed Online Optimization Gautam Goel Yiheng Lin Haoyuan Sun Adam Wierman 50 67 0 29 May 2019
Explore no more: Improved high-probability regret bounds for non-stochastic bandits Gergely Neu 393 185 0 10 Jun 2015
$Bandits with Switching Costs: T^{2/3} Regret$ Bandits with Switching Costs: T^{2/3} Regret O. Dekel Jian Ding Tomer Koren Yuval Peres 79 98 0 11 Oct 2013
Empirical Bernstein Bounds and Sample Variance Penalization Andreas Maurer Massimiliano Pontil 397 545 0 21 Jul 2009