{"id":"https://openalex.org/W4415524554","doi":"https://doi.org/10.1109/mlsp62443.2025.11204301","title":"Provable Reduction in Communication Rounds for Non-Smooth Convex Federated Learning","display_name":"Provable Reduction in Communication Rounds for Non-Smooth Convex Federated Learning","publication_year":2025,"publication_date":"2025-08-31","ids":{"openalex":"https://openalex.org/W4415524554","doi":"https://doi.org/10.1109/mlsp62443.2025.11204301"},"language":null,"primary_location":{"id":"doi:10.1109/mlsp62443.2025.11204301","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mlsp62443.2025.11204301","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 35th International Workshop on Machine Learning for Signal Processing (MLSP)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5119948802","display_name":"Karlo Palenzuela","orcid":null},"institutions":[{"id":"https://openalex.org/I90267481","display_name":"Ume\u00e5 University","ror":"https://ror.org/05kb8h459","country_code":"SE","type":"education","lineage":["https://openalex.org/I90267481"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Karlo Palenzuela","raw_affiliation_strings":["Ume&#x00E5; University,Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ume&#x00E5; University,Sweden","institution_ids":["https://openalex.org/I90267481"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5093826620","display_name":"Ali Dadras","orcid":null},"institutions":[{"id":"https://openalex.org/I90267481","display_name":"Ume\u00e5 University","ror":"https://ror.org/05kb8h459","country_code":"SE","type":"education","lineage":["https://openalex.org/I90267481"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Ali Dadras","raw_affiliation_strings":["Ume&#x00E5; University,Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ume&#x00E5; University,Sweden","institution_ids":["https://openalex.org/I90267481"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043683448","display_name":"Alp Yurtsever","orcid":"https://orcid.org/0000-0001-7320-1506"},"institutions":[{"id":"https://openalex.org/I90267481","display_name":"Ume\u00e5 University","ror":"https://ror.org/05kb8h459","country_code":"SE","type":"education","lineage":["https://openalex.org/I90267481"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Alp Yurtsever","raw_affiliation_strings":["Ume&#x00E5; University,Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ume&#x00E5; University,Sweden","institution_ids":["https://openalex.org/I90267481"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035857033","display_name":"Tommy L\u00f6fstedt","orcid":"https://orcid.org/0000-0001-7119-7646"},"institutions":[{"id":"https://openalex.org/I90267481","display_name":"Ume\u00e5 University","ror":"https://ror.org/05kb8h459","country_code":"SE","type":"education","lineage":["https://openalex.org/I90267481"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Tommy L\u00f6fstedt","raw_affiliation_strings":["Ume&#x00E5; University,Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ume&#x00E5; University,Sweden","institution_ids":["https://openalex.org/I90267481"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I90267481"],"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":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.996399998664856,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.996399998664856,"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/T12879","display_name":"Distributed Sensor Networks and Detection Algorithms","score":0.9896000027656555,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9821000099182129,"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/federated-learning","display_name":"Federated learning","score":0.6051999926567078},{"id":"https://openalex.org/keywords/subgradient-method","display_name":"Subgradient method","score":0.5982999801635742},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.5655999779701233},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.5595999956130981},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4959999918937683},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4618000090122223},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.43779999017715454},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.3702000081539154}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7476000189781189},{"id":"https://openalex.org/C2992525071","wikidata":"https://www.wikidata.org/wiki/Q50818671","display_name":"Federated learning","level":2,"score":0.6051999926567078},{"id":"https://openalex.org/C158968445","wikidata":"https://www.wikidata.org/wiki/Q7631150","display_name":"Subgradient method","level":2,"score":0.5982999801635742},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.5655999779701233},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.5595999956130981},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4959999918937683},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4618000090122223},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.43779999017715454},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41110000014305115},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3702000081539154},{"id":"https://openalex.org/C94284585","wikidata":"https://www.wikidata.org/wiki/Q228184","display_name":"Random oracle","level":4,"score":0.33889999985694885},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.3361000120639801},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.32330000400543213},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.29170000553131104},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.2863999903202057},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2800000011920929},{"id":"https://openalex.org/C131672422","wikidata":"https://www.wikidata.org/wiki/Q852594","display_name":"Provable security","level":3,"score":0.2721000015735626},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.26460000872612},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2590000033378601},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.25220000743865967},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.25130000710487366}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/mlsp62443.2025.11204301","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mlsp62443.2025.11204301","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 35th International Workshop on Machine Learning for Signal Processing (MLSP)","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":4,"referenced_works":["https://openalex.org/W1969557815","https://openalex.org/W2963318081","https://openalex.org/W2995022099","https://openalex.org/W4313627870"],"related_works":[],"abstract_inverted_index":{"Multiple":[0],"local":[1,43],"steps":[2],"are":[3],"key":[4],"to":[5],"communication-efficient":[6],"federated":[7,35],"learning.":[8],"However,":[9],"theoretical":[10],"guarantees":[11],"for":[12],"such":[13],"algorithms,":[14],"without":[15],"data":[16],"heterogeneity-bounding":[17],"assumptions,":[18],"have":[19],"been":[20],"lacking":[21],"in":[22],"general":[23],"non-smooth":[24],"convex":[25],"problems.":[26],"Leveraging":[27],"projection-efficient":[28],"optimization":[29],"methods,":[30],"we":[31],"propose":[32],"FedMLS,":[33],"a":[34,54],"learning":[36],"algorithm":[37],"with":[38],"provable":[39],"improvements":[40],"from":[41],"multiple":[42],"steps.":[44],"FedMLS":[45],"attains":[46],"an$\\epsilon$-suboptimal":[47],"solution":[48],"in$\\mathcal{O}(1":[49],"/":[50,57],"\\epsilon)$communication":[51],"rounds,":[52],"requiring":[53],"total":[55],"of$\\mathcal{O}\\left(1":[56],"\\epsilon^{2}\\right)$stochastic":[58],"subgradient":[59],"oracle":[60],"calls.":[61]},"counts_by_year":[],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-24T00:00:00"}
