Image de couverture de livre

Achieving adaptivity and optimality for multi-armed bandits using Exponential-Kullback Leibler Maillard Sampling

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Qin, Hao, Jun, Kwang-Sung, Zhang, Chicheng
Format:	Preprint
Publié:	2025
Sujets:	Machine Learning Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Kullback-Leibler Maillard Sampling for Multi-armed Bandits with Bounded Rewards
par: Qin, Hao, et autres
Publié: (2023)

The Best Arm Evades: Near-optimal Multi-pass Streaming Lower Bounds for Pure Exploration in Multi-armed Bandits
par: Assadi, Sepehr, et autres
Publié: (2023)

Efficient Sample-optimal Learning of Gaussian Tree Models via Sample-optimal Testing of Gaussian Mutual Information
par: Gayen, Sutanu, et autres
Publié: (2024)

Fit Like You Sample: Sample-Efficient Generalized Score Matching from Fast Mixing Diffusions
par: Qin, Yilong, et autres
Publié: (2023)

Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap
par: Karpov, Nikolai, et autres
Publié: (2025)

Simple KNN-Based Outlier Detection Achieves Robust Clustering
par: Jiang, Tianle, et autres
Publié: (2026)

Clustering with Non-adaptive Subset Queries
par: Black, Hadley, et autres
Publié: (2024)

Sample-Adaptivity Tradeoff in On-Demand Sampling
par: Haghtalab, Nika, et autres
Publié: (2025)

Learning the Inverse Temperature of Ising Models under Hard Constraints using One Sample
par: Chauhan, Rohan, et autres
Publié: (2025)

Parallel Best Arm Identification in Heterogeneous Environments
par: Karpov, Nikolai, et autres
Publié: (2022)

Approximation Algorithms for D-optimal Design
par: Singh, Mohit, et autres
Publié: (2018)

OPTWIN: Drift identification with optimal sub-windows
par: Tosi, Mauro Dalle Lucca, et autres
Publié: (2023)

Thompson Sampling Itself is Differentially Private
par: Ou, Tingting, et autres
Publié: (2024)

Improved Approximations for Hard Graph Problems using Predictions
par: Aamand, Anders, et autres
Publié: (2025)

Near-optimal Active Regression of Single-Index Models
par: Li, Yi, et autres
Publié: (2025)

Near-optimal Swap Regret Minimization for Convex Losses
par: Hu, Lunjia, et autres
Publié: (2026)

MNL-Bandit with Knapsacks: a near-optimal algorithm
par: Aznag, Abdellah, et autres
Publié: (2021)

Provably learning a multi-head attention layer
par: Chen, Sitan, et autres
Publié: (2024)

Finite Sample Bounds for Learning with Score Matching
par: Smedira, Devin, et autres
Publié: (2026)

Optimal Dimension-Free Sampling for Regularized Classification
par: Alishahi, Meysam, et autres
Publié: (2026)

Metalearning with Very Few Samples Per Task
par: Aliakbarpour, Maryam, et autres
Publié: (2023)

Sharper Bounds for $\ell_p$ Sensitivity Sampling
par: Woodruff, David P., et autres
Publié: (2023)

Distribution Learning Meets Graph Structure Sampling
par: Bhattacharyya, Arnab, et autres
Publié: (2024)

Unrolled denoising networks provably learn optimal Bayesian inference
par: Karan, Aayush, et autres
Publié: (2024)

Log-concave Sampling from a Convex Body with a Barrier: a Robust and Unified Dikin Walk
par: Gu, Yuzhou, et autres
Publié: (2024)

Agnostic learning in (almost) optimal time via Gaussian surface area
par: Pesenti, Lucas, et autres
Publié: (2026)

Adaptive Discretization against an Adversary: Lipschitz bandits, Dynamic Pricing, and Auction Tuning
par: Podimata, Chara, et autres
Publié: (2020)

Sample-efficient Multiclass Calibration under $\ell_{p}$ Error
par: Bairaktari, Konstantina, et autres
Publié: (2025)

Structure-Aware Spectral Sparsification via Uniform Edge Sampling
par: He, Kaiwen, et autres
Publié: (2025)

Taming Imperfect Process Verifiers: A Sampling Perspective on Backtracking
par: Rohatgi, Dhruv, et autres
Publié: (2025)

Ridge Leverage Score Sampling for $\ell_p$ Subspace Approximation
par: Woodruff, David P., et autres
Publié: (2024)

A Provably Accurate Randomized Sampling Algorithm for Logistic Regression
par: Chowdhury, Agniva, et autres
Publié: (2024)

An efficient, provably optimal algorithm for the 0-1 loss linear classification problem
par: He, Xi, et autres
Publié: (2023)

Online Search with Predictions: Pareto-optimal Algorithm and its Applications in Energy Markets
par: Lee, Russell, et autres
Publié: (2022)

Polynomial-time derivation of optimal k-tree topology from Markov networks
par: Dastjerdi, Fereshteh R., et autres
Publié: (2024)

Sample-Efficient Optimization over Generative Priors via Coarse Learnability
par: Awasthi, Pranjal, et autres
Publié: (2025)

Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity
par: Amanatidis, Georgios, et autres
Publié: (2021)

A Single-Sample Polylogarithmic Regret Bound for Nonstationary Online Linear Programming
par: Xu, Haoran, et autres
Publié: (2026)

Proper decision trees: An axiomatic framework for solving optimal decision tree problems with arbitrary splitting rules
par: He, Xi, et autres
Publié: (2025)

A New Rejection Sampling Approach to $k$-$\mathtt{means}$++ With Improved Trade-Offs
par: Shah, Poojan, et autres
Publié: (2025)