English(EN) Prediction with Expert Advice under Heavy-Tailed Losses

新算法解决重尾损失下的专家建议预测问题

作者 PulseAugur 编辑部 · [1 个来源] · 2026-10-14 04:00

研究人员开发了用于专家建议预测的新算法，专门解决重尾损失的情况。当损失的界限矩小于一时，现有方法可能不是最优的，导致对专家数量的依赖呈多项式增长。提出的自适应重尾FTRL和OMD算法在事先不知道损失参数的情况下，实现了接近最优的遗憾保证。此外，具有香农熵正则化的FTRL算法在已知这些参数时，提供了最优遗憾。 AI

影响在具有重尾损失的机器学习环境中引入了新颖的算法方法，以提高预测准确性。

排序理由学术论文，详细介绍了专家建议预测的新算法。[lever_c_demoted from research: ic=1 ai=1.0]

在 arXiv stat.ML 阅读 →

AI 生成摘要 · Google Gemini · 来自 1 个来源。我们如何撰写摘要 →

本文如何被排名

Signal score: 3 / 100; Composite score across the factors below. Higher = stronger signal that this story matters right now.
Newsworthiness bucket: Tool; 学术论文，详细介绍了专家建议预测的新算法。[lever_c_demoted from research: ic=1 ai=1.0]
Source corroboration: Single-source cluster; Only one publisher covered this so far. Single-source stories can still rank when the publisher is high-authority, but they lack cross-source corroboration.
Topics: paper, other; Editorial topic classification. Feeds into how the story surfaces on /topic/<slug> hub pages and into the per-entity coverage mix.
AI-industry relevance: High; Clearly on-topic for AI-industry coverage.
Story freshness: Same-day; Cluster formed today. Ranking reflects the current source set at time of score.

完整方法见我们的编辑标准。

报道来源 [1]

arXiv stat.ML TIER_1 English(EN) · Yuki Shibukawa, Shinji Ito · 2026-10-14 04:00

重尾损失下的专家建议预测

arXiv:2610.14904v1 Announce Type: cross Abstract: We study prediction with expert advice over $T$ rounds with $K$ experts under heavy-tailed losses whose $(1+\epsilon)$-moment is bounded by $\theta>0$ for some $\epsilon\in(0,1]$. In this setting, existing algorithms designed for …

本文如何被排名

报道来源 [1]

重尾损失下的专家建议预测

相关实体

相关话题