{"id":"https://openalex.org/W7127977904","doi":"https://doi.org/10.48550/arxiv.2602.05304","title":"A Short and Unified Convergence Analysis of the SAG, SAGA, and IAG Algorithms","display_name":"A Short and Unified Convergence Analysis of the SAG, SAGA, and IAG Algorithms","publication_year":2026,"publication_date":"2026-02-05","ids":{"openalex":"https://openalex.org/W7127977904","doi":"https://doi.org/10.48550/arxiv.2602.05304"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.05304","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5125196781","display_name":"Feng Zhu","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Zhu, Feng","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5125245477","display_name":"Robert W. Heath Jr.","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Heath, Robert W.","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5101651422","display_name":"Aritra Mitra","orcid":"https://orcid.org/0000-0002-0472-284X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mitra, Aritra","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5125196781"],"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.9837999939918518,"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.9837999939918518,"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/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.003100000089034438,"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.0017999999690800905,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6280999779701233},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.5023000240325928},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.47620001435279846},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.4693000018596649},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.43639999628067017},{"id":"https://openalex.org/keywords/lyapunov-function","display_name":"Lyapunov function","score":0.41530001163482666},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.39959999918937683},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.36230000853538513}],"concepts":[{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6280999779701233},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5544000267982483},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.5023000240325928},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.47620001435279846},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47540000081062317},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.4693000018596649},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4503999948501587},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.43639999628067017},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42170000076293945},{"id":"https://openalex.org/C60640748","wikidata":"https://www.wikidata.org/wiki/Q2337858","display_name":"Lyapunov function","level":3,"score":0.41530001163482666},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.39959999918937683},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.36230000853538513},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.35850000381469727},{"id":"https://openalex.org/C8272713","wikidata":"https://www.wikidata.org/wiki/Q176737","display_name":"Stochastic process","level":2,"score":0.3292999863624573},{"id":"https://openalex.org/C95763700","wikidata":"https://www.wikidata.org/wiki/Q578985","display_name":"Convergence of random variables","level":3,"score":0.31679999828338623},{"id":"https://openalex.org/C122268817","wikidata":"https://www.wikidata.org/wiki/Q2020318","display_name":"Frank\u2013Wolfe algorithm","level":5,"score":0.31209999322891235},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.29420000314712524},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.28029999136924744},{"id":"https://openalex.org/C55479107","wikidata":"https://www.wikidata.org/wiki/Q97663916","display_name":"Stochastic approximation","level":3,"score":0.2705000042915344},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.2653999924659729},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.2630999982357025},{"id":"https://openalex.org/C97542219","wikidata":"https://www.wikidata.org/wiki/Q497863","display_name":"SIMPLE algorithm","level":2,"score":0.26190000772476196},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.2572000026702881}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.05304","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.05304","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.05304","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":"article"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2602.05304","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Stochastic":[0,5],"variance-reduced":[1],"algorithms":[2,37],"such":[3,127],"as":[4],"Average":[6],"Gradient":[7,19],"(SAG)":[8],"and":[9,11,70,94,116,134,143,153],"SAGA,":[10,93],"their":[12,31],"deterministic":[13],"counterparts":[14],"like":[15],"the":[16,50,137,167,172],"Incremental":[17],"Aggregated":[18],"(IAG)":[20],"method,":[21],"have":[22],"been":[23],"extensively":[24],"studied":[25],"in":[26],"large-scale":[27],"machine":[28],"learning.":[29],"Despite":[30],"popularity,":[32],"existing":[33],"analyses":[34],"for":[35,126,141,171],"these":[36],"are":[38],"disparate,":[39],"relying":[40],"on":[41,65,106],"different":[42],"proof":[43,52,131],"techniques":[44],"tailored":[45],"to":[46,57,79,88,109,150],"each":[47],"method.":[48],"Furthermore,":[49],"original":[51],"of":[53,160],"SAG":[54,142],"is":[55,78,132],"known":[56,169],"be":[58,147],"notoriously":[59],"involved,":[60],"requiring":[61],"computer-aided":[62],"analysis.":[63],"Focusing":[64],"finite-sum":[66],"optimization":[67],"with":[68],"smooth":[69],"strongly":[71],"convex":[72],"objective":[73],"functions,":[74],"our":[75,161],"main":[76],"contribution":[77],"develop":[80],"a":[81,104,120],"single":[82],"unified":[83],"convergence":[84],"analysis":[85,97,163],"that":[86,124,145],"applies":[87],"all":[89],"three":[90],"algorithms:":[91],"SAG,":[92],"IAG.":[95],"Our":[96],"features":[98],"two":[99],"key":[100],"steps:":[101],"(i)":[102],"establishing":[103],"bound":[105],"delays":[107],"due":[108],"stochastic":[110],"sub-sampling":[111],"using":[112],"simple":[113],"concentration":[114],"tools,":[115],"(ii)":[117],"carefully":[118],"designing":[119],"novel":[121],"Lyapunov":[122],"function":[123],"accounts":[125],"delays.":[128],"The":[129],"resulting":[130],"short":[133],"modular,":[135],"providing":[136],"first":[138],"high-probability":[139],"bounds":[140],"SAGA":[144],"can":[146],"seamlessly":[148],"extended":[149],"non-convex":[151],"objectives":[152],"Markov":[154],"sampling.":[155],"As":[156],"an":[157],"immediate":[158],"byproduct":[159],"new":[162],"technique,":[164],"we":[165],"obtain":[166],"best":[168],"rates":[170],"IAG":[173],"algorithm,":[174],"significantly":[175],"improving":[176],"upon":[177],"prior":[178],"bounds.":[179]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2026-02-07T00:00:00"}