Robust Lipschitz Bandits to Adversarial Corruptions

29 May 2023

Papers citing "Robust Lipschitz Bandits to Adversarial Corruptions"

9 / 9 papers shown

Title
Quantum Lipschitz Bandits Bongsoo Yi Yue Kang Yao Li 27 1 0 03 Apr 2025
A Model Selection Approach for Corruption Robust Reinforcement Learning Chen-Yu Wei Christoph Dann Julian Zimmert 77 44 0 31 Dec 2024
Provably and Practically Efficient Adversarial Imitation Learning with General Function Approximation Tian Xu Zhilong Zhang Ruishuo Chen Yihao Sun Yang Yu 25 1 0 01 Nov 2024
Towards Robust Model-Based Reinforcement Learning Against Adversarial Corruption Chen Ye Jiafan He Quanquan Gu Tong Zhang 16 5 0 14 Feb 2024
Efficient Frameworks for Generalized Low-Rank Matrix Bandit Problems Yue Kang Cho-Jui Hsieh T. C. Lee 29 17 0 14 Jan 2024
Best-of-Both-Worlds Algorithms for Linear Contextual Bandits Yuko Kuroki Alberto Rumi Taira Tsuchiya Fabio Vitale Nicolò Cesa-Bianchi 15 5 0 24 Dec 2023
Corruption-Robust Offline Reinforcement Learning with General Function Approximation Chen Ye Rui Yang Quanquan Gu Tong Zhang OffRL 8 16 0 23 Oct 2023
Online Continuous Hyperparameter Optimization for Generalized Linear Contextual Bandits Yue Kang Cho-Jui Hsieh T. C. Lee 11 1 0 18 Feb 2023
Nearly Optimal Algorithms for Linear Contextual Bandits with Adversarial Corruptions Jiafan He Dongruo Zhou Tong Zhang Quanquan Gu 61 46 0 13 May 2022