{"id":"https://openalex.org/W4395028151","doi":"https://doi.org/10.1109/tsp.2024.3392351","title":"A Communication-Efficient Algorithm for Federated Multilevel Stochastic Compositional Optimization","display_name":"A Communication-Efficient Algorithm for Federated Multilevel Stochastic Compositional Optimization","publication_year":2024,"publication_date":"2024-01-01","ids":{"openalex":"https://openalex.org/W4395028151","doi":"https://doi.org/10.1109/tsp.2024.3392351"},"language":"en","primary_location":{"id":"doi:10.1109/tsp.2024.3392351","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/tsp.2024.3392351","pdf_url":null,"source":{"id":"https://openalex.org/S168680287","display_name":"IEEE Transactions on Signal Processing","issn_l":"1053-587X","issn":["1053-587X","1941-0476"],"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 Transactions on Signal Processing","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":"https://openalex.org/A5075657505","display_name":"Shuoguang Yang","orcid":"https://orcid.org/0000-0002-0915-196X"},"institutions":[{"id":"https://openalex.org/I200769079","display_name":"Hong Kong University of Science and Technology","ror":"https://ror.org/00q4vv597","country_code":"HK","type":"education","lineage":["https://openalex.org/I200769079"]},{"id":"https://openalex.org/I889458895","display_name":"University of Hong Kong","ror":"https://ror.org/02zhqgq86","country_code":"HK","type":"education","lineage":["https://openalex.org/I889458895"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Shuoguang Yang","raw_affiliation_strings":["Department of Industrial Engineering and Decision Analytics, The Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong, China"],"raw_orcid":"https://orcid.org/0000-0002-0915-196X","affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering and Decision Analytics, The Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong, China","institution_ids":["https://openalex.org/I200769079","https://openalex.org/I889458895"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015581947","display_name":"Fengpei Li","orcid":"https://orcid.org/0000-0003-0904-4723"},"institutions":[{"id":"https://openalex.org/I2802755631","display_name":"Morgan Stanley (United States)","ror":"https://ror.org/00aphdz18","country_code":"US","type":"company","lineage":["https://openalex.org/I2802755631"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Fengpei Li","raw_affiliation_strings":["Morgan Stanley Machine Learning Research, Morgan Stanley, New York, NY, USA"],"raw_orcid":"https://orcid.org/0000-0003-0904-4723","affiliations":[{"raw_affiliation_string":"Morgan Stanley Machine Learning Research, Morgan Stanley, New York, NY, USA","institution_ids":["https://openalex.org/I2802755631"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2495,"currency":"USD","value_usd":2495},"apc_paid":null,"fwci":0.4601,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.69597552,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"72","issue":null,"first_page":"2333","last_page":"2347"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10764","display_name":"Privacy-Preserving Technologies in Data","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"}},"topics":[{"id":"https://openalex.org/T10764","display_name":"Privacy-Preserving Technologies in Data","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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9997000098228455,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9889000058174133,"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/computer-science","display_name":"Computer science","score":0.6923339366912842},{"id":"https://openalex.org/keywords/stochastic-optimization","display_name":"Stochastic optimization","score":0.4656881093978882},{"id":"https://openalex.org/keywords/optimization-algorithm","display_name":"Optimization algorithm","score":0.45776039361953735},{"id":"https://openalex.org/keywords/efficient-algorithm","display_name":"Efficient algorithm","score":0.4474841058254242},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43535757064819336},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.4326714873313904},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34964486956596375},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.31704002618789673},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18426969647407532}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6923339366912842},{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.4656881093978882},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.45776039361953735},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.4474841058254242},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43535757064819336},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.4326714873313904},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34964486956596375},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.31704002618789673},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18426969647407532}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tsp.2024.3392351","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/tsp.2024.3392351","pdf_url":null,"source":{"id":"https://openalex.org/S168680287","display_name":"IEEE Transactions on Signal Processing","issn_l":"1053-587X","issn":["1053-587X","1941-0476"],"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 Transactions on Signal Processing","raw_type":"journal-article"},{"id":"pmh:oai:repository.hkust.edu.hk:1783.1-138800","is_oa":false,"landing_page_url":"http://lbdiscover.ust.hk/uresolver?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rfr_id=info:sid/HKUST:SPI&rft.genre=article&rft.issn=1053-587X&rft.volume=72&rft.issue=&rft.date=2024&rft.spage=2333&rft.aulast=Yang&rft.aufirst=Shuoguang&rft.atitle=A+Communication-Efficient+Algorithm+for+Federated+Multilevel+Stochastic+Compositional+Optimization&rft.title=IEEE+Transactions+on+Signal+Processing","pdf_url":null,"source":{"id":"https://openalex.org/S4306401796","display_name":"Rare & Special e-Zone (The Hong Kong University of Science and Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I200769079","host_organization_name":"Hong Kong University of Science and Technology","host_organization_lineage":["https://openalex.org/I200769079"],"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":"Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W1494085563","https://openalex.org/W2047979611","https://openalex.org/W2053637704","https://openalex.org/W2130062883","https://openalex.org/W2949585412","https://openalex.org/W2962696932","https://openalex.org/W2963313444","https://openalex.org/W2963373496","https://openalex.org/W2964037929","https://openalex.org/W2991046523","https://openalex.org/W2995022099","https://openalex.org/W3011252985","https://openalex.org/W3011766119","https://openalex.org/W3033452898","https://openalex.org/W3042103612","https://openalex.org/W3048592889","https://openalex.org/W3080245286","https://openalex.org/W3108977839","https://openalex.org/W3122922399","https://openalex.org/W3154049590","https://openalex.org/W4206941915","https://openalex.org/W4225699136","https://openalex.org/W4229065169","https://openalex.org/W4252698487","https://openalex.org/W4292084264","https://openalex.org/W4292363360","https://openalex.org/W6631132026","https://openalex.org/W6679314259","https://openalex.org/W6726059432","https://openalex.org/W6736057607","https://openalex.org/W6738250615","https://openalex.org/W6756976665","https://openalex.org/W6764194201","https://openalex.org/W6765176130","https://openalex.org/W6770416249","https://openalex.org/W6779141816","https://openalex.org/W6780238375","https://openalex.org/W6780249484","https://openalex.org/W6785517317","https://openalex.org/W6787022869","https://openalex.org/W6803236494","https://openalex.org/W6804330603","https://openalex.org/W6811076604","https://openalex.org/W6839047477"],"related_works":["https://openalex.org/W3095130276","https://openalex.org/W2410068627","https://openalex.org/W2375625581","https://openalex.org/W4402187056","https://openalex.org/W4396917903","https://openalex.org/W2140656843","https://openalex.org/W1995335680","https://openalex.org/W2533280800","https://openalex.org/W4402124245","https://openalex.org/W2032082769"],"abstract_inverted_index":{"Recent":[0],"literature":[1],"shows":[2],"a":[3,30,92,103,114],"growing":[4],"interest":[5],"in":[6,21,32,52,58,69],"the":[7,137,143,154,160,168,172],"integration":[8],"of":[9,91,130,133,157,162,175],"federated":[10,115],"learning":[11],"(FL)":[12],"and":[13,23,94],"multilevel":[14],"stochastic":[15],"compositional":[16],"optimization":[17],"(MSCO),":[18],"which":[19,131],"arises":[20],"meta-learning":[22],"reinforcement":[24],"learning.":[25],"It":[26],"is":[27,34,167],"known":[28],"that":[29,118],"bottleneck":[31],"FL":[33],"communication":[35,70],"efficiency,":[36],"when":[37],"compared":[38],"to":[39,170],"non-distributed":[40],"methods.":[41],"Yet,":[42],"it":[43,151],"remains":[44],"unclear":[45],"whether":[46],"communication-efficient":[47],"algorithms":[48],"exist":[49],"for":[50,82,179],"MSCO":[51,90,116],"distributed":[53,89,180],"settings.":[54],"Single-loop":[55],"optimizations,":[56],"used":[57],"recent":[59],"methods,":[60],"structurally":[61],"require":[62],"communications":[63],"per":[64],"fixed":[65],"samples":[66],"generated,":[67],"resulting":[68],"complexity":[71,122,177],"being":[72],"no":[73],"less":[74],"than":[75],"sample":[76],"complexity,":[77,128],"hence":[78],"lower":[79],"bounded":[80],"by$\\mathcal{O}(1/\\epsilon)$,":[81],"reaching":[83],"an$\\epsilon$-accurate":[84],"solution.":[85],"This":[86],"paper":[87],"studies":[88],"smooth":[93,99],"strongly":[95],"convex":[96],"objective":[97],"with":[98],"gradients.":[100],"Based":[101],"on":[102],"double-loop":[104],"strategy,":[105],"we":[106],"proposed":[107],"Federated":[108],"Stochastic":[109],"Compositional":[110],"Gradient":[111],"Extrapolation":[112],"(FedSCGE),":[113],"method":[117,147],"attains":[119],"an":[120,125],"optimal$\\mathcal{O}(\\log\\frac{1}{\\epsilon})$communication":[121],"while":[123],"maintaining":[124],"(almost)":[126],"optimal$\\tilde{\\mathcal{O}}(1/\\epsilon)$sample":[127],"both":[129,176],"independent":[132],"client":[134],"number,":[135],"making":[136],"approach":[138],"scalable.":[139],"Our":[140],"analysis":[141],"leverages":[142],"random":[144],"gradient":[145],"extrapolation":[146],"(RGEM)":[148],"in[19]and":[149],"generalizes":[150],"by":[152],"overcoming":[153],"biased":[155],"gradients":[156],"MSCO.":[158,181],"To":[159],"best":[161],"our":[163,165],"knowledge,":[164],"work":[166],"first":[169],"show":[171],"simultaneous":[173],"attainability":[174],"bounds":[178]},"counts_by_year":[{"year":2025,"cited_by_count":2}],"updated_date":"2026-08-28T12:50:07.497085","created_date":"2025-10-10T00:00:00"}