Cover Image

Cascading Bandits Robust to Adversarial Corruptions

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Xie, Jize, Chen, Cheng, Wang, Zhiyong, Li, Shuai
Format:	Preprint
Published:	2025
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

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

Online Clustering of Dueling Bandits
by: Wang, Zhiyong, et al.
Published: (2025)

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

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

Heavy-tailed Linear Bandits: Adversarial Robustness, Best-of-both-worlds, and Beyond
by: Zhao, Canzhe, et al.
Published: (2025)

Federated Contextual Cascading Bandits with Asynchronous Communication and Heterogeneous Users
by: Yang, Hantao, et al.
Published: (2024)

Corruption-Robust Linear Bandits: Minimax Optimality and Gap-Dependent Misspecification
by: Liu, Haolin, et al.
Published: (2024)

Stochastic Bandits Robust to Adversarial Attacks
by: Wang, Xuchuang, et al.
Published: (2024)

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

Robust Distribution Learning with Local and Global Adversarial Corruptions
by: Nietert, Sloan, et al.
Published: (2024)

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

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

Towards Robust Model-Based Reinforcement Learning Against Adversarial Corruption
by: Ye, Chenlu, et al.
Published: (2024)

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

Communication-Corruption Coupling and Verification in Cooperative Multi-Objective Bandits
by: Shi, Ming
Published: (2026)

Cascade-KDE: Robust Time-Series Restoration under Out-of-Distribution Impulse Corruptions
by: Liu, Yuefeng, et al.
Published: (2026)

Federated Linear Dueling Bandits
by: Huang, Xuhan, et al.
Published: (2025)

On Characterizing Learnability for Adversarial Noisy Bandits
by: Hanneke, Steve, et al.
Published: (2026)

Optimal Analysis for Bandit Learning in Matching Markets with Serial Dictatorship
by: Wang, Zilong, et al.
Published: (2025)

Adversarial Bandit over Bandits: Hierarchical Bandits for Online Configuration Management
by: Avin, Chen, et al.
Published: (2025)

Heterogeneous Multi-Player Multi-Armed Bandits Robust To Adversarial Attacks
by: Magesh, Akshayaa, et al.
Published: (2025)

Combinatorial Multivariant Multi-Armed Bandits with Applications to Episodic Reinforcement Learning and Beyond
by: Liu, Xutong, et al.
Published: (2024)

Cascading Bandits With Feedback
by: Prakash, R Sri, et al.
Published: (2025)

Adversarial Bandit Optimization with Globally Bounded Perturbations to Linear Losses
by: Cheng, Zhuoyu, et al.
Published: (2026)

Towards More Robust and Accurate Sequential Recommendation with Cascade-guided Adversarial Training
by: Tan, Juntao, et al.
Published: (2023)

Learning with Monotone Adversarial Corruptions
by: Larsen, Kasper Green, et al.
Published: (2026)

Robust Satisficing Gaussian Process Bandits Under Adversarial Attacks
by: Saday, Artun, et al.
Published: (2025)

Adversarial Bandits with Multi-User Delayed Feedback: Theory and Application
by: Li, Yandi, et al.
Published: (2023)

Adversarial Multi-dueling Bandits
by: Gajane, Pratik
Published: (2024)

Robust Batched Bandits
by: Guo, Yunwen, et al.
Published: (2025)

Decentralized Asynchronous Multi-player Bandits
by: Fan, Jingqi, et al.
Published: (2025)

Regret Bounds for Noise-Free Cascaded Kernelized Bandits
by: Li, Zihan, et al.
Published: (2022)

RANSAC Revisited: An Improved Algorithm for Robust Subspace Recovery under Adversarial and Noisy Corruptions
by: Chen, Guixian, et al.
Published: (2025)

Stress-Testing ML Pipelines with Adversarial Data Corruption
by: Zhu, Jiongli, et al.
Published: (2025)

Disagreement-Regularized Importance Sampling for Adversarial Label Corruption
by: Horváth, Csongor, et al.
Published: (2026)

FedProphet: Memory-Efficient Federated Adversarial Training via Robust and Consistent Cascade Learning
by: Tang, Minxue, et al.
Published: (2024)