{"id":"https://openalex.org/W4414827399","doi":"https://doi.org/10.48550/arxiv.2504.08079","title":"On iteratively regularized first-order methods for simple bilevel optimization","display_name":"On iteratively regularized first-order methods for simple bilevel optimization","alternate_titles":[],"publication_year":2025,"publication_date":"2025-04-10","ids":{"openalex":"https://openalex.org/W4414827399","doi":"https://doi.org/10.48550/arxiv.2504.08079"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2504.08079","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2504.08079","pdf_url":"https://arxiv.org/pdf/2504.08079","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"},"parent_works":[],"lineage":["https://openalex.org/W4414827399"],"child_works_count":0,"type":"preprint","is_traditional":true,"indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2504.08079","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5047304264","display_name":"Sepideh Samadi","orcid":"https://orcid.org/0009-0005-1546-4371","observed_orcids":["https://orcid.org/0009-0005-1546-4371"]},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Samadi, Sepideh","raw_affiliation_strings":["affiliated with Rutgers University , Piscataway , NJ 08854 , USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"affiliated with Rutgers University , Piscataway , NJ 08854 , USA","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080844477","display_name":"Daniel Alberto Burbano-L.","orcid":"https://orcid.org/0000-0002-7708-1289","observed_orcids":["https://orcid.org/0000-0002-7708-1289"]},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Burbano, Daniel","raw_affiliation_strings":["affiliated with Rutgers University , Piscataway , NJ 08854 , USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"affiliated with Rutgers University , Piscataway , NJ 08854 , USA","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003164670","display_name":"Farzad Yousefian","orcid":"https://orcid.org/0000-0003-2628-741X","observed_orcids":["https://orcid.org/0000-0003-2628-741X"]},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yousefian, Farzad","raw_affiliation_strings":["affiliated with Rutgers University , Piscataway , NJ 08854 , USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"affiliated with Rutgers University , Piscataway , NJ 08854 , USA","institution_ids":["https://openalex.org/I102322142"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I102322142"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"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_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.9872999787330627,"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"}},"topics":[{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.9872999787330627,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.005799999926239252,"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/T11205","display_name":"Numerical methods in inverse problems","score":0.0012000000569969416,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"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/proximal-gradient-method","display_name":"proximal gradient method","score":0.7139999866485596},{"id":"https://openalex.org/keywords/accelerated-proximal-gradient","display_name":"accelerated proximal gradient","score":0.8560000061988831},{"id":"https://openalex.org/keywords/composite-convex-optimization","display_name":"composite convex optimization","score":0.5619999766349792},{"id":"https://openalex.org/keywords/sublinear-convergence","display_name":"sublinear convergence","score":0.7829999923706055},{"id":"https://openalex.org/keywords/gradient-projection-method","display_name":"gradient projection","score":0.6729999780654907},{"id":"https://openalex.org/keywords/ill-posed-linear-inverse-problems","display_name":"ill-posed linear inverse problems","score":0.9020000100135803}],"concepts":[{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.8008000254631042},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7595999836921692},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.7049000263214111},{"id":"https://openalex.org/C2776135515","wikidata":"https://www.wikidata.org/wiki/Q17143721","display_name":"Regularization (linguistics)","level":2,"score":0.6621999740600586},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.573199987411499},{"id":"https://openalex.org/C79248915","wikidata":"https://www.wikidata.org/wiki/Q17086776","display_name":"Proximal gradient methods for learning","level":5,"score":0.5091999769210815},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.5091000199317932},{"id":"https://openalex.org/C3309286","wikidata":"https://www.wikidata.org/wiki/Q4907693","display_name":"Bilevel optimization","level":3,"score":0.5076000094413757},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4584999978542328},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.438400000333786},{"id":"https://openalex.org/C195956108","wikidata":"https://www.wikidata.org/wiki/Q7268362","display_name":"Quadratic growth","level":2,"score":0.4246000051498413},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4162999987602234},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.414000004529953},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.4090000092983246},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.39250001311302185},{"id":"https://openalex.org/C189237950","wikidata":"https://www.wikidata.org/wiki/Q2500758","display_name":"Stationary point","level":2,"score":0.38960000872612},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.3628000020980835},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.36000001430511475},{"id":"https://openalex.org/C63548660","wikidata":"https://www.wikidata.org/wiki/Q858223","display_name":"Limit point","level":2,"score":0.3587999939918518},{"id":"https://openalex.org/C135252773","wikidata":"https://www.wikidata.org/wiki/Q1567213","display_name":"Inverse problem","level":2,"score":0.3395000100135803},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.32659998536109924},{"id":"https://openalex.org/C152442038","wikidata":"https://www.wikidata.org/wiki/Q2778212","display_name":"Tikhonov regularization","level":3,"score":0.3188999891281128},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.289900004863739},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.2856000065803528},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.2680000066757202},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.26510000228881836}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2504.08079","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2504.08079","pdf_url":"https://arxiv.org/pdf/2504.08079","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.2504.08079","doi":"https://doi.org/10.48550/arxiv.2504.08079","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2504.08079","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:2504.08079","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2504.08079","pdf_url":"https://arxiv.org/pdf/2504.08079","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":[{"id":"https://openalex.org/G3306723105","display_name":"CAREER: Advancing Mathematical Models and Algorithms for Decentralized Optimization in Complex Multi-agent Networks","funder_award_id":"2323159","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6621944723","display_name":"RANDOMIZED FEDERATED LEARNING METHODS FOR NONSMOOTH, NONCONVEX, AND HIERARCHICAL OPTIMIZATION","funder_award_id":"DESC0023303","funder_id":"https://openalex.org/F4320306084","funder_display_name":"U.S. Department of Energy"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G811776586","display_name":null,"funder_award_id":"N00014-22-1-2757","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320306084","display_name":"U.S. Department of Energy","ror":"https://ror.org/01bj3aw27"},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"},{"id":"https://openalex.org/F4320337392","display_name":"Division of Electrical, Communications and Cyber Systems","ror":"https://ror.org/01krpsy48"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4414827399.pdf","grobid_xml":"https://content.openalex.org/works/W4414827399.grobid-xml"},"referenced_works_count":36,"referenced_works":["https://openalex.org/W905619","https://openalex.org/W1822292100","https://openalex.org/W1971559451","https://openalex.org/W1972451512","https://openalex.org/W1972711404","https://openalex.org/W1975708545","https://openalex.org/W2027741643","https://openalex.org/W2062813253","https://openalex.org/W2064114733","https://openalex.org/W2092554297","https://openalex.org/W2100556411","https://openalex.org/W2129704204","https://openalex.org/W2140449165","https://openalex.org/W2265806316","https://openalex.org/W2588501147","https://openalex.org/W2606904667","https://openalex.org/W2763081248","https://openalex.org/W2892725081","https://openalex.org/W2990364438","https://openalex.org/W3046785529","https://openalex.org/W3089776011","https://openalex.org/W3134565505","https://openalex.org/W3198484963","https://openalex.org/W4307472121","https://openalex.org/W4313256606","https://openalex.org/W4323022409","https://openalex.org/W4388631464","https://openalex.org/W4402264275","https://openalex.org/W4402264951","https://openalex.org/W4404073035","https://openalex.org/W4405029750","https://openalex.org/W4407681304","https://openalex.org/W4415797824","https://openalex.org/W7096874275","https://openalex.org/W7097482596","https://openalex.org/W7168370330"],"related_works":["https://openalex.org/W4402264951","https://openalex.org/W4417538298","https://openalex.org/W7168370330","https://openalex.org/W2623208267","https://openalex.org/W4415797824","https://openalex.org/W4396653224","https://openalex.org/W4307472121","https://openalex.org/W4313256606","https://openalex.org/W2606904667","https://openalex.org/W7128010275"],"abstract_inverted_index":{"We":[0,63,228],"consider":[1],"simple":[2],"bilevel":[3],"optimization":[4,21],"(SBO)":[5],"problems":[6,128,195,238],"where":[7],"the":[8,14,37,60,68,71,89,121,138,151,178,185,201,206,210],"goal":[9],"is":[10,33,40,154,184],"to":[11,70,119],"compute":[12],"among":[13],"optimal":[15,73,241],"solutions":[16],"of":[17,67,146,180,193,205,214,218],"a":[18,26,55,130,223],"composite":[19,41],"convex":[20,132],"problem,":[22],"one":[23],"that":[24,196,217],"minimizes":[25],"secondary":[27],"objective":[28,39,134,153],"function.":[29],"Our":[30],"main":[31],"contribution":[32],"threefold.":[34],"(i)":[35],"When":[36,150],"upper-level":[38,133,152],"and":[42,75,83,135,156,169,173,239],"strongly":[43,131],"convex,":[44],"we":[45,92,158],"propose":[46,93,159],"IR-ISTAs,":[47],"an":[48,95,161,240],"iteratively":[49,96,164],"regularized":[50,97,165],"proximal":[51,99],"gradient":[52,100,167],"method":[53],"with":[54,129],"prescribed":[56],"update":[57],"rule":[58],"for":[59,79,126,142,190],"regularization":[61],"parameter.":[62],"establish":[64,102,170],"asymptotic":[65,104,172,187],"convergence":[66,123,175],"iterates":[69],"unique":[72],"solution":[74],"simultaneous":[76,113],"sublinear":[77],"rates":[78,114,139],"suitably":[80],"defined":[81],"infeasibility":[82,226],"suboptimality":[84],"error":[85],"metrics.":[86],"(ii)":[87],"For":[88],"same":[90],"setting,":[91],"IR-VFISTAs,":[94],"accelerated":[98,166],"method,":[101,168],"its":[103],"convergence,":[105],"and,":[106],"under":[107],"weak":[108,202],"sharp":[109,203],"minimality,":[110],"derive":[111],"faster":[112],"than":[115],"IR-ISTAs.":[116],"These":[117],"appear":[118],"be":[120],"best-known":[122],"rate":[124],"guarantees":[125],"SBO":[127,194],"improve":[136],"upon":[137],"previously":[140],"established":[141],"methods":[143],"requiring":[144],"convexity":[145],"both":[147,171],"levels.":[148],"(iii)":[149],"smooth":[155],"nonconvex,":[157],"IPR-VFISTAnc,":[160],"inexactly":[162],"projected":[163],"nonasymptotic":[174],"guarantees.":[176],"To":[177],"best":[179],"our":[181],"knowledge,":[182],"this":[183,191],"first":[186],"stationarity":[188],"result":[189],"class":[192],"does":[197],"not":[198],"rely":[199],"on":[200,233],"minimality":[204],"lower-level":[207,225],"problem.":[208,243],"Moreover,":[209],"total":[211],"iteration":[212],"complexity":[213],"IPR-VFISTAnc":[215],"matches":[216],"existing":[219],"methods,":[220],"while":[221],"providing":[222],"sharper":[224],"guarantee.":[227],"present":[229],"preliminary":[230],"numerical":[231],"experiments":[232],"three":[234],"ill-posed":[235],"linear":[236],"inverse":[237],"classifier-selection":[242]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W4414827399","counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2}],"updated_date":"2026-11-17T12:49:18.490984","created_date":"2025-10-10T00:00:00"}
