:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Zhao, Canzhe, Ito, Shinji, Li, Shuai
Format:	Preprint
Published:	2025
Subjects:	Machine Learning
Online Access:	https://arxiv.org/abs/2508.13679
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

LC-Tsallis-INF: Generalized Best-of-Both-Worlds Linear Contextual Bandits
by: Kato, Masahiro, et al.
Published: (2024)

A Best-of-both-worlds Algorithm for Bandits with Delayed Feedback with Robustness to Excessive Delays
by: Masoudian, Saeed, et al.
Published: (2023)

Follow-the-Perturbed-Leader with Fréchet-type Tail Distributions: Optimality in Adversarial Bandits and Best-of-Both-Worlds
by: Lee, Jongyeong, et al.
Published: (2024)

Stability-penalty-adaptive follow-the-regularized-leader: Sparsity, game-dependency, and best-of-both-worlds
by: Tsuchiya, Taira, et al.
Published: (2023)

Catoni Contextual Bandits are Robust to Heavy-tailed Rewards
by: Ye, Chenlu, et al.
Published: (2025)

A Perturbation Approach to Unconstrained Linear Bandits
by: Jacobsen, Andrew, et al.
Published: (2026)

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

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

Data-dependent Bounds with $T$-Optimal Best-of-Both-Worlds Guarantees in Multi-Armed Bandits using Stability-Penalty Matching
by: Nguyen, Quan, et al.
Published: (2025)

Influential Bandits: Pulling an Arm May Change the Environment
by: Sato, Ryoma, 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)

Bandit Max-Min Fair Allocation
by: Harada, Tsubasa, et al.
Published: (2025)

Exploration by Optimization with Hybrid Regularizers: Logarithmic Regret with Adversarial Robustness in Partial Monitoring
by: Tsuchiya, Taira, et al.
Published: (2024)

Low-rank Matrix Bandits with Heavy-tailed Rewards
by: Kang, Yue, et al.
Published: (2024)

Best of both worlds: Stochastic & adversarial best-arm identification
by: Abbasi-Yadkori, Yasin, et al.
Published: (2026)

A Simple and Adaptive Learning Rate for FTRL in Online Learning with Minimax Regret of $Θ(T^{2/3})$ and its Application to Best-of-Both-Worlds
by: Tsuchiya, Taira, et al.
Published: (2024)

Replicability is Asymptotically Free in Multi-armed Bandits
by: Komiyama, Junpei, et al.
Published: (2024)

Combinatorial Allocation Bandits with Nonlinear Arm Utility
by: Shibukawa, Yuki, et al.
Published: (2026)

A Tight Lower Bound for Non-stochastic Multi-armed Bandits with Expert Advice
by: Chase, Zachary, et al.
Published: (2025)

Adaptive Learning Rate for Follow-the-Regularized-Leader: Competitive Analysis and Best-of-Both-Worlds
by: Ito, Shinji, et al.
Published: (2024)

Multi-agent Multi-armed Bandit with Fully Heavy-tailed Dynamics
by: Wang, Xingyu, et al.
Published: (2025)

New Classes of the Greedy-Applicable Arm Feature Distributions in the Sparse Linear Bandit Problem
by: Ichikawa, Koji, et al.
Published: (2023)

A/B Testing and Best-arm Identification for Linear Bandits with Robustness to Non-stationarity
by: Xiong, Zhihan, et al.
Published: (2023)

Reinforcement Learning from Adversarial Preferences in Tabular MDPs
by: Tsuchiya, Taira, et al.
Published: (2025)

Revisiting Follow-the-Perturbed-Leader with Unbounded Perturbations in Bandit Problems
by: Lee, Jongyeong, et al.
Published: (2025)

Best-of-Both-Worlds Algorithms for Linear Contextual Bandits
by: Kuroki, Yuko, et al.
Published: (2023)

Outlier-Robust Linear System Identification Under Heavy-tailed Noise
by: Kanakeri, Vinay, et al.
Published: (2024)

Heavy-Tailed Linear Bandits: Huber Regression with One-Pass Update
by: Wang, Jing, et al.
Published: (2025)

Improved Algorithm for Adversarial Linear Mixture MDPs with Bandit Feedback and Unknown Transition
by: Li, Long-Fei, et al.
Published: (2024)

On The Complexity of Best-Arm Identification in Non-Stationary Linear Bandits
by: Maynard-Zhang, Leo, et al.
Published: (2026)

On the Power of Adaptivity for $\varepsilon$-Best Arm Identification in Linear Bandits
by: Maiti, Arnab, et al.
Published: (2026)

Sparsity-Agnostic Linear Bandits with Adaptive Adversaries
by: Jin, Tianyuan, et al.
Published: (2024)

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

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

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

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

Heavy-tailed Contamination is Easier than Adversarial Contamination
by: Cherapanamjeri, Yeshwanth, et al.
Published: (2024)

Differentially Private Sparse Linear Regression with Heavy-tailed Responses
by: Tian, Xizhi, et al.
Published: (2025)

Adversarial Learning in Games with Bandit Feedback: Logarithmic Pure-Strategy Maximin Regret
by: Ito, Shinji, et al.
Published: (2026)