新的方差缩减方法加速求根算法

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

研究人员开发了新的方差缩减快速Krasnoselkii-Mann方法，以有效地解决有限和求根问题。这些方法在梯度期望范数平方的最后迭代收敛方面实现了改进的收敛率，具体为O(1/k^2)和o(1/k^2)。该框架通过SVRG和SAGA估计器实例化，达到ε-解的预言机复杂度为O(n + n^(2/3)ε^(-1))。该方法还被扩展到处理有限和包含问题，保持理论保证，并在数值实验中展示了有希望的性能。 AI

排序理由该集群包含一篇详细介绍新数学方法及其理论保证的学术论文。[lever_c_demoted from research: ic=1 ai=0.4]

在 arXiv stat.ML 阅读 →

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

本文如何被排名

Signal score: 18 / 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=0.4]
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: Standard; On-topic for AI-industry coverage; kept in the public index.
Story freshness: Breaking (< 6h); Fresh story with cross-source coverage still developing. Ranking may shift as more sources report.

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

报道来源 [1]

arXiv stat.ML TIER_1 English(EN) · Quoc Tran-Dinh · 2026-09-10 04:00

有限和根查找问题的方差减小快速Krasnoselkii-Mann方法

arXiv:2406.02413v4 Announce Type: replace-cross Abstract: We propose a new class of fast Krasnoselkii--Mann methods with variance reduction to solve a finite-sum co-coercive equation $Gx = 0$. Our algorithm is single-loop and leverages a new family of unbiased variance-reduced es…

本文如何被排名

报道来源 [1]

有限和根查找问题的方差减小快速Krasnoselkii-Mann方法

相关实体

相关话题