{"id":"https://openalex.org/W4372268260","doi":"https://doi.org/10.1109/icassp49357.2023.10094584","title":"Accelerated Distributed Stochastic Non-Convex Optimization over Time-Varying Directed Networks","display_name":"Accelerated Distributed Stochastic Non-Convex Optimization over Time-Varying Directed Networks","publication_year":2023,"publication_date":"2023-05-05","ids":{"openalex":"https://openalex.org/W4372268260","doi":"https://doi.org/10.1109/icassp49357.2023.10094584"},"language":"en","primary_location":{"id":"doi:10.1109/icassp49357.2023.10094584","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp49357.2023.10094584","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICASSP 2023 - 2023 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5010018937","display_name":"Yiyue Chen","orcid":"https://orcid.org/0000-0001-5578-121X"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yiyue Chen","raw_affiliation_strings":["The University of Texas of Austin"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of Texas of Austin","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036900440","display_name":"Abolfazl Hashemi","orcid":"https://orcid.org/0000-0002-8421-4270"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Abolfazl Hashemi","raw_affiliation_strings":["Purdue University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Purdue University","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067602750","display_name":"Haris Vikalo","orcid":"https://orcid.org/0000-0002-7945-4114"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Haris Vikalo","raw_affiliation_strings":["The University of Texas of Austin"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of Texas of Austin","institution_ids":["https://openalex.org/I86519309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9991999864578247,"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"}},"topics":[{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9991999864578247,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9983999729156494,"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/oracle","display_name":"Oracle","score":0.814883291721344},{"id":"https://openalex.org/keywords/stochastic-gradient-descent","display_name":"Stochastic gradient descent","score":0.694534957408905},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6741937398910522},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.6598577499389648},{"id":"https://openalex.org/keywords/stochastic-optimization","display_name":"Stochastic optimization","score":0.5711469650268555},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.5192354321479797},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5118147730827332},{"id":"https://openalex.org/keywords/acceleration","display_name":"Acceleration","score":0.5020179748535156},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.49452969431877136},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.4803503751754761},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4347647726535797},{"id":"https://openalex.org/keywords/stochastic-neural-network","display_name":"Stochastic neural network","score":0.4164019227027893},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.41544878482818604},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26820123195648193},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22554835677146912},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.20997169613838196},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12371683120727539},{"id":"https://openalex.org/keywords/recurrent-neural-network","display_name":"Recurrent neural network","score":0.11863389611244202}],"concepts":[{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.814883291721344},{"id":"https://openalex.org/C206688291","wikidata":"https://www.wikidata.org/wiki/Q7617819","display_name":"Stochastic gradient descent","level":3,"score":0.694534957408905},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6741937398910522},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.6598577499389648},{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.5711469650268555},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.5192354321479797},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5118147730827332},{"id":"https://openalex.org/C117896860","wikidata":"https://www.wikidata.org/wiki/Q11376","display_name":"Acceleration","level":2,"score":0.5020179748535156},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.49452969431877136},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.4803503751754761},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4347647726535797},{"id":"https://openalex.org/C86582703","wikidata":"https://www.wikidata.org/wiki/Q7617824","display_name":"Stochastic neural network","level":4,"score":0.4164019227027893},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.41544878482818604},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26820123195648193},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22554835677146912},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.20997169613838196},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12371683120727539},{"id":"https://openalex.org/C147168706","wikidata":"https://www.wikidata.org/wiki/Q1457734","display_name":"Recurrent neural network","level":3,"score":0.11863389611244202},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.0},{"id":"https://openalex.org/C74650414","wikidata":"https://www.wikidata.org/wiki/Q11397","display_name":"Classical mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icassp49357.2023.10094584","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp49357.2023.10094584","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICASSP 2023 - 2023 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W114517082","https://openalex.org/W1984884414","https://openalex.org/W2044212084","https://openalex.org/W2137435346","https://openalex.org/W2147800946","https://openalex.org/W2163605009","https://openalex.org/W2810882972","https://openalex.org/W2896457183","https://openalex.org/W2914057340","https://openalex.org/W2963156126","https://openalex.org/W2963649943","https://openalex.org/W2970623506","https://openalex.org/W3007090074","https://openalex.org/W3023944502","https://openalex.org/W3035647850","https://openalex.org/W3047043330","https://openalex.org/W3121161630","https://openalex.org/W3162760367","https://openalex.org/W3172409312","https://openalex.org/W4206372917","https://openalex.org/W4299802343","https://openalex.org/W4301602261","https://openalex.org/W6684191040","https://openalex.org/W6753122105","https://openalex.org/W6755207826","https://openalex.org/W6756976665","https://openalex.org/W6759119893","https://openalex.org/W6763249885","https://openalex.org/W6779587744","https://openalex.org/W6791042152","https://openalex.org/W6791122150"],"related_works":["https://openalex.org/W4206903459","https://openalex.org/W2754816816","https://openalex.org/W4366280654","https://openalex.org/W3160167280","https://openalex.org/W4231621013","https://openalex.org/W4362706668","https://openalex.org/W3008318776","https://openalex.org/W4286899070","https://openalex.org/W3109737792","https://openalex.org/W3150057971"],"abstract_inverted_index":{"We":[0,68,89],"study":[1],"non-convex":[2,73],"optimization":[3,74],"problems":[4,75],"where":[5],"the":[6,23,52,101,105,119],"data":[7],"is":[8,28,108],"distributed":[9],"across":[10],"nodes":[11,27],"of":[12,104,118,131],"a":[13,47,64,129],"time-varying":[14],"directed":[15],"network;":[16],"this":[17],"describes":[18],"dynamic":[19,94],"settings":[20,78],"in":[21,76,128],"which":[22,38],"communication":[24],"between":[25],"network":[26,36,95],"affected":[29],"by":[30,56,92],"delays":[31],"or":[32],"link":[33],"failures.":[34],"The":[35,113],"nodes,":[37],"can":[39],"access":[40],"only":[41],"their":[42,60],"local":[43],"objectives":[44],"and":[45,86],"query":[46],"stochastic":[48,81],"first-order":[49],"oracle":[50,102],"for":[51,72],"gradient":[53,82,87,98],"estimates,":[54],"collaborate":[55],"exchanging":[57],"messages":[58],"with":[59,84,97],"neighbors":[61],"to":[62,123],"minimize":[63],"global":[65],"objective":[66],"function.":[67],"propose":[69],"an":[70],"algorithm":[71,107],"such":[77],"that":[79,100],"leverages":[80],"descent":[83],"momentum":[85],"tracking.":[88],"further":[90],"prove,":[91],"analyzing":[93],"systems":[96],"acceleration,":[99],"complexity":[103],"proposed":[106,120],"$\\mathcal{O}\\left(":[109],"{1/{\\varepsilon":[110],"^{1.5}}}":[111],"\\right)$.":[112],"results":[114],"demonstrate":[115],"superior":[116],"performance":[117],"framework":[121],"compared":[122],"state-of-the-art":[124],"related":[125],"methods":[126],"used":[127],"variety":[130],"machine":[132],"learning":[133],"tasks.":[134]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}