菜单

关于 🐙 GitHub
arXiv 提交日期: 2026-03-03
📄 Abstract - A Short Note on a Variant of the Squint Algorithm

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].

顶级标签: theory machine learning
详细标签: online learning regret bound expert problem algorithm variant 或 搜索:

关于Squint算法一个变种的简短说明 / A Short Note on a Variant of the Squint Algorithm


1️⃣ 一句话总结

这篇论文提出了Squint算法的一个简单变种,并通过修改原证明,证明了该变种能获得与另一算法(NormalHedge的变种)相似的性能保证,用于解决经典的专家预测问题。

源自 arXiv: 2603.03409