{"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","name":"Distributed Optimization","slug":"distributed-optimization","description_markdown":"The goal of **Distributed Optimization** is to optimize a certain objective defined over millions of billions of data that is distributed over many machines by utilizing the computational power of these machines.\n\n\n<span class=\"description-source\">Source: [Analysis of Distributed StochasticDual Coordinate Ascent ](https://arxiv.org/abs/1312.1031)</span>","categories":[{"name":"Methodology","url":"/area/methodology"},{"name":"Miscellaneous","url":"/area/miscellaneous"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":536,"papers_with_code":86,"benchmarks":1,"benchmark_tables_in_archive":1,"benchmark_tables_shown":1,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":0,"subtasks":0,"parent_tasks":1},"benchmarks":[{"leaderboard":"/sota/distributed-optimization-on","slug":"distributed-optimization-on","dataset":"^(#$!@#$)(()))******","dataset_url":null,"rows_in_archive":1,"metrics":["0..5sec"],"first_row_in_archive_order":{"model":"多微电网区域配电系统的多目标分布式优化","paper_title":"Multi-objective Distributed Optimization for Zonal Distribution System with Multi-Microgrids","paper_url":"/paper/multi-objective-distributed-optimization-for","paper_date":"2022-02-20","arxiv_id":"2202.09762","code_links":[],"syntology":null}}],"datasets":[],"subtasks":[],"parent_tasks":[{"url":"/task/stochastic-optimization","name":"Stochastic Optimization"}],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":6,"rows_per_page":100,"shown":100,"of":536,"of_with_code":86,"tagged_in_all":536,"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"},"items":[{"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/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/power-bundle-adjustment-for-large-scale-3d","slug":"power-bundle-adjustment-for-large-scale-3d","title":"Power Bundle Adjustment for Large-Scale 3D Reconstruction","date":"2022-04-27","arxiv_id":"2204.12834","repositories_listed":3,"syntology":null},{"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/zoopt-toolbox-for-derivative-free","slug":"zoopt-toolbox-for-derivative-free","title":"ZOOpt: Toolbox for Derivative-Free Optimization","date":"2017-12-31","arxiv_id":"1801.00329","repositories_listed":3,"syntology":null},{"url":"/paper/distributed-adversarial-training-to-robustify-1","slug":"distributed-adversarial-training-to-robustify-1","title":"Distributed Adversarial Training to Robustify Deep Neural Networks at Scale","date":"2022-06-13","arxiv_id":"2206.06257","repositories_listed":2,"syntology":null},{"url":"/paper/deeplm-large-scale-nonlinear-least-squares-on","slug":"deeplm-large-scale-nonlinear-least-squares-on","title":"DeepLM: Large-Scale Nonlinear Least Squares on Deep Learning Frameworks Using Stochastic Domain Decomposition","date":"2021-06-19","arxiv_id":null,"repositories_listed":2,"syntology":null},{"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/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","repositories_listed":2,"syntology":{"n":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 3 unverified","sample_list":"/paper/slowmo-improving-communication-efficient#ran","syntology_url":"https://syntology.ai/paper/1910.00643","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.00643"}},"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":[]}}},{"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":7,"n_instrument":4,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":4,"phrase":"11 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; 4 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/robust-learning-from-untrusted-sources","slug":"robust-learning-from-untrusted-sources","title":"Robust Learning from Untrusted Sources","date":"2019-01-29","arxiv_id":"1901.10310","repositories_listed":2,"syntology":null},{"url":"/paper/cocoa-a-general-framework-for-communication","slug":"cocoa-a-general-framework-for-communication","title":"CoCoA: A General Framework for Communication-Efficient Distributed Optimization","date":"2016-11-07","arxiv_id":"1611.02189","repositories_listed":2,"syntology":null},{"url":"/paper/l1-regularized-distributed-optimization-a","slug":"l1-regularized-distributed-optimization-a","title":"L1-Regularized Distributed Optimization: A Communication-Efficient Primal-Dual Framework","date":"2015-12-13","arxiv_id":"1512.04011","repositories_listed":2,"syntology":null},{"url":"/paper/dplib-a-standard-benchmark-library-for","slug":"dplib-a-standard-benchmark-library-for","title":"DPLib: A Standard Benchmark Library for Distributed Power System Analysis and Optimization","date":"2025-06-25","arxiv_id":"2506.20819","repositories_listed":1,"syntology":null},{"url":"/paper/opportunistic-routing-in-wireless","slug":"opportunistic-routing-in-wireless","title":"Opportunistic Routing in Wireless Communications via Learnable State-Augmented Policies","date":"2025-03-05","arxiv_id":"2503.03736","repositories_listed":1,"syntology":null},{"url":"/paper/fedcfa-alleviating-simpson-s-paradox-in-model","slug":"fedcfa-alleviating-simpson-s-paradox-in-model","title":"FedCFA: Alleviating Simpson's Paradox in Model Aggregation with Counterfactual Federated Learning","date":"2024-12-25","arxiv_id":"2412.18904","repositories_listed":1,"syntology":null},{"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":2,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 0 violated, 3 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/gnn-empowered-effective-partial-observation","slug":"gnn-empowered-effective-partial-observation","title":"GNN-Empowered Effective Partial Observation MARL Method for AoI Management in Multi-UAV Network","date":"2024-08-18","arxiv_id":"2409.00036","repositories_listed":1,"syntology":null},{"url":"/paper/communication-and-computation-efficient","slug":"communication-and-computation-efficient","title":"Communication- and Computation-Efficient Distributed Submodular Optimization in Robot Mesh Networks","date":"2024-07-15","arxiv_id":"2407.10382","repositories_listed":1,"syntology":null},{"url":"/paper/acco-accumulate-while-you-communicate-hiding","slug":"acco-accumulate-while-you-communicate-hiding","title":"ACCO: Accumulate While You Communicate for Communication-Overlapped Sharded LLM Training","date":"2024-06-03","arxiv_id":"2406.02613","repositories_listed":1,"syntology":null},{"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":4,"n_instrument":3,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":3,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 1 violated, 3 with no contract checked; 3 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":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/analysis-of-distributed-optimization","slug":"analysis-of-distributed-optimization","title":"PIM-Opt: Demystifying Distributed Optimization Algorithms on a Real-World Processing-In-Memory System","date":"2024-04-10","arxiv_id":"2404.07164","repositories_listed":1,"syntology":null},{"url":"/paper/fairsync-ensuring-amortized-group-exposure-in","slug":"fairsync-ensuring-amortized-group-exposure-in","title":"FairSync: Ensuring Amortized Group Exposure in Distributed Recommendation Retrieval","date":"2024-02-16","arxiv_id":"2402.10628","repositories_listed":1,"syntology":null},{"url":"/paper/distributed-markov-chain-monte-carlo-sampling","slug":"distributed-markov-chain-monte-carlo-sampling","title":"Distributed Markov Chain Monte Carlo Sampling based on the Alternating Direction Method of Multipliers","date":"2024-01-29","arxiv_id":"2401.15838","repositories_listed":1,"syntology":null},{"url":"/paper/asynchronous-local-sgd-training-for-language","slug":"asynchronous-local-sgd-training-for-language","title":"Asynchronous Local-SGD Training for Language Modeling","date":"2024-01-17","arxiv_id":"2401.09135","repositories_listed":1,"syntology":null},{"url":"/paper/communication-compression-for-byzantine","slug":"communication-compression-for-byzantine","title":"Communication Compression for Byzantine Robust Learning: New Efficient Algorithms and Improved Rates","date":"2023-10-15","arxiv_id":"2310.09804","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/communication-compression-for-byzantine#ran","syntology_url":"https://syntology.ai/paper/2310.09804","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.09804"}},"official":{"repos":["nikosimus/cc-for-br-learning"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/transmission-investment-coordination-using","slug":"transmission-investment-coordination-using","title":"Transmission Investment Coordination using MILP Lagrange Dual Decomposition and Auxiliary Problem Principle","date":"2023-10-10","arxiv_id":"2310.06231","repositories_listed":1,"syntology":null},{"url":"/paper/a-primal-dual-perspective-for-distributed-td","slug":"a-primal-dual-perspective-for-distributed-td","title":"A primal-dual perspective for distributed TD-learning","date":"2023-10-01","arxiv_id":"2310.00638","repositories_listed":1,"syntology":null},{"url":"/paper/differentially-private-distributed-estimation","slug":"differentially-private-distributed-estimation","title":"Differentially Private Distributed Estimation and Learning","date":"2023-06-28","arxiv_id":"2306.15865","repositories_listed":1,"syntology":null},{"url":"/paper/just-one-byte-per-gradient-a-note-on-low","slug":"just-one-byte-per-gradient-a-note-on-low","title":"Just One Byte (per gradient): A Note on Low-Bandwidth Decentralized Language Model Finetuning Using Shared Randomness","date":"2023-06-16","arxiv_id":"2306.10015","repositories_listed":1,"syntology":null},{"url":"/paper/error-feedback-shines-when-features-are-rare","slug":"error-feedback-shines-when-features-are-rare","title":"Error Feedback Shines when Features are Rare","date":"2023-05-24","arxiv_id":"2305.15264","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-convergence-of-decentralized-federated","slug":"on-the-convergence-of-decentralized-federated","title":"On the Convergence of Decentralized Federated Learning Under Imperfect Information Sharing","date":"2023-03-19","arxiv_id":"2303.10695","repositories_listed":1,"syntology":null},{"url":"/paper/byzantine-robust-loopless-stochastic-variance","slug":"byzantine-robust-loopless-stochastic-variance","title":"Byzantine-Robust Loopless Stochastic Variance-Reduced Gradient","date":"2023-03-08","arxiv_id":"2303.04560","repositories_listed":1,"syntology":null},{"url":"/paper/tamuna-accelerated-federated-learning-with","slug":"tamuna-accelerated-federated-learning-with","title":"TAMUNA: Doubly Accelerated Distributed Optimization with Local Training, Compression, and Partial Participation","date":"2023-02-20","arxiv_id":"2302.09832","repositories_listed":1,"syntology":null},{"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/beyond-spectral-gap-extended-the-role-of-the","slug":"beyond-spectral-gap-extended-the-role-of-the","title":"Beyond spectral gap (extended): The role of the topology in decentralized learning","date":"2023-01-05","arxiv_id":"2301.02151","repositories_listed":1,"syntology":null},{"url":"/paper/gradskip-communication-accelerated-local","slug":"gradskip-communication-accelerated-local","title":"GradSkip: Communication-Accelerated Local Gradient Methods with Better Computational Complexity","date":"2022-10-28","arxiv_id":"2210.16402","repositories_listed":1,"syntology":null},{"url":"/paper/shuffle-qudio-accelerate-distributed-vqe-with","slug":"shuffle-qudio-accelerate-distributed-vqe-with","title":"Shuffle-QUDIO: accelerate distributed VQE with trainability enhancement and measurement reduction","date":"2022-09-26","arxiv_id":"2209.12454","repositories_listed":1,"syntology":null},{"url":"/paper/cooperative-tuning-of-multi-agent-optimal","slug":"cooperative-tuning-of-multi-agent-optimal","title":"Cooperative Tuning of Multi-Agent Optimal Control Systems","date":"2022-09-24","arxiv_id":"2209.12017","repositories_listed":1,"syntology":null},{"url":"/paper/variance-reduced-proxskip-algorithm-theory","slug":"variance-reduced-proxskip-algorithm-theory","title":"Variance Reduced ProxSkip: Algorithm, Theory and Application to Federated Learning","date":"2022-07-09","arxiv_id":"2207.04338","repositories_listed":1,"syntology":null},{"url":"/paper/beyond-spectral-gap-the-role-of-the-topology","slug":"beyond-spectral-gap-the-role-of-the-topology","title":"Beyond spectral gap: The role of the topology in decentralized learning","date":"2022-06-07","arxiv_id":"2206.03093","repositories_listed":1,"syntology":null},{"url":"/paper/ef-bv-a-unified-theory-of-error-feedback-and","slug":"ef-bv-a-unified-theory-of-error-feedback-and","title":"EF-BV: A Unified Theory of Error Feedback and Variance Reduction Mechanisms for Biased and Unbiased Compression in Distributed Optimization","date":"2022-05-09","arxiv_id":"2205.04180","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/ef-bv-a-unified-theory-of-error-feedback-and#ran","syntology_url":"https://syntology.ai/paper/2205.04180","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.04180"}},"official":{"repos":["WilliamYi96/EF-BV"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/acceleration-of-federated-learning-with-1","slug":"acceleration-of-federated-learning-with-1","title":"Acceleration of Federated Learning with Alleviated Forgetting in Local Training","date":"2022-03-05","arxiv_id":"2203.02645","repositories_listed":1,"syntology":null},{"url":"/paper/signal-decomposition-using-masked-proximal","slug":"signal-decomposition-using-masked-proximal","title":"Signal Decomposition Using Masked Proximal Operators","date":"2022-02-18","arxiv_id":"2202.09338","repositories_listed":1,"syntology":null},{"url":"/paper/dasha-distributed-nonconvex-optimization-with","slug":"dasha-distributed-nonconvex-optimization-with","title":"DASHA: Distributed Nonconvex Optimization with Communication Compression, Optimal Oracle Complexity, and No Client Synchronization","date":"2022-02-02","arxiv_id":"2202.01268","repositories_listed":1,"syntology":null},{"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/distributed-optimization-using-heterogeneous","slug":"distributed-optimization-using-heterogeneous","title":"Distributed Optimization using Heterogeneous Compute Systems","date":"2021-10-03","arxiv_id":"2110.08941","repositories_listed":1,"syntology":null},{"url":"/paper/quantization-for-distributed-optimization","slug":"quantization-for-distributed-optimization","title":"Unbiased Single-scale and Multi-scale Quantizers for Distributed Optimization","date":"2021-09-26","arxiv_id":"2109.12497","repositories_listed":1,"syntology":null},{"url":"/paper/communication-efficient-distributed-linear","slug":"communication-efficient-distributed-linear","title":"Communication-Efficient Federated Linear and Deep Generalized Canonical Correlation Analysis","date":"2021-09-25","arxiv_id":"2109.12400","repositories_listed":1,"syntology":null},{"url":"/paper/private-multi-task-learning-formulation-and","slug":"private-multi-task-learning-formulation-and","title":"Private Multi-Task Learning: Formulation and Applications to Federated Learning","date":"2021-08-30","arxiv_id":"2108.12978","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-communication-topologies-for","slug":"dynamic-communication-topologies-for","title":"Dynamic communication topologies for distributed heuristics in energy system optimization algorithms","date":"2021-08-03","arxiv_id":"2108.01380","repositories_listed":1,"syntology":null},{"url":"/paper/bagua-scaling-up-distributed-learning-with","slug":"bagua-scaling-up-distributed-learning-with","title":"BAGUA: Scaling up Distributed Learning with System Relaxations","date":"2021-07-03","arxiv_id":"2107.01499","repositories_listed":1,"syntology":null},{"url":"/paper/an-efficient-learning-framework-for-federated","slug":"an-efficient-learning-framework-for-federated","title":"An Efficient Learning Framework For Federated XGBoost Using Secret Sharing And Distributed Optimization","date":"2021-05-12","arxiv_id":"2105.05717","repositories_listed":1,"syntology":null},{"url":"/paper/distributed-learning-and-democratic","slug":"distributed-learning-and-democratic","title":"Efficient Randomized Subspace Embeddings for Distributed Optimization under a Communication Budget","date":"2021-03-13","arxiv_id":"2103.07578","repositories_listed":1,"syntology":null},{"url":"/paper/decentralized-riemannian-gradient-descent-on","slug":"decentralized-riemannian-gradient-descent-on","title":"Decentralized Riemannian Gradient Descent on the Stiefel Manifold","date":"2021-02-14","arxiv_id":"2102.07091","repositories_listed":1,"syntology":null},{"url":"/paper/wyner-ziv-estimators-efficient-distributed","slug":"wyner-ziv-estimators-efficient-distributed","title":"Wyner-Ziv Estimators for Distributed Mean Estimation with Side Information and Optimization","date":"2020-11-24","arxiv_id":"2011.12160","repositories_listed":1,"syntology":null},{"url":"/paper/distributed-resource-allocation-with-multi","slug":"distributed-resource-allocation-with-multi","title":"Distributed Resource Allocation with Multi-Agent Deep Reinforcement Learning for 5G-V2V Communication","date":"2020-10-11","arxiv_id":"2010.05290","repositories_listed":1,"syntology":null},{"url":"/paper/distributed-optimization-averaging-via-admm","slug":"distributed-optimization-averaging-via-admm","title":"Distributed Optimization, Averaging via ADMM, and Network Topology","date":"2020-09-05","arxiv_id":"2009.02604","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-networks-for-scalable-radio","slug":"graph-neural-networks-for-scalable-radio","title":"Graph Neural Networks for Scalable Radio Resource Management: Architecture Design and Theoretical Analysis","date":"2020-07-15","arxiv_id":"2007.07632","repositories_listed":1,"syntology":null},{"url":"/paper/distributed-optimization-for-nonrigid-nano","slug":"distributed-optimization-for-nonrigid-nano","title":"Distributed optimization for nonrigid nano-tomography","date":"2020-07-11","arxiv_id":"2008.03375","repositories_listed":1,"syntology":null},{"url":"/paper/federated-learning-with-compression-unified","slug":"federated-learning-with-compression-unified","title":"Federated Learning with Compression: Unified Analysis and Sharp Guarantees","date":"2020-07-02","arxiv_id":"2007.01154","repositories_listed":1,"syntology":null},{"url":"/paper/byzantine-robust-learning-on-heterogeneous","slug":"byzantine-robust-learning-on-heterogeneous","title":"Byzantine-Robust Learning on Heterogeneous Datasets via Bucketing","date":"2020-06-16","arxiv_id":"2006.09365","repositories_listed":1,"syntology":null},{"url":"/paper/federated-accelerated-stochastic-gradient","slug":"federated-accelerated-stochastic-gradient","title":"Federated Accelerated Stochastic Gradient Descent","date":"2020-06-16","arxiv_id":"2006.08950","repositories_listed":1,"syntology":null},{"url":"/paper/mango-a-python-library-for-parallel","slug":"mango-a-python-library-for-parallel","title":"MANGO: A Python Library for Parallel Hyperparameter Tuning","date":"2020-05-22","arxiv_id":"2005.11394","repositories_listed":1,"syntology":null},{"url":"/paper/communication-efficient-distributed-6","slug":"communication-efficient-distributed-6","title":"Communication-Efficient Distributed Stochastic AUC Maximization with Deep Neural Networks","date":"2020-05-05","arxiv_id":"2005.02426","repositories_listed":1,"syntology":null},{"url":"/paper/privacy-preserving-distributed-optimization","slug":"privacy-preserving-distributed-optimization","title":"Privacy-Preserving Distributed Optimization via Subspace Perturbation: A General Framework","date":"2020-04-29","arxiv_id":"2004.13999","repositories_listed":1,"syntology":null},{"url":"/paper/manifold-identification-for-ultimately","slug":"manifold-identification-for-ultimately","title":"Manifold Identification for Ultimately Communication-Efficient Distributed Optimization","date":"2020-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/a-distributed-quasi-newton-algorithm-for-1","slug":"a-distributed-quasi-newton-algorithm-for-1","title":"A Distributed Quasi-Newton Algorithm for Primal and Dual Regularized Empirical Risk Minimization","date":"2019-12-12","arxiv_id":"1912.06508","repositories_listed":1,"syntology":null},{"url":"/paper/qsparse-local-sgd-distributed-sgd-with-1","slug":"qsparse-local-sgd-distributed-sgd-with-1","title":"Qsparse-local-SGD: Distributed SGD with Quantization, Sparsification and Local Computations","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/accelerated-primal-dual-algorithms-for","slug":"accelerated-primal-dual-algorithms-for","title":"Accelerated Primal-Dual Algorithms for Distributed Smooth Convex Optimization over Networks","date":"2019-10-23","arxiv_id":"1910.10666","repositories_listed":1,"syntology":null},{"url":"/paper/communication-efficient-distributed-5","slug":"communication-efficient-distributed-5","title":"Communication-Efficient Distributed Optimization in Networks with Gradient Tracking and Variance Reduction","date":"2019-09-12","arxiv_id":"1909.05844","repositories_listed":1,"syntology":null},{"url":"/paper/trading-redundancy-for-communication-speeding","slug":"trading-redundancy-for-communication-speeding","title":"Trading Redundancy for Communication: Speeding up Distributed SGD for Non-convex Optimization","date":"2019-07-03","arxiv_id":null,"repositories_listed":1,"syntology":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/oversketched-newton-fast-convex-optimization","slug":"oversketched-newton-fast-convex-optimization","title":"OverSketched Newton: Fast Convex Optimization for Serverless Systems","date":"2019-03-21","arxiv_id":"1903.08857","repositories_listed":1,"syntology":null},{"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"]}}},{"url":"/paper/a-distributed-quasi-newton-algorithm-for","slug":"a-distributed-quasi-newton-algorithm-for","title":"A Distributed Quasi-Newton Algorithm for Empirical Risk Minimization with Nonsmooth Regularization","date":"2018-03-04","arxiv_id":"1803.01370","repositories_listed":1,"syntology":null},{"url":"/paper/an-accelerated-communication-efficient-primal","slug":"an-accelerated-communication-efficient-primal","title":"An Accelerated Communication-Efficient Primal-Dual Optimization Framework for Structured Machine Learning","date":"2017-11-14","arxiv_id":"1711.05305","repositories_listed":1,"syntology":null},{"url":"/paper/optimal-algorithms-for-smooth-and-strongly","slug":"optimal-algorithms-for-smooth-and-strongly","title":"Optimal algorithms for smooth and strongly convex distributed optimization in networks","date":"2017-02-28","arxiv_id":"1702.08704","repositories_listed":1,"syntology":null},{"url":"/paper/optimization-for-large-scale-machine-learning","slug":"optimization-for-large-scale-machine-learning","title":"Optimization for Large-Scale Machine Learning with Distributed Features and Observations","date":"2016-10-31","arxiv_id":"1610.10060","repositories_listed":1,"syntology":null},{"url":"/paper/accelerating-exact-and-approximate-inference","slug":"accelerating-exact-and-approximate-inference","title":"Accelerating Exact and Approximate Inference for (Distributed) Discrete Optimization with GPUs","date":"2016-08-18","arxiv_id":"1608.05288","repositories_listed":1,"syntology":null},{"url":"/paper/distributed-optimization-with-arbitrary-local","slug":"distributed-optimization-with-arbitrary-local","title":"Distributed Optimization with Arbitrary Local Solvers","date":"2015-12-13","arxiv_id":"1512.04039","repositories_listed":1,"syntology":null},{"url":"/paper/adding-vs-averaging-in-distributed-primal","slug":"adding-vs-averaging-in-distributed-primal","title":"Adding vs. Averaging in Distributed Primal-Dual Optimization","date":"2015-02-12","arxiv_id":"1502.03508","repositories_listed":1,"syntology":null},{"url":"/paper/communication-efficient-distributed-1","slug":"communication-efficient-distributed-1","title":"Communication Efficient Distributed Optimization using an Approximate Newton-type Method","date":"2013-12-30","arxiv_id":"1312.7853","repositories_listed":1,"syntology":null},{"url":null,"slug":"communication-efficient-differentially","title":"Communication Efficient, Differentially Private Distributed Optimization using Correlation-Aware Sketching","date":"2025-07-04","arxiv_id":"2507.03545","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-timescale-gradient-sliding-for","title":"Multi-Timescale Gradient Sliding for Distributed Optimization","date":"2025-06-18","arxiv_id":"2506.15387","repositories_listed":0,"syntology":null},{"url":null,"slug":"decentralized-optimization-on-compact","title":"Decentralized Optimization on Compact Submanifolds by Quantized Riemannian Gradient Tracking","date":"2025-06-09","arxiv_id":"2506.07351","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-gradient-methods-under-heavy","title":"Distributed gradient methods under heavy-tailed communication noise","date":"2025-05-30","arxiv_id":"2505.24464","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-distributed-optimization-for-spatio","title":"Online distributed optimization for spatio-temporally constrained real-time peer-to-peer energy trading","date":"2025-05-28","arxiv_id":"2505.21884","repositories_listed":0,"syntology":null},{"url":null,"slug":"privacy-preserving-peer-to-peer-energy","title":"Privacy-Preserving Peer-to-Peer Energy Trading via Hybrid Secure Computations","date":"2025-05-26","arxiv_id":"2505.20577","repositories_listed":0,"syntology":null},{"url":null,"slug":"federated-learning-from-theory-to-practice","title":"Federated Learning: From Theory to Practice","date":"2025-05-25","arxiv_id":"2505.19183","repositories_listed":0,"syntology":null},{"url":null,"slug":"beyond-self-repellent-kernels-history-driven","title":"Beyond Self-Repellent Kernels: History-Driven Target Towards Efficient Nonlinear MCMC on General Graphs","date":"2025-05-23","arxiv_id":"2505.18300","repositories_listed":0,"syntology":null},{"url":null,"slug":"lago-few-shot-crosslingual-embedding","title":"LAGO: Few-shot Crosslingual Embedding Inversion Attacks via Language Similarity-Aware Graph Optimization","date":"2025-05-21","arxiv_id":"2505.16008","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-optimization-with-efficient","title":"Distributed Optimization with Efficient Communication, Event-Triggered Solution Enhancement, and Operation Stopping","date":"2025-04-23","arxiv_id":"2504.16477","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-model-predictive-control-without","title":"Distributed model predictive control without terminal cost under inexact distributed optimization","date":"2025-04-22","arxiv_id":"2504.15768","repositories_listed":0,"syntology":null},{"url":null,"slug":"hessian-riemannian-flow-for-multi-population","title":"Hessian Riemannian Flow For Multi-Population Wardrop Equilibrium","date":"2025-04-22","arxiv_id":"2504.16028","repositories_listed":0,"syntology":null},{"url":null,"slug":"residual-evasive-attacks-on-admm-in","title":"Residual-Evasive Attacks on ADMM in Distributed Optimization","date":"2025-04-22","arxiv_id":"2504.18570","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-optimization-with-gradient","title":"Distributed Optimization with Gradient Tracking over Heterogeneous Delay-Prone Directed Networks","date":"2025-04-15","arxiv_id":"2504.10964","repositories_listed":0,"syntology":null}],"syntology_records":17,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"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)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":14,"papers_where_code_ran_first_page":"/task/distributed-optimization/papers/ran/1","papers_where_code_ran_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.","pages":[{"order":"archive","page":2,"of":6,"url":"/task/distributed-optimization/papers/2","json":"/task/distributed-optimization/papers/2.json","rows":100},{"order":"archive","page":3,"of":6,"url":"/task/distributed-optimization/papers/3","json":"/task/distributed-optimization/papers/3.json","rows":100},{"order":"archive","page":4,"of":6,"url":"/task/distributed-optimization/papers/4","json":"/task/distributed-optimization/papers/4.json","rows":100},{"order":"archive","page":5,"of":6,"url":"/task/distributed-optimization/papers/5","json":"/task/distributed-optimization/papers/5.json","rows":100},{"order":"archive","page":6,"of":6,"url":"/task/distributed-optimization/papers/6","json":"/task/distributed-optimization/papers/6.json","rows":36},{"order":"ran","page":1,"of":1,"url":"/task/distributed-optimization/papers/ran/1","json":"/task/distributed-optimization/papers/ran/1.json","rows":14}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"4cc89550f398edf25a5e64834356916e5c50a296625453043927d68fbcb5fc71","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}