{"id":"https://openalex.org/W4414899062","doi":"https://doi.org/10.52202/085713-0819","title":"Efficient Quadratic Corrections for Frank-Wolfe Algorithms","display_name":"Efficient Quadratic Corrections for Frank-Wolfe Algorithms","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4414899062","doi":"https://doi.org/10.52202/085713-0819"},"language":"en","primary_location":{"id":"doi:10.52202/085713-0819","doi":"https://doi.org/10.52202/085713-0819","is_oa":false,"landing_page_url":"https://doi.org/10.52202/085713-0819","pdf_url":null,"source":{"id":"https://openalex.org/S4363606243","display_name":"neural information processing systems","issn_l":"1049-5258","issn":["1049-5258"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","norway-2"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Advances in Neural Information Processing Systems 38","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2506.02635","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5116039245","display_name":"Jannis Halbey","orcid":"https://orcid.org/0009-0008-1785-8130","observed_orcids":["https://orcid.org/0009-0008-1785-8130"]},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Jannis Halbey","raw_affiliation_strings":["Technische Universit\u00e4t Berlin"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Berlin","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5098823229","display_name":"Seta Rakotomandimby","orcid":"https://orcid.org/0009-0003-2616-5743","observed_orcids":["https://orcid.org/0009-0003-2616-5743"]},"institutions":[{"id":"https://openalex.org/I142631665","display_name":"\u00c9cole nationale des ponts et chauss\u00e9es","ror":"https://ror.org/02nwvxz07","country_code":"FR","type":"education","lineage":["https://openalex.org/I142631665","https://openalex.org/I4210145102"]},{"id":"https://openalex.org/I4210145102","display_name":"Institut Polytechnique de Paris","ror":"https://ror.org/042tfbd02","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210145102"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Seta Rakotomandimby","raw_affiliation_strings":["Ecole Nationale des Ponts et Chausees, IP Paris"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ecole Nationale des Ponts et Chausees, IP Paris","institution_ids":["https://openalex.org/I142631665","https://openalex.org/I4210145102"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071995361","display_name":"Mathieu Besan\u00e7on","orcid":"https://orcid.org/0000-0002-6284-3033","observed_orcids":["https://orcid.org/0000-0002-6284-3033"]},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Mathieu Besan\u00e7on","raw_affiliation_strings":["INRIA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INRIA","institution_ids":["https://openalex.org/I1326498283"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013603253","display_name":"S\u00e9bastien Designolle","orcid":"https://orcid.org/0000-0003-0303-3556","observed_orcids":["https://orcid.org/0000-0003-0303-3556"]},"institutions":[{"id":"https://openalex.org/I195893171","display_name":"Zuse Institute Berlin","ror":"https://ror.org/02eva5865","country_code":"DE","type":"facility","lineage":["https://openalex.org/I195893171"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"S\u00e9bastien Designolle","raw_affiliation_strings":["Zuse Institute Berlin"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Zuse Institute Berlin","institution_ids":["https://openalex.org/I195893171"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043574831","display_name":"Sebastian Pokutta","orcid":"https://orcid.org/0000-0001-7365-3000","observed_orcids":["https://orcid.org/0000-0001-7365-3000"]},"institutions":[{"id":"https://openalex.org/I195893171","display_name":"Zuse Institute Berlin","ror":"https://ror.org/02eva5865","country_code":"DE","type":"facility","lineage":["https://openalex.org/I195893171"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Sebastian Pokutta","raw_affiliation_strings":["Zuse Institute Berlin"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Zuse Institute Berlin","institution_ids":["https://openalex.org/I195893171"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.07,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.79637144,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"27497","last_page":"27541"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.5371000170707703,"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"}},"topics":[{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.5371000170707703,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.38769999146461487,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.0568000003695488,"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/frank-wolfe-algorithm","display_name":"Frank-Wolfe algorithm","score":0.9639999866485596},{"id":"https://openalex.org/keywords/quadratic-corrections","display_name":"quadratic corrections","score":0.8949999809265137},{"id":"https://openalex.org/keywords/convergence-guarantees","display_name":"convergence guarantees","score":0.6150000095367432},{"id":"https://openalex.org/keywords/face-identification","display_name":"face identification","score":0.800000011920929},{"id":"https://openalex.org/keywords/convergence-rate","display_name":"convergence rate","score":0.5770000219345093},{"id":"https://openalex.org/keywords/linear-programming","display_name":"linear programming","score":0.4560000002384186},{"id":"https://openalex.org/keywords/linear-system-solution","display_name":"linear system solution","score":0.8379999995231628}],"concepts":[{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.6840999722480774},{"id":"https://openalex.org/C122268817","wikidata":"https://www.wikidata.org/wiki/Q2020318","display_name":"Frank\u2013Wolfe algorithm","level":5,"score":0.6711000204086304},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.5494999885559082},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.5454999804496765},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5400000214576721},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5299999713897705},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5175999999046326},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5016999840736389},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.44350001215934753},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.43790000677108765},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.415800005197525},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.398499995470047},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.38940000534057617},{"id":"https://openalex.org/C116834253","wikidata":"https://www.wikidata.org/wiki/Q2039217","display_name":"Identification (biology)","level":2,"score":0.3601999878883362},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.34389999508857727},{"id":"https://openalex.org/C177179195","wikidata":"https://www.wikidata.org/wiki/Q7268372","display_name":"Quadratic unconstrained binary optimization","level":4,"score":0.3393000066280365},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3257000148296356},{"id":"https://openalex.org/C195956108","wikidata":"https://www.wikidata.org/wiki/Q7268362","display_name":"Quadratic growth","level":2,"score":0.3156999945640564},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2849000096321106},{"id":"https://openalex.org/C6802819","wikidata":"https://www.wikidata.org/wiki/Q1072174","display_name":"Linear system","level":2,"score":0.27570000290870667},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.2680000066757202},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.2653999924659729},{"id":"https://openalex.org/C2779304628","wikidata":"https://www.wikidata.org/wiki/Q3503480","display_name":"Face (sociological concept)","level":2,"score":0.2628999948501587},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.2581999897956848},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.2581000030040741},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.25760000944137573},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.2563000023365021},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.2542000114917755},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2526000142097473}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.52202/085713-0819","doi":"https://doi.org/10.52202/085713-0819","is_oa":false,"landing_page_url":"https://doi.org/10.52202/085713-0819","pdf_url":null,"source":{"id":"https://openalex.org/S4363606243","display_name":"neural information processing systems","issn_l":"1049-5258","issn":["1049-5258"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","norway-2"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Advances in Neural Information Processing Systems 38","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2506.02635","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2506.02635","pdf_url":"https://arxiv.org/pdf/2506.02635","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:HAL:hal-05426705v1","doi":null,"is_oa":true,"landing_page_url":"https://hal.science/hal-05426705","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4405252976","host_organization_name":"Centre pour la Communication Scientifique Directe","host_organization_lineage":["https://openalex.org/I4405252976"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"NeurIPS, Dec 2025, San Diego, United States","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"doi:10.48550/arxiv.2506.02635","doi":"https://doi.org/10.48550/arxiv.2506.02635","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2506.02635","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2506.02635","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2506.02635","pdf_url":"https://arxiv.org/pdf/2506.02635","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G1041279674","display_name":"MIAI @ Grenoble Alpes","funder_award_id":"ANR-19-P3IA-0003","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G1372115314","display_name":null,"funder_award_id":"EXC-2046","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G2033548659","display_name":null,"funder_award_id":"EXC\u20102046/1","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G3010527862","display_name":null,"funder_award_id":"ANR\u201019","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G7442926511","display_name":null,"funder_award_id":"ANR-19-P3IA-0003","funder_id":"https://openalex.org/F4320313937","funder_display_name":"Universit\u00e9 Grenoble Alpes"},{"id":"https://openalex.org/G7451273612","display_name":null,"funder_award_id":"ANR-19-P3IA-0003","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G7725451807","display_name":"EXC 2046: MATH+: Berlin Mathematics Research Center","funder_award_id":"390685689","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320313937","display_name":"Universit\u00e9 Grenoble Alpes","ror":"https://ror.org/02rx3b187"},{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4414899062.pdf","grobid_xml":"https://content.openalex.org/works/W4414899062.grobid-xml"},"referenced_works_count":15,"referenced_works":["https://openalex.org/W1963481290","https://openalex.org/W1992586477","https://openalex.org/W2063958549","https://openalex.org/W2091918879","https://openalex.org/W2136106887","https://openalex.org/W2144126354","https://openalex.org/W2734645039","https://openalex.org/W2991366040","https://openalex.org/W3035125686","https://openalex.org/W4310884143","https://openalex.org/W4389984410","https://openalex.org/W4400255820","https://openalex.org/W4407426247","https://openalex.org/W4414402602","https://openalex.org/W4414880273"],"related_works":["https://openalex.org/W3011802363","https://openalex.org/W1971791211","https://openalex.org/W3112125359","https://openalex.org/W7016960949","https://openalex.org/W2172790076","https://openalex.org/W4407093023","https://openalex.org/W3033638172","https://openalex.org/W3207650135","https://openalex.org/W4410855706","https://openalex.org/W4323521014"],"abstract_inverted_index":{"We":[0,103],"develop":[1],"a":[2],"Frank-Wolfe":[3],"algorithm":[4],"with":[5,30,132],"corrective":[6,42],"steps,":[7],"generalizing":[8],"previous":[9],"algorithms":[10,82,131],"including":[11],"blended":[12,15],"conditional":[13,17,85,89],"gradients,":[14,18],"pairwise":[16],"and":[19,61,87,111],"fully-corrective":[20],"Frank-Wolfe.":[21],"For":[22],"this,":[23],"we":[24,37,79,124],"prove":[25],"tight":[26],"convergence":[27,106],"guarantees":[28],"together":[29],"an":[31],"optimal":[32],"face":[33],"identification":[34],"property.":[35],"Furthermore,":[36],"propose":[38],"two":[39,81],"highly":[40],"efficient":[41],"steps":[43],"for":[44,108,114,129],"convex":[45],"quadratic":[46,96,101,133],"objectives":[47],"based":[48],"on":[49],"linear":[50,53],"optimization":[51,73],"or":[52],"system":[54],"solving,":[55],"akin":[56],"to":[57,98],"Wolfe's":[58],"minimum-norm":[59],"point,":[60],"show":[62,125],"that":[63,75],"they":[64],"converge":[65],"in":[66],"finite":[67],"time":[68],"under":[69],"suitable":[70],"conditions.":[71],"Beyond":[72],"problems":[74],"are":[76],"directly":[77],"quadratic,":[78],"revisit":[80],"-":[83,92],"split":[84],"gradient":[86,90],"second-order":[88],"sliding":[91],"which":[93,117],"can":[94],"leverage":[95],"corrections":[97,134],"accelerate":[99],"their":[100],"subproblems.":[102],"demonstrate":[104],"improved":[105],"rates":[107],"the":[109,115,136],"first":[110],"broader":[112],"applicability":[113],"second,":[116],"may":[118],"be":[119],"of":[120],"independent":[121],"interest.":[122],"Finally,":[123],"substantial":[126],"computational":[127],"speedups":[128],"Frank-Wolfe-based":[130],"across":[135],"considered":[137],"problem":[138],"classes.":[139]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1}],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2025-10-10T00:00:00"}
