:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Cheng, Zhuoyu, Hatano, Kohei, Takimoto, Eiji
Format:	Preprint
Published:	2026
Subjects:	Machine Learning
Online Access:	https://arxiv.org/abs/2603.26066
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Adversarial bandit optimization for approximately linear functions
by: Cheng, Zhuoyu, et al.
Published: (2025)

Multi-thresholding Good Arm Identification with Bandit Feedback
by: Jiang, Xuanke, et al.
Published: (2025)

Self-Concordant Perturbations for Linear Bandits
by: Lévy, Lucas, et al.
Published: (2025)

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

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

Primal-Dual Policy Optimization for Linear CMDPs with Adversarial Losses
by: Yu, Kihyun, et al.
Published: (2026)

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

Improved Bound for Robust Causal Bandits with Linear Models
by: Yan, Zirui, et al.
Published: (2024)

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

An Improved Algorithm for Adversarial Linear Contextual Bandits via Reduction
by: van Erven, Tim, et al.
Published: (2025)

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

Regret Bounds for Adversarial Contextual Bandits with General Function Approximation and Delayed Feedback
by: Levy, Orin, et al.
Published: (2025)

Fix the Loss, Not the Radius: Rethinking the Adversarial Perturbation of Sharpness-Aware Minimization
by: Wang, Jinping, et al.
Published: (2026)

Quantum Non-Linear Bandit Optimization
by: Siam, Zakaria Shams, et al.
Published: (2025)

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

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

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

Heavy-tailed Linear Bandits: Adversarial Robustness, Best-of-both-worlds, and Beyond
by: Zhao, Canzhe, 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)

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)

Bandits with Mean Bounds
by: Sharma, Nihal, et al.
Published: (2020)

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

Efficient Matroid Bandit Linear Optimization Leveraging Unimodality
by: Delage, Aurélien, et al.
Published: (2025)

Improved Algorithms for Stochastic Linear Bandits Using Tail Bounds for Martingale Mixtures
by: Flynn, Hamish, et al.
Published: (2023)

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

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

Exploration via Feature Perturbation in Contextual Bandits
by: Yi, Seouh-won, et al.
Published: (2025)

Online Continuous Hyperparameter Optimization for Generalized Linear Contextual Bandits
by: Kang, Yue, et al.
Published: (2023)

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

Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds
by: Güçlü, Arda, et al.
Published: (2024)

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)

Optimizing the Adversarial Perturbation with a Momentum-based Adaptive Matrix
by: Tao, Wei, et al.
Published: (2025)

Constrained Adversarial Perturbation
by: Nishad, Virendra, et al.
Published: (2025)

Contrasting Adversarial Perturbations: The Space of Harmless Perturbations
by: Chen, Lu, et al.
Published: (2024)

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

Constrained Contextual Bandits with Adversarial Contexts
by: Sarkar, Dhruv, et al.
Published: (2026)

Adversarial Combinatorial Bandits with Switching Costs
by: Dong, Yanyan, et al.
Published: (2024)

Faster Rates for Private Adversarial Bandits
by: Asi, Hilal, et al.
Published: (2025)

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