{"id":"https://openalex.org/W7213412478","doi":"https://doi.org/10.48550/arxiv.2609.17483","title":"Bridging the Gap Between Homogeneous and Heterogeneous Asynchronous Optimization Is Surprisingly Difficult","display_name":"Bridging the Gap Between Homogeneous and Heterogeneous Asynchronous Optimization Is Surprisingly Difficult","publication_year":2026,"publication_date":"2026-09-15","ids":{"openalex":"https://openalex.org/W7213412478","doi":"https://doi.org/10.48550/arxiv.2609.17483"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2609.17483","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.17483","pdf_url":"https://arxiv.org/pdf/2609.17483","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2609.17483","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5135847823","display_name":"Alexander Tyurin","orcid":"https://orcid.org/0000-0003-4963-8227","observed_orcids":["https://orcid.org/0000-0003-4963-8227"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Tyurin, Alexander","raw_affiliation_strings":["AXXX , Moscow , Russia Applied AI Institute , Moscow , Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"AXXX , Moscow , Russia Applied AI Institute , Moscow , Russia","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5135847823"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"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.9994999766349792,"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.9994999766349792,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.00019999999494757503,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"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/T12535","display_name":"Machine Learning and Data Classification","score":0.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"}}],"keywords":[{"id":"https://openalex.org/keywords/asynchronous-optimization","display_name":"asynchronous optimization","score":0.7590000033378601},{"id":"https://openalex.org/keywords/distributed-stochastic-gradient-descent","display_name":"distributed stochastic gradient descent","score":0.7210000157356262},{"id":"https://openalex.org/keywords/heterogeneous-data-distributions","display_name":"heterogeneous data distributions","score":0.7480000257492065},{"id":"https://openalex.org/keywords/time-complexity-bounds","display_name":"time complexity bounds","score":0.7599999904632568},{"id":"https://openalex.org/keywords/polyak-lojasiewicz-condition","display_name":"Polyak-Lojasiewicz condition","score":0.9919999837875366},{"id":"https://openalex.org/keywords/randomized-algorithms","display_name":"randomized algorithms","score":0.5329999923706055}],"concepts":[{"id":"https://openalex.org/C174348530","wikidata":"https://www.wikidata.org/wiki/Q188635","display_name":"Bridging (networking)","level":2,"score":0.7688999772071838},{"id":"https://openalex.org/C66882249","wikidata":"https://www.wikidata.org/wiki/Q169336","display_name":"Homogeneous","level":2,"score":0.7114999890327454},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6233000159263611},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5776000022888184},{"id":"https://openalex.org/C137800194","wikidata":"https://www.wikidata.org/wiki/Q11713455","display_name":"Interpolation (computer graphics)","level":3,"score":0.5770999789237976},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.5242999792098999},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4242999851703644},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.41600000858306885},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3781000077724457},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36480000615119934},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3431999981403351},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.3384000062942505},{"id":"https://openalex.org/C103278499","wikidata":"https://www.wikidata.org/wiki/Q254465","display_name":"Similarity (geometry)","level":3,"score":0.30160000920295715},{"id":"https://openalex.org/C149629883","wikidata":"https://www.wikidata.org/wiki/Q660926","display_name":"Fraction (chemistry)","level":2,"score":0.27059999108314514},{"id":"https://openalex.org/C46686674","wikidata":"https://www.wikidata.org/wiki/Q466303","display_name":"Boosting (machine learning)","level":2,"score":0.2648000121116638},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.260699987411499},{"id":"https://openalex.org/C188198153","wikidata":"https://www.wikidata.org/wiki/Q1613840","display_name":"Limiting","level":2,"score":0.2551000118255615}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2609.17483","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.17483","pdf_url":"https://arxiv.org/pdf/2609.17483","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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"},{"id":"doi:10.48550/arxiv.2609.17483","doi":"https://doi.org/10.48550/arxiv.2609.17483","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2609.17483","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2609.17483","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.17483","pdf_url":"https://arxiv.org/pdf/2609.17483","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7213412478.pdf","grobid_xml":"https://content.openalex.org/works/W7213412478.grobid-xml"},"referenced_works_count":5,"referenced_works":["https://openalex.org/W2535838896","https://openalex.org/W2622263826","https://openalex.org/W2962950660","https://openalex.org/W4226396810","https://openalex.org/W7037841583"],"related_works":["https://openalex.org/W7116093948","https://openalex.org/W7083816441","https://openalex.org/W4415797622","https://openalex.org/W4406890349","https://openalex.org/W6966754108","https://openalex.org/W4415795195","https://openalex.org/W7164932511","https://openalex.org/W7127649507","https://openalex.org/W7161180701","https://openalex.org/W2202546323"],"abstract_inverted_index":{"Modern":[0],"large-scale":[1],"machine":[2],"learning":[3],"tasks":[4],"often":[5],"require":[6],"multiple":[7],"workers,":[8],"devices,":[9],"CPUs,":[10],"or":[11],"GPUs":[12],"to":[13,21,41,119,150],"compute":[14],"stochastic":[15],"gradients":[16],"in":[17,63,75,165,169],"parallel":[18],"and":[19,46,108,123,145],"asynchronously":[20],"train":[22],"model":[23],"weights.":[24],"Theoretical":[25],"results":[26],"typically":[27],"distinguish":[28],"between":[29],"two":[30],"settings:":[31],"(i)":[32],"the":[33,42,48,76,120,126,146,159,166,170],"homogeneous":[34,171],"setting,":[35,50,172],"where":[36,51],"all":[37],"workers":[38],"have":[39],"access":[40],"same":[43],"data":[44,57,176],"distribution,":[45],"(ii)":[47],"heterogeneous":[49,77],"each":[52],"worker":[53,162],"operates":[54],"on":[55,161],"different":[56,94],"distributions.":[58,177],"Known":[59],"optimal":[60,87],"time":[61,88,154],"complexities":[62,89],"these":[64,85],"settings":[65],"reveal":[66],"a":[67,137,152],"significant":[68],"gap,":[69],"with":[70],"far":[71],"more":[72],"pessimistic":[73,86],"guarantees":[74],"case.":[78],"In":[79],"this":[80],"work,":[81],"we":[82,97,135],"investigate":[83],"whether":[84],"can":[90],"be":[91],"overcome":[92],"under":[93,104],"assumptions.":[95],"Surprisingly,":[96],"show":[98],"that":[99,125,157],"improvement":[100],"is":[101,131],"provably":[102],"impossible":[103],"widely":[105],"used":[106],"first-":[107],"second-order":[109],"similarity":[110],"assumptions":[111],"for":[112],"any":[113],"randomized":[114],"algorithm.":[115],"We":[116],"then":[117],"turn":[118],"interpolation":[121,128,144],"regime":[122],"demonstrate":[124],"weak":[127],"assumption":[129],"alone":[130],"also":[132],"insufficient.":[133],"Finally,":[134],"introduce":[136],"minimal":[138],"combination":[139],"of":[140],"irreducible":[141],"assumptions,":[142],"strong":[143],"local":[147],"Polyak-Lojasiewicz":[148],"condition,":[149],"derive":[151],"new":[153],"complexity":[155],"bound":[156],"matches":[158],"dependence":[160],"computation":[163],"times":[164],"best-known":[167],"result":[168],"without":[173],"requiring":[174],"identical":[175]},"counts_by_year":[],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2026-09-17T00:00:00"}
