{"id":"https://openalex.org/W4417142436","doi":"https://doi.org/10.48550/arxiv.2512.05327","title":"Non-Convex Federated Optimization under Cost-Aware Client Selection","display_name":"Non-Convex Federated Optimization under Cost-Aware Client Selection","publication_year":2025,"publication_date":"2025-12-05","ids":{"openalex":"https://openalex.org/W4417142436","doi":"https://doi.org/10.48550/arxiv.2512.05327"},"language":null,"primary_location":{"id":"pmh:oai:arXiv.org:2512.05327","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2512.05327","pdf_url":"https://arxiv.org/pdf/2512.05327","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2512.05327","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5021783986","display_name":"Xiaowen Jiang","orcid":"https://orcid.org/0000-0002-6283-2262"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Jiang, Xiaowen","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062011745","display_name":"Anton Rodomanov","orcid":"https://orcid.org/0000-0001-9656-8554"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rodomanov, Anton","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5045519627","display_name":"Sebastian U. Stich","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Stich, Sebastian U.","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5021783986"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.60589998960495,"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.60589998960495,"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.3246000111103058,"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/T10237","display_name":"Cryptography and Data Security","score":0.005200000014156103,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/estimator","display_name":"Estimator","score":0.671500027179718},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.6528000235557556},{"id":"https://openalex.org/keywords/variance","display_name":"Variance (accounting)","score":0.5375999808311462},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5134000182151794},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.5016000270843506},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.4943999946117401},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4860999882221222}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.791100025177002},{"id":"https://openalex.org/C185429906","wikidata":"https://www.wikidata.org/wiki/Q1130160","display_name":"Estimator","level":2,"score":0.671500027179718},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.6528000235557556},{"id":"https://openalex.org/C196083921","wikidata":"https://www.wikidata.org/wiki/Q7915758","display_name":"Variance (accounting)","level":2,"score":0.5375999808311462},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5134000182151794},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.5016000270843506},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.4943999946117401},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4860999882221222},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4471000134944916},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4223000109195709},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4077000021934509},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.3896999955177307},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.38519999384880066},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.3531999886035919},{"id":"https://openalex.org/C191393472","wikidata":"https://www.wikidata.org/wiki/Q15222032","display_name":"Bias of an estimator","level":4,"score":0.3174999952316284},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.3140000104904175},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.27399998903274536},{"id":"https://openalex.org/C122268817","wikidata":"https://www.wikidata.org/wiki/Q2020318","display_name":"Frank\u2013Wolfe algorithm","level":5,"score":0.26660001277923584},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.26409998536109924}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2512.05327","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2512.05327","pdf_url":"https://arxiv.org/pdf/2512.05327","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"text"},{"id":"doi:10.48550/arxiv.2512.05327","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2512.05327","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2512.05327","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2512.05327","pdf_url":"https://arxiv.org/pdf/2512.05327","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Different":[0],"federated":[1,75,120],"optimization":[2,46,76,121],"algorithms":[3],"typically":[4,48],"employ":[5],"distinct":[6,100],"client-selection":[7,92],"strategies:":[8],"some":[9],"methods":[10,47,122],"communicate":[11,28],"only":[12],"with":[13,29,98,136],"a":[14,34,69,99,107,137,143,161,169,189,199,218],"randomly":[15],"sampled":[16],"subset":[17],"of":[18,74,198],"clients":[19,31],"at":[20,151],"each":[21,97,152],"round,":[22],"while":[23],"others":[24],"need":[25],"to":[26,192,214,229],"periodically":[27],"all":[30],"or":[32],"use":[33],"hybrid":[35],"scheme":[36],"that":[37,77,110,176],"combines":[38],"both":[39,206],"strategies.":[40],"However,":[41],"existing":[42,119],"metrics":[43],"for":[44,88,123,146,173],"comparing":[45],"do":[49],"not":[50],"distinguish":[51],"between":[52],"these":[53],"strategies,":[54],"which":[55,222],"often":[56],"incur":[57],"different":[58],"communication":[59,79,114],"costs":[60],"in":[61],"practice.":[62],"To":[63],"address":[64],"this":[65,103,212],"disparity,":[66],"we":[67,105,216],"introduce":[68,184],"simple":[70],"and":[71,80,94,115,142,208],"natural":[72],"model":[73,86],"quantifies":[78],"local":[81,116],"computation":[82],"complexities.":[83],"This":[84,126],"new":[85,108,170,219],"allows":[87],"several":[89],"commonly":[90],"used":[91],"strategies":[93],"explicitly":[95],"associates":[96],"cost.":[101],"Within":[102],"setting,":[104],"propose":[106],"algorithm":[109,127],"achieves":[111],"the":[112,131,148,185,195,230],"best-known":[113],"complexities":[117],"among":[118],"non-convex":[124],"optimization.":[125],"is":[128,157],"based":[129,158],"on":[130,159],"inexact":[132],"composite":[133],"gradient":[134,140,155,164,203],"method":[135],"carefully":[138],"constructed":[139],"estimator":[141,156],"special":[144],"procedure":[145],"solving":[147],"auxiliary":[149],"subproblem":[150],"iteration.":[153],"The":[154],"SAGA,":[160,215],"popular":[162],"variance-reduced":[163],"estimator.":[165],"We":[166,182],"first":[167],"derive":[168],"variance":[171],"bound":[172,197,227],"it,":[174],"showing":[175],"SAGA":[177,207],"can":[178],"exploit":[179],"functional":[180],"similarity.":[181],"then":[183],"Recursive-Gradient":[186],"technique":[187,213],"as":[188],"general":[190],"way":[191],"potentially":[193],"improve":[194],"error":[196,226],"given":[200],"conditionally":[201],"unbiased":[202],"estimator,":[204,220],"including":[205],"SVRG.":[209],"By":[210],"applying":[211],"obtain":[217],"RG-SAGA,":[221],"has":[223],"an":[224],"improved":[225],"compared":[228],"original":[231],"one.":[232]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-12-09T00:00:00"}