{"id":"https://openalex.org/W4414648302","doi":"https://doi.org/10.1109/vtc2025-spring65109.2025.11174871","title":"Trading off Communication Cost and Optimization Performance in Decentralized Multi-Task Optimization","display_name":"Trading off Communication Cost and Optimization Performance in Decentralized Multi-Task Optimization","publication_year":2025,"publication_date":"2025-06-17","ids":{"openalex":"https://openalex.org/W4414648302","doi":"https://doi.org/10.1109/vtc2025-spring65109.2025.11174871"},"language":"en","primary_location":{"id":"doi:10.1109/vtc2025-spring65109.2025.11174871","is_oa":false,"landing_page_url":"https://doi.org/10.1109/vtc2025-spring65109.2025.11174871","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 101st Vehicular Technology Conference (VTC2025-Spring)","raw_type":"proceedings-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":"https://openalex.org/A5045528129","display_name":"Chenmin Sha","orcid":"https://orcid.org/0000-0002-0695-0539"},"institutions":[{"id":"https://openalex.org/I4210148107","display_name":"Space Engineering University","ror":"https://ror.org/04rj1td02","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210148107"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Chenmin Sha","raw_affiliation_strings":["Beijing National Research Center for Information Science and Technology, Tsinghua University,State Key Laboratory of Space Network and Communications,Department of Electronic Engineering,Beijing,China,100084"],"affiliations":[{"raw_affiliation_string":"Beijing National Research Center for Information Science and Technology, Tsinghua University,State Key Laboratory of Space Network and Communications,Department of Electronic Engineering,Beijing,China,100084","institution_ids":["https://openalex.org/I4210148107"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010514423","display_name":"Shidong Zhou","orcid":null},"institutions":[{"id":"https://openalex.org/I4210148107","display_name":"Space Engineering University","ror":"https://ror.org/04rj1td02","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210148107"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Shidong Zhou","raw_affiliation_strings":["Beijing National Research Center for Information Science and Technology, Tsinghua University,State Key Laboratory of Space Network and Communications,Department of Electronic Engineering,Beijing,China,100084"],"affiliations":[{"raw_affiliation_string":"Beijing National Research Center for Information Science and Technology, Tsinghua University,State Key Laboratory of Space Network and Communications,Department of Electronic Engineering,Beijing,China,100084","institution_ids":["https://openalex.org/I4210148107"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5045528129"],"corresponding_institution_ids":["https://openalex.org/I4210148107"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.3976665,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.8331999778747559,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.8331999778747559,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T12288","display_name":"Optimization and Search Problems","score":0.7712000012397766,"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/T10273","display_name":"IoT and Edge/Fog Computing","score":0.7651000022888184,"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/optimization-problem","display_name":"Optimization problem","score":0.614799976348877},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.5080999732017517},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.5045999884605408},{"id":"https://openalex.org/keywords/aggregate","display_name":"Aggregate (composite)","score":0.4986000061035156},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.43810001015663147},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.42640000581741333},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.37790000438690186},{"id":"https://openalex.org/keywords/term","display_name":"Term (time)","score":0.35179999470710754}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7109000086784363},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.638700008392334},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.614799976348877},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.5080999732017517},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.5045999884605408},{"id":"https://openalex.org/C4679612","wikidata":"https://www.wikidata.org/wiki/Q866298","display_name":"Aggregate (composite)","level":2,"score":0.4986000061035156},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.43810001015663147},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.42640000581741333},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.37790000438690186},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.35179999470710754},{"id":"https://openalex.org/C101765175","wikidata":"https://www.wikidata.org/wiki/Q577764","display_name":"Communications system","level":2,"score":0.32350000739097595},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.3107999861240387},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.305400013923645},{"id":"https://openalex.org/C192126672","wikidata":"https://www.wikidata.org/wiki/Q1068715","display_name":"Telecommunications network","level":2,"score":0.2896000146865845},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.2775999903678894},{"id":"https://openalex.org/C98036226","wikidata":"https://www.wikidata.org/wiki/Q7268356","display_name":"Quadratic assignment problem","level":3,"score":0.2745000123977661},{"id":"https://openalex.org/C193254401","wikidata":"https://www.wikidata.org/wiki/Q2160088","display_name":"Robust optimization","level":2,"score":0.2718999981880188},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.27160000801086426},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.266400009393692},{"id":"https://openalex.org/C110850998","wikidata":"https://www.wikidata.org/wiki/Q5377895","display_name":"Engineering optimization","level":3,"score":0.2581999897956848}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/vtc2025-spring65109.2025.11174871","is_oa":false,"landing_page_url":"https://doi.org/10.1109/vtc2025-spring65109.2025.11174871","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 101st Vehicular Technology Conference (VTC2025-Spring)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W2098995249","https://openalex.org/W2103972604","https://openalex.org/W2118356983","https://openalex.org/W2123705108","https://openalex.org/W2151590071","https://openalex.org/W2405727896","https://openalex.org/W2763081248","https://openalex.org/W2800888570","https://openalex.org/W2901838001","https://openalex.org/W2905915262","https://openalex.org/W2942979385","https://openalex.org/W2962771678","https://openalex.org/W3004184337","https://openalex.org/W3021272668","https://openalex.org/W3088106497","https://openalex.org/W3121156404","https://openalex.org/W3180881483","https://openalex.org/W4212863985","https://openalex.org/W4292363360","https://openalex.org/W4375798893","https://openalex.org/W4381199009"],"related_works":[],"abstract_inverted_index":{"In":[0],"sensor":[1],"networks":[2],"or":[3],"other":[4],"multi-agent":[5],"systems,":[6],"agents":[7],"often":[8],"need":[9],"to":[10,30,72,121,149],"make":[11],"personalized":[12],"decisions":[13],"through":[14],"cooperation,":[15],"which":[16,85],"can":[17,104],"be":[18],"formulated":[19],"as":[20],"a":[21,48,65,74,144],"decentralized":[22,49],"multi-task":[23],"optimization":[24,36,50,89,95],"problem.":[25,135],"This":[26],"paper":[27],"investigates":[28],"how":[29],"achieve":[31],"the":[32,53,81,88,94,98,106,118,133,140,155,158],"trade-off":[33,146],"between":[34],"final":[35],"accuracy":[37],"and":[38,97,113,153],"communication":[39,100,110,123,152],"cost":[40],"when":[41,108],"solving":[42],"such":[43],"problems.":[44],"We":[45,125],"focus":[46],"on":[47],"problem":[51],"where":[52],"objective":[54,61],"is":[55,71,111],"an":[56,128],"aggregate":[57],"sum":[58],"of":[59,157],"local":[60],"functions,":[62],"regularized":[63,77],"by":[64,84],"general":[66],"quadratic":[67,76],"term.":[68],"Our":[69,102],"approach":[70],"find":[73],"new":[75],"term":[78],"that":[79,91,139],"approximates":[80],"original,":[82],"guided":[83],"we":[86,114],"develop":[87],"framework":[90,103],"characterizes":[92],"both":[93],"performance":[96],"associated":[99],"cost.":[101],"handle":[105],"case":[107],"multi-hop":[109,151],"necessary":[112],"further":[115],"propose":[116],"leveraging":[117],"\u201ccompute-and-forward\u201d":[119],"technique":[120],"enhance":[122],"efficiency.":[124],"then":[126],"present":[127],"efficient":[129],"solution":[130],"method":[131],"for":[132],"proposed":[134,159],"Simulation":[136],"results":[137],"demonstrate":[138],"\u201ccompute-andforward\u201d":[141],"scheme":[142],"offers":[143],"superior":[145],"in":[147],"comparison":[148],"traditional":[150],"validate":[154],"effectiveness":[156],"algorithm.":[160]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-10T00:00:00"}