{"id":"https://openalex.org/W7214800080","doi":"https://doi.org/10.48550/arxiv.2609.35275","title":"Projection-Free Algorithms for Nonsmooth Stochastic Convex-Concave Saddle-Point Problems","display_name":"Projection-Free Algorithms for Nonsmooth Stochastic Convex-Concave Saddle-Point Problems","publication_year":2026,"publication_date":"2026-09-28","ids":{"openalex":"https://openalex.org/W7214800080","doi":"https://doi.org/10.48550/arxiv.2609.35275"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2609.35275","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.35275","pdf_url":"https://arxiv.org/pdf/2609.35275","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.35275","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5093286135","display_name":"Khanh-Hung Giang-Tran","orcid":"https://orcid.org/0009-0005-3268-7112","observed_orcids":["https://orcid.org/0009-0005-3268-7112"]},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Giang-Tran, Khanh-Hung","raw_affiliation_strings":["Cornell University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Cornell University","institution_ids":["https://openalex.org/I205783295"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5096114626","display_name":"Soroosh Shafiee","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shafiee, Soroosh","raw_affiliation_strings":["Cornell University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Cornell University","institution_ids":["https://openalex.org/I205783295"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I205783295"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.8144999742507935,"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.8144999742507935,"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.15489999949932098,"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.003599999938160181,"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/projection-free-algorithms","display_name":"projection-free algorithms","score":0.8140000104904175},{"id":"https://openalex.org/keywords/saddle-point-problems","display_name":"saddle point problems","score":0.800000011920929},{"id":"https://openalex.org/keywords/nonsmooth-optimization","display_name":"nonsmooth optimization","score":0.8069999814033508},{"id":"https://openalex.org/keywords/linear-minimization-oracle","display_name":"linear minimization oracle","score":0.9589999914169312},{"id":"https://openalex.org/keywords/single-loop-algorithm","display_name":"single-loop algorithm","score":0.656000018119812},{"id":"https://openalex.org/keywords/iteration-complexity","display_name":"iteration complexity","score":0.7250000238418579},{"id":"https://openalex.org/keywords/minimax-lower-bounds","display_name":"minimax lower bounds","score":0.8659999966621399}],"concepts":[{"id":"https://openalex.org/C158968445","wikidata":"https://www.wikidata.org/wiki/Q7631150","display_name":"Subgradient method","level":2,"score":0.8752999901771545},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.8234000205993652},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.605400025844574},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5842999815940857},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5558000206947327},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5223000049591064},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5099999904632568},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.45339998602867126},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.451200008392334},{"id":"https://openalex.org/C22171661","wikidata":"https://www.wikidata.org/wiki/Q1074380","display_name":"Stochastic game","level":2,"score":0.41449999809265137},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.40869998931884766},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39559999108314514},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.39430001378059387},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.3889999985694885},{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.37599998712539673},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3653999865055084},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.33230000734329224},{"id":"https://openalex.org/C2681867","wikidata":"https://www.wikidata.org/wiki/Q690935","display_name":"Saddle point","level":2,"score":0.3199000060558319},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.31949999928474426},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.3116999864578247},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.3089999854564667},{"id":"https://openalex.org/C2777127463","wikidata":"https://www.wikidata.org/wiki/Q10862618","display_name":"Saddle","level":2,"score":0.29440000653266907},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2919999957084656},{"id":"https://openalex.org/C8272713","wikidata":"https://www.wikidata.org/wiki/Q176737","display_name":"Stochastic process","level":2,"score":0.288100004196167},{"id":"https://openalex.org/C22324862","wikidata":"https://www.wikidata.org/wiki/Q652707","display_name":"Lipschitz continuity","level":2,"score":0.2863999903202057},{"id":"https://openalex.org/C6802819","wikidata":"https://www.wikidata.org/wiki/Q1072174","display_name":"Linear system","level":2,"score":0.2799000144004822},{"id":"https://openalex.org/C17095337","wikidata":"https://www.wikidata.org/wiki/Q2375229","display_name":"Piecewise linear function","level":2,"score":0.27959999442100525},{"id":"https://openalex.org/C72134830","wikidata":"https://www.wikidata.org/wiki/Q5166524","display_name":"Convexity","level":2,"score":0.27079999446868896},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.25270000100135803}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2609.35275","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.35275","pdf_url":"https://arxiv.org/pdf/2609.35275","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.35275","doi":"https://doi.org/10.48550/arxiv.2609.35275","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2609.35275","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:2609.35275","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.35275","pdf_url":"https://arxiv.org/pdf/2609.35275","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/W7214800080.pdf","grobid_xml":"https://content.openalex.org/works/W7214800080.grobid-xml"},"referenced_works_count":7,"referenced_works":["https://openalex.org/W1517483307","https://openalex.org/W2767185219","https://openalex.org/W4290858305","https://openalex.org/W7128051350","https://openalex.org/W7131827551","https://openalex.org/W7135198985","https://openalex.org/W7147107765"],"related_works":["https://openalex.org/W7147107765","https://openalex.org/W3093821799","https://openalex.org/W2945170552","https://openalex.org/W3164209919","https://openalex.org/W2919464796","https://openalex.org/W4402859376","https://openalex.org/W7133211593","https://openalex.org/W3024063968","https://openalex.org/W4290858305","https://openalex.org/W7221532040"],"abstract_inverted_index":{"We":[0,19,97,125],"study":[1],"nonsmooth":[2,144],"convex-concave":[3],"saddle-point":[4],"problems":[5],"over":[6,29,66],"compact":[7],"convex":[8],"sets,":[9],"assuming":[10],"access":[11],"to":[12],"stochastic":[13,107,122,145],"subgradients":[14],"of":[15,151,161],"the":[16,30,55,70,83,132,148,159],"payoff":[17],"function.":[18],"develop":[20],"single-loop":[21,84],"projection-free":[22,37,92],"algorithms":[23,114],"that":[24,39],"use":[25],"linear":[26,60,152],"minimization":[27,61,153],"oracles":[28,154],"primal":[31],"and":[32,48,93],"dual":[33],"domains.":[34],"Unlike":[35],"prior":[36],"approaches":[38],"rely":[40],"on":[41],"smoothing,":[42],"our":[43,87],"methods":[44],"are":[45],"purely":[46],"subgradient-based":[47],"handle":[49],"nonsmoothness":[50],"directly.":[51],"This":[52],"design":[53],"makes":[54],"framework":[56,88],"modular:":[57],"when":[58],"a":[59,67,77],"oracle":[62,80,95,108,134,164],"is":[63],"not":[64,156],"used":[65],"specific":[68],"domain,":[69],"corresponding":[71,133],"update":[72],"can":[73],"be":[74],"replaced":[75],"by":[76],"standard":[78,105],"projection":[79],"without":[81],"changing":[82],"structure.":[85],"Thus,":[86],"covers":[89],"both":[90],"fully":[91],"hybrid":[94],"configurations.":[96],"prove":[98],"anytime":[99],"strong":[100],"saddle":[101],"gap":[102],"guarantees":[103],"under":[104],"unbiased":[106],"assumptions":[109],"with":[110],"bounded":[111],"variance.":[112],"Our":[113,139],"achieve":[115],"an":[116],"$O(\u03b5^{-2})$":[117],"iteration":[118],"complexity,":[119],"matching":[120,128],"projected":[121],"subgradient":[123],"methods.":[124],"also":[126],"provide":[127],"lower":[129],"bounds":[130],"for":[131,143],"models,":[135],"establishing":[136],"minimax":[137,146],"optimality.":[138],"results":[140],"show":[141],"that,":[142],"problems,":[147],"computational":[149],"advantages":[150],"need":[155],"come":[157],"at":[158],"expense":[160],"statistical":[162],"or":[163],"efficiency.":[165]},"counts_by_year":[],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2026-09-30T00:00:00"}