Unverified50% confidenceFactExact time
The paper "A Quasipolynomial Algorithm for ℓ∞ Contractions" proposes an algorithm that can compute an ε-approximate fixed point of any non-expansive map under the d-dimensional ℓ∞ norm in quasipolynomial time.
1
Sources
50%
Confidence
Long-term
Relevance
10/22/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedPreviously, the best known algorithms for the fixed-point problem of ℓ∞ contraction maps were exponential-time algorithms based on the simplex method, or polynomial-time algorithms for special structures.80% similarUnverifiedThe core of the new method lies in exploiting linear structure in existing BO algorithms: under certain conditions the Gaussian process surrogate model can be transformed into a linear model, reducing computational complexity from cubic to linear or quadratic.65% similarUnverifiedThe paper uses quantitative geometric estimates of regular polynomial systems to transform the original geometric testing problem into a finite-dimensional, structurally explicit auxiliary optimization problem.65% similarUnverifiedThe naive discrete Fourier transform (DFT) algorithm requires O(N²) complex multiplications.64% similarUnverifiedComputing fixed points of ℓ∞ contraction maps can be applied to equilibrium computation in economics, adversarial training in machine learning, and stability analysis in control theory.64% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1083945API
curl https://kongchang.com/api/v1/knowledge/claims/1083945MCP
get_claim(id=1083945)