{"id":"https://openalex.org/W2949585412","doi":"https://doi.org/10.1109/tac.2016.2525015","title":"An Asynchronous Mini-Batch Algorithm for Regularized Stochastic Optimization","display_name":"An Asynchronous Mini-Batch Algorithm for Regularized Stochastic Optimization","publication_year":2016,"publication_date":"2016-02-03","ids":{"openalex":"https://openalex.org/W2949585412","doi":"https://doi.org/10.1109/tac.2016.2525015","mag":"2949585412"},"language":"en","primary_location":{"id":"doi:10.1109/tac.2016.2525015","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tac.2016.2525015","pdf_url":null,"source":{"id":"https://openalex.org/S184954342","display_name":"IEEE Transactions on Automatic Control","issn_l":"0018-9286","issn":["0018-9286","1558-2523","2334-3303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automatic Control","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/A5038418293","display_name":"Hamid Reza Feyzmahdavian","orcid":"https://orcid.org/0000-0003-1149-4715"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Hamid Reza Feyzmahdavian","raw_affiliation_strings":["Department of Automatic Control, School of Electrical Engineering and ACCESS Linnaeus Center, Royal Institute of Technology (KTH), Stockholm, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Automatic Control, School of Electrical Engineering and ACCESS Linnaeus Center, Royal Institute of Technology (KTH), Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027754543","display_name":"Arda Aytekin","orcid":"https://orcid.org/0000-0003-1725-2901"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Arda Aytekin","raw_affiliation_strings":["Department of Automatic Control, School of Electrical Engineering and ACCESS Linnaeus Center, Royal Institute of Technology (KTH), Stockholm, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Automatic Control, School of Electrical Engineering and ACCESS Linnaeus Center, Royal Institute of Technology (KTH), Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024256519","display_name":"Mikael Johansson","orcid":"https://orcid.org/0000-0002-2237-2580"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Mikael Johansson","raw_affiliation_strings":["Department of Automatic Control, School of Electrical Engineering and ACCESS Linnaeus Center, Royal Institute of Technology (KTH), Stockholm, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Automatic Control, School of Electrical Engineering and ACCESS Linnaeus Center, Royal Institute of Technology (KTH), Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5038418293"],"corresponding_institution_ids":["https://openalex.org/I86987016"],"apc_list":null,"apc_paid":null,"fwci":14.1397,"has_fulltext":false,"cited_by_count":108,"citation_normalized_percentile":{"value":0.98835688,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"61","issue":"12","first_page":"3740","last_page":"3754"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9998999834060669,"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.9998999834060669,"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.9983999729156494,"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/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.9965000152587891,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.7910840511322021},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6081916689872742},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.5740503668785095},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.5695697665214539},{"id":"https://openalex.org/keywords/asynchrony","display_name":"Asynchrony (computer programming)","score":0.5590925812721252},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5351176261901855},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5331128835678101},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5173291563987732},{"id":"https://openalex.org/keywords/regularization","display_name":"Regularization (linguistics)","score":0.5154760479927063},{"id":"https://openalex.org/keywords/idle","display_name":"Idle","score":0.47177600860595703},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.47114601731300354},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.37626025080680847},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28417059779167175},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.15144413709640503},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.09944328665733337}],"concepts":[{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.7910840511322021},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6081916689872742},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.5740503668785095},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.5695697665214539},{"id":"https://openalex.org/C2779019669","wikidata":"https://www.wikidata.org/wiki/Q25203946","display_name":"Asynchrony (computer programming)","level":3,"score":0.5590925812721252},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5351176261901855},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5331128835678101},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5173291563987732},{"id":"https://openalex.org/C2776135515","wikidata":"https://www.wikidata.org/wiki/Q17143721","display_name":"Regularization (linguistics)","level":2,"score":0.5154760479927063},{"id":"https://openalex.org/C16320812","wikidata":"https://www.wikidata.org/wiki/Q1812200","display_name":"Idle","level":2,"score":0.47177600860595703},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.47114601731300354},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.37626025080680847},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28417059779167175},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.15144413709640503},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.09944328665733337},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tac.2016.2525015","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tac.2016.2525015","pdf_url":null,"source":{"id":"https://openalex.org/S184954342","display_name":"IEEE Transactions on Automatic Control","issn_l":"0018-9286","issn":["0018-9286","1558-2523","2334-3303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automatic Control","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.6299999952316284}],"awards":[],"funders":[{"id":"https://openalex.org/F4320320940","display_name":"Stiftelsen f\u00f6r\u00a0Strategisk Forskning","ror":"https://ror.org/044wr7g58"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":74,"referenced_works":["https://openalex.org/W104095019","https://openalex.org/W130696423","https://openalex.org/W131378802","https://openalex.org/W205960364","https://openalex.org/W1442374986","https://openalex.org/W1480376833","https://openalex.org/W1506295250","https://openalex.org/W1574923065","https://openalex.org/W1594004154","https://openalex.org/W1969095781","https://openalex.org/W1990585910","https://openalex.org/W1992208280","https://openalex.org/W1994616650","https://openalex.org/W1998880679","https://openalex.org/W2016384870","https://openalex.org/W2024484010","https://openalex.org/W2032395696","https://openalex.org/W2045744861","https://openalex.org/W2049469158","https://openalex.org/W2051381803","https://openalex.org/W2060393849","https://openalex.org/W2079482358","https://openalex.org/W2090376964","https://openalex.org/W2096199223","https://openalex.org/W2100007248","https://openalex.org/W2101868363","https://openalex.org/W2105767123","https://openalex.org/W2106901427","https://openalex.org/W2112269233","https://openalex.org/W2122825543","https://openalex.org/W2124541940","https://openalex.org/W2130062883","https://openalex.org/W2133941677","https://openalex.org/W2135046866","https://openalex.org/W2138243089","https://openalex.org/W2140451424","https://openalex.org/W2143021454","https://openalex.org/W2150102617","https://openalex.org/W2154834860","https://openalex.org/W2162287622","https://openalex.org/W2163525955","https://openalex.org/W2166706236","https://openalex.org/W2167302917","https://openalex.org/W2168231600","https://openalex.org/W2168909589","https://openalex.org/W2169713291","https://openalex.org/W2238591594","https://openalex.org/W2787894218","https://openalex.org/W2949198759","https://openalex.org/W2950002113","https://openalex.org/W2950517004","https://openalex.org/W2951306242","https://openalex.org/W2951488730","https://openalex.org/W2951781666","https://openalex.org/W2962720772","https://openalex.org/W2963755123","https://openalex.org/W3000662989","https://openalex.org/W3006097074","https://openalex.org/W3023471860","https://openalex.org/W4229650096","https://openalex.org/W6605426635","https://openalex.org/W6628377381","https://openalex.org/W6674593956","https://openalex.org/W6675069819","https://openalex.org/W6675995183","https://openalex.org/W6676963778","https://openalex.org/W6679314259","https://openalex.org/W6679795937","https://openalex.org/W6680915361","https://openalex.org/W6681283895","https://openalex.org/W6681875376","https://openalex.org/W6684471329","https://openalex.org/W6684859321","https://openalex.org/W6764309476"],"related_works":["https://openalex.org/W4292651679","https://openalex.org/W1489256244","https://openalex.org/W2400034325","https://openalex.org/W2499557797","https://openalex.org/W2985014567","https://openalex.org/W4299515259","https://openalex.org/W2744955408","https://openalex.org/W2022378219","https://openalex.org/W2781354165","https://openalex.org/W4292295567"],"abstract_inverted_index":{"Mini-batch":[0],"optimization":[1,72],"has":[2],"proven":[3],"to":[4,31,56,85],"be":[5,161],"a":[6,105,152,171],"powerful":[7],"paradigm":[8],"for":[9,52,69,113,122],"large-scale":[10],"learning.":[11],"However,":[12],"the":[13,53,98,101,108,119,130,137,142,156],"state-of-the-art":[14],"parallel":[15],"mini-batch":[16,67],"algorithms":[17],"assume":[18],"synchronous":[19,39],"operation":[20],"or":[21,35],"cyclic":[22,41],"update":[23,90],"orders.":[24],"When":[25],"worker":[26],"nodes":[27,55],"are":[28,43,165],"heterogeneous":[29],"(due":[30],"different":[32,36],"computational":[33],"capabilities":[34],"communication":[37],"delays),":[38],"and":[40,82,118,151],"operations":[42],"inefficient":[44],"since":[45],"they":[46],"will":[47],"leave":[48],"workers":[49,84,159],"idle":[50,80],"waiting":[51,81],"slower":[54],"complete":[57],"their":[58,88],"computations.":[59],"In":[60,134],"this":[61],"paper,":[62],"we":[63],"propose":[64],"an":[65],"asynchronous":[66],"algorithm":[68,102,147],"regularized":[70],"stochastic":[71],"problems":[73],"with":[74],"smooth":[75],"loss":[76],"functions":[77],"that":[78,94],"eliminates":[79],"allows":[83],"run":[86],"at":[87],"maximal":[89],"rates.":[91],"We":[92],"show":[93],"by":[95],"suitably":[96],"choosing":[97],"step-size":[99],"values,":[100],"\u221a":[103],"achieves":[104],"rate":[106,120,144],"of":[107,132,139,145,158],"order":[109],"O(1/":[110],"T":[111,128],")":[112],"general":[114],"convex":[115,124],"regularization":[116,125],"functions,":[117,126],"O(1/T)":[121],"strongly":[123],"where":[127],"is":[129,148],"number":[131,157],"iterations.":[133],"both":[135],"cases,":[136],"impact":[138],"asynchrony":[140],"on":[141,170],"convergence":[143],"our":[146],"asymptotically":[149],"negligible,":[150],"near-linear":[153],"speed-up":[154],"in":[155,167],"can":[160],"expected.":[162],"Theoretical":[163],"results":[164],"confirmed":[166],"real":[168],"implementations":[169],"distributed":[172],"computing":[173],"infrastructure.":[174]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":15},{"year":2022,"cited_by_count":10},{"year":2021,"cited_by_count":23},{"year":2020,"cited_by_count":13},{"year":2019,"cited_by_count":10},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}