{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/federated-optimization-for-heterogeneous-1","title":"Federated Optimization for Heterogeneous Networks","arxiv_id":null,"date":"2019-05-16","proceeding":"ICML Workshop AMTL 2019 6","authors":["Anonymous"],"abstract":"Federated learning involves training and effectively combining machine learning models from distributed partitions of data (i.e., tasks) on edge devices, and be naturally viewed as a multi- task learning problem. While Federated Averaging (FedAvg) is the leading optimization method for training non-convex models in this setting, its behavior is not well understood in realistic federated settings when the devices/tasks are statistically heterogeneous, i.e., where each device collects data in a non-identical fashion. In this work, we introduce a framework, called FedProx, to tackle statistical heterogeneity. FedProx encompasses FedAvg as a special case. We provide convergence guarantees for FedProx through a device dissimilarity assumption. Our empirical evaluation validates our theoretical analysis and demonstrates the improved robustness and stability of FedProx for learning in heterogeneous networks.","url_abs":"https://openreview.net/forum?id=SkgwE5Ss3N","url_pdf":"https://openreview.net/pdf?id=SkgwE5Ss3N","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"federated-optimization-for-heterogeneous-1","repo_url":"https://github.com/litian96/FedProx","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"federated-optimization-for-heterogeneous-1","repo_url":"https://github.com/KarhouTam/FL-bench","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"GPL-3.0"}},{"paper_slug":"federated-optimization-for-heterogeneous-1","repo_url":"https://github.com/TsingZ0/FL-IoT","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null},{"paper_slug":"federated-optimization-for-heterogeneous-1","repo_url":"https://github.com/TsingZ0/PFL-Non-IID","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null},{"paper_slug":"federated-optimization-for-heterogeneous-1","repo_url":"https://github.com/thejungwon/gc-fed","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"federated-learning","task_name":"Federated Learning"},{"task_slug":"multi-task-learning","task_name":"Multi-Task Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[{"repo":"litian96/FedProx","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1812.06127"],"harvested_for_calls":[{"arxiv_id":"1812.06127","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1812.06127"},"call":"get_harvested_code_for_paper(arxiv_id=\"1812.06127\")"}]},{"repo":"KarhouTam/FL-bench","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"TsingZ0/FL-IoT","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1602.05629"],"harvested_for_calls":[{"arxiv_id":"1602.05629","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1602.05629"},"call":"get_harvested_code_for_paper(arxiv_id=\"1602.05629\")"}]},{"repo":"TsingZ0/PFL-Non-IID","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":11,"harvested_for":["1602.05629","2001.01523","2012.04221","2012.08565","2102.07623","2106.03097","2106.06042","2107.00778","2111.04263","2306.11867","2308.10279"],"harvested_for_calls":[{"arxiv_id":"1602.05629","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1602.05629"},"call":"get_harvested_code_for_paper(arxiv_id=\"1602.05629\")"},{"arxiv_id":"2001.01523","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2001.01523"},"call":"get_harvested_code_for_paper(arxiv_id=\"2001.01523\")"},{"arxiv_id":"2012.04221","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2012.04221"},"call":"get_harvested_code_for_paper(arxiv_id=\"2012.04221\")"},{"arxiv_id":"2012.08565","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2012.08565"},"call":"get_harvested_code_for_paper(arxiv_id=\"2012.08565\")"},{"arxiv_id":"2102.07623","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2102.07623"},"call":"get_harvested_code_for_paper(arxiv_id=\"2102.07623\")"},{"arxiv_id":"2106.03097","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2106.03097"},"call":"get_harvested_code_for_paper(arxiv_id=\"2106.03097\")"},{"arxiv_id":"2106.06042","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2106.06042"},"call":"get_harvested_code_for_paper(arxiv_id=\"2106.06042\")"},{"arxiv_id":"2107.00778","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2107.00778"},"call":"get_harvested_code_for_paper(arxiv_id=\"2107.00778\")"},{"arxiv_id":"2111.04263","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2111.04263"},"call":"get_harvested_code_for_paper(arxiv_id=\"2111.04263\")"},{"arxiv_id":"2306.11867","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2306.11867"},"call":"get_harvested_code_for_paper(arxiv_id=\"2306.11867\")"},{"arxiv_id":"2308.10279","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2308.10279"},"call":"get_harvested_code_for_paper(arxiv_id=\"2308.10279\")"}]},{"repo":"thejungwon/gc-fed","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":4,"harvested_for":["1602.05629","2106.03097","2111.04263","2209.00189"],"harvested_for_calls":[{"arxiv_id":"1602.05629","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1602.05629"},"call":"get_harvested_code_for_paper(arxiv_id=\"1602.05629\")"},{"arxiv_id":"2106.03097","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2106.03097"},"call":"get_harvested_code_for_paper(arxiv_id=\"2106.03097\")"},{"arxiv_id":"2111.04263","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2111.04263"},"call":"get_harvested_code_for_paper(arxiv_id=\"2111.04263\")"},{"arxiv_id":"2209.00189","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2209.00189"},"call":"get_harvested_code_for_paper(arxiv_id=\"2209.00189\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"2314bdb3a8ae8813544a763908ef997a70035b5c3dd12515c217ed99c001ee03","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}