{"id":"https://openalex.org/W3011766119","doi":"https://doi.org/10.1137/18m1230542","title":"A Single Timescale Stochastic Approximation Method for Nested Stochastic Optimization","display_name":"A Single Timescale Stochastic Approximation Method for Nested Stochastic Optimization","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3011766119","doi":"https://doi.org/10.1137/18m1230542","mag":"3011766119"},"language":"en","primary_location":{"id":"doi:10.1137/18m1230542","is_oa":false,"landing_page_url":"https://doi.org/10.1137/18m1230542","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5063746021","display_name":"Saeed Ghadimi","orcid":"https://orcid.org/0000-0002-3191-5153"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Saeed Ghadimi","raw_affiliation_strings":["Department of Operations Research and Financial Engineering, Princeton University, Princeton, NJ 08544;"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Operations Research and Financial Engineering, Princeton University, Princeton, NJ 08544;","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014600365","display_name":"Andrzej Ruszczy\u0144ski","orcid":"https://orcid.org/0000-0002-4571-1469"},"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":"Andrzej Ruszczy\u0144ski","raw_affiliation_strings":["Department of Management Science and Information Systems, Rutgers University, Piscataway, 08854;"],"raw_orcid":"https://orcid.org/0000-0002-4571-1469","affiliations":[{"raw_affiliation_string":"Department of Management Science and Information Systems, Rutgers University, Piscataway, 08854;","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100707460","display_name":"Mengdi Wang","orcid":"https://orcid.org/0000-0002-2101-9507"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mengdi Wang","raw_affiliation_strings":["Department of Operations Research and Financial Engineering, Princeton University, Princeton, NJ 08544;"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Operations Research and Financial Engineering, Princeton University, Princeton, NJ 08544;","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.7165,"has_fulltext":false,"cited_by_count":75,"citation_normalized_percentile":{"value":0.97370227,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"30","issue":"1","first_page":"960","last_page":"979"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":1.0,"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":1.0,"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.9995999932289124,"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.9965999722480774,"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/mathematics","display_name":"Mathematics","score":0.746711015701294},{"id":"https://openalex.org/keywords/stochastic-approximation","display_name":"Stochastic approximation","score":0.6453403830528259},{"id":"https://openalex.org/keywords/stochastic-optimization","display_name":"Stochastic optimization","score":0.6249802112579346},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5486944913864136},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4876483678817749},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.46179911494255066},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.45838233828544617},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.44455865025520325},{"id":"https://openalex.org/keywords/lyapunov-function","display_name":"Lyapunov function","score":0.41822558641433716},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1986638307571411},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.14722269773483276}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.746711015701294},{"id":"https://openalex.org/C55479107","wikidata":"https://www.wikidata.org/wiki/Q97663916","display_name":"Stochastic approximation","level":3,"score":0.6453403830528259},{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.6249802112579346},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5486944913864136},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4876483678817749},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.46179911494255066},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.45838233828544617},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.44455865025520325},{"id":"https://openalex.org/C60640748","wikidata":"https://www.wikidata.org/wiki/Q2337858","display_name":"Lyapunov function","level":3,"score":0.41822558641433716},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1986638307571411},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.14722269773483276},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/18m1230542","is_oa":false,"landing_page_url":"https://doi.org/10.1137/18m1230542","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3593650806","display_name":"CAREER: Stochastic Nested Composition Optimization: Theory and Algorithms","funder_award_id":"1653435","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5625727722","display_name":null,"funder_award_id":"FA9550-19-1-0203 608","funder_id":"https://openalex.org/F4320338279","funder_display_name":"Air Force Office of Scientific Research"},{"id":"https://openalex.org/G6386400672","display_name":"Collaborative Research: Risk-Averse Control of Markov Systems with Model Uncertainty","funder_award_id":"1907522","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320338279","display_name":"Air Force Office of Scientific Research","ror":"https://ror.org/011e9bt93"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1487404723","https://openalex.org/W1494085563","https://openalex.org/W1950214537","https://openalex.org/W1986324933","https://openalex.org/W1987083649","https://openalex.org/W2008796819","https://openalex.org/W2029008056","https://openalex.org/W2029463628","https://openalex.org/W2038725517","https://openalex.org/W2060471940","https://openalex.org/W2593248927","https://openalex.org/W2962970637","https://openalex.org/W2963190258","https://openalex.org/W2963231446","https://openalex.org/W2963313444","https://openalex.org/W2963470657","https://openalex.org/W2963819344"],"related_works":["https://openalex.org/W4254717236","https://openalex.org/W2377757044","https://openalex.org/W3160952126","https://openalex.org/W2320103255","https://openalex.org/W798918733","https://openalex.org/W4213167601","https://openalex.org/W2101287851","https://openalex.org/W163279402","https://openalex.org/W2403168774","https://openalex.org/W2281909915"],"abstract_inverted_index":{"We":[0,27,133],"study":[1],"constrained":[2,120,129,146,162],"nested":[3,39,105],"stochastic":[4,32,41,106,131,148],"optimization":[5,149],"problems":[6],"in":[7],"which":[8,35,61],"the":[9,38,51,63,66,71,84,87,114,141,154],"objective":[10,68],"function":[11,69,73],"is":[12],"a":[13,29,77,136],"composition":[14],"of":[15,50,65,90,125,140],"two":[16,56],"smooth":[17],"functions":[18],"whose":[19],"exact":[20],"values":[21],"and":[22,70,110,119,151,161],"derivatives":[23],"are":[24,113],"not":[25],"available.":[26],"propose":[28],"single":[30],"timescale":[31],"approximation":[33,42],"algorithm,":[34],"we":[36,81,152],"call":[37],"averaged":[40,58],"(NASA),":[43],"to":[44],"find":[45],"an":[46,95],"approximate":[47],"stationary":[48,97],"point":[49],"problem.":[52],"The":[53],"algorithm":[54],"has":[55],"auxiliary":[57],"sequences":[59],"(filters)":[60],"estimate":[62],"gradient":[64],"composite":[67],"inner":[72],"value.":[74],"By":[75],"using":[76],"special":[78],"Lyapunov":[79],"function,":[80],"show":[82],"that":[83],"NASA":[85,142],"achieves":[86],"sample":[88],"complexity":[89,156],"${\\cal":[91],"O}(1/\\epsilon^{2})$":[92],"for":[93,104,116,128,144,158],"finding":[94],"$\\epsilon$-approximate":[96],"point,":[98],"thus":[99],"outperforming":[100],"all":[101],"extant":[102],"methods":[103],"approximation.":[107],"Our":[108],"method":[109,143],"its":[111],"analysis":[112],"same":[115,155],"both":[117,159],"unconstrained":[118,160],"problems,":[121,150],"without":[122],"any":[123],"need":[124],"batch":[126],"samples":[127],"nonconvex":[130],"optimization.":[132],"also":[134],"present":[135],"simplified":[137],"parameter-free":[138],"variant":[139],"solving":[145],"single-level":[147],"prove":[153],"result":[157],"problems.":[163]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":9},{"year":2024,"cited_by_count":11},{"year":2023,"cited_by_count":13},{"year":2022,"cited_by_count":10},{"year":2021,"cited_by_count":18},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":2}],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2025-10-10T00:00:00"}