{"id":"https://openalex.org/W4283213126","doi":"https://doi.org/10.48550/arxiv.2206.08573","title":"Optimal Extragradient-Based Bilinearly-Coupled Saddle-Point Optimization","display_name":"Optimal Extragradient-Based Bilinearly-Coupled Saddle-Point Optimization","publication_year":2022,"publication_date":"2022-06-17","ids":{"openalex":"https://openalex.org/W4283213126","doi":"https://doi.org/10.48550/arxiv.2206.08573"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2206.08573","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2206.08573","pdf_url":"https://arxiv.org/pdf/2206.08573","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2206.08573","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5033061754","display_name":"Simon S. Du","orcid":"https://orcid.org/0000-0003-0056-8299"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Du, Simon S.","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011494985","display_name":"Gauthier Gidel","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gidel, Gauthier","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049812527","display_name":"Michael I. Jordan","orcid":"https://orcid.org/0000-0001-8935-817X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jordan, Michael I.","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5058611209","display_name":"Chris Junchi Li","orcid":"https://orcid.org/0000-0003-0158-1655"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li, Chris Junchi","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5033061754"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":3,"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.9993000030517578,"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.9993000030517578,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"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","display_name":"Saddle point","score":0.7967987656593323},{"id":"https://openalex.org/keywords/variational-inequality","display_name":"Variational inequality","score":0.6232794523239136},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5888348817825317},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5762671828269958},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.527137279510498},{"id":"https://openalex.org/keywords/stochastic-gradient-descent","display_name":"Stochastic gradient descent","score":0.5177482962608337},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4575447738170624},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.4261443614959717},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.41360852122306824},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.41236698627471924},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.41087818145751953},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.335368275642395},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.32914215326309204},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.29643064737319946},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.19103363156318665},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.14146047830581665}],"concepts":[{"id":"https://openalex.org/C2681867","wikidata":"https://www.wikidata.org/wiki/Q690935","display_name":"Saddle point","level":2,"score":0.7967987656593323},{"id":"https://openalex.org/C161999928","wikidata":"https://www.wikidata.org/wiki/Q4556320","display_name":"Variational inequality","level":2,"score":0.6232794523239136},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5888348817825317},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5762671828269958},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.527137279510498},{"id":"https://openalex.org/C206688291","wikidata":"https://www.wikidata.org/wiki/Q7617819","display_name":"Stochastic gradient descent","level":3,"score":0.5177482962608337},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4575447738170624},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.4261443614959717},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.41360852122306824},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.41236698627471924},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.41087818145751953},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.335368275642395},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32914215326309204},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.29643064737319946},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.19103363156318665},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.14146047830581665},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.0},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2206.08573","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2206.08573","pdf_url":"https://arxiv.org/pdf/2206.08573","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"doi:10.48550/arxiv.2206.08573","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2206.08573","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":"pmh:oai:arXiv.org:2206.08573","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2206.08573","pdf_url":"https://arxiv.org/pdf/2206.08573","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2964170259","https://openalex.org/W3002546633","https://openalex.org/W2765682467","https://openalex.org/W4206119629","https://openalex.org/W4382937879","https://openalex.org/W4292651679","https://openalex.org/W2400034325","https://openalex.org/W2499557797","https://openalex.org/W4299515259","https://openalex.org/W4224283687"],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,27,106],"smooth":[3],"convex-concave":[4],"bilinearly-coupled":[5],"saddle-point":[6,119],"problem,":[7],"$\\min_{\\mathbf{x}}\\max_{\\mathbf{y}}~F(\\mathbf{x})":[8],"+":[9],"H(\\mathbf{x},\\mathbf{y})":[10],"-":[11],"G(\\mathbf{y})$,":[12],"where":[13],"one":[14],"has":[15],"access":[16],"to":[17,65,100],"stochastic":[18,35,44,58,94],"first-order":[19],"oracles":[20],"for":[21,38,92],"$F$,":[22],"$G$":[23],"as":[24,26],"well":[25],"bilinear":[28],"coupling":[29],"function":[30],"$H$.":[31],"Building":[32],"upon":[33],"standard":[34],"extragradient":[36,52],"analysis":[37],"variational":[39],"inequalities,":[40],"we":[41],"present":[42],"a":[43,67,101,112],"\\emph{accelerated":[45],"gradient-extragradient":[46],"(AG-EG)}":[47],"descent-ascent":[48],"algorithm":[49,61],"that":[50,72,96,109],"combines":[51],"and":[53,80],"Nesterov's":[54],"acceleration":[55],"in":[56,82,118],"general":[57],"settings.":[59],"This":[60,104],"leverages":[62],"scheduled":[63],"restarting":[64],"admit":[66],"fine-grained":[68],"nonasymptotic":[69],"convergence":[70],"rate":[71],"matches":[73],"known":[74],"lower":[75],"bounds":[76],"by":[77],"both":[78],"\\citet{ibrahim2020linear}":[79],"\\citet{zhang2021lower}":[81],"their":[83],"corresponding":[84],"settings,":[85],"plus":[86],"an":[87],"additional":[88],"statistical":[89],"error":[90],"term":[91],"bounded":[93],"noise":[95],"is":[97,105],"optimal":[98],"up":[99],"constant":[102],"prefactor.":[103],"first":[107],"result":[108],"achieves":[110],"such":[111],"relatively":[113],"mature":[114],"characterization":[115],"of":[116],"optimality":[117],"optimization.":[120]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2}],"updated_date":"2026-02-09T09:26:11.010843","created_date":"2025-10-10T00:00:00"}