Computing a Fixed Point of Contraction Maps in Polynomial Queries
Xi Chen, Yuhao Li, Mihalis Yannakakis
2024Year
1Citations
3Top-tier citations
Abstract
We give an algorithm for finding an ε-fixed point of a contraction map f : [0, 1] k → [0, 1] k under the ℓ ∞ -norm with query complexity O(k log(1/ε)).
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 02a7f14e-56ca-4513-8051-a0cc6519d6d3Cited by top-tier papers3
- The Complexity of Min-Max Optimization with Product ConstraintsMartino Bernasconi, Matteo CastiglioniSTOC 2026 · 5 citations
- Monotone ContractionsEleni Batziou, John Fearnley, Spencer Gordon, Ruta Mehta et al.STOC 2025 · 1 citation
- Query-Efficient Fixpoints of ℓp-ContractionsSebastian Haslebacher, Jonas Lill, Patrick Schnider, Simon WeberFOCS 2025
Builds on2
Related papers
- The query complexity of certificationGuy Blanc, Caleb Koch, Jane Lange, Li-Yang TanSTOC 2022 · 1 citation
- Towards Characterizing the First-order Query Complexity of Learning (Approximate) Nash Equilibria in Zero-sum Matrix GamesHédi Hadiji, Sarah Sachs, Tim van Erven, Wouter M. KoolenNeurIPS 2023 · 6 citations
- Black-Box Methods for Restoring MonotonicityEvangelia Gergatsouli, Brendan Lucier, Christos TzamosICML 2020 · 3 citations
- Solving Zero-Sum Games with Fewer Matrix-Vector ProductsIshani Karmarkar, Liam O'Carroll, Aaron SidfordFOCS 2025 · 1 citation
- Asymptotically Optimal Quantile Pure Exploration for Infinite-Armed BanditsEvelyn Xiao-Yue Gong, Mark SellkeNeurIPS 2023 · 4 citations
