PulseAugur
中
实时 12:40:27

新算法在无偏平滑在线学习中实现了最优遗憾

作者 PulseAugur 编辑部 · [1 个来源] ·

研究人员开发了一种新的平滑在线学习算法，该算法在无偏设置下实现了亚线性遗憾，而无需对基本度量进行采样或依赖于完美预测的标签。这种名为高斯扰动领导者跟随（Gaussian Follow-The-Perturbed-Leader）的新方法是无参数的，这意味着它不需要了解基本度量、平滑参数或范围。它使用对经验风险最小化预言机的一次调用，为具有VC维度d的二元类别实现了\ufffdO(d\sqrt{T/\sigma})的最优遗憾界限。 AI

影响 引入了一种更灵活、更高效的在线学习方法，有可能拓宽其在复杂数据场景中的应用范围。

排序理由 详细介绍在线学习新算法的学术论文。[lever_c_demoted from research: ic=1 ai=1.0]

在 arXiv cs.LG 阅读 →

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

新算法在无偏平滑在线学习中实现了最优遗憾

本文如何被排名

Signal score
8 / 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]

  1. arXiv cs.LG TIER_1 English(EN) · Sasha Voitovych, Adam Block, Alexander Rakhlin, Abhishek Shetty ·

    Oracle-高效且无参数的不可知平滑在线学习

    arXiv:2610.10499v1 Announce Type: new Abstract: Online learning is an attractive framework in many domains because it permits well-defined learning even when data are dependent or chosen adversarially. This generality, however, comes at a steep price, introducing significant stat…

相关实体

相关话题