A Short Note on a Variant of the Squint Algorithm
Not on the map. Why?
Abstract (arXiv)
This short note describes a simple variant of the Squint algorithm of Koolen and Van Erven [2015] for the classic expert problem. Via an equally simple modification of their proof, we prove that this variant ensures a regret bound that resembles the one shown in a recent work by Freund et al. [2026] for a variant of the NormalHedge algorithm [Chaudhuri et al., 2009].
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 2 of its 4 references that are in the map. First posted on arXiv 3 Mar 2026.
Builds on
2 of 4 references.
References · 2
- 2015Second-order Quantile Methods for Experts and Combinatorial Gamescited by 49
- 2026A second order regret bound for NormalHedgecited by 4
Built on by
Citing papers per year: 2026: 1.
1 paper.