跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2607.23863 · v2

Polynomial-time computation of $\ell_p$-contraction fixed points for even $p$

首次提交 2026-07-27 06:12
版本更新 2026-11-13 23:34
雷达观测 2026-11-16 11:41
arXiv ↗PDF ↗

摘要

We give a poly(d,p,log⁡(1/ε))\text{poly}(d, p, \log(1/ε))-time algorithm that computes an εε-approximate fixed point of any ℓp\ell_p-nonexpansive map f:X→Xf : \mathcal{X} \to \mathcal{X}, where X⊂Rd\mathcal{X} \subset \mathbb R^d is a convex compact set and pp is an even integer. This is the first algorithm with poly(d,log⁡(1/ε))\text{poly}(d, \log(1/ε)) runtime for any fixed p≠2p \ne 2. Our techniques are based on a computationally efficient version of Sion's theorem for non-compact minmax problems, and extend to more general total search problems that admit low-degree polynomial potentials.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

本站首次收录为 v2,暂无更早版本可对照。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v2 · 2026-11-13 23:34 · 最新观测版本

Polynomial-time computation of $\ell_p$-contraction fixed points for even $p$

We give a poly(d,p,log⁡(1/ε))\text{poly}(d, p, \log(1/ε))-time algorithm that computes an εε-approximate fixed point of any ℓp\ell_p-nonexpansive map f:X→Xf : \mathcal{X} \to \mathcal{X}, where X⊂Rd\mathcal{X} \subset \mathbb R^d is a convex compact set and pp is an even integer. This is the first algorithm with poly(d,log⁡(1/ε))\text{poly}(d, \log(1/ε)) runtime for any fixed p≠2p \ne 2. Our techniques are based on a computationally efficient version of Sion's theorem for non-compact minmax problems, and extend to more general total search problems that admit low-degree polynomial potentials.

查看此版本解读 →查看此版本原文 ↗