Reproduce “A Quasipolynomial Algorithm for $\ell_\infty$ Contractions” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Ashkan Soleymani, Gabriele Farina
The authors find near fixed points of ℓ∞ contractions by shrinking a region known to contain the answer, rather than iterating until convergence. For dimension d ≥ 2, gap γ, and tolerance ε ≤ 1/4, the algorithm uses at most (log(1/(γε)))^{C log² d} arithmetic operations and exact map evaluations, and yields quasipolynomial algorithms for simple stochastic games as a theoretical guarantee.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.