2 papers
cs.LG2025
Small steps no more: Global convergence of stochastic gradient bandits for arbitrary learning rates
Jincheng Mei, Bo Dai, Alekh Agarwal +4
We provide a new understanding of the stochastic gradient bandit algorithm by showing that it converges to a globally optimal policy almost surely using \emph{any} constant learnin…
cs.LG2024
Almost Free: Self-concordance in Natural Exponential Families and an Application to Bandits
Shuai Liu, Alex Ayoub, Flore Sentenac +2
We prove that single-parameter natural exponential families with subexponential tails are self-concordant with polynomial-sized parameters. For subgaussian natural exponential fami…