新算法为 $\ell_\infty$ 收缩提供了拟多项式时间解决方案

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

开发了一种新的算法，用于计算 $\ell_\infty$ 范数中非扩张映射的近似不动点。该算法的运行时间为 $\log(1/\eps)^{O(\log^2 d)}$，这对于以拟多项式时间解决简单的随机博弈具有重要意义。该研究利用了提升论证来逐步缩小搜索区域。 AI

影响这项研究可能会推进适用于 AI 算法的理论理解，特别是在博弈论和优化等领域。

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

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

$新算法为 $\ell_\infty$ 收缩提供了拟多项式时间解决方案$

本文如何被排名

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.7]
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: 2 days old; Coverage has settled into its steady-state source set.

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

arXiv cs.LG TIER_1 English(EN) · Ashkan Soleymani, Gabriele Farina · 2026-10-22 04:00

A Quasipolynomial Algorithm for $\ell_\infty$ Contractions

arXiv:2610.30122v1 Announce Type: cross Abstract: We give an algorithm for computing an $\eps$-approximate fixed point of any $d$-dimensional nonexpansion with respect to the $\ell_\infty$ norm in time $\log(1/\eps)^{O(\log^2 d)}$. At its core, our method uses a boosting argument…