{"id":"https://openalex.org/W7125675966","doi":"https://doi.org/10.48550/arxiv.2601.16897","title":"FedSGM: A Unified Framework for Constraint Aware, Bidirectionally Compressed, Multi-Step Federated Optimization","display_name":"FedSGM: A Unified Framework for Constraint Aware, Bidirectionally Compressed, Multi-Step Federated Optimization","publication_year":2026,"publication_date":"2026-01-23","ids":{"openalex":"https://openalex.org/W7125675966","doi":"https://doi.org/10.48550/arxiv.2601.16897"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2601.16897","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.16897","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2601.16897","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5064442263","display_name":"Antesh Upadhyay","orcid":"https://orcid.org/0000-0001-7185-3690"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Upadhyay, Antesh","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111192843","display_name":"Sang Bin Moon","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Moon, Sang Bin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5111270942","display_name":"A. M. Hashemi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hashemi, Abolfazl","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"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.8992999792098999,"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.8992999792098999,"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.03060000017285347,"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/T11307","display_name":"Domain Adaptation and Few-Shot Learning","score":0.009399999864399433,"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/constraint","display_name":"Constraint (computer-aided design)","score":0.5910000205039978},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.5400999784469604},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5356000065803528},{"id":"https://openalex.org/keywords/noise","display_name":"Noise (video)","score":0.5146999955177307},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.5060999989509583},{"id":"https://openalex.org/keywords/constrained-optimization","display_name":"Constrained optimization","score":0.4778999984264374},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.4250999987125397}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7516000270843506},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5910000205039978},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5400999784469604},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5364999771118164},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5356000065803528},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.5146999955177307},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.5060999989509583},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.4778999984264374},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.4250999987125397},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.3912000060081482},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3849000036716461},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.31679999828338623},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.31459999084472656},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.30880001187324524},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.2856999933719635},{"id":"https://openalex.org/C180016635","wikidata":"https://www.wikidata.org/wiki/Q2712821","display_name":"Compression (physics)","level":2,"score":0.275299996137619},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.2639000117778778},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2556000053882599},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.25189998745918274}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2601.16897","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.16897","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2601.16897","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.16897","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.7386795878410339,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,74],"introduce":[1,105],"FedSGM,":[2],"a":[3,106,140],"unified":[4],"framework":[5,126],"for":[6,144],"federated":[7,16,146],"constrained":[8,145,162],"optimization":[9,94],"that":[10,79,92],"addresses":[11],"four":[12],"major":[13],"challenges":[14],"in":[15],"learning":[17],"(FL):":[18],"functional":[19,129],"constraints,":[20,130],"communication":[21,49],"bottlenecks,":[22],"local":[23,72,133],"updates,":[24,39,134],"and":[25,70,135,161],"partial":[26,101,136],"client":[27,137],"participation.":[28,102],"Building":[29],"on":[30,158],"the":[31,57,65,80,84,116,124,151],"switching":[32,108],"gradient":[33],"method,":[34],"FedSGM":[35,51,111,122,155],"provides":[36],"projection-free,":[37],"primal-only":[38],"avoiding":[40],"expensive":[41],"dual-variable":[42],"tuning":[43],"or":[44],"inner":[45],"solvers.":[46],"To":[47,119],"handle":[48],"limits,":[50],"incorporates":[52],"bi-directional":[53],"error":[54],"feedback,":[55],"correcting":[56],"bias":[58],"introduced":[59],"by":[60],"compression":[61,68],"while":[62],"explicitly":[63],"understanding":[64],"interaction":[66],"between":[67],"noise":[69,98],"multi-step":[71],"updates.":[73],"derive":[75],"convergence":[76],"guarantees":[77,153],"showing":[78],"averaged":[81],"iterate":[82],"achieves":[83],"canonical":[85],"$\\boldsymbol{\\mathcal{O}}(1/\\sqrt{T})$":[86],"rate,":[87],"with":[88],"additional":[89],"high-probability":[90],"bounds":[91],"decouple":[93],"progress":[95],"from":[96],"sampling":[97],"due":[99],"to":[100,112,127],"Additionally,":[103],"we":[104,149],"soft":[107],"version":[109],"of":[110,154],"stabilize":[113],"updates":[114],"near":[115],"feasibility":[117],"boundary.":[118],"our":[120],"knowledge,":[121],"is":[123],"first":[125],"unify":[128],"compression,":[131],"multiple":[132],"participation,":[138],"establishing":[139],"theoretically":[141],"grounded":[142],"foundation":[143],"learning.":[147],"Finally,":[148],"validate":[150],"theoretical":[152],"via":[156],"experimentation":[157],"Neyman-Pearson":[159],"classification":[160],"Markov":[163],"decision":[164],"process":[165],"(CMDP)":[166],"tasks.":[167]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-01-27T00:00:00"}