{"id":"https://openalex.org/W7084059064","doi":"https://doi.org/10.1109/infocom55648.2025.11044637","title":"Client Sampling for Communication-Efficient Distributed Minimax Optimization","display_name":"Client Sampling for Communication-Efficient Distributed Minimax Optimization","publication_year":2025,"publication_date":"2025-05-19","ids":{"openalex":"https://openalex.org/W7084059064","doi":"https://doi.org/10.1109/infocom55648.2025.11044637"},"language":"en","primary_location":{"id":"doi:10.1109/infocom55648.2025.11044637","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom55648.2025.11044637","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2025 - IEEE Conference on Computer Communications","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":null,"display_name":"Wen Xu","orcid":null},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Wen Xu","raw_affiliation_strings":["University of Toronto,Department of Electrical and Computer Engineering,Canada"],"affiliations":[{"raw_affiliation_string":"University of Toronto,Department of Electrical and Computer Engineering,Canada","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Ben Liang","orcid":null},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Ben Liang","raw_affiliation_strings":["University of Toronto,Department of Electrical and Computer Engineering,Canada"],"affiliations":[{"raw_affiliation_string":"University of Toronto,Department of Electrical and Computer Engineering,Canada","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Gary Boudreau","orcid":null},"institutions":[{"id":"https://openalex.org/I4210094041","display_name":"Ericsson (Canada)","ror":"https://ror.org/00nas2c56","country_code":"CA","type":"company","lineage":["https://openalex.org/I1306339040","https://openalex.org/I4210094041"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Gary Boudreau","raw_affiliation_strings":["Ericsson Canada Inc.,Canada"],"affiliations":[{"raw_affiliation_string":"Ericsson Canada Inc.,Canada","institution_ids":["https://openalex.org/I4210094041"]}]},{"author_position":"last","author":{"id":null,"display_name":"Hamza Sokun","orcid":null},"institutions":[{"id":"https://openalex.org/I4210094041","display_name":"Ericsson (Canada)","ror":"https://ror.org/00nas2c56","country_code":"CA","type":"company","lineage":["https://openalex.org/I1306339040","https://openalex.org/I4210094041"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Hamza Sokun","raw_affiliation_strings":["Ericsson Canada Inc.,Canada"],"affiliations":[{"raw_affiliation_string":"Ericsson Canada Inc.,Canada","institution_ids":["https://openalex.org/I4210094041"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I185261750"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.53548456,"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":"10"},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10410","display_name":"COVID-19 epidemiological studies","score":0.8579000234603882,"subfield":{"id":"https://openalex.org/subfields/2611","display_name":"Modeling and Simulation"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10410","display_name":"COVID-19 epidemiological studies","score":0.8579000234603882,"subfield":{"id":"https://openalex.org/subfields/2611","display_name":"Modeling and Simulation"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10833","display_name":"Vaccine Coverage and Hesitancy","score":0.0738999992609024,"subfield":{"id":"https://openalex.org/subfields/3306","display_name":"Health"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10168","display_name":"COVID-19 and Mental Health","score":0.007499999832361937,"subfield":{"id":"https://openalex.org/subfields/3203","display_name":"Clinical Psychology"},"field":{"id":"https://openalex.org/fields/32","display_name":"Psychology"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/minimax","display_name":"Minimax","score":0.928600013256073},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6517999768257141},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.5047000050544739},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.49790000915527344},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.44130000472068787},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4316999912261963}],"concepts":[{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.928600013256073},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6560999751091003},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6517999768257141},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6290000081062317},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.5047000050544739},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.49790000915527344},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.44130000472068787},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4316999912261963},{"id":"https://openalex.org/C117148685","wikidata":"https://www.wikidata.org/wiki/Q6865376","display_name":"Minimax approximation algorithm","level":2,"score":0.3855000138282776},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3582000136375427},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.3458000123500824},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27799999713897705},{"id":"https://openalex.org/C51632099","wikidata":"https://www.wikidata.org/wiki/Q3985153","display_name":"Training set","level":2,"score":0.2720000147819519},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.25940001010894775},{"id":"https://openalex.org/C193254401","wikidata":"https://www.wikidata.org/wiki/Q2160088","display_name":"Robust optimization","level":2,"score":0.25099998712539673}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/infocom55648.2025.11044637","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom55648.2025.11044637","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2025 - IEEE Conference on Computer Communications","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":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Distributed":[0],"minimax":[1,52,144],"optimization":[2,53],"is":[3],"essential":[4],"for":[5,83,142],"robust":[6],"federated":[7],"learning,":[8],"offering":[9],"resiliency":[10],"against":[11],"the":[12,32,47,68,73,100,108],"variability":[13],"in":[14,39,104],"data":[15],"distribution.":[16],"Most":[17],"previous":[18],"works":[19],"focus":[20],"only":[21],"on":[22],"learning":[23],"guarantees":[24],"and":[25,72,90],"convergence":[26,70,81],"analysis,":[27],"without":[28],"explicit":[29],"consideration":[30,66,106],"of":[31,49,107],"communication":[33,74,109,134],"delay,":[34],"which":[35,63,94],"can":[36,125],"be":[37],"crucial":[38],"practical":[40],"systems.":[41],"In":[42],"this":[43],"work,":[44],"we":[45,95],"consider":[46],"problem":[48],"communication-efficient":[50],"distributed":[51,143],"via":[54],"judicious":[55],"client":[56,101,139],"sampling,":[57],"proposing":[58],"an":[59],"algorithm":[60],"termed":[61],"CE-MINIMAX,":[62],"takes":[64],"into":[65],"both":[67,88],"training":[69,77],"performance":[71],"time":[75],"per":[76],"round.":[78],"We":[79,111],"derive":[80],"bounds":[82],"CE":[84,122],"\u2212":[85,123],"MINIMAX":[86,124],"under":[87,131],"convex":[89],"non-convex":[91],"loss":[92],"functions,":[93],"then":[96],"use":[97],"to":[98,119],"design":[99],"sampling":[102,140],"probabilities":[103],"joint":[105],"time.":[110],"conduct":[112],"numerical":[113],"experiments":[114],"with":[115,137],"canonical":[116],"classification":[117],"datasets":[118],"demonstrate":[120],"that":[121],"achieve":[126],"higher":[127],"worst-case":[128],"test":[129],"accuracy":[130],"substantially":[132],"reduced":[133],"time,":[135],"compared":[136],"state-of-the-art":[138],"schemes":[141],"optimization.":[145]},"counts_by_year":[],"updated_date":"2025-12-21T23:12:01.093139","created_date":"2025-10-10T00:00:00"}