Sign inGet started
Paper · arXiv

Prediction with Expert Advice under Heavy-Tailed Losses

We study prediction with expert advice over $T$ rounds with $K$ experts under heavy-tailed losses whose $(1+ε)$-moment is bounded by $θ>0$ for some $ε\in(0,1]$. In this setting, existing algorithms designed for the case $ε=1$ can be suboptimal when $ε<1$, suffering an additional polynomial dependence on $K$. We characterize the minimax pseudo-regret rate as $Θ((θT)^{\frac{1}{1+ε}}(\log K)^{\fracε{1+ε}})$ and establish gap-dependent lower bounds in a self-bounded environment. To attain this minimax rate without prior knowledge of either $ε$ or $θ$, we propose Adaptive Heavy-Tailed FTRL, which uses robust data-dependent scale adaptation together with truncation. We further develop Adaptive ...

AuthorsYuki Shibukawa, Shinji Ito
Primary categorycs.LG
Published10 October 2026
Last updated at source10 October 2026
cs.LGstat.ML
Embed this entry
<iframe src="https://silytics.si/embed/item/84eb1cfe-504a-4ce2-89e9-a369af5f93b3" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Popularity, last 2 days

0 now. Counts as reported by the source, snapshotted daily by Silytics.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.