{"id":"https://openalex.org/W7109952141","doi":"https://doi.org/10.4230/lipics.icalp.2025.5","title":"Acceleration Meets Inverse Maintenance: Faster $\\ell_{\\infty}$-Regression","display_name":"Acceleration Meets Inverse Maintenance: Faster $\\ell_{\\infty}$-Regression","alternate_titles":[],"publication_year":2024,"publication_date":"2024-09-30","ids":{"openalex":"https://openalex.org/W7109952141","doi":"https://doi.org/10.4230/lipics.icalp.2025.5"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:23382","doi":null,"is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.5","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol334-icalp2025/LIPIcs.ICALP.2025.5/LIPIcs.ICALP.2025.5.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"InProceedings"},"parent_works":[{"id":"https://openalex.org/W6948134761","display_name":"LIPIcs, Volume 334, ICALP 2025, Complete Volume","relationship":"part"}],"lineage":["https://openalex.org/W7109952141","https://openalex.org/W6948134761"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol334-icalp2025/LIPIcs.ICALP.2025.5/LIPIcs.ICALP.2025.5.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5016937106","display_name":"Deeksha Adil","orcid":"https://orcid.org/0009-0004-7520-0696","observed_orcids":["https://orcid.org/0009-0004-7520-0696"]},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Adil, Deeksha","raw_affiliation_strings":["ETH Z\u00fcrich, Switzerland"],"raw_orcid":"https://orcid.org/0009-0004-7520-0696","affiliations":[{"raw_affiliation_string":"ETH Z\u00fcrich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Jiang, Shunhua","orcid":"https://orcid.org/0000-0003-2226-7980","observed_orcids":["https://orcid.org/0000-0003-2226-7980"]},"institutions":[{"id":"https://openalex.org/I78577930","display_name":"Columbia University","ror":"https://ror.org/00hj8s172","country_code":"US","type":"education","lineage":["https://openalex.org/I78577930"]}],"countries":["US"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Jiang, Shunhua","raw_affiliation_strings":["Columbia University, New York, NY, USA"],"raw_orcid":"https://orcid.org/0000-0003-2226-7980","affiliations":[{"raw_affiliation_string":"Columbia University, New York, NY, USA","institution_ids":["https://openalex.org/I78577930"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053449713","display_name":"Rasmus Kyng","orcid":"https://orcid.org/0000-0002-8268-6258","observed_orcids":["https://orcid.org/0000-0002-8268-6258"]},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Kyng, Rasmus","raw_affiliation_strings":["ETH Z\u00fcrich, Switzerland"],"raw_orcid":"https://orcid.org/0000-0002-8268-6258","affiliations":[{"raw_affiliation_string":"ETH Z\u00fcrich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4142,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.4682133,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":94},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.7548999786376953,"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.7548999786376953,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.07270000129938126,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10792","display_name":"Matrix Theory and Algorithms","score":0.06440000236034393,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/multiplicative-weights-update","display_name":"multiplicative weights update","score":0.8370000123977661},{"id":"https://openalex.org/keywords/acceleration-schemes","display_name":"acceleration schemes","score":0.5440000295639038},{"id":"https://openalex.org/keywords/structured-convex-optimization","display_name":"structured convex optimization","score":0.7870000004768372},{"id":"https://openalex.org/keywords/randomized-algorithms","display_name":"randomized algorithms","score":0.40700000524520874}],"concepts":[{"id":"https://openalex.org/C117896860","wikidata":"https://www.wikidata.org/wiki/Q11376","display_name":"Acceleration","level":2,"score":0.8026999831199646},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.6593999862670898},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.6425999999046326},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.5368000268936157},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.526199996471405},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4860999882221222},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.451200008392334},{"id":"https://openalex.org/C135252773","wikidata":"https://www.wikidata.org/wiki/Q1567213","display_name":"Inverse problem","level":2,"score":0.44749999046325684},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4296000003814697},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40880000591278076},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.3763999938964844},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.3662000000476837},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.358599990606308},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.3424000144004822},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.33000001311302185},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.3276999890804291},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.32760000228881836},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.3221000134944916},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.31220000982284546},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.3061999976634979},{"id":"https://openalex.org/C47446073","wikidata":"https://www.wikidata.org/wiki/Q5165890","display_name":"Control theory (sociology)","level":3,"score":0.29159998893737793},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.27549999952316284},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.2685999870300293},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.25609999895095825},{"id":"https://openalex.org/C157351203","wikidata":"https://www.wikidata.org/wiki/Q216906","display_name":"Multiplicative inverse","level":3,"score":0.25450000166893005}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:23382","doi":null,"is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.5","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol334-icalp2025/LIPIcs.ICALP.2025.5/LIPIcs.ICALP.2025.5.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"InProceedings"},{"id":"pmh:oai:arXiv.org:2409.20030","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/2409.20030","pdf_url":"https://arxiv.org/pdf/2409.20030","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2409.20030","doi":"https://doi.org/10.48550/arxiv.2409.20030","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2409.20030","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"Preprint"},{"id":"doi:10.4230/lipics.icalp.2025.5","doi":"https://doi.org/10.4230/lipics.icalp.2025.5","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.icalp.2025.5","pdf_url":null,"source":{"id":"https://openalex.org/S4393917817","display_name":"Leibniz international proceedings in informatics","issn_l":"1868-8969","issn":["1868-8969"],"is_oa":true,"is_in_doaj":true,"is_core":false,"listed_in":["doaj","jufo-1","norway-1"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:23382","doi":null,"is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.5","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol334-icalp2025/LIPIcs.ICALP.2025.5/LIPIcs.ICALP.2025.5.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"InProceedings"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G3935824571","display_name":"AF:Small: Nearest Neighbor Search in High Dimensional Spaces","funder_award_id":"1617955","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3974885098","display_name":"TRIPODS: From Foundations to Practice of Data Science and Back","funder_award_id":"1740833","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5247731681","display_name":"Algorithms and complexity for high-accuracy flows and convex optimization","funder_award_id":"204787","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"},{"id":"https://openalex.org/G660254721","display_name":"AF:Small: Data-Dependent Algorithms for High-Dimensional Data","funder_award_id":"2008733","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7756092016","display_name":"CAREER: Information Theoretic Methods in Data Structures","funder_award_id":"1844887","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G993971353","display_name":null,"funder_award_id":"200021","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320320924","display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","ror":"https://ror.org/00yjd3n13"},{"id":"https://openalex.org/F4320321652","display_name":"Eidgen\u00f6ssische Technische Hochschule Z\u00fcrich","ror":"https://ror.org/05a28rw58"},{"id":"https://openalex.org/F4320327714","display_name":"ETH Z\u00fcrich Foundation","ror":"https://ror.org/03nqkz164"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7109952141.pdf","grobid_xml":"https://content.openalex.org/works/W7109952141.grobid-xml"},"referenced_works_count":39,"referenced_works":["https://openalex.org/W1505310183","https://openalex.org/W1632601927","https://openalex.org/W1766210857","https://openalex.org/W1968307589","https://openalex.org/W1973117121","https://openalex.org/W2035144082","https://openalex.org/W2043093325","https://openalex.org/W2076680677","https://openalex.org/W2083459869","https://openalex.org/W2106759055","https://openalex.org/W2113623631","https://openalex.org/W2117366131","https://openalex.org/W2128054898","https://openalex.org/W2133352257","https://openalex.org/W2150865801","https://openalex.org/W2153441719","https://openalex.org/W2201600774","https://openalex.org/W2278710066","https://openalex.org/W2316564661","https://openalex.org/W2517816841","https://openalex.org/W2886596322","https://openalex.org/W2906064434","https://openalex.org/W2912973156","https://openalex.org/W2914681165","https://openalex.org/W2936995161","https://openalex.org/W2944079414","https://openalex.org/W2944717612","https://openalex.org/W2979473749","https://openalex.org/W2982534635","https://openalex.org/W3002603762","https://openalex.org/W3096094006","https://openalex.org/W3101947672","https://openalex.org/W3118621910","https://openalex.org/W3126188815","https://openalex.org/W3169940233","https://openalex.org/W3188385283","https://openalex.org/W4390098177","https://openalex.org/W4401396978","https://openalex.org/W7098482137"],"related_works":["https://openalex.org/W6910227526","https://openalex.org/W4401396978","https://openalex.org/W2914681165","https://openalex.org/W2627073818","https://openalex.org/W4390098177","https://openalex.org/W7133187709","https://openalex.org/W4226254347","https://openalex.org/W2944079414"],"abstract_inverted_index":{"We":[0,75,105],"propose":[1,50],"a":[2,51,78,110],"randomized":[3],"multiplicative":[4],"weight":[5],"update":[6],"(MWU)":[7],"algorithm":[8,35,82],"for":[9,55,65],"\ud835\udcc1_{\u221e}":[10],"regression":[11],"that":[12,57,83,114],"runs":[13,84],"in":[14,30,85,101],"O\u0303(n^{2+1/22.5}":[15],"poly(1/\u03b5))":[16],"time":[17,87],"when":[18,88],"\u03c9":[19,89],"=":[20,90],"2+o(1),":[21,91],"improving":[22,92],"upon":[23,93],"the":[24,31,66,70,94,102,129,141],"previous":[25,95],"best":[26,96],"O\u0303(n^{2+1/18}":[27],"polylog(1/\u03b5))":[28],"runtime":[29,100],"low-accuracy":[32,103],"regime.":[33,104],"Our":[34,126],"combines":[36],"state-of-the-art":[37],"inverse":[38,71,135],"maintenance":[39,72,136],"data":[40,73],"structures":[41],"with":[42],"acceleration.":[43],"In":[44],"order":[45],"to":[46,131],"do":[47],"so,":[48],"we":[49],"novel":[52,111],"acceleration":[53,133],"scheme":[54],"MWU":[56,81],"exhibits":[58],"stability":[59,112],"and":[60,134],"robustness,":[61],"which":[62],"are":[63],"required":[64],"efficient":[67],"implementations":[68],"of":[69,147],"structures.":[74],"also":[76],"design":[77],"faster":[79],"deterministic":[80],"O\u0303(n^{2+1/12}poly(1/\u03b5))":[86],"O\u0303(n^{2+1/6}":[97],"poly":[98],"log(1/\u03b5))":[99],"achieve":[106],"this":[107],"by":[108],"showing":[109],"result":[113],"goes":[115],"beyond":[116],"previously":[117],"known":[118],"works":[119],"based":[120],"on":[121],"interior":[122],"point":[123],"methods":[124],"(IPMs).":[125],"work":[127],"is":[128],"first":[130],"use":[132],"together":[137],"efficiently,":[138],"finally":[139],"making":[140],"two":[142],"most":[143],"important":[144],"building":[145],"blocks":[146],"modern":[148],"structured":[149],"convex":[150],"optimization":[151],"compatible.":[152]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W7109952141","counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1}],"updated_date":"2026-11-21T10:27:49.728292","created_date":"2025-12-08T00:00:00"}
