:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Chang, Xiangyu, Chen, Xi, Wang, Yining, Zeng, Zhiyi
Format:	Preprint
Published:	2025
Subjects:	Machine Learning
Online Access:	https://arxiv.org/abs/2505.22361
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Offline Learning for Combinatorial Multi-armed Bandits
by: Liu, Xutong, et al.
Published: (2025)

GINO-Q: Learning an Asymptotically Optimal Index Policy for Restless Multi-armed Bandits
by: Chen, Gongpu, et al.
Published: (2024)

Batched Stochastic Bandit for Nondegenerate Functions
by: Liu, Yu, et al.
Published: (2024)

Oracle-Efficient Combinatorial Semi-Bandits
by: Kim, Jung-hun, et al.
Published: (2025)

Online Statistical Inference for Contextual Bandits via Stochastic Gradient Descent
by: Chang, Xiangyu, et al.
Published: (2022)

ComPO: Preference Alignment via Comparison Oracles
by: Chen, Peter, et al.
Published: (2025)

Multi-armed Bandits with Missing Outcome
by: Mahrooghi, Ilia, et al.
Published: (2024)

Batched Kernelized Bandits: Refinements and Extensions
by: Ma, Chenkai, et al.
Published: (2026)

Batched Nonparametric Contextual Bandits
by: Jiang, Rong, et al.
Published: (2024)

Optimal Batched Linear Bandits
by: Ren, Xuanfei, et al.
Published: (2024)

The Batch Complexity of Bandit Pure Exploration
by: Tuynman, Adrienne, et al.
Published: (2025)

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

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

Maximal Objectives in the Multi-armed Bandit with Applications
by: Ozbay, Eren, et al.
Published: (2020)

Deceptive Exploration in Multi-armed Bandits
by: Vurankaya, I. Arda, et al.
Published: (2025)

Causally Abstracted Multi-armed Bandits
by: Zennaro, Fabio Massimo, et al.
Published: (2024)

Hybrid Combinatorial Multi-armed Bandits with Probabilistically Triggered Arms
by: Zhou, Kongchang, et al.
Published: (2025)

Design Experiments to Compare Multi-armed Bandit Algorithms
by: Meng, Huiling, et al.
Published: (2026)

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

Pairwise Elimination with Instance-Dependent Guarantees for Bandits with Cost Subsidy
by: Juneja, Ishank, et al.
Published: (2025)

Optimal and Practical Batched Linear Bandit Algorithm
by: Yu, Sanghoon, et al.
Published: (2025)

Fairness of Exposure in Online Restless Multi-armed Bandits
by: Sood, Archit, et al.
Published: (2024)

Federated $\mathcal{X}$-armed Bandit with Flexible Personalisation
by: Arabzadeh, Ali, et al.
Published: (2024)

Transfer Learning for Contextual Multi-armed Bandits
by: Cai, Changxiao, et al.
Published: (2022)

Learning with Limited Shared Information in Multi-agent Multi-armed Bandit
by: Shao, Junning, et al.
Published: (2025)

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

A Two-armed Bandit Framework for A/B Testing
by: Wang, Jinjuan, et al.
Published: (2025)

Feedback Descent: Open-Ended Text Optimization via Pairwise Comparison
by: Lee, Yoonho, et al.
Published: (2025)

Heterogeneous Multi-agent Multi-armed Bandits on Stochastic Block Models
by: Xu, Mengfan, et al.
Published: (2025)

Locally Private Nonparametric Contextual Multi-armed Bandits
by: Ma, Yuheng, et al.
Published: (2025)

Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap
by: Karpov, Nikolai, et al.
Published: (2025)

Transfer in Sequential Multi-armed Bandits via Reward Samples
by: R, Rahul N, et al.
Published: (2024)

Falcon: Fair Active Learning using Multi-armed Bandits
by: Tae, Ki Hyun, et al.
Published: (2024)

Batch Ensemble for Variance Dependent Regret in Stochastic Bandits
by: Cassel, Asaf, et al.
Published: (2024)

Metric Learning from Limited Pairwise Preference Comparisons
by: Wang, Zhi, et al.
Published: (2024)

Batch size invariant Adam
by: Wang, Xi, et al.
Published: (2024)

Multi-Armed Bandits and Quantum Channel Oracles
by: Buchholz, Simon, et al.
Published: (2023)

A Re-solving Heuristic for Dynamic Assortment Optimization with Knapsack Constraints
by: Chen, Xi, et al.
Published: (2024)

Pairwise Comparisons without Stochastic Transitivity: Model, Theory and Applications
by: Lee, Sze Ming, et al.
Published: (2025)