Cover Image

Optimal Clustering with Bandit Feedback

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Yang, Junwen, Zhong, Zixin, Tan, Vincent Y. F.
Format:	Preprint
Published:	2022
Subjects:	Machine Learning Information Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

On the Benefits of Free Exploration for Regret Minimization in Multi-Armed Bandits
by: Hou, Yunlong, et al.
Published: (2026)

A General Framework for Clustering and Distribution Matching with Bandit Feedback
by: Yavas, Recep Can, et al.
Published: (2024)

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

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

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

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

Almost Asymptotically Optimal Active Clustering Through Pairwise Observations
by: Teo, Rachel S. Y., et al.
Published: (2026)

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)

Finite-Time Minimax Bounds and an Optimal Lyapunov Policy in Queueing Control
by: Liu, Yujie, et al.
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)

Optimal Arm Elimination Algorithms for Combinatorial Bandits
by: Wen, Yuxiao, et al.
Published: (2025)

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

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

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

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

On the Exponential Convergence for Offline RLHF with Pairwise Comparisons
by: Chen, Zhirui, et al.
Published: (2024)

A Mirror Descent-Based Algorithm for Corruption-Tolerant Distributed Gradient Descent
by: Wang, Shuche, et al.
Published: (2024)

Best Arm Identification with Possibly Biased Offline Data
by: Yang, Le, et al.
Published: (2025)

Influence Maximization via Graph Neural Bandits
by: Feng, Yuting, et al.
Published: (2024)

Transformers Provably Learn Directed Acyclic Graphs via Kernel-Guided Mutual Information
by: Cheng, Yuan, et al.
Published: (2025)

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

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

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

ODELoRA: Training Low-Rank Adaptation by Solving Ordinary Differential Equations
by: Gao, Yihang, et al.
Published: (2026)

Automatic Rank Determination for Low-Rank Adaptation via Submodular Function Maximization
by: Gao, Yihang, et al.
Published: (2025)

Near-Optimal Clustering in Mixture of Markov Chains
by: Lee, Junghyun, et al.
Published: (2025)

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

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

$L^1$ Estimation: On the Optimality of Linear Estimators
by: Barnes, Leighton P., et al.
Published: (2023)

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

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

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

Fixed-Budget Differentially Private Best Arm Identification
by: Chen, Zhirui, et al.
Published: (2024)

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

ProFL: Performative Robust Optimal Federated Learning
by: Zheng, Xue, et al.
Published: (2024)

Improved Offline Contextual Bandits with Second-Order Bounds: Betting and Freezing
by: Ryu, J. Jon, et al.
Published: (2025)