Cover Image

Optimal Arm Elimination Algorithms for Combinatorial Bandits

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Wen, Yuxiao, Han, Yanjun, Zhou, Zhengyuan
Format:	Preprint
Published:	2025
Subjects:	Machine Learning Information Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Joint Value Estimation and Bidding in Repeated First-Price Auctions
by: Wen, Yuxiao, et al.
Published: (2025)

The (Marginal) Value of a Search Ad: An Online Causal Framework for Repeated Second-price Auctions
by: Wen, Yuxiao, et al.
Published: (2026)

Statistical Complexity and Optimal Algorithms for Non-linear Ridge Bandits
by: Rajaraman, Nived, et al.
Published: (2023)

Adversarial Combinatorial Semi-bandits with Graph Feedback
by: Wen, Yuxiao
Published: (2025)

Optimal No-regret Learning in Repeated First-price Auctions
by: Han, Yanjun, et al.
Published: (2020)

Stochastic contextual bandits with graph feedback: from independence number to MAS number
by: Wen, Yuxiao, et al.
Published: (2024)

Combinatorial Multi-armed Bandits: Arm Selection via Group Testing
by: Mukherjee, Arpan, et al.
Published: (2024)

Optimal Best Arm Identification with Fixed Confidence in Restless Bandits
by: Karthik, P. N., et al.
Published: (2023)

Learning to Bid Optimally and Efficiently in Adversarial First-price Auctions
by: Han, Yanjun, et al.
Published: (2020)

Evolution of Information in Interactive Decision Making: A Case Study for Multi-Armed Bandits
by: Gu, Yuzhou, et al.
Published: (2025)

Almost Minimax Optimal Best Arm Identification in Piecewise Stationary Linear Bandits
by: Hou, Yunlong, et al.
Published: (2024)

On Instability of Minimax Optimal Optimism-Based Bandit Algorithms
by: Praharaj, Samya, et al.
Published: (2025)

Regret Tail Characterization of Optimal Bandit Algorithms with Generic Rewards
by: Panda, Subhodip, et al.
Published: (2026)

Optimal Clustering with Bandit Feedback
by: Yang, Junwen, et al.
Published: (2022)

Towards Efficient and Optimal Covariance-Adaptive Algorithms for Combinatorial Semi-Bandits
by: Zhou, Julien, et al.
Published: (2024)

Assouad, Fano, and Le Cam with Interaction: A Unifying Lower Bound Framework and Characterization for Bandit Learnability
by: Chen, Fan, et al.
Published: (2024)

Optimal Best-Arm Identification under Fixed Confidence with Multiple Optima
by: Truong, Lan V.
Published: (2025)

Optimal Top-Two Method for Best Arm Identification and Fluid Analysis
by: Bandyopadhyay, Agniv, et al.
Published: (2024)

Indexed Minimum Empirical Divergence-Based Algorithms for Linear Bandits
by: Bian, Jie, et al.
Published: (2024)

Asymptotically and Minimax Optimal Regret Bounds for Multi-Armed Bandits with Abstention
by: Yang, Junwen, et al.
Published: (2024)

Optimal Multi-Objective Best Arm Identification with Fixed Confidence
by: Chen, Zhirui, et al.
Published: (2025)

Quantum-Enhanced Neural Contextual Bandit Algorithms
by: Huang, Yuqi, et al.
Published: (2026)

Asymptotically Optimal Linear Best Feasible Arm Identification with Fixed Budget
by: Bian, Jie, et al.
Published: (2025)

Best Arm Identification with Minimal Regret
by: Yang, Junwen, et al.
Published: (2024)

Best-Arm Identification with Noisy Actuation
by: Karakas, Merve, et al.
Published: (2026)

Optimal Regret of Bernoulli Bandits under Global Differential Privacy
by: Azize, Achraf, et al.
Published: (2025)

Restless Linear Bandits
by: Khaleghi, Azadeh
Published: (2024)

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

Fixed-Confidence Best Arm Identification with Decreasing Variance
by: Roychowdhury, Tamojeet, et al.
Published: (2025)

Bandit Convex Optimization with Gradient Prediction Adaptivity
by: Wang, Shuche, et al.
Published: (2026)

Lower Bounds for Time-Varying Kernelized Bandits
by: Cai, Xu, et al.
Published: (2024)

Conversational Dueling Bandits in Generalized Linear Models
by: Yang, Shuhua, et al.
Published: (2024)

Competing Bandits in Matching Markets via Super Stability
by: Basu, Soumya
Published: (2025)

Quantile Multi-Armed Bandits with 1-bit Feedback
by: Lau, Ivan, et al.
Published: (2025)

Online Clustering of Data Sequences with Bandit Information
by: Chandran, G Dhinesh, et al.
Published: (2025)

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

A Modularized Framework for Piecewise-Stationary Restless Bandits
by: Li, Kuan-Ta, et al.
Published: (2026)

Constrained Gaussian Wasserstein Optimal Transport with Commutative Covariance Matrices
by: Chen, Jun, et al.
Published: (2025)

Minimax Optimal Algorithms with Fixed-$k$-Nearest Neighbors
by: Ryu, J. Jon, et al.
Published: (2022)

Harnessing the Power of Federated Learning in Federated Contextual Bandits
by: Shi, Chengshuai, et al.
Published: (2023)