{"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/personalized-federated-learning-with","title":"Personalized Federated Learning with Theoretical Guarantees: A Model-Agnostic Meta-Learning Approach","arxiv_id":null,"date":"2020-12-01","proceeding":"NeurIPS 2020 12","authors":["Alireza Fallah","Aryan Mokhtari","Asuman Ozdaglar"],"abstract":"In Federated Learning, we aim to train models across multiple computing units (users), while users can only communicate with a common central server, without exchanging their data samples. This mechanism exploits the computational power of all users and allows users to obtain a richer model as their models are trained over a larger set of data points. However, this scheme only develops a common output for all the users, and, therefore, it does not adapt the model to each user. This is an important missing feature, especially given the heterogeneity of the underlying data distribution for various users. In this paper, we study a personalized variant of the federated learning in which our goal is to find an initial shared model that current or new users can easily adapt to their local dataset by performing one or a few steps of gradient descent with respect to their own data. This approach keeps all the benefits of the federated learning architecture, and, by structure, leads to a more personalized model for each user. We show this problem can be studied within the Model-Agnostic Meta-Learning (MAML) framework. Inspired by this connection, we study a personalized variant of the well-known Federated Averaging algorithm and evaluate its performance in terms of gradient norm for non-convex loss functions. Further, we characterize how this performance is affected by the closeness of underlying distributions of user data, measured in terms of distribution distances such as Total Variation and 1-Wasserstein metric.","url_abs":"http://proceedings.neurips.cc/paper/2020/hash/24389bfe4fe2eba8bf9aa9203a44cdad-Abstract.html","url_pdf":"http://proceedings.neurips.cc/paper/2020/file/24389bfe4fe2eba8bf9aa9203a44cdad-Paper.pdf","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":"personalized-federated-learning-with","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":"personalized-federated-learning-with","repo_url":"https://github.com/TsingZ0/PFL-Non-IID","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":"meta-learning","task_name":"Meta-Learning"},{"task_slug":"personalized-federated-learning","task_name":"Personalized Federated 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":"KarhouTam/FL-bench","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"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\")"}]}],"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":"5db1d7efc951f35d6a19c555a3d6e35f56b97872806e1e5a0d7e32de177936df","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}