:: Library Catalog

Copertina

Salvato in:

Dettagli Bibliografici
Autori principali:	Xie, Jize, Chen, Cheng, Wang, Zhiyong, Li, Shuai
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Machine Learning
Accesso online:	https://arxiv.org/abs/2502.08077
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions
di: Ghaffari, Fatemeh, 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)

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

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

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

Online Clustering of Dueling Bandits
di: Wang, Zhiyong, et al.
Pubblicazione: (2025)

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

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)

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

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

Stochastic Bandits Robust to Adversarial Attacks
di: Wang, Xuchuang, 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)

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

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

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

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

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

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

Federated Linear Dueling Bandits
di: Huang, Xuhan, et al.
Pubblicazione: (2025)

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

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

Cascading Bandits With Feedback
di: Prakash, R Sri, et al.
Pubblicazione: (2025)

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

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

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

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

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

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

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

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

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

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

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

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

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

Robust Batched Bandits
di: Guo, Yunwen, et al.
Pubblicazione: (2025)

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

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

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