{"id":"https://openalex.org/W6929311131","doi":"https://doi.org/10.48550/arxiv.2503.18224","title":"A Framework for Finding Local Saddle Points in Two-Player Zero-Sum Black-Box Games","display_name":"A Framework for Finding Local Saddle Points in Two-Player Zero-Sum Black-Box Games","publication_year":2025,"publication_date":"2025-03-23","ids":{"openalex":"https://openalex.org/W6929311131","doi":"https://doi.org/10.48550/arxiv.2503.18224"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2503.18224","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/2503.18224","pdf_url":"https://arxiv.org/pdf/2503.18224","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","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2503.18224","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5090536067","display_name":"Shubhankar Agarwal","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Agarwal, Shubhankar","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102842693","display_name":"Hamzah I. Khan","orcid":"https://orcid.org/0000-0001-5481-6388","observed_orcids":["https://orcid.org/0000-0001-5481-6388"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Khan, Hamzah I.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024120306","display_name":"Sandeep Chinchali","orcid":"https://orcid.org/0000-0002-0601-3633","observed_orcids":["https://orcid.org/0000-0002-0601-3633"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chinchali, Sandeep P.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5070827615","display_name":"David Fridovich-Keil","orcid":"https://orcid.org/0000-0002-5866-6441","observed_orcids":["https://orcid.org/0000-0002-5866-6441"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Fridovich-Keil, David","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"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":true,"primary_topic":{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.4309000074863434,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.4309000074863434,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.3181000053882599,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.08290000259876251,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/saddle-point-optimization","display_name":"saddle point optimization","score":0.9810000061988831},{"id":"https://openalex.org/keywords/black-box-optimization","display_name":"black-box optimization","score":0.7730000019073486},{"id":"https://openalex.org/keywords/two-player-zero-sum-games","display_name":"two-person zero-sum games","score":0.9399999976158142},{"id":"https://openalex.org/keywords/gaussian-processes","display_name":"Gaussian processes","score":0.6370000243186951},{"id":"https://openalex.org/keywords/bayesian-optimization","display_name":"Bayesian optimization","score":0.9390000104904175},{"id":"https://openalex.org/keywords/derivative-free-optimization","display_name":"derivative-free optimization","score":0.777999997138977},{"id":"https://openalex.org/keywords/general-sum-games","display_name":"general-sum games","score":0.6480000019073486},{"id":"https://openalex.org/keywords/generative-adversarial-networks","display_name":"generative adversarial networks","score":0.6970000267028809},{"id":"https://openalex.org/keywords/portfolio-optimization","display_name":"portfolio optimization","score":0.6579999923706055}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6773999929428101},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5418999791145325},{"id":"https://openalex.org/C2681867","wikidata":"https://www.wikidata.org/wiki/Q690935","display_name":"Saddle point","level":2,"score":0.5156000256538391},{"id":"https://openalex.org/C2780598303","wikidata":"https://www.wikidata.org/wiki/Q65921492","display_name":"Flexibility (engineering)","level":2,"score":0.48539999127388},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4641999900341034},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.45980000495910645},{"id":"https://openalex.org/C61326573","wikidata":"https://www.wikidata.org/wiki/Q1496376","display_name":"Gaussian process","level":3,"score":0.4189999997615814},{"id":"https://openalex.org/C2778049539","wikidata":"https://www.wikidata.org/wiki/Q17002908","display_name":"Bayesian optimization","level":2,"score":0.39809998869895935},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.38350000977516174},{"id":"https://openalex.org/C2777127463","wikidata":"https://www.wikidata.org/wiki/Q10862618","display_name":"Saddle","level":2,"score":0.35260000824928284},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3467000126838684},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.3427000045776367},{"id":"https://openalex.org/C164660894","wikidata":"https://www.wikidata.org/wiki/Q2037833","display_name":"Piecewise","level":2,"score":0.33730000257492065},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33489999175071716},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.32409998774528503},{"id":"https://openalex.org/C2780821815","wikidata":"https://www.wikidata.org/wiki/Q5340806","display_name":"Portfolio","level":2,"score":0.31130000948905945},{"id":"https://openalex.org/C107673813","wikidata":"https://www.wikidata.org/wiki/Q812534","display_name":"Bayesian probability","level":2,"score":0.3075000047683716},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.29350000619888306},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.28940001130104065},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.27480000257492065},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.27480000257492065},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.27070000767707825},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.2572000026702881},{"id":"https://openalex.org/C202655437","wikidata":"https://www.wikidata.org/wiki/Q7231728","display_name":"Portfolio optimization","level":3,"score":0.2549999952316284},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.2508000135421753},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.2506999969482422},{"id":"https://openalex.org/C167966045","wikidata":"https://www.wikidata.org/wiki/Q5532625","display_name":"Generative model","level":3,"score":0.25029999017715454}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2503.18224","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/2503.18224","pdf_url":"https://arxiv.org/pdf/2503.18224","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.2503.18224","doi":"https://doi.org/10.48550/arxiv.2503.18224","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2503.18224","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":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2503.18224","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/2503.18224","pdf_url":"https://arxiv.org/pdf/2503.18224","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":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Saddle":[0],"point":[1,95],"optimization":[2,73,96],"is":[3,31],"a":[4,68,99,120,146],"critical":[5],"problem":[6,57,97],"employed":[7],"in":[8,25,37,51,128,161,205,218],"numerous":[9],"real-world":[10],"applications,":[11],"including":[12],"portfolio":[13],"optimization,":[14],"generative":[15],"adversarial":[16],"networks,":[17],"and":[18,33,85,107,131,144,164,188,202],"robotics.":[19],"It":[20],"has":[21],"been":[22],"extensively":[23],"studied":[24],"cases":[26],"where":[27],"the":[28,52,56,80,93,123,132,139,167,183,189],"objective":[29,53,84,124],"function":[30,125,186],"known":[32],"differentiable.":[34],"Existing":[35],"work":[36],"black-box":[38,206],"settings":[39],"with":[40,60],"unknown":[41,81],"objectives":[42],"that":[43],"can":[44,103,158],"only":[45,87],"be":[46,159],"sampled":[47],"either":[48],"assumes":[49],"convexity-concavity":[50],"to":[54,78,110,142,149,152,212],"simplify":[55],"or":[58],"operates":[59],"noisy":[61],"gradient":[62],"estimators.":[63],"In":[64],"contrast,":[65],"we":[66,165],"introduce":[67],"framework":[69,118,137],"inspired":[70],"by":[71,126,172],"Bayesian":[72],"which":[74,102,175],"utilizes":[75],"Gaussian":[76],"processes":[77],"model":[79,121,141],"(potentially":[82],"nonconvex-nonconcave)":[83],"requires":[86],"zeroth-order":[88],"samples.":[89,194],"Our":[90],"approach":[91,171],"frames":[92],"saddle":[94,216],"as":[98],"two-level":[100],"process":[101],"flexibly":[104],"integrate":[105],"existing":[106,140],"novel":[108],"approaches":[109],"this":[111],"problem.":[112],"The":[113],"upper":[114],"level":[115,134,156],"of":[116,122,135,169,185,191],"our":[117,136,170],"produces":[119],"sampling":[127],"promising":[129],"locations,":[130],"lower":[133,155],"uses":[138],"frame":[143],"solve":[145],"general-sum":[147],"game":[148],"identify":[150],"locations":[151],"sample.":[153],"This":[154],"procedure":[157],"designed":[160],"complementary":[162],"ways,":[163],"demonstrate":[166,197],"flexibility":[168],"introducing":[173],"variants":[174],"appropriately":[176],"trade":[177],"off":[178],"between":[179],"factors":[180],"like":[181],"runtime,":[182],"cost":[184],"evaluations,":[187],"number":[190],"available":[192],"initial":[193],"We":[195],"experimentally":[196],"these":[198,219],"algorithms":[199],"on":[200],"synthetic":[201],"realistic":[203],"datasets":[204],"nonconvex-nonconcave":[207],"settings,":[208],"showcasing":[209],"their":[210],"ability":[211],"efficiently":[213],"locate":[214],"local":[215],"points":[217],"contexts.":[220]},"counts_by_year":[],"updated_date":"2026-10-14T16:39:01.820549","created_date":"2025-10-10T00:00:00"}