{"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":"/method/local-sgd","slug":"local-sgd","name":"Local SGD","full_name":"Local SGD","full_name_withheld":false,"description_markdown":"**Local SGD** is a distributed training technique that runs [SGD](https://paperswithcode.com/method/sgd) independently in parallel on different workers and averages the sequences only once in a while.","description_state":"present","introduced_year":null,"introduced_by":{"title":"Local SGD Converges Fast and Communicates Little","paper":"/paper/local-sgd-converges-fast-and-communicates","first_author":"Sebastian U. Stich","n_authors":1,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/local-sgd-converges-fast-and-communicates"},"source":{"url":"https://arxiv.org/abs/1805.09767v3","title":"Local SGD Converges Fast and Communicates Little","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"General","area_id":"general","collection":"Data Parallel Methods","url":"/methods/category/data-parallel-methods","pwc_aliases":[]},{"area":"General","area_id":"general","collection":"Distributed Methods","url":"/methods/category/distributed-methods","pwc_aliases":[]},{"area":"General","area_id":"general","collection":"Optimization","url":"/methods/category/optimization","pwc_aliases":[]},{"area":"General","area_id":"general","collection":"Stochastic Optimization","url":"/methods/category/stochastic-optimization","pwc_aliases":[]}],"n_papers_tagged":69,"archive_num_papers":69,"papers_newest_first":[{"paper":null,"slug":"des-loc-desynced-low-communication-adaptive","title":"DES-LOC: Desynced Low Communication Adaptive Optimizers for Training Foundation Models","date":"2025-05-28","arxiv_id":"2505.22549","n_code_links":0,"syntology":null},{"paper":null,"slug":"sharp-gaussian-approximations-for","title":"Sharp Gaussian approximations for Decentralized Federated Learning","date":"2025-05-12","arxiv_id":"2505.08125","n_code_links":0,"syntology":null},{"paper":null,"slug":"streaming-federated-learning-with-markovian","title":"Streaming Federated Learning with Markovian Data","date":"2025-03-24","arxiv_id":"2503.18807","n_code_links":0,"syntology":null},{"paper":"/paper/edit-a-local-sgd-based-efficient-distributed","slug":"edit-a-local-sgd-based-efficient-distributed","title":"EDiT: A Local-SGD-Based Efficient Distributed Training Method for Large Language Models","date":"2024-12-10","arxiv_id":"2412.07210","n_code_links":2,"syntology":null},{"paper":null,"slug":"collaborative-and-efficient-personalization","title":"Collaborative and Efficient Personalization with Mixtures of Adaptors","date":"2024-10-04","arxiv_id":"2410.03497","n_code_links":0,"syntology":null},{"paper":null,"slug":"does-worst-performing-agent-lead-the-pack","title":"Does Worst-Performing Agent Lead the Pack? Analyzing Agent Dynamics in Unified Distributed SGD","date":"2024-09-26","arxiv_id":"2409.17499","n_code_links":0,"syntology":null},{"paper":null,"slug":"convergence-of-distributed-adaptive","title":"Convergence of Distributed Adaptive Optimization with Local Updates","date":"2024-09-20","arxiv_id":"2409.13155","n_code_links":0,"syntology":null},{"paper":null,"slug":"exploring-scaling-laws-for-local-sgd-in-large","title":"Exploring Scaling Laws for Local SGD in Large Language Model Training","date":"2024-09-20","arxiv_id":"2409.13198","n_code_links":0,"syntology":null},{"paper":null,"slug":"communication-efficient-adaptive-batch-size","title":"Communication-Efficient Adaptive Batch Size Strategies for Distributed Local Gradient Methods","date":"2024-06-20","arxiv_id":"2406.13936","n_code_links":0,"syntology":null},{"paper":null,"slug":"local-methods-with-adaptivity-via-scaling","title":"Local Methods with Adaptivity via Scaling","date":"2024-06-02","arxiv_id":"2406.00846","n_code_links":0,"syntology":null},{"paper":null,"slug":"the-limits-and-potentials-of-local-sgd-for","title":"The Limits and Potentials of Local SGD for Distributed Heterogeneous Learning with Intermittent Communication","date":"2024-05-19","arxiv_id":"2405.11667","n_code_links":0,"syntology":null},{"paper":"/paper/communication-efficient-and-provable","slug":"communication-efficient-and-provable","title":"Communication Efficient and Provable Federated Unlearning","date":"2024-01-19","arxiv_id":"2401.11018","n_code_links":1,"syntology":null},{"paper":"/paper/can-we-learn-communication-efficient","slug":"can-we-learn-communication-efficient","title":"Can We Learn Communication-Efficient Optimizers?","date":"2023-12-02","arxiv_id":"2312.02204","n_code_links":1,"syntology":null},{"paper":null,"slug":"asynchronous-sgd-on-graphs-a-unified","title":"Asynchronous SGD on Graphs: a Unified Framework for Asynchronous Decentralized and Federated Optimization","date":"2023-11-01","arxiv_id":"2311.00465","n_code_links":0,"syntology":null},{"paper":"/paper/a-quadratic-synchronization-rule-for","slug":"a-quadratic-synchronization-rule-for","title":"A Quadratic Synchronization Rule for Distributed Deep Learning","date":"2023-10-22","arxiv_id":"2310.14423","n_code_links":1,"syntology":{"ran":5,"of":6,"n_ran_checked":5,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["hmgxr128/qsr"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"asynchronous-federated-learning-with-2","title":"Asynchronous Federated Learning with Incentive Mechanism Based on Contract Theory","date":"2023-10-10","arxiv_id":"2310.06448","n_code_links":0,"syntology":null},{"paper":null,"slug":"stability-and-generalization-for-minibatch","title":"Stability and Generalization for Minibatch SGD and Local SGD","date":"2023-10-02","arxiv_id":"2310.01139","n_code_links":0,"syntology":null},{"paper":null,"slug":"global-convergence-analysis-of-local-sgd-for","title":"Global Convergence Analysis of Local SGD for Two-layer Neural Network without Overparameterization","date":"2023-09-21","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"preconditioned-federated-learning","title":"Preconditioned Federated Learning","date":"2023-09-20","arxiv_id":"2309.11378","n_code_links":0,"syntology":null},{"paper":null,"slug":"fedyolo-augmenting-federated-learning-with","title":"FedYolo: Augmenting Federated Learning with Pretrained Transformers","date":"2023-07-10","arxiv_id":"2307.04905","n_code_links":0,"syntology":null},{"paper":null,"slug":"semi-asynchronous-federated-edge-learning","title":"Semi-Asynchronous Federated Edge Learning Mechanism via Over-the-air Computation","date":"2023-05-06","arxiv_id":"2305.04066","n_code_links":0,"syntology":null},{"paper":"/paper/why-and-when-does-local-sgd-generalize-better","slug":"why-and-when-does-local-sgd-generalize-better","title":"Why (and When) does Local SGD Generalize Better than SGD?","date":"2023-03-02","arxiv_id":"2303.01215","n_code_links":1,"syntology":{"ran":8,"of":8,"n_ran_checked":8,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["hmgxr128/local-sgd"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"z-signfedavg-a-unified-stochastic-sign-based","title":"$z$-SignFedAvg: A Unified Stochastic Sign-based Compression for Federated Learning","date":"2023-02-06","arxiv_id":"2302.02589","n_code_links":0,"syntology":null},{"paper":"/paper/when-do-curricula-work-in-federated-learning","slug":"when-do-curricula-work-in-federated-learning","title":"When Do Curricula Work in Federated Learning?","date":"2022-12-24","arxiv_id":"2212.12712","n_code_links":1,"syntology":null},{"paper":null,"slug":"hetsyn-speeding-up-local-sgd-with","title":"STSyn: Speeding Up Local SGD with Straggler-Tolerant Synchronization","date":"2022-10-06","arxiv_id":"2210.03521","n_code_links":0,"syntology":null},{"paper":null,"slug":"on-the-stability-analysis-of-open-federated","title":"On the Stability Analysis of Open Federated Learning Systems","date":"2022-09-25","arxiv_id":"2209.12307","n_code_links":0,"syntology":null},{"paper":"/paper/fedaug-reducing-the-local-learning-bias","slug":"fedaug-reducing-the-local-learning-bias","title":"FedBR: Improving Federated Learning on Heterogeneous Data via Local Learning Bias Reduction","date":"2022-05-26","arxiv_id":"2205.13462","n_code_links":1,"syntology":{"ran":10,"of":15,"n_ran_checked":4,"n_instrument":6,"unverified":5,"pointer_only":2,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 3 honoured, 0 violated, 1 with no contract checked; 6 where Syntology's instrument failed) · 5 unverified","official":{"repos":["lins-lab/fedbr"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":5,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"random-reshuffling-with-variance-reduction-1","title":"Federated Random Reshuffling with Compression and Variance Reduction","date":"2022-05-08","arxiv_id":"2205.03914","n_code_links":0,"syntology":null},{"paper":null,"slug":"federated-stochastic-primal-dual-learning","title":"Federated Stochastic Primal-dual Learning with Differential Privacy","date":"2022-04-26","arxiv_id":"2204.12284","n_code_links":0,"syntology":null},{"paper":null,"slug":"imagenet-challenging-classification-with-the","title":"ImageNet Challenging Classification with the Raspberry Pi: An Incremental Local Stochastic Gradient Descent Algorithm","date":"2022-03-21","arxiv_id":"2203.11853","n_code_links":0,"syntology":null},{"paper":null,"slug":"the-role-of-local-steps-in-local-sgd","title":"The Role of Local Steps in Local SGD","date":"2022-03-14","arxiv_id":"2203.06798","n_code_links":0,"syntology":null},{"paper":null,"slug":"faster-convergence-of-local-sgd-for-over","title":"Faster Convergence of Local SGD for Over-Parameterized Models","date":"2022-01-30","arxiv_id":"2201.12719","n_code_links":0,"syntology":null},{"paper":null,"slug":"partial-model-averaging-in-federated-learning","title":"Partial Model Averaging in Federated Learning: Performance Guarantees and Benefits","date":"2022-01-11","arxiv_id":"2201.03789","n_code_links":0,"syntology":null},{"paper":"/paper/sharp-bounds-for-federated-averaging-local","slug":"sharp-bounds-for-federated-averaging-local","title":"Sharp Bounds for Federated Averaging (Local SGD) and Continuous Perspective","date":"2021-11-05","arxiv_id":"2111.03741","n_code_links":1,"syntology":null},{"paper":null,"slug":"minibatch-vs-local-sgd-with-shuffling-tight-1","title":"Minibatch vs Local SGD with Shuffling: Tight Convergence Bounds and Beyond","date":"2021-10-20","arxiv_id":"2110.10342","n_code_links":0,"syntology":null},{"paper":null,"slug":"trade-offs-of-local-sgd-at-scale-an-empirical","title":"Trade-offs of Local SGD at Scale: An Empirical Study","date":"2021-10-15","arxiv_id":"2110.08133","n_code_links":0,"syntology":null},{"paper":null,"slug":"hybrid-local-sgd-for-federated-learning-with","title":"Hybrid Local SGD for Federated Learning with Heterogeneous Communications","date":"2021-09-29","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"statistical-estimation-and-inference-via","title":"Statistical Estimation and Inference via Local SGD in Federated Learning","date":"2021-09-03","arxiv_id":"2109.01326","n_code_links":0,"syntology":null},{"paper":null,"slug":"the-minimax-complexity-of-distributed","title":"The Minimax Complexity of Distributed Optimization","date":"2021-09-01","arxiv_id":"2109.00534","n_code_links":0,"syntology":null},{"paper":null,"slug":"byzantine-fault-tolerance-in-federated-local","title":"Byzantine Fault-Tolerance in Federated Local SGD under 2f-Redundancy","date":"2021-08-26","arxiv_id":"2108.11769","n_code_links":0,"syntology":null},{"paper":null,"slug":"fedpage-a-fast-local-stochastic-gradient","title":"FedPAGE: A Fast Local Stochastic Gradient Method for Communication-Efficient Federated Learning","date":"2021-08-10","arxiv_id":"2108.04755","n_code_links":0,"syntology":null},{"paper":null,"slug":"local-sgd-optimizes-overparameterized-neural","title":"Local SGD Optimizes Overparameterized Neural Networks in Polynomial Time","date":"2021-07-22","arxiv_id":"2107.10868","n_code_links":0,"syntology":null},{"paper":null,"slug":"stem-a-stochastic-two-sided-momentum","title":"STEM: A Stochastic Two-Sided Momentum Algorithm Achieving Near-Optimal Sample and Communication Complexities for Federated Learning","date":"2021-06-19","arxiv_id":"2106.10435","n_code_links":0,"syntology":null},{"paper":null,"slug":"communication-efficient-sgd-from-local-sgd-to","title":"Communication-efficient SGD: From Local SGD to One-Shot Averaging","date":"2021-06-09","arxiv_id":"2106.04759","n_code_links":0,"syntology":null},{"paper":null,"slug":"accelerating-gossip-sgd-with-periodic-global","title":"Accelerating Gossip SGD with Periodic Global Averaging","date":"2021-05-19","arxiv_id":"2105.09080","n_code_links":0,"syntology":null},{"paper":null,"slug":"local-stochastic-gradient-descent-ascent","title":"Local Stochastic Gradient Descent Ascent: Convergence Analysis and Communication Efficiency","date":"2021-02-25","arxiv_id":"2102.13152","n_code_links":0,"syntology":null},{"paper":"/paper/personalized-federated-learning-a-unified","slug":"personalized-federated-learning-a-unified","title":"Personalized Federated Learning: A Unified Framework and Universal Optimization Techniques","date":"2021-02-19","arxiv_id":"2102.09743","n_code_links":1,"syntology":null},{"paper":null,"slug":"differential-private-hogwild-over-distributed","title":"Proactive DP: A Multple Target Optimization Framework for DP-SGD","date":"2021-02-17","arxiv_id":"2102.09030","n_code_links":0,"syntology":null},{"paper":"/paper/proximal-and-federated-random-reshuffling","slug":"proximal-and-federated-random-reshuffling","title":"Proximal and Federated Random Reshuffling","date":"2021-02-12","arxiv_id":"2102.06704","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["konstmish/rr_prox_fed"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"bias-variance-reduced-local-sgd-for-less","title":"Bias-Variance Reduced Local SGD for Less Heterogeneous Federated Learning","date":"2021-02-05","arxiv_id":"2102.03198","n_code_links":0,"syntology":null},{"paper":null,"slug":"local-sgd-meets-asynchrony","title":"Local SGD Meets Asynchrony","date":"2021-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"multi-level-local-sgd-distributed-sgd-for","title":"Multi-Level Local SGD: Distributed SGD for Heterogeneous Hierarchical Networks","date":"2021-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"local-sgd-unified-theory-and-new-efficient","title":"Local SGD: Unified Theory and New Efficient Methods","date":"2020-11-03","arxiv_id":"2011.02828","n_code_links":0,"syntology":null},{"paper":null,"slug":"hogwild-over-distributed-local-data-sets-with","title":"Hogwild! over Distributed Local Data Sets with Linearly Increasing Mini-Batch Sizes","date":"2020-10-27","arxiv_id":"2010.14763","n_code_links":0,"syntology":null},{"paper":null,"slug":"local-sgd-for-saddle-point-problems","title":"Distributed Saddle-Point Problems: Lower Bounds, Near-Optimal and Robust Algorithms","date":"2020-10-25","arxiv_id":"2010.13112","n_code_links":0,"syntology":null},{"paper":"/paper/over-the-air-federated-learning-from","slug":"over-the-air-federated-learning-from","title":"Over-the-Air Federated Learning from Heterogeneous Data","date":"2020-09-27","arxiv_id":"2009.12787","n_code_links":1,"syntology":null},{"paper":"/paper/multi-level-local-sgd-for-heterogeneous","slug":"multi-level-local-sgd-for-heterogeneous","title":"Multi-Level Local SGD for Heterogeneous Hierarchical Networks","date":"2020-07-27","arxiv_id":"2007.13819","n_code_links":1,"syntology":{"ran":10,"of":17,"n_ran_checked":5,"n_instrument":5,"unverified":7,"pointer_only":17,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 3 honoured, 0 violated, 2 with no contract checked; 5 where Syntology's instrument failed) · 7 unverified","official":{"repos":["rpi-nsl/MLL-SGD"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":7,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"stl-sgd-speeding-up-local-sgd-with-stagewise","title":"STL-SGD: Speeding Up Local SGD with Stagewise Communication Period","date":"2020-06-11","arxiv_id":"2006.06377","n_code_links":0,"syntology":null},{"paper":null,"slug":"minibatch-vs-local-sgd-for-heterogeneous","title":"Minibatch vs Local SGD for Heterogeneous Distributed Learning","date":"2020-06-08","arxiv_id":"2006.04735","n_code_links":0,"syntology":null},{"paper":null,"slug":"local-sgd-with-a-communication-overhead","title":"Local SGD With a Communication Overhead Depending Only on the Number of Workers","date":"2020-06-03","arxiv_id":"2006.02582","n_code_links":0,"syntology":null},{"paper":null,"slug":"squarm-sgd-communication-efficient-momentum","title":"SQuARM-SGD: Communication-Efficient Momentum SGD for Decentralized Optimization","date":"2020-05-13","arxiv_id":"2005.07041","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-unified-theory-of-decentralized-sgd-with","title":"A Unified Theory of Decentralized SGD with Changing Topology and Local Updates","date":"2020-03-23","arxiv_id":"2003.10422","n_code_links":0,"syntology":null},{"paper":null,"slug":"is-local-sgd-better-than-minibatch-sgd","title":"Is Local SGD Better than Minibatch SGD?","date":"2020-02-18","arxiv_id":"2002.07839","n_code_links":0,"syntology":null},{"paper":"/paper/variance-reduced-local-sgd-with-lower-1","slug":"variance-reduced-local-sgd-with-lower-1","title":"Variance Reduced Local SGD with Lower Communication Complexity","date":"2019-12-30","arxiv_id":"1912.12844","n_code_links":1,"syntology":null},{"paper":null,"slug":"on-the-convergence-of-local-descent-methods","title":"On the Convergence of Local Descent Methods in Federated Learning","date":"2019-10-31","arxiv_id":"1910.14425","n_code_links":0,"syntology":null},{"paper":"/paper/local-sgd-with-periodic-averaging-tighter","slug":"local-sgd-with-periodic-averaging-tighter","title":"Local SGD with Periodic Averaging: Tighter Analysis and Adaptive Synchronization","date":"2019-10-30","arxiv_id":"1910.13598","n_code_links":2,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["mmkamani7/LUPA-SGD"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/slowmo-improving-communication-efficient","slug":"slowmo-improving-communication-efficient","title":"SlowMo: Improving Communication-Efficient Distributed SGD with Slow Momentum","date":"2019-10-01","arxiv_id":"1910.00643","n_code_links":2,"syntology":{"ran":0,"of":3,"n_ran_checked":0,"n_instrument":0,"unverified":3,"pointer_only":1,"phrase":"0 ran · 3 unverified","official":{"repos":["facebookresearch/fairscale"],"state":"official: harvested for another paper","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]}}},{"paper":null,"slug":"better-communication-complexity-for-local-sgd","title":"Tighter Theory for Local SGD on Identical and Heterogeneous Data","date":"2019-09-10","arxiv_id":"1909.04746","n_code_links":0,"syntology":null},{"paper":"/paper/local-sgd-converges-fast-and-communicates","slug":"local-sgd-converges-fast-and-communicates","title":"Local SGD Converges Fast and Communicates Little","date":"2018-05-24","arxiv_id":"1805.09767","n_code_links":2,"syntology":null}],"papers_shown":69,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":69,"with_a_code_link":16,"where_syntology_ran_a_sample":6,"not_listed_spam_title":0,"listed":69,"listed_where_code_ran":6,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":6,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":6,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":6,"papers_where_code_ran_first_page":"/method/local-sgd/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/local-sgd/papers/ran/1","json":"/method/local-sgd/papers/ran/1.json","rows":6}],"tasks":[{"task":"/task/federated-learning","name":"Federated Learning","papers":27},{"task":"/task/distributed-optimization","name":"Distributed Optimization","papers":11},{"task":"/task/image-classification","name":"Image Classification","papers":4},{"task":"/task/language-modeling","name":"Language Modeling","papers":4},{"task":"/task/language-modelling","name":"Language Modelling","papers":4},{"task":"/task/image-classification","name":"image-classification","papers":4},{"task":"/task/edge-computing","name":"Edge-computing","papers":3},{"task":"/task/stochastic-optimization","name":"Stochastic Optimization","papers":3},{"task":"/task/machine-learning","name":"BIG-bench Machine Learning","papers":2},{"task":"/task/blocking","name":"Blocking","papers":2},{"task":"/task/privacy-preserving","name":"Privacy Preserving","papers":2},{"task":"/task/2k","name":"2k","papers":1},{"task":null,"name":"CPU","papers":1},{"task":"/task/deep-learning","name":"Deep Learning","papers":1},{"task":"/task/domain-generalization","name":"Domain Generalization","papers":1},{"task":null,"name":"GPU","papers":1},{"task":"/task/large-language-model","name":"Large Language Model","papers":1},{"task":"/task/machine-translation","name":"Machine Translation","papers":1},{"task":"/task/multi-task-learning","name":"Multi-Task Learning","papers":1},{"task":"/task/personalized-federated-learning","name":"Personalized Federated Learning","papers":1}],"tasks_shown":20,"n_tasks":23,"usage_by_year":[{"year":"2018","papers":1},{"year":"2019","papers":5},{"year":"2020","papers":11},{"year":"2021","papers":19},{"year":"2022","papers":10},{"year":"2023","papers":11},{"year":"2024","papers":9},{"year":"2025","papers":3}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/local-sgd"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=Local%20SGD","read_at":"2026-10-05T00:58:41+00:00","query":"Local SGD","kind":"paper","have":"no_code","tier":"paper_only","verified_implementation":false,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"arxiv_id":"2011.02828"},"resolution":"paper","resolved_name_differs":false,"absence_asserted":"for_this_paper_only","absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"different_paper","archive_paper_arxiv_id":"1805.09767","repositories":{"listed":null,"in_graph":0,"list_truncated":null,"strongest_link":null},"retrieve_with":null,"name_competition":{"verdict":"sole_bearer","may_be_wrong_sense":false,"bearers_found":1,"served":{"arxiv_id":"2011.02828","citations":126},"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing else in this corpus is named 'Local SGD'. That is a statement about this corpus and not about the field: short names are reused, and a sense we never collected cannot show up here. Confirm `served.arxiv_id` if you had a specific paper in mind."},"name_competition_text":null,"near_matches":null,"code_nearby":[],"code_nearby_caption":null,"origin_paper":{"arxiv_id":"2011.02828","page":null,"syntology_url":"https://syntology.ai/paper/2011.02828","in_graph_layer":false,"samples":0},"line":"about another paper, arXiv:2011.02828: the paper matched by title held, no code (no_code; paper_only). The lookup matched a paper by its title, arXiv:2011.02828, not a method entry. About another paper: this answer is about arXiv:2011.02828, while the archive credits arXiv:1805.09767, so it does not say whether this method has code.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"273712fcb6310ad653dc1407314190aab8cc032f8b69476b3efbc8ef5ab98325","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}