Copertina

A Near-optimal, Scalable and Parallelizable Framework for Stochastic Bandits Robust to Adversarial Corruptions and Beyond

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Hu, Zicheng, Chen, Cheng
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Machine Learning
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

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

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

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

Beyond Primal-Dual Methods in Bandits with Stochastic and Adversarial Constraints
di: Bernasconi, Martino, et al.
Pubblicazione: (2024)

Near Optimal Adversarial Attacks on Stochastic Bandits and Defenses with Smoothed Responses
di: Zuo, Shiliang
Pubblicazione: (2020)

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)

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

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

Nearly-Optimal Algorithm for Adversarial Kernelized Bandits
di: Iwazaki, Shogo
Pubblicazione: (2026)

Near-Optimal Regret in Adversarial Kernel Bandits
di: Zhang, Yu-Jie, et al.
Pubblicazione: (2026)

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

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

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

Few Batches or Little Memory, But Not Both: Simultaneous Space and Adaptivity Constraints in Stochastic Bandits
di: Huang, Ruiyuan, et al.
Pubblicazione: (2026)

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

Near-Optimal Regret for Distributed Adversarial Bandits: A Black-Box Approach
di: Qiu, Hao, et al.
Pubblicazione: (2026)

Nearly Optimal Algorithms for Contextual Dueling Bandits from Adversarial Feedback
di: Di, Qiwei, et al.
Pubblicazione: (2024)

Near-optimal Per-Action Regret Bounds for Sleeping Bandits
di: Nguyen, Quan, et al.
Pubblicazione: (2024)

Stealthy Adversarial Attacks on Stochastic Multi-Armed Bandits
di: Wang, Zhiwei, et al.
Pubblicazione: (2024)

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

Adapting to Stochastic and Adversarial Losses in Episodic MDPs with Aggregate Bandit Feedback
di: Ito, Shinji, et al.
Pubblicazione: (2025)

Parallelizable memory recurrent units
di: De Geeter, Florent, et al.
Pubblicazione: (2026)

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

HyperArm Bandit Optimization: A Novel approach to Hyperparameter Optimization and an Analysis of Bandit Algorithms in Stochastic and Adversarial Settings
di: Karroum, Samih, et al.
Pubblicazione: (2025)

Tractable Gaussian Phase Retrieval with Heavy Tails and Adversarial Corruption with Near-Linear Sample Complexity
di: Das, Santanu, et al.
Pubblicazione: (2026)

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

Near-Optimal Regret for Efficient Stochastic Combinatorial Semi-Bandits
di: Ye, Zichun, et al.
Pubblicazione: (2025)

Towards Optimal Adversarial Robust Reinforcement Learning with Infinity Measurement Error
di: Li, Haoran, et al.
Pubblicazione: (2025)

Towards Optimal Adversarial Robust Q-learning with Bellman Infinity-error
di: Li, Haoran, et al.
Pubblicazione: (2024)

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

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

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

CAWR: Corruption-Averse Advantage-Weighted Regression for Robust Policy Optimization
di: Hu, Ranting
Pubblicazione: (2025)

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

Near-optimal Regret Using Policy Optimization in Online MDPs with Aggregate Bandit Feedback
di: Lancewicki, Tal, et al.
Pubblicazione: (2025)

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

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

Adversarial Multi-dueling Bandits
di: Gajane, Pratik
Pubblicazione: (2024)