{"id":"https://openalex.org/W4415707057","doi":"https://doi.org/10.1109/lcsys.2025.3627045","title":"Toward <i>O</i> (log(1/\u03f5)/\u03f5) Computational Complexity for PL Functions in Decentralized Stochastic Optimization With Communication Noise","display_name":"Toward <i>O</i> (log(1/\u03f5)/\u03f5) Computational Complexity for PL Functions in Decentralized Stochastic Optimization With Communication Noise","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4415707057","doi":"https://doi.org/10.1109/lcsys.2025.3627045"},"language":null,"primary_location":{"id":"doi:10.1109/lcsys.2025.3627045","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcsys.2025.3627045","pdf_url":null,"source":{"id":"https://openalex.org/S4306422535","display_name":"IEEE Control Systems Letters","issn_l":"2475-1456","issn":["2475-1456"],"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 Control Systems Letters","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":null,"display_name":"Soham Mukherjee","orcid":"https://orcid.org/0009-0009-7668-2814"},"institutions":[{"id":"https://openalex.org/I145894827","display_name":"Indian Institute of Technology Kharagpur","ror":"https://ror.org/03w5sq511","country_code":"IN","type":"education","lineage":["https://openalex.org/I145894827"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Soham Mukherjee","raw_affiliation_strings":["Electronics and Electrical Communication Engineering Department, Indian Institute of Technology Kharagpur, Kharagpur, India","Indian Institute of Technology Kharagpur, India"],"raw_orcid":"https://orcid.org/0009-0009-7668-2814","affiliations":[{"raw_affiliation_string":"Electronics and Electrical Communication Engineering Department, Indian Institute of Technology Kharagpur, Kharagpur, India","institution_ids":["https://openalex.org/I145894827"]},{"raw_affiliation_string":"Indian Institute of Technology Kharagpur, India","institution_ids":["https://openalex.org/I145894827"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072872028","display_name":"Mrityunjoy Chakraborty","orcid":"https://orcid.org/0000-0003-4009-9554"},"institutions":[{"id":"https://openalex.org/I145894827","display_name":"Indian Institute of Technology Kharagpur","ror":"https://ror.org/03w5sq511","country_code":"IN","type":"education","lineage":["https://openalex.org/I145894827"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Mrityunjoy Chakraborty","raw_affiliation_strings":["Electronics and Electrical Communication Engineering Department, Indian Institute of Technology Kharagpur, Kharagpur, India","Indian Institute of Technology Kharagpur, India"],"raw_orcid":"https://orcid.org/0000-0003-4009-9554","affiliations":[{"raw_affiliation_string":"Electronics and Electrical Communication Engineering Department, Indian Institute of Technology Kharagpur, Kharagpur, India","institution_ids":["https://openalex.org/I145894827"]},{"raw_affiliation_string":"Indian Institute of Technology Kharagpur, India","institution_ids":["https://openalex.org/I145894827"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.32742551,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"9","issue":null,"first_page":"2477","last_page":"2482"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.41269999742507935,"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"}},"topics":[{"id":"https://openalex.org/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.41269999742507935,"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.11460000276565552,"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/T11413","display_name":"Risk and Portfolio Optimization","score":0.05640000104904175,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.6812000274658203},{"id":"https://openalex.org/keywords/smoothness","display_name":"Smoothness","score":0.6722999811172485},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.642799973487854},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6175000071525574},{"id":"https://openalex.org/keywords/stochastic-optimization","display_name":"Stochastic optimization","score":0.5016000270843506},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.4936000108718872},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4571000039577484},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.44929999113082886},{"id":"https://openalex.org/keywords/noise","display_name":"Noise (video)","score":0.43700000643730164}],"concepts":[{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.6812000274658203},{"id":"https://openalex.org/C102634674","wikidata":"https://www.wikidata.org/wiki/Q868473","display_name":"Smoothness","level":2,"score":0.6722999811172485},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.642799973487854},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6175000071525574},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5702999830245972},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5455999970436096},{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.5016000270843506},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.4936000108718872},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4571000039577484},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.44929999113082886},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.43700000643730164},{"id":"https://openalex.org/C206688291","wikidata":"https://www.wikidata.org/wiki/Q7617819","display_name":"Stochastic gradient descent","level":3,"score":0.43540000915527344},{"id":"https://openalex.org/C55479107","wikidata":"https://www.wikidata.org/wiki/Q97663916","display_name":"Stochastic approximation","level":3,"score":0.38929998874664307},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38749998807907104},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35929998755455017},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3222000002861023},{"id":"https://openalex.org/C8272713","wikidata":"https://www.wikidata.org/wiki/Q176737","display_name":"Stochastic process","level":2,"score":0.305400013923645},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.30000001192092896},{"id":"https://openalex.org/C192126672","wikidata":"https://www.wikidata.org/wiki/Q1068715","display_name":"Telecommunications network","level":2,"score":0.2955000102519989},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.2863999903202057},{"id":"https://openalex.org/C127491075","wikidata":"https://www.wikidata.org/wiki/Q7617825","display_name":"Stochastic modelling","level":2,"score":0.26499998569488525},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.26260000467300415},{"id":"https://openalex.org/C66024118","wikidata":"https://www.wikidata.org/wiki/Q1122506","display_name":"Computational model","level":2,"score":0.26030001044273376},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.25839999318122864},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.2556000053882599},{"id":"https://openalex.org/C29265498","wikidata":"https://www.wikidata.org/wiki/Q7047719","display_name":"Noise measurement","level":3,"score":0.2556000053882599},{"id":"https://openalex.org/C101765175","wikidata":"https://www.wikidata.org/wiki/Q577764","display_name":"Communications system","level":2,"score":0.2540000081062317}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lcsys.2025.3627045","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcsys.2025.3627045","pdf_url":null,"source":{"id":"https://openalex.org/S4306422535","display_name":"IEEE Control Systems Letters","issn_l":"2475-1456","issn":["2475-1456"],"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 Control Systems Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320671","display_name":"National Research Foundation","ror":"https://ror.org/05s0g1g46"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W2155723880","https://openalex.org/W2763533254","https://openalex.org/W2963248893","https://openalex.org/W2965142130","https://openalex.org/W3038283795","https://openalex.org/W3119622507","https://openalex.org/W3170805044","https://openalex.org/W4226038297","https://openalex.org/W4226124631","https://openalex.org/W4298352039","https://openalex.org/W4312919720","https://openalex.org/W4372037445","https://openalex.org/W4407246729"],"related_works":[],"abstract_inverted_index":{"A":[0,205],"decentralized":[1],"stochastic":[2,150],"optimization":[3],"problem":[4,156],"is":[5,98,114,131,172,188,208],"considered,":[6],"in":[7,27,33,61,79,100,110,123,195],"which":[8,187,198],"a":[9,20,30,67],"network":[10],"of":[11,149,182],"nodes":[12],"collaborate":[13],"over":[14,118],"noisy":[15],"communication":[16,185],"links":[17],"to":[18,43,64,81,91,102,133,159,202],"minimize":[19],"global":[21],"objective":[22],"function.":[23],"Recently,":[24],"the":[25,34,56,76,84,94,103,111,119,127,137,142,147,154,168,176,180,192],"authors":[26],"tcns":[28,80],"incorporated":[29],"skipping":[31,52],"technique":[32,53],"Noisy":[35],"Consensus":[36],"+":[37],"Stochastic":[38],"Gradient":[39],"Descent":[40],"(SGD)":[41],"framework":[42],"address":[44],"this":[45,72],"problem,":[46],"and":[47,140,184],"showed":[48],"that":[49],"their":[50],"proposed":[51,78],"helps":[54],"improve":[55],"O(1/\u03b53)":[57],"computational":[58,85,170],"complexity":[59,86],"obtained":[60,107,122,194],"previous":[62,124,196],"works":[63,125,197],"O(1/\u03b52)":[65,120],"under":[66,126],"general":[68],"smoothness":[69,104],"assumption.":[70,105],"In":[71],"work,":[73],"we":[74],"consider":[75,199],"algorithm":[77],"show":[82],"how":[83],"can":[87],"be":[88,134],"further":[89],"improved":[90],"O(log(1/\u03b5)/\u03b5)":[92,108,169],"when":[93],"Polyak-Lojasiewicz":[95],"(PL)":[96],"condition":[97],"satisfied":[99],"addition":[101],"The":[106],"rate":[109,121,178],"current":[112],"work":[113],"also":[115],"an":[116,160],"improvement":[117],"strong-convexity":[128],"assumption":[129],"(which":[130],"known":[132],"stricter":[135],"than":[136],"PL":[138],"condition),":[139],"matches":[141],"\u03a9(1/\u03b5)":[143],"lower":[144],"bound":[145],"for":[146,153,179],"number":[148,181],"gradient":[151],"computations":[152],"considered":[155],"class":[157],"up":[158,201],"extra":[161],"log(1/\u03b5)":[162],"factor.":[163],"Last":[164],"but":[165],"not":[166],"least,":[167],"cost":[171],"achieved":[173],"while":[174],"retaining":[175],"O(log2(1/\u03b5)/\u03b52)":[177],"iterations":[183],"rounds,":[186],"at":[189],"par":[190],"with":[191],"results":[193],"strong-convexity,":[200],"logarithmic":[203],"factors.":[204],"numerical":[206],"experiment":[207],"conducted":[209],"corroborate":[210],"theoretical":[211],"results.":[212]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-30T00:00:00"}