{"id":"https://openalex.org/W2920766117","doi":"https://doi.org/10.1109/globalsip.2018.8646525","title":"PROVABLY COMMUNICATION-EFFICIENT ASYNCHRONOUS DISTRIBUTED INFERENCE FOR CONVEX AND NONCONVEX PROBLEMS","display_name":"PROVABLY COMMUNICATION-EFFICIENT ASYNCHRONOUS DISTRIBUTED INFERENCE FOR CONVEX AND NONCONVEX PROBLEMS","publication_year":2018,"publication_date":"2018-11-01","ids":{"openalex":"https://openalex.org/W2920766117","doi":"https://doi.org/10.1109/globalsip.2018.8646525","mag":"2920766117"},"language":"en","primary_location":{"id":"doi:10.1109/globalsip.2018.8646525","is_oa":false,"landing_page_url":"https://doi.org/10.1109/globalsip.2018.8646525","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","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/A5101405882","display_name":"Jineng Ren","orcid":"https://orcid.org/0000-0003-0174-9366"},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]},{"id":"https://openalex.org/I4210101327","display_name":"Twin Cities Orthopedics","ror":"https://ror.org/01en4s460","country_code":"US","type":"healthcare","lineage":["https://openalex.org/I4210101327"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jineng Ren","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Minnesota Twin Cities"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Minnesota Twin Cities","institution_ids":["https://openalex.org/I130238516","https://openalex.org/I4210101327"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011305900","display_name":"Jarvis Haupt","orcid":"https://orcid.org/0000-0002-1570-7071"},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]},{"id":"https://openalex.org/I4210101327","display_name":"Twin Cities Orthopedics","ror":"https://ror.org/01en4s460","country_code":"US","type":"healthcare","lineage":["https://openalex.org/I4210101327"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jarvis Haupt","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Minnesota Twin Cities"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Minnesota Twin Cities","institution_ids":["https://openalex.org/I130238516","https://openalex.org/I4210101327"]}]}],"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":"23","issue":null,"first_page":"638","last_page":"642"},"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.9998000264167786,"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.9998000264167786,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9998000264167786,"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/T10080","display_name":"Energy Efficient Wireless Sensor Networks","score":0.9947999715805054,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.7902592420578003},{"id":"https://openalex.org/keywords/convexity","display_name":"Convexity","score":0.7725600004196167},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.6946070194244385},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6586829423904419},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.6270232200622559},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5757300853729248},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.5474281311035156},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.500117301940918},{"id":"https://openalex.org/keywords/inference","display_name":"Inference","score":0.4921519160270691},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.48432695865631104},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.4202438294887543},{"id":"https://openalex.org/keywords/empirical-risk-minimization","display_name":"Empirical risk minimization","score":0.41755953431129456},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.41219669580459595},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.3560381233692169},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33330100774765015},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23205429315567017},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.19333946704864502}],"concepts":[{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.7902592420578003},{"id":"https://openalex.org/C72134830","wikidata":"https://www.wikidata.org/wiki/Q5166524","display_name":"Convexity","level":2,"score":0.7725600004196167},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.6946070194244385},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6586829423904419},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.6270232200622559},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5757300853729248},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.5474281311035156},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.500117301940918},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.4921519160270691},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.48432695865631104},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.4202438294887543},{"id":"https://openalex.org/C107321475","wikidata":"https://www.wikidata.org/wiki/Q5374254","display_name":"Empirical risk minimization","level":2,"score":0.41755953431129456},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.41219669580459595},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3560381233692169},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33330100774765015},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23205429315567017},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19333946704864502},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"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/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/globalsip.2018.8646525","is_oa":false,"landing_page_url":"https://doi.org/10.1109/globalsip.2018.8646525","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W1518479949","https://openalex.org/W1574923065","https://openalex.org/W1603765807","https://openalex.org/W2044207982","https://openalex.org/W2049469158","https://openalex.org/W2078831169","https://openalex.org/W2112274848","https://openalex.org/W2114643899","https://openalex.org/W2117412539","https://openalex.org/W2127941149","https://openalex.org/W2129375853","https://openalex.org/W2138243089","https://openalex.org/W2154834860","https://openalex.org/W2155723734","https://openalex.org/W2159857890","https://openalex.org/W2164278908","https://openalex.org/W2235185944","https://openalex.org/W2295652899","https://openalex.org/W2395344476","https://openalex.org/W2475736732","https://openalex.org/W2553629933","https://openalex.org/W2569020760","https://openalex.org/W2571425027","https://openalex.org/W2791738856","https://openalex.org/W2962696932","https://openalex.org/W2962897077","https://openalex.org/W2964166170","https://openalex.org/W4292363360","https://openalex.org/W4300843330","https://openalex.org/W4301376094","https://openalex.org/W6631132026","https://openalex.org/W6662929504","https://openalex.org/W6676759488","https://openalex.org/W6677418025","https://openalex.org/W6679154944","https://openalex.org/W6680402377","https://openalex.org/W6690024855","https://openalex.org/W6711649141","https://openalex.org/W6729806161"],"related_works":["https://openalex.org/W90906771","https://openalex.org/W2018828772","https://openalex.org/W257189624","https://openalex.org/W2149119057","https://openalex.org/W2393350255","https://openalex.org/W4390176194","https://openalex.org/W2985979428","https://openalex.org/W2510140549","https://openalex.org/W2187449906","https://openalex.org/W2962818859"],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"and":[3,18,40],"analyzes":[4],"an":[5],"asynchronous":[6],"communication-efficient":[7],"distributed":[8],"optimization":[9],"framework":[10],"for":[11,81],"a":[12,30,41,45,62,87],"general":[13],"type":[14],"of":[15,29,68,91,95,110,126],"machine":[16,43],"learning":[17],"signal":[19],"processing":[20],"problems.":[21,84],"At":[22],"each":[23],"iteration,":[24],"worker":[25],"machines":[26],"compute":[27],"gradients":[28],"known":[31],"empirical":[32],"loss":[33,97],"function":[34],"using":[35],"their":[36],"own":[37],"local":[38],"data,":[39],"master":[42],"solves":[44],"related":[46],"minimization":[47],"problem":[48],"to":[49],"update":[50],"the":[51,57,66,73,92,96,108,111],"current":[52],"estimate.":[53],"We":[54],"establish":[55],"that":[56,77,107],"proposed":[58,112],"algorithm":[59],"converges":[60],"with":[61,72],"sublinear":[63],"rate":[64,76],"over":[65,120],"number":[67],"communication":[69,128],"rounds,":[70],"coinciding":[71],"best":[74],"theoretical":[75],"can":[78],"be":[79],"achieved":[80],"nonconvex":[82],"nonsmooth":[83],"Moreover,":[85],"under":[86],"strong":[88],"convexity":[89],"assumption":[90],"smooth":[93],"part":[94],"function,":[98],"linear":[99],"convergence":[100],"is":[101],"established.":[102],"Extensive":[103],"numerical":[104],"experiments":[105],"show":[106],"performance":[109],"approach":[113],"indeed":[114],"improves":[115],"-":[116,119],"sometimes":[117],"significantly":[118],"other":[121],"state-of-the-art":[122],"algorithms":[123],"in":[124],"terms":[125],"total":[127],"efficiency.":[129]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}