English(EN) Wasserstein mixing time of the unadjusted Langevin algorithm

新研究改进了 Langevin 算法的 Wasserstein 混合时间估计

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

一篇新发表在 arXiv 上的论文详细介绍了不可调 Langevin 算法渐近偏差的改进估计。该研究为 Wasserstein 混合时间提供了新的界限，达到了 $\kappa \sqrt{d}/\varepsilon$ 的数量级。这比先前最先进的结果有了显著改进，提供了 $\sqrt{d}/\varepsilon$ 的增强。 AI

影响为机器学习和优化中使用的算法提供了理论改进。

排序理由该集群包含一篇关于算法理论改进的学术论文。[lever_c_demoted from research: ic=1 ai=1.0]

在 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=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: 80 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) · Francesco Pedrotti, Peter A. Whalley · 2026-08-04 04:00

未调整Langevin算法的Wasserstein混合时间

arXiv:2608.02430v1 Announce Type: cross Abstract: We provide new estimates in Wasserstein distance for the asymptotic bias of the unadjusted Langevin algorithm, in the classical setting of log-smooth strongly log-concave measures. Our bound implies a Wasserstein mixing time of or…

本文如何被排名

报道来源 [1]

未调整Langevin算法的Wasserstein混合时间

相关实体

相关话题