{"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":"/task/distributed-optimization/papers/ran/1","list_of":"/task/distributed-optimization","task":"Distributed Optimization","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,14],"of":14,"counts":{"archive_papers_tagged":536,"with_a_code_link":86,"where_syntology_ran_a_sample":14,"not_listed_spam_title":0,"listed":536,"listed_where_code_ran":14,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":13,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":13,"listed_every_run_a_failure_of_syntologys_instrument":1,"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"},"first_page":"/task/distributed-optimization/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/optimization-algorithm-design-via-electric","slug":"optimization-algorithm-design-via-electric","title":"Optimization Algorithm Design via Electric Circuits","date":"2024-11-04","arxiv_id":"2411.02573","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_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) · 3 unverified","sample_list":"/paper/optimization-algorithm-design-via-electric#ran","syntology_url":"https://syntology.ai/paper/2411.02573","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.02573"}},"official":{"repos":["cvxgrp/optimization_via_circuits"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/microadam-accurate-adaptive-optimization-with","slug":"microadam-accurate-adaptive-optimization-with","title":"MicroAdam: Accurate Adaptive Optimization with Low Space Overhead and Provable Convergence","date":"2024-05-24","arxiv_id":"2405.15593","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/microadam-accurate-adaptive-optimization-with#ran","syntology_url":"https://syntology.ai/paper/2405.15593","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.15593"}},"official":{"repos":["ist-daslab/microadam"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/federated-learning-as-variational-inference-a","slug":"federated-learning-as-variational-inference-a","title":"Federated Learning as Variational Inference: A Scalable Expectation Propagation Approach","date":"2023-02-08","arxiv_id":"2302.04228","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/federated-learning-as-variational-inference-a#ran","syntology_url":"https://syntology.ai/paper/2302.04228","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.04228"}},"official":{"repos":["hanguo97/expectation-propagation"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/recycling-model-updates-in-federated-learning-1","slug":"recycling-model-updates-in-federated-learning-1","title":"Recycling Model Updates in Federated Learning: Are Gradient Subspaces Low-Rank?","date":"2022-02-01","arxiv_id":"2202.00280","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/recycling-model-updates-in-federated-learning-1#ran","syntology_url":"https://syntology.ai/paper/2202.00280","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.00280"}},"official":{"repos":["shams-sam/fedoptim"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/secure-distributed-training-at-scale","slug":"secure-distributed-training-at-scale","title":"Secure Distributed Training at Scale","date":"2021-06-21","arxiv_id":"2106.11257","repositories_listed":3,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/secure-distributed-training-at-scale#ran","syntology_url":"https://syntology.ai/paper/2106.11257","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.11257"}},"official":{"repos":["yandex-research/btard","iclr-paper/btard"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/moshpit-sgd-communication-efficient","slug":"moshpit-sgd-communication-efficient","title":"Moshpit SGD: Communication-Efficient Decentralized Training on Heterogeneous Unreliable Devices","date":"2021-03-04","arxiv_id":"2103.03239","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_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","sample_list":"/paper/moshpit-sgd-communication-efficient#ran","syntology_url":"https://syntology.ai/paper/2103.03239","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.03239"}},"official":{"repos":["yandex-research/moshpit-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"]}}},{"url":"/paper/training-large-neural-networks-with-constant","slug":"training-large-neural-networks-with-constant","title":"Training Large Neural Networks with Constant Memory using a New Execution Algorithm","date":"2020-02-13","arxiv_id":"2002.05645","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/training-large-neural-networks-with-constant#ran","syntology_url":"https://syntology.ai/paper/2002.05645","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.05645"}},"official":null}},{"url":"/paper/feddane-a-federated-newton-type-method","slug":"feddane-a-federated-newton-type-method","title":"FedDANE: A Federated Newton-Type Method","date":"2020-01-07","arxiv_id":"2001.01920","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_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","sample_list":"/paper/feddane-a-federated-newton-type-method#ran","syntology_url":"https://syntology.ai/paper/2001.01920","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.01920"}},"official":{"repos":["litian96/FedDANE"],"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"]}}},{"url":"/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","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_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","sample_list":"/paper/local-sgd-with-periodic-averaging-tighter#ran","syntology_url":"https://syntology.ai/paper/1910.13598","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.13598"}},"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"]}}},{"url":"/paper/scaffold-stochastic-controlled-averaging-for","slug":"scaffold-stochastic-controlled-averaging-for","title":"SCAFFOLD: Stochastic Controlled Averaging for Federated Learning","date":"2019-10-14","arxiv_id":"1910.06378","repositories_listed":8,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/scaffold-stochastic-controlled-averaging-for#ran","syntology_url":"https://syntology.ai/paper/1910.06378","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.06378"}},"official":null}},{"url":"/paper/190807873","slug":"190807873","title":"Federated Learning: Challenges, Methods, and Future Directions","date":"2019-08-21","arxiv_id":"1908.07873","repositories_listed":2,"syntology":{"n":11,"n_ran":11,"n_constructed":0,"n_ran_checked":9,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":4,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/190807873#ran","syntology_url":"https://syntology.ai/paper/1908.07873","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.07873"}},"official":null}},{"url":"/paper/powersgd-practical-low-rank-gradient","slug":"powersgd-practical-low-rank-gradient","title":"PowerSGD: Practical Low-Rank Gradient Compression for Distributed Optimization","date":"2019-05-31","arxiv_id":"1905.13727","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/powersgd-practical-low-rank-gradient#ran","syntology_url":"https://syntology.ai/paper/1905.13727","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.13727"}},"official":{"repos":["epfml/powersgd"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/federated-optimization-for-heterogeneous","slug":"federated-optimization-for-heterogeneous","title":"Federated Optimization in Heterogeneous Networks","date":"2018-12-14","arxiv_id":"1812.06127","repositories_listed":22,"syntology":{"n":26,"n_ran":15,"n_constructed":6,"n_ran_checked":15,"n_instrument":0,"n_unverified":11,"n_honours":2,"n_violates":0,"n_no_contract":13,"n_pointer_only":9,"phrase":"15 ran (of which 6 constructed an object rather than computing a result; 15 with no instrument failure: 2 honoured, 0 violated, 13 with no contract checked; 0 where Syntology's instrument failed) · 11 unverified","sample_list":"/paper/federated-optimization-for-heterogeneous#ran","syntology_url":"https://syntology.ai/paper/1812.06127","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.06127"}},"official":{"repos":["litian96/FedProx"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/sparsified-sgd-with-memory","slug":"sparsified-sgd-with-memory","title":"Sparsified SGD with Memory","date":"2018-09-20","arxiv_id":"1809.07599","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/sparsified-sgd-with-memory#ran","syntology_url":"https://syntology.ai/paper/1809.07599","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.07599"}},"official":{"repos":["epfml/sparsifiedSGD"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}}],"record_sha256":"346ebdf31fd3b0b92fe32749346c86507f6180493e738ebf1fdcf4c82806dff2","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}