{"id":"https://openalex.org/W7148497132","doi":"https://doi.org/10.48550/arxiv.2604.01006","title":"Faster Approximate Fixed Points of $\\ell_\\infty$-Contractions","display_name":"Faster Approximate Fixed Points of $\\ell_\\infty$-Contractions","publication_year":2026,"publication_date":"2026-04-01","ids":{"openalex":"https://openalex.org/W7148497132","doi":"https://doi.org/10.48550/arxiv.2604.01006"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.01006","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.01006","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.01006","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5132791423","display_name":"Andrei Feodorov","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Feodorov, Andrei","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5132822259","display_name":"Sebastian Haslebacher","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Haslebacher, Sebastian","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5132791423"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.39410001039505005,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.39410001039505005,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.10459999740123749,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.07289999723434448,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/fixed-point","display_name":"Fixed point","score":0.6003999710083008},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5105999708175659},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4936999976634979},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.49300000071525574},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.4043999910354614},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.3984000086784363},{"id":"https://openalex.org/keywords/dependency","display_name":"Dependency (UML)","score":0.3853999972343445},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.37869998812675476}],"concepts":[{"id":"https://openalex.org/C61445026","wikidata":"https://www.wikidata.org/wiki/Q217608","display_name":"Fixed point","level":2,"score":0.6003999710083008},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5770999789237976},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5105999708175659},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4936999976634979},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.49300000071525574},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4885999858379364},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44179999828338623},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.4043999910354614},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.3984000086784363},{"id":"https://openalex.org/C19768560","wikidata":"https://www.wikidata.org/wiki/Q320727","display_name":"Dependency (UML)","level":2,"score":0.3853999972343445},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.37869998812675476},{"id":"https://openalex.org/C27333817","wikidata":"https://www.wikidata.org/wiki/Q6134913","display_name":"Least fixed point","level":5,"score":0.3686000108718872},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36500000953674316},{"id":"https://openalex.org/C45962547","wikidata":"https://www.wikidata.org/wiki/Q1422068","display_name":"Fixed-point theorem","level":2,"score":0.3382999897003174},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.33629998564720154},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33180001378059387},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.31349998712539673},{"id":"https://openalex.org/C2776230367","wikidata":"https://www.wikidata.org/wiki/Q7314222","display_name":"Representation theorem","level":2,"score":0.2962999939918518},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2919999957084656},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.2912999987602234},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.289000004529953},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.2888999879360199},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.2660999894142151},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2599000036716461},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.25679999589920044},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2524000108242035}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.01006","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.01006","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.01006","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.01006","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,61,71,105,147],"new":[3],"algorithm":[4,23,29,73,149],"for":[5,65,100,150],"finding":[6],"an":[7,12,40,76,108],"$\u03b5$-approximate":[8,77],"fixed":[9,78],"point":[10,79],"of":[11,44,119,135],"$\\ell_\\infty$-contracting":[13,66,101],"function":[14],"$f":[15],":":[16],"[0,":[17,20],"1]^d":[18],"\\rightarrow":[19],"1]^d$.":[21],"Our":[22],"is":[24,92,111],"based":[25],"on":[26,49,122],"the":[27,50,98,120,123,130,133,137],"query-efficient":[28],"by":[30],"Chen,":[31],"Li,":[32],"and":[33,86],"Yannakakis":[34],"(STOC":[35],"2024),":[36],"but":[37],"comes":[38],"with":[39,60],"improved":[41],"upper":[42,139],"bound":[43],"$(\\log":[45,81],"\\frac{1}\u03b5)^{\\mathcal{O}(d":[46],"\\log":[47,83],"d)}$":[48,84],"overall":[51],"runtime":[52,110,131],"(while":[53],"still":[54],"being":[55],"query-efficient).":[56],"By":[57,141],"combining":[58],"this":[59],"recent":[62],"decomposition":[63,94],"theorem":[64],"functions,":[67],"we":[68,127],"then":[69,126],"describe":[70],"second":[72],"that":[74,93],"finds":[75],"in":[80,117],"\\frac{1}\u03b5)^{\\mathcal{O}(\\sqrt{d}":[82],"queries":[85],"time.":[87],"The":[88],"key":[89],"observation":[90],"here":[91],"theorems":[95],"such":[96],"as":[97],"one":[99],"maps":[102],"often":[103],"allow":[104],"trade-off:":[106],"If":[107],"algorithm's":[109],"worse":[112],"than":[113],"its":[114],"query":[115,138],"complexity":[116],"terms":[118],"dependency":[121],"dimension":[124],"$d$,":[125],"can":[128],"improve":[129],"at":[132],"expense":[134],"weakening":[136],"bound.":[140],"well-known":[142],"reductions,":[143],"our":[144],"results":[145],"imply":[146],"faster":[148],"$\u03b5$-approximately":[151],"solving":[152],"Shapley":[153],"stochastic":[154],"games.":[155]},"counts_by_year":[],"updated_date":"2026-04-03T16:44:17.987007","created_date":"2026-04-03T00:00:00"}