English(EN) Adjusted Shuffling SARAH: Advancing Complexity Analysis via Dynamic Gradient Weighting

新的 Shuffling SARAH 算法增强了优化复杂性分析

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

研究人员推出了一种名为 Adjusted Shuffling SARAH 的新算法，旨在提高优化过程的效率。该方法在 SARAH 框架内结合了动态梯度加权和打乱策略。该算法有两种模式：精确模式，与方差缩减方法的理论保证相匹配；以及非精确模式，该模式使用小批量估计器来处理大规模应用。值得注意的是，非精确模式实现了与数据集大小无关的总复杂性，与现有的打乱技术相比，在大数据集上提供了卓越的可扩展性。 AI

排序理由这是一篇详细介绍新优化算法的研究论文。[lever_c_demoted from research: ic=1 ai=0.4]

在 arXiv cs.LG 阅读 →

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

本文如何被排名

Signal score: 0 / 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: 137 days old; Aged out of breaking-news scoring windows; ranking reflects the durable signal from the full source set.

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

报道来源 [1]

arXiv cs.LG TIER_1 English(EN) · Duc Toan Nguyen, Trang H. Tran, Lam M. Nguyen · 2026-05-28 04:00

调整后的 Shuffling SARAH：通过动态梯度加权推进复杂性分析

arXiv:2506.12444v2 Announce Type: replace-cross Abstract: In this paper, we propose Adjusted Shuffling SARAH, a novel algorithm that integrates shuffling strategies into the recursive SARAH framework using a dynamic weighting mechanism to enhance exploration. We analyze the algor…

本文如何被排名

报道来源 [1]

调整后的 Shuffling SARAH：通过动态梯度加权推进复杂性分析

相关实体

相关话题