Cover Image

Optimal Best Arm Identification with Fixed Confidence in Restless Bandits

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Karthik, P. N., Tan, Vincent Y. F., Mukherjee, Arpan, Tajer, Ali
Format:	Preprint
Published:	2023
Subjects:	Machine Learning Information Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

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

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

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

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

Timely Best Arm Identification in Restless Shared Networks
by: Zhou, Mengqiu, et al.
Published: (2026)

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

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

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

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

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

Risk-sensitive Bandits: Arm Mixture Optimality and Regret-efficient Algorithms
by: Tatlı, Meltem, et al.
Published: (2025)

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

Fixed-Budget Constrained Best Arm Identification in Grouped Bandits
by: Mukherjee, Raunak, et al.
Published: (2026)

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

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

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

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

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

Locally Optimal Fixed-Budget Best Arm Identification in Two-Armed Gaussian Bandits with Unknown Variances
by: Kato, Masahiro
Published: (2023)

Fair Best Arm Identification with Fixed Confidence
by: Russo, Alessio, et al.
Published: (2024)

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

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

Fixed Confidence Best Arm Identification in the Bayesian Setting
by: Jang, Kyoungseok, et al.
Published: (2024)

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

Preference-centric Bandits: Optimality of Mixtures and Regret-efficient Algorithms
by: Tatlı, Meltem, et al.
Published: (2025)

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

Risk-Averse Best Arm Set Identification with Fixed Budget and Fixed Confidence
by: Nonaga, Shunta, et al.
Published: (2025)

Worst-Case Optimal Multi-Armed Gaussian Best Arm Identification with a Fixed Budget
by: Kato, Masahiro
Published: (2023)

Minimax and Bayes Optimal Best-Arm Identification
by: Kato, Masahiro
Published: (2025)

Nearly Optimal Best Arm Identification for Semiparametric Bandits
by: Kim, Seok-Jin
Published: (2026)

Near Optimal Best Arm Identification for Clustered Bandits
by: Yash, et al.
Published: (2025)

Finite-Time Minimax Bounds and an Optimal Lyapunov Policy in Queueing Control
by: Liu, Yujie, et al.
Published: (2025)

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

Prior-Dependent Allocations for Bayesian Fixed-Budget Best-Arm Identification in Structured Bandits
by: Nguyen, Nicolas, et al.
Published: (2024)

Best-Arm Identification in Unimodal Bandits
by: Poiani, Riccardo, et al.
Published: (2024)

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