arXiv AI
Gap Entropy and Almost Instance-Wise Optimal Best-Arm Identification
Read the original on arXiv AI →The Flow has not summarised this story yet — read it at arXiv AI.
Related stories
arXiv Statistics ML
Sep 10
A positive resolution of the gap-entropy conjecture
arXiv:2609.10529v1 Announce Type: cross Abstract: We prove the gap-entropy conjecture for fixed-confidence best-arm identification with independent unit-variance Gaussian arms, means in $[0,1]$, and...
Hugging Face Trending Papers
Sep 9
A positive resolution of the gap-entropy conjecture
We prove the gap-entropy conjecture for fixed-confidence best-arm identification with independent unit-variance Gaussian arms, means in $[0,1]$, and a unique optimal arm. For each suboptimal arm $i$,...
arXiv Statistics ML
Oct 26
On the Complexity of Best-Arm Identification in Non-Stationary Linear Bandits
arXiv:2603. 10346v2 Announce Type: replace Abstract: We study the fixed-budget best-arm identification (BAI) problem in non-stationary linear bandits.
arXiv Machine Learning
Jul 21
Tight Sample Bounds for Renyi and Min-Entropy Estimation
arXiv:2607. 16966v1 Announce Type: cross Abstract: Estimating entropy from samples is fundamental in information theory and property testing.
arXiv Statistics ML
Oct 2
Sharp Non-Asymptotic Analysis of the Penalized Challenger in $\beta$-EB-TCI for Bernoulli Bandits
arXiv:2610.01951v1 Announce Type: cross Abstract: Top-two algorithms are simple and effective for fixed-confidence best-arm identification, but their sharp non-asymptotic behavior is still not well u...
arXiv Machine Learning
Sep 30
Optimal Multi-Reward Reinforcement Learning
arXiv:2609.36486v1 Announce Type: new Abstract: We study an unknown-transition finite-horizon Markov decision process (MDP) with a finite collection of known reward functions $\{r^1, r^2, \ldots, r^M...