跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.12140 · v1

Visible Tails: Characterizing Adaptation to Unknown Moments in Heavy-Tailed Bandits

首次提交 2026-11-09 17:53
版本更新 2026-11-09 17:53
雷达观测 2026-11-10 15:22
arXiv ↗PDF ↗

摘要

Heavy-tailed bandit learners without moment parameters face an obstruction: the rewards that carry an arm's mean can stay unseen. We address the remaining part of a COLT open problem by characterizing the optimal-arm laws that permit adaptation to unknown moments at constant-factor cost. The condition, variance-core visibility, is one-sided and translation-invariant: the mean hidden in any rare event is at most a constant multiple of the standard error of the rewards that remain. A quantile-trimmed UCB index that knows the visibility constants attains the central-moment benchmark on this class, and no single strategy adapts across all visibility levels. The same index achieves logarithmic expected regret on every instance with a visible optimal arm and finite-mean rewards. On an explicit family with no higher moment, gap $Δ$ and constant $A$, its logarithmic coefficient and the information lower bound are of order $Δ^{-1}e^{A/Δ}$, exponential in the inverse gap within one visibility class.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只观测到一个版本,无法比较变化。之后收录新版本时,会在这里对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-09 17:53 · 最新观测版本

Visible Tails: Characterizing Adaptation to Unknown Moments in Heavy-Tailed Bandits

Heavy-tailed bandit learners without moment parameters face an obstruction: the rewards that carry an arm's mean can stay unseen. We address the remaining part of a COLT open problem by characterizing the optimal-arm laws that permit adaptation to unknown moments at constant-factor cost. The condition, variance-core visibility, is one-sided and translation-invariant: the mean hidden in any rare event is at most a constant multiple of the standard error of the rewards that remain. A quantile-trimmed UCB index that knows the visibility constants attains the central-moment benchmark on this class, and no single strategy adapts across all visibility levels. The same index achieves logarithmic expected regret on every instance with a visible optimal arm and finite-mean rewards. On an explicit family with no higher moment, gap $Δ$ and constant $A$, its logarithmic coefficient and the information lower bound are of order $Δ^{-1}e^{A/Δ}$, exponential in the inverse gap within one visibility class.

查看此版本解读 →查看此版本原文 ↗