Copertina

Corruption-Robust Linear Bandits: Minimax Optimality and Gap-Dependent Misspecification

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Liu, Haolin, Tajdini, Artin, Wagenmaker, Andrew, Wei, Chen-Yu
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Machine Learning
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Nearly Minimax Optimal Submodular Maximization with Bandit Feedback
di: Tajdini, Artin, et al.
Pubblicazione: (2023)

Improved Regret Bounds for Linear Bandits with Heavy-Tailed Rewards
di: Tajdini, Artin, et al.
Pubblicazione: (2025)

No-Regret Linear Bandits under Gap-Adjusted Misspecification
di: Liu, Chong, et al.
Pubblicazione: (2025)

Linear Bandits on Ellipsoids: Minimax Optimal Algorithms
di: Zhang, Raymond, et al.
Pubblicazione: (2025)

Gap-Dependent Bounds for Nearly Minimax Optimal Reinforcement Learning with Linear Function Approximation
di: Zhang, Haochen, et al.
Pubblicazione: (2026)

Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits
di: Liu, Jingyu, et al.
Pubblicazione: (2025)

Cascading Bandits Robust to Adversarial Corruptions
di: Xie, Jize, et al.
Pubblicazione: (2025)

Learning to Incentivize in Repeated Principal-Agent Problems with Adversarial Agent Arrivals
di: Liu, Junyan, et al.
Pubblicazione: (2025)

A Jointly Efficient and Optimal Algorithm for Heteroskedastic Generalized Linear Bandits with Adversarial Corruptions
di: Kim, Sanghwa, et al.
Pubblicazione: (2026)

Nearly Minimax Optimal Regret for Multinomial Logistic Bandit
di: Lee, Joongkyu, et al.
Pubblicazione: (2024)

Almost Minimax Optimal Best Arm Identification in Piecewise Stationary Linear Bandits
di: Hou, Yunlong, et al.
Pubblicazione: (2024)

Learning What to Recommend: Minimax Optimal Simple Regret in Logistic Bandits
di: Liu, Shuai, et al.
Pubblicazione: (2026)

Efficient and Optimal Policy Gradient Algorithm for Corrupted Multi-armed Bandits
di: Liu, Jiayuan, et al.
Pubblicazione: (2025)

Robust and Computationally Efficient Linear Contextual Bandits under Adversarial Corruption and Heavy-Tailed Noise
di: Tani, Naoto, et al.
Pubblicazione: (2026)

Robust Linear Dueling Bandits with Post-serving Context under Unknown Delays and Adversarial Corruptions
di: Oh, Youngmin
Pubblicazione: (2026)

Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions
di: Ghaffari, Fatemeh, et al.
Pubblicazione: (2024)

Beating Adversarial Low-Rank MDPs with Unknown Transition and Bandit Feedback
di: Liu, Haolin, et al.
Pubblicazione: (2024)

Robust Decentralized Multi-armed Bandits: From Corruption-Resilience to Byzantine-Resilience
di: Hu, Zicheng, et al.
Pubblicazione: (2025)

On Instability of Minimax Optimal Optimism-Based Bandit Algorithms
di: Praharaj, Samya, et al.
Pubblicazione: (2025)

Corruption-Robust Algorithms with Uncertainty Weighting for Nonlinear Contextual Bandits and Markov Decision Processes
di: Ye, Chenlu, et al.
Pubblicazione: (2022)

Online Learning to Rank under Corruption: A Robust Cascading Bandits Approach
di: Ghaffari, Fatemeh, et al.
Pubblicazione: (2025)

Optimal and Practical Batched Linear Bandit Algorithm
di: Yu, Sanghoon, et al.
Pubblicazione: (2025)

Optimal Thresholding Linear Bandit
di: Rivera, Eduardo Ochoa, et al.
Pubblicazione: (2024)

Asymptotically and Minimax Optimal Regret Bounds for Multi-Armed Bandits with Abstention
di: Yang, Junwen, et al.
Pubblicazione: (2024)

A Near-optimal, Scalable and Parallelizable Framework for Stochastic Bandits Robust to Adversarial Corruptions and Beyond
di: Hu, Zicheng, et al.
Pubblicazione: (2025)

Overcoming the Sim-to-Real Gap: Leveraging Simulation to Learn to Explore for Real-World RL
di: Wagenmaker, Andrew, et al.
Pubblicazione: (2024)

Optimal Batched Linear Bandits
di: Ren, Xuanfei, et al.
Pubblicazione: (2024)

Minimax-Optimal Multi-Agent Robust Reinforcement Learning
di: Jiao, Yuchen, et al.
Pubblicazione: (2024)

A Model Selection Approach for Corruption Robust Reinforcement Learning
di: Wei, Chen-Yu, et al.
Pubblicazione: (2021)

Robust Causal Bandits for Linear Models
di: Yan, Zirui, et al.
Pubblicazione: (2023)

Behavioral Exploration: Learning to Explore via In-Context Adaptation
di: Wagenmaker, Andrew, et al.
Pubblicazione: (2025)

Learning from Similar Linear Representations: Adaptivity, Minimaxity, and Robustness
di: Tian, Ye, et al.
Pubblicazione: (2023)

Practical and Optimal Algorithm for Linear Contextual Bandits with Rare Parameter Updates
di: Yu, Sanghoon, et al.
Pubblicazione: (2026)

Linear Bandits beyond Inner Product Spaces, the case of Bandit Optimal Transport
di: Croissant, Lorenzo
Pubblicazione: (2025)

Towards Minimax Optimality of Model-based Robust Reinforcement Learning
di: Clavier, Pierre, et al.
Pubblicazione: (2023)

Enjoying Non-linearity in Multinomial Logistic Bandits: A Minimax-Optimal Algorithm
di: Boudart, Pierre, et al.
Pubblicazione: (2025)

Constructing Adversarial Examples for Vertical Federated Learning: Optimal Client Corruption through Multi-Armed Bandit
di: Yao, Duanyi, et al.
Pubblicazione: (2024)

Achieving Optimal Static and Dynamic Regret Simultaneously in Bandits with Deterministic Losses
di: Qian, Jian, et al.
Pubblicazione: (2026)

Generalized Linear Bandits: Almost Optimal Regret with One-Pass Update
di: Zhang, Yu-Jie, et al.
Pubblicazione: (2025)

Variance-Dependent Regret Bounds for Non-stationary Linear Bandits
di: Wang, Zhiyong, et al.
Pubblicazione: (2024)