English(EN) Oracle Complexity of Stochastic Fixed-Point Equations with Nonexpansive Maps

新算法解决了数学研究中的随机不动点方程

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

研究人员开发了一种新的算法来求解涉及非扩张映射的随机不动点方程。该算法基于递归锚定技术，在 $\ell_p$-空间（对于 $p \in [2, \infty]$）中实现了特定的Oracle复杂度。该研究还为高维 $\ell_{\infty}$-范数实例建立了近乎匹配的下界，适用于随机算法和稀疏噪声设置。 AI

排序理由学术论文发布在arXiv上，详细介绍了一种求解数学方程的新算法。[lever_c_demoted from research: ic=1 ai=0.1]

在 arXiv stat.ML 阅读 →

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

本文如何被排名

Signal score: 5 / 100; Composite score across the factors below. Higher = stronger signal that this story matters right now.
Newsworthiness bucket: Tool; 学术论文发布在arXiv上，详细介绍了一种求解数学方程的新算法。[lever_c_demoted from research: ic=1 ai=0.1]
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: Low; Off-topic or adjacent — cluster remains reachable but doesn't surface in AI-industry rankings.
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) · Jelena Diakonikolas, Crist\'obal Guzm\'an, David Mart\'inez-Rubio · 2026-09-10 04:00

具有非扩张映射的随机不动点方程的Oracle复杂度

arXiv:2609.09524v1 Announce Type: cross Abstract: We study the oracle complexity of computing a point with small fixed-point residual $\|T(x)-x\| \leq \epsilon$, for a general norm $\|\cdot\|$ and a self-map $T$ of a compact convex set. We study this problem in the setting where …

本文如何被排名

报道来源 [1]

具有非扩张映射的随机不动点方程的Oracle复杂度

相关实体

相关话题