{"id":"https://openalex.org/W2276974598","doi":"https://doi.org/10.1137/15m1049695","title":"On the Convergence Rate of Incremental Aggregated Gradient Algorithms","display_name":"On the Convergence Rate of Incremental Aggregated Gradient Algorithms","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2276974598","doi":"https://doi.org/10.1137/15m1049695","mag":"2276974598"},"language":"en","primary_location":{"id":"doi:10.1137/15m1049695","is_oa":false,"landing_page_url":"https://doi.org/10.1137/15m1049695","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":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1506.02081","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"M. G\u00fcrb\u00fczbalaban","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"M. G\u00fcrb\u00fczbalaban","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"A. Ozdaglar","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"A. Ozdaglar","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"P. A. Parrilo","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"P. A. Parrilo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.4022,"has_fulltext":false,"cited_by_count":78,"citation_normalized_percentile":{"value":0.97116374,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"27","issue":"2","first_page":"1035","last_page":"1048"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.982699990272522,"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.982699990272522,"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.006399999838322401,"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.003800000064074993,"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/rate-of-convergence","display_name":"Rate of convergence","score":0.6833999752998352},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.6412000060081482},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6236000061035156},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4814999997615814},{"id":"https://openalex.org/keywords/lyapunov-function","display_name":"Lyapunov function","score":0.4672999978065491},{"id":"https://openalex.org/keywords/gradient-method","display_name":"Gradient method","score":0.396699994802475}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7081000208854675},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.6833999752998352},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.6412000060081482},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6236000061035156},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4814999997615814},{"id":"https://openalex.org/C60640748","wikidata":"https://www.wikidata.org/wiki/Q2337858","display_name":"Lyapunov function","level":3,"score":0.4672999978065491},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4607999920845032},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4503999948501587},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.396699994802475},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.382099986076355},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.3345000147819519},{"id":"https://openalex.org/C2778937211","wikidata":"https://www.wikidata.org/wiki/Q486598","display_name":"Quicksort","level":4,"score":0.3151000142097473},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.2937999963760376},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.27140000462532043},{"id":"https://openalex.org/C122268817","wikidata":"https://www.wikidata.org/wiki/Q2020318","display_name":"Frank\u2013Wolfe algorithm","level":5,"score":0.2587999999523163},{"id":"https://openalex.org/C60718061","wikidata":"https://www.wikidata.org/wiki/Q1414747","display_name":"Momentum (technical analysis)","level":2,"score":0.25609999895095825}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/15m1049695","is_oa":false,"landing_page_url":"https://doi.org/10.1137/15m1049695","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"},{"id":"pmh:oai:arXiv.org:1506.02081","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1506.02081","pdf_url":"https://arxiv.org/pdf/1506.02081","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1506.02081","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1506.02081","pdf_url":"https://arxiv.org/pdf/1506.02081","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8042784503","display_name":null,"funder_award_id":"ONR Basic Research Challenge No. N000141210997","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"},{"id":"https://openalex.org/G8828279617","display_name":null,"funder_award_id":"AFOSR MURI FA9550-09-1-0538","funder_id":"https://openalex.org/F4320338279","funder_display_name":"Air Force Office of Scientific Research"}],"funders":[{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"},{"id":"https://openalex.org/F4320338279","display_name":"Air Force Office of Scientific Research","ror":"https://ror.org/011e9bt93"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1562505150","https://openalex.org/W1988795359","https://openalex.org/W2010315937","https://openalex.org/W2017938640","https://openalex.org/W2061863621","https://openalex.org/W2095531095","https://openalex.org/W2101159990","https://openalex.org/W2113372738","https://openalex.org/W2221583060"],"related_works":[],"abstract_inverted_index":{"Motivated":[0],"by":[1],"applications":[2],"to":[3,58,81],"distributed":[4],"optimization":[5],"over":[6],"networks":[7],"and":[8,50,109,123,146],"large-scale":[9],"data":[10],"processing":[11],"in":[12,46,65,78,84],"machine":[13],"learning,":[14],"we":[15,99,110],"analyze":[16],"the":[17,32,40,79,88,93,112,143,148],"deterministic":[18,48,103],"incremental":[19],"aggregated":[20,119],"gradient":[21,56],"method":[22,38,120],"for":[23],"minimizing":[24],"a":[25,44,47,52,132,136],"finite":[26],"sum":[27,33],"of":[28,54,87,135],"smooth":[29],"functions":[30,41],"where":[31],"is":[34],"strongly":[35],"convex.":[36],"This":[37],"processes":[39],"one":[42],"at":[43],"time":[45],"order":[49],"incorporates":[51],"memory":[53],"previous":[55],"values":[57],"accelerate":[59],"convergence.":[60,127],"Empirically":[61],"it":[62],"performs":[63],"well":[64],"practice;":[66],"however,":[67],"no":[68],"theoretical":[69],"analysis":[70],"with":[71,121],"explicit":[72],"rate":[73],"results":[74],"was":[75],"previously":[76],"given":[77],"literature":[80],"our":[82],"knowledge,":[83],"particular":[85],"most":[86],"recent":[89],"efforts":[90],"concentrated":[91],"on":[92,131],"randomized":[94],"versions.":[95],"In":[96],"this":[97,102],"paper,":[98],"show":[100],"that":[101,139],"algorithm":[104],"has":[105],"global":[106],"linear":[107,126],"convergence":[108,113],"characterize":[111],"rate.":[114],"We":[115],"also":[116],"consider":[117],"an":[118],"momentum":[122],"demonstrate":[124],"its":[125],"Our":[128],"proofs":[129,149],"rely":[130],"careful":[133],"choice":[134],"Lyapunov":[137],"function":[138],"offers":[140],"insight":[141],"into":[142],"algorithm's":[144],"behavior":[145],"simplifies":[147],"considerably.":[150]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":15},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":12},{"year":2020,"cited_by_count":14},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":2}],"updated_date":"2026-06-17T08:01:34.144755","created_date":"2016-06-24T00:00:00"}