{"id":"https://openalex.org/W7214768246","doi":"https://doi.org/10.48550/arxiv.2609.32441","title":"Saddle-Point Problems with a Low-Dimensional Block Do Not Need Accurate Inner Solves","display_name":"Saddle-Point Problems with a Low-Dimensional Block Do Not Need Accurate Inner Solves","publication_year":2026,"publication_date":"2026-09-26","ids":{"openalex":"https://openalex.org/W7214768246","doi":"https://doi.org/10.48550/arxiv.2609.32441"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2609.32441","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.32441","pdf_url":"https://arxiv.org/pdf/2609.32441","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"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2609.32441","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5153469643","display_name":"Ivan Fomin","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Fomin, Ivan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5152324984","display_name":"Alexander V. Gasnikov","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I4210116741","display_name":"Innopolis University","ror":"https://ror.org/02b7jh107","country_code":"RU","type":"education","lineage":["https://openalex.org/I4210116741"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Gasnikov, Alexander V.","raw_affiliation_strings":["Innopolis University , Innopolis , Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Innopolis University , Innopolis , Russia","institution_ids":["https://openalex.org/I4210116741"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":1,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.8467000126838684,"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.8467000126838684,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.07280000299215317,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.031599998474121094,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/saddle-point-problems","display_name":"saddle point problems","score":0.9779999852180481},{"id":"https://openalex.org/keywords/min-max-optimization","display_name":"minimax optimization","score":0.6620000004768372},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"cutting plane method","score":0.7210000157356262},{"id":"https://openalex.org/keywords/accelerated-gradient-methods","display_name":"accelerated gradient methods","score":0.5059999823570251},{"id":"https://openalex.org/keywords/oracle-complexity","display_name":"oracle complexity","score":0.6840000152587891}],"concepts":[{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.5954999923706055},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.5817000269889832},{"id":"https://openalex.org/C114466953","wikidata":"https://www.wikidata.org/wiki/Q6034165","display_name":"Initialization","level":2,"score":0.5489000082015991},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.510200023651123},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5060999989509583},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5026999711990356},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49639999866485596},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4535999894142151},{"id":"https://openalex.org/C96865113","wikidata":"https://www.wikidata.org/wiki/Q2946816","display_name":"Certificate","level":2,"score":0.42809998989105225},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41749998927116394},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3978999853134155},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.3596999943256378},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.30640000104904175},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.30140000581741333},{"id":"https://openalex.org/C167981075","wikidata":"https://www.wikidata.org/wiki/Q2667186","display_name":"Sandbox (software development)","level":2,"score":0.2662000060081482},{"id":"https://openalex.org/C122268817","wikidata":"https://www.wikidata.org/wiki/Q2020318","display_name":"Frank\u2013Wolfe algorithm","level":5,"score":0.25699999928474426},{"id":"https://openalex.org/C198082294","wikidata":"https://www.wikidata.org/wiki/Q3399648","display_name":"Position (finance)","level":2,"score":0.25049999356269836}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2609.32441","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.32441","pdf_url":"https://arxiv.org/pdf/2609.32441","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.2609.32441","doi":"https://doi.org/10.48550/arxiv.2609.32441","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2609.32441","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"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2609.32441","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.32441","pdf_url":"https://arxiv.org/pdf/2609.32441","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"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7214768246.pdf","grobid_xml":"https://content.openalex.org/works/W7214768246.grobid-xml"},"referenced_works_count":3,"referenced_works":["https://openalex.org/W3134655137","https://openalex.org/W4405738106","https://openalex.org/W4414845944"],"related_works":["https://openalex.org/W4386902393","https://openalex.org/W4221139974","https://openalex.org/W4385262272","https://openalex.org/W3092540645","https://openalex.org/W7221729298","https://openalex.org/W2791323206","https://openalex.org/W2995377052","https://openalex.org/W2806731488","https://openalex.org/W3129078050","https://openalex.org/W4409128400"],"abstract_inverted_index":{"Many":[0],"learning":[1,24],"problems":[2,97],"couple":[3],"a":[4,10,20,26,37,64,108,114,121,124,151,158,234],"high-dimensional":[5],"block":[6],"of":[7,12,113,153,161,207,209,241,246],"parameters":[8],"with":[9,35,44,77,157,205],"handful":[11],"adversarial":[13],"or":[14,23,145],"dual":[15],"variables:":[16],"worst-group":[17],"risk":[18],"over":[19],"few":[21,27],"groups,":[22],"under":[25],"constraints.":[28],"We":[29,92],"consider":[30],"$\\min_{x\\in":[31],"X}\\max_{y\\in":[32],"Y}":[33],"f(x,y)$":[34],"$X\\subseteq\\mathbb{R}^n$,":[36],"compact":[38],"convex":[39,43,110],"set":[40],"and":[41,48,56,69,117,182,200,222],"strongly":[42,109],"condition":[45],"number":[46,240],"$\u03ba$,":[47],"we":[49],"count":[50],"the":[51,95,129,143,147,154,162,210,215,223,239],"oracle":[52],"calls":[53,84,89,174,184,219,226,242],"for":[54,57,85,90,123,138,175,185,220,227,243],"$x$":[55,221,244],"$y$":[58,68,86,139],"separately.":[59],"The":[60],"textbook":[61],"approach":[62],"runs":[63],"cutting-plane":[65],"method":[66,216,237],"in":[67,134,232],"solves":[70],"every":[71,136],"inner":[72,96],"problem":[73],"to":[74,150,178,197],"accuracy":[75],"$\\varepsilon$":[76],"an":[78,169,179],"accelerated":[79,126,236],"method;":[80],"it":[81,119],"needs":[82,217],"$O(m\\log(1/\\varepsilon))$":[83,225],"but":[87],"$O(m\\sqrt\u03ba\\log^2(1/\\varepsilon))$":[88],"$x$.":[91],"show":[93],"that":[94],"need":[98],"not":[99],"be":[100,198],"solved":[101],"accurately.":[102],"Our":[103],"method,":[104],"certificate":[105],"transport,":[106],"keeps":[107],"lower":[111,148,163],"model":[112,149],"single":[115],"slice":[116],"uses":[118],"as":[120,213],"prior":[122],"short":[125],"run":[127],"on":[128],"next":[130],"slice.":[131],"By":[132],"concavity":[133,231],"$y$,":[135,233],"call":[137],"then":[140],"either":[141],"cuts":[142],"localizer":[144,211],"moves":[146],"mixture":[152],"two":[155],"slices":[156],"certified":[159],"increase":[160],"bound.":[164],"For":[165,202],"$m=1$":[166],"this":[167],"gives":[168],"$\\varepsilon$-saddle":[170],"point":[171],"after":[172],"$O(\\sqrt\u03ba\\log(1/\\varepsilon))$":[173],"$x$,":[176],"up":[177],"initialization":[180],"term,":[181],"$O(\\log(1/\\varepsilon))$":[183],"$y$;":[186],"both":[187],"counts":[188],"are":[189],"optimal,":[190],"even":[191],"though":[192],"$f(x,\\cdot)$":[193],"is":[194],"only":[195],"assumed":[196],"concave":[199],"Lipschitz.":[201],"general":[203],"$m$,":[204],"centers":[206],"gravity":[208],"treated":[212],"computable,":[214],"$O((m+\\sqrt{m\u03ba})\\log(1/\\varepsilon))$":[218],"optimal":[224],"$y$.":[228],"Under":[229],"strong":[230],"two-point":[235],"makes":[238],"independent":[245],"$m$.":[247]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-11-09T13:22:03.289127","created_date":"2026-09-30T00:00:00"}