{"id":"https://openalex.org/W7163059119","doi":"https://doi.org/10.48550/arxiv.2605.31309","title":"Non-Asymptotic Convergence of Stochastic Iterative Algorithms: A Lyapunov Framework","display_name":"Non-Asymptotic Convergence of Stochastic Iterative Algorithms: A Lyapunov Framework","publication_year":2026,"publication_date":"2026-05-29","ids":{"openalex":"https://openalex.org/W7163059119","doi":"https://doi.org/10.48550/arxiv.2605.31309"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.31309","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.31309","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":"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"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.31309","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5058269077","display_name":"Zaiwei Chen","orcid":"https://orcid.org/0000-0001-9915-5595"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chen, Zaiwei","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5021806638","display_name":"Siva Theja Maguluri","orcid":"https://orcid.org/0000-0002-5797-1639"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Maguluri, Siva Theja","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":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.6043999791145325,"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.6043999791145325,"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.1542000025510788,"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/T11206","display_name":"Model Reduction and Neural Networks","score":0.0210999995470047,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.599399983882904},{"id":"https://openalex.org/keywords/lyapunov-function","display_name":"Lyapunov function","score":0.521399974822998},{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.4884999990463257},{"id":"https://openalex.org/keywords/stochastic-approximation","display_name":"Stochastic approximation","score":0.45969998836517334},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.43230000138282776},{"id":"https://openalex.org/keywords/iterative-learning-control","display_name":"Iterative learning control","score":0.4235000014305115},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.4162999987602234},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.40400001406669617}],"concepts":[{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.599399983882904},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5728999972343445},{"id":"https://openalex.org/C60640748","wikidata":"https://www.wikidata.org/wiki/Q2337858","display_name":"Lyapunov function","level":3,"score":0.521399974822998},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.5031999945640564},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.4884999990463257},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4684999883174896},{"id":"https://openalex.org/C55479107","wikidata":"https://www.wikidata.org/wiki/Q97663916","display_name":"Stochastic approximation","level":3,"score":0.45969998836517334},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.43230000138282776},{"id":"https://openalex.org/C117619785","wikidata":"https://www.wikidata.org/wiki/Q6094414","display_name":"Iterative learning control","level":3,"score":0.4235000014305115},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.4162999987602234},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.40400001406669617},{"id":"https://openalex.org/C99692599","wikidata":"https://www.wikidata.org/wiki/Q596577","display_name":"Dissipative system","level":2,"score":0.4025999903678894},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.3986999988555908},{"id":"https://openalex.org/C191795146","wikidata":"https://www.wikidata.org/wiki/Q3878446","display_name":"Norm (philosophy)","level":2,"score":0.3930000066757202},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.3905999958515167},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3781999945640564},{"id":"https://openalex.org/C8272713","wikidata":"https://www.wikidata.org/wiki/Q176737","display_name":"Stochastic process","level":2,"score":0.3747999966144562},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.36320000886917114},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.3472000062465668},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.29339998960494995},{"id":"https://openalex.org/C61445026","wikidata":"https://www.wikidata.org/wiki/Q217608","display_name":"Fixed point","level":2,"score":0.26750001311302185},{"id":"https://openalex.org/C25854792","wikidata":"https://www.wikidata.org/wiki/Q1028945","display_name":"Lyapunov equation","level":4,"score":0.267300009727478}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.31309","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.31309","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.31309","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.31309","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":"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"},"sustainable_development_goals":[{"score":0.40026578307151794,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,36,74],"survey":[1],"Lyapunov-based":[2],"techniques":[3],"for":[4,19,132],"the":[5,25,40,54,71,133],"finite-time":[6,134],"analysis":[7,135],"of":[8,70,136],"stochastic":[9,15,87],"iterative":[10],"algorithms,":[11,18],"also":[12],"known":[13],"as":[14,65,98],"approximation":[16],"(SA)":[17],"solving":[20],"fixed-point":[21],"equations":[22],"$\\bar{F}(x)=x$,":[23],"where":[24],"operator":[26],"$\\bar{F}(\\cdot)$":[27,45],"can":[28],"only":[29],"be":[30],"accessed":[31],"through":[32],"a":[33,127],"noisy":[34],"oracle.":[35],"first":[37],"focus":[38],"on":[39],"standard":[41],"setting":[42],"in":[43,142],"which":[44],"is":[46,56,124],"contractive":[47],"with":[48,119],"respect":[49],"to":[50,86,107,125],"some":[51],"norm":[52],"and":[53,58,84,92,100,114,117,129,138],"noise":[55],"i.i.d.,":[57],"explain":[59],"how":[60,77],"generalized":[61],"Moreau":[62],"envelopes":[63],"serve":[64],"universal":[66],"Lyapunov":[67],"functions,":[68],"regardless":[69],"underlying":[72],"norm.":[73],"then":[75],"show":[76],"this":[78],"framework":[79],"yields":[80],"mean-square":[81],"convergence":[82],"guarantees":[83],"applies":[85],"gradient":[88],"descent,":[89],"linear":[90],"SA,":[91],"value-based":[93],"reinforcement":[94,143],"learning":[95],"algorithms":[96],"such":[97],"Q-learning":[99],"temporal-difference":[101],"learning.":[102,144],"Finally,":[103],"we":[104],"discuss":[105],"extensions":[106],"Markovian":[108],"noise,":[109],"seminorm-contractive":[110],"operators,":[111,113],"dissipative":[112],"high-probability":[115],"bounds,":[116],"conclude":[118],"open":[120],"problems.":[121],"The":[122],"goal":[123],"present":[126],"unified":[128],"self-contained":[130],"roadmap":[131],"SA":[137],"its":[139],"applications,":[140],"especially":[141]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-06-02T00:00:00"}