{"id":"https://openalex.org/W2065241082","doi":"https://doi.org/10.1109/allerton.2014.7028430","title":"Asynchronous incremental block-coordinate descent","display_name":"Asynchronous incremental block-coordinate descent","publication_year":2014,"publication_date":"2014-09-01","ids":{"openalex":"https://openalex.org/W2065241082","doi":"https://doi.org/10.1109/allerton.2014.7028430","mag":"2065241082"},"language":"en","primary_location":{"id":"doi:10.1109/allerton.2014.7028430","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2014.7028430","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-164288","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","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":true,"raw_author_name":"Arda Aytekin","raw_affiliation_strings":["Department of Automatic Control, Royal Institute of Technology (KTH), Stockholm, Sweden","Department of Automatic Control, School of Electrical Engineering and ACCESS Linnaeus Center, Royal Institute of Technology (KTH), SE-100 44 Stockholm, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Automatic Control, Royal Institute of Technology (KTH), Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]},{"raw_affiliation_string":"Department of Automatic Control, School of Electrical Engineering and ACCESS Linnaeus Center, Royal Institute of Technology (KTH), SE-100 44 Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"middle","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":false,"raw_author_name":"Hamid Reza Feyzmahdavian","raw_affiliation_strings":["Department of Automatic Control, Royal Institute of Technology (KTH), Stockholm, Sweden","Department of Automatic Control, School of Electrical Engineering and ACCESS Linnaeus Center, Royal Institute of Technology (KTH), SE-100 44 Stockholm, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Automatic Control, Royal Institute of Technology (KTH), Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]},{"raw_affiliation_string":"Department of Automatic Control, School of Electrical Engineering and ACCESS Linnaeus Center, Royal Institute of Technology (KTH), SE-100 44 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, Royal Institute of Technology (KTH), Stockholm, Sweden","Department of Automatic Control, School of Electrical Engineering and ACCESS Linnaeus Center, Royal Institute of Technology (KTH), SE-100 44 Stockholm, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Automatic Control, Royal Institute of Technology (KTH), Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]},{"raw_affiliation_string":"Department of Automatic Control, School of Electrical Engineering and ACCESS Linnaeus Center, Royal Institute of Technology (KTH), SE-100 44 Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5027754543"],"corresponding_institution_ids":["https://openalex.org/I86987016"],"apc_list":null,"apc_paid":null,"fwci":0.818,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.80905923,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"19","last_page":"24"},"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.9997000098228455,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.992900013923645,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/coordinate-descent","display_name":"Coordinate descent","score":0.8939879536628723},{"id":"https://openalex.org/keywords/convexity","display_name":"Convexity","score":0.6732787489891052},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.6665470004081726},{"id":"https://openalex.org/keywords/lipschitz-continuity","display_name":"Lipschitz continuity","score":0.6392554044723511},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5510979294776917},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48234838247299194},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.46802860498428345},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4639548659324646},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.46232321858406067},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4607888162136078},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.4584907591342926},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.4351784586906433},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4197211265563965},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.19495534896850586},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1134009063243866},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.0856354832649231}],"concepts":[{"id":"https://openalex.org/C157553263","wikidata":"https://www.wikidata.org/wiki/Q5168004","display_name":"Coordinate descent","level":2,"score":0.8939879536628723},{"id":"https://openalex.org/C72134830","wikidata":"https://www.wikidata.org/wiki/Q5166524","display_name":"Convexity","level":2,"score":0.6732787489891052},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.6665470004081726},{"id":"https://openalex.org/C22324862","wikidata":"https://www.wikidata.org/wiki/Q652707","display_name":"Lipschitz continuity","level":2,"score":0.6392554044723511},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5510979294776917},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48234838247299194},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46802860498428345},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4639548659324646},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.46232321858406067},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4607888162136078},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.4584907591342926},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.4351784586906433},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4197211265563965},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.19495534896850586},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1134009063243866},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0856354832649231},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.0},{"id":"https://openalex.org/C106159729","wikidata":"https://www.wikidata.org/wiki/Q2294553","display_name":"Financial economics","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/allerton.2014.7028430","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2014.7028430","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","raw_type":"proceedings-article"},{"id":"pmh:oai:DiVA.org:kth-164288","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-164288","pdf_url":null,"source":{"id":"https://openalex.org/S4306401559","display_name":"KTH Publication Database DiVA (KTH Royal Institute of Technology)","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference paper"}],"best_oa_location":{"id":"pmh:oai:DiVA.org:kth-164288","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-164288","pdf_url":null,"source":{"id":"https://openalex.org/S4306401559","display_name":"KTH Publication Database DiVA (KTH Royal Institute of Technology)","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference paper"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.6499999761581421,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W16591383","https://openalex.org/W1506295250","https://openalex.org/W1574923065","https://openalex.org/W2016937404","https://openalex.org/W2047152541","https://openalex.org/W2095984592","https://openalex.org/W2124541940","https://openalex.org/W2138243089","https://openalex.org/W2951253949","https://openalex.org/W2951781666","https://openalex.org/W2976223356","https://openalex.org/W3141595720","https://openalex.org/W4298191357","https://openalex.org/W6764309476","https://openalex.org/W6768479163"],"related_works":["https://openalex.org/W4243698225","https://openalex.org/W2075869708","https://openalex.org/W4287670495","https://openalex.org/W3084156746","https://openalex.org/W2793948820","https://openalex.org/W4288346661","https://openalex.org/W2947416323","https://openalex.org/W4390176194","https://openalex.org/W2393350255","https://openalex.org/W257189624"],"abstract_inverted_index":{"This":[0],"paper":[1],"studies":[2],"a":[3,8,18,44,59,62,115],"flexible":[4],"algorithm":[5,111,129],"for":[6,134],"minimizing":[7],"sum":[9],"of":[10,14,21,50,70,79,97,147],"component":[11],"functions,":[12],"each":[13,33],"which":[15],"depends":[16],"on":[17,66],"large":[19],"number":[20,49],"decision":[22],"variables.":[23],"Such":[24],"formulations":[25],"appear":[26],"naturally":[27],"in":[28,125],"\u201cbig":[29],"data\u201d":[30],"applications,":[31],"where":[32],"function":[34],"describes":[35],"the":[36,40,48,71,95,110,118,126,148],"loss":[37],"estimated":[38],"using":[39],"data":[41],"available":[42],"at":[43],"specific":[45],"machine,":[46],"and":[47,84,100,139],"features":[51],"under":[52],"consideration":[53],"is":[54,130],"huge.":[55],"In":[56],"our":[57,128],"algorithm,":[58],"coordinator":[60],"updates":[61],"global":[63],"iterate":[64],"based":[65],"delayed":[67,85],"partial":[68,105],"gradients":[69],"individual":[72],"objective":[73],"functions":[74],"with":[75],"respect":[76],"to":[77,114,122],"blocks":[78],"coordinates.":[80],"Delayed":[81],"incremental":[82],"gradient":[83],"coordinate":[86],"descent":[87],"algorithms":[88],"are":[89],"obtained":[90],"as":[91],"special":[92],"cases.":[93],"Under":[94],"assumption":[96],"strong":[98],"convexity":[99],"block":[101],"coordinate-wise":[102],"Lipschitz":[103],"continuous":[104],"gradients,":[106],"we":[107],"show":[108],"that":[109],"converges":[112,133],"linearly":[113],"ball":[116],"around":[117],"optimal":[119],"value.":[120],"Contrary":[121],"related":[123],"proposals":[124],"literature,":[127],"delay-insensitive:":[131],"it":[132],"any":[135],"bounded":[136],"information":[137],"delay,":[138],"its":[140],"step-size":[141],"parameter":[142],"can":[143],"be":[144],"chosen":[145],"independently":[146],"maximum":[149],"delay":[150],"bound.":[151]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}