{"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-computing","name":"Distributed Computing","slug":"distributed-computing","description_markdown":null,"categories":[],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":379,"papers_with_code":85,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"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":1,"subtasks":2,"parent_tasks":0},"benchmarks":[],"datasets":[{"url":"/dataset/mnist-8m","name":"MNIST-8M","full_name":"Infinite MNIST","num_papers_in_archive":26}],"subtasks":[{"url":"/task/collaborative-inference","name":"Collaborative Inference"},{"url":"/task/distributed-voting","name":"Distributed Voting"}],"parent_tasks":[],"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":4,"rows_per_page":100,"shown":100,"of":379,"of_with_code":85,"tagged_in_all":379,"counts":{"archive_papers_tagged":379,"with_a_code_link":85,"where_syntology_ran_a_sample":12,"not_listed_spam_title":0,"listed":379,"listed_where_code_ran":12,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":12,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":12,"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"},"items":[{"url":"/paper/optuna-a-next-generation-hyperparameter","slug":"optuna-a-next-generation-hyperparameter","title":"Optuna: A Next-generation Hyperparameter Optimization Framework","date":"2019-07-25","arxiv_id":"1907.10902","repositories_listed":11,"syntology":{"n":20,"n_ran":14,"n_constructed":0,"n_ran_checked":14,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":0,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/optuna-a-next-generation-hyperparameter#ran","syntology_url":"https://syntology.ai/paper/1907.10902","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.10902"}},"official":{"repos":["pfnet/optuna"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/massively-parallel-hyperparameter-tuning","slug":"massively-parallel-hyperparameter-tuning","title":"A System for Massively Parallel Hyperparameter Tuning","date":"2018-10-13","arxiv_id":"1810.05934","repositories_listed":6,"syntology":{"n":15,"n_ran":14,"n_constructed":0,"n_ran_checked":14,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":0,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/massively-parallel-hyperparameter-tuning#ran","syntology_url":"https://syntology.ai/paper/1810.05934","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.05934"}},"official":{"repos":["liamcli/darts_asha"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/fedml-a-research-library-and-benchmark-for","slug":"fedml-a-research-library-and-benchmark-for","title":"FedML: A Research Library and Benchmark for Federated Machine Learning","date":"2020-07-27","arxiv_id":"2007.13518","repositories_listed":5,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"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) · 2 unverified","sample_list":"/paper/fedml-a-research-library-and-benchmark-for#ran","syntology_url":"https://syntology.ai/paper/2007.13518","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.13518"}},"official":{"repos":["chaoyanghe/Awesome-Federated-Learning"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/residual-inr-communication-efficient-on","slug":"residual-inr-communication-efficient-on","title":"Residual-INR: Communication Efficient On-Device Learning Using Implicit Neural Representation","date":"2024-08-10","arxiv_id":"2408.05617","repositories_listed":3,"syntology":null},{"url":"/paper/tree-guided-l-1-convex-clustering","slug":"tree-guided-l-1-convex-clustering","title":"Tree-Guided $L_1$-Convex Clustering","date":"2025-03-31","arxiv_id":"2503.24012","repositories_listed":2,"syntology":null},{"url":"/paper/benchmarking-dynamic-slo-compliance-in","slug":"benchmarking-dynamic-slo-compliance-in","title":"Benchmarking Dynamic SLO Compliance in Distributed Computing Continuum Systems","date":"2025-03-05","arxiv_id":"2503.03274","repositories_listed":2,"syntology":null},{"url":"/paper/peersimgym-an-environment-for-solving-the","slug":"peersimgym-an-environment-for-solving-the","title":"PeersimGym: An Environment for Solving the Task Offloading Problem with Reinforcement Learning","date":"2024-03-26","arxiv_id":"2403.17637","repositories_listed":2,"syntology":null},{"url":"/paper/scalable-agent-based-modeling-for-complex","slug":"scalable-agent-based-modeling-for-complex","title":"Scalable Agent-Based Modeling for Complex Financial Market Simulations","date":"2023-12-22","arxiv_id":"2312.14903","repositories_listed":2,"syntology":null},{"url":"/paper/data-juicer-a-one-stop-data-processing-system","slug":"data-juicer-a-one-stop-data-processing-system","title":"Data-Juicer: A One-Stop Data Processing System for Large Language Models","date":"2023-09-05","arxiv_id":"2309.02033","repositories_listed":2,"syntology":null},{"url":"/paper/distributed-bayesian-matrix-decomposition-for","slug":"distributed-bayesian-matrix-decomposition-for","title":"Distributed Bayesian Matrix Decomposition for Big Data Mining and Clustering","date":"2020-02-10","arxiv_id":"2002.03703","repositories_listed":2,"syntology":null},{"url":"/paper/orchestral-a-lightweight-framework-for","slug":"orchestral-a-lightweight-framework-for","title":"Orchestral: a lightweight framework for parallel simulations of cell-cell communication","date":"2018-06-28","arxiv_id":"1806.10889","repositories_listed":2,"syntology":null},{"url":"/paper/billion-scale-network-embedding-with","slug":"billion-scale-network-embedding-with","title":"Billion-scale Network Embedding with Iterative Random Projection","date":"2018-05-07","arxiv_id":"1805.02396","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/sacfl-self-adaptive-federated-continual","slug":"sacfl-self-adaptive-federated-continual","title":"SacFL: Self-Adaptive Federated Continual Learning for Resource-Constrained End Devices","date":"2025-05-01","arxiv_id":"2505.00365","repositories_listed":1,"syntology":null},{"url":"/paper/distributed-llms-and-multimodal-large","slug":"distributed-llms-and-multimodal-large","title":"Distributed LLMs and Multimodal Large Language Models: A Survey on Advances, Challenges, and Future Directions","date":"2025-03-20","arxiv_id":"2503.16585","repositories_listed":1,"syntology":null},{"url":"/paper/distributed-mixture-of-agents-for-edge","slug":"distributed-mixture-of-agents-for-edge","title":"Distributed Mixture-of-Agents for Edge Inference with Large Language Models","date":"2024-12-30","arxiv_id":"2412.21200","repositories_listed":1,"syntology":null},{"url":"/paper/a-survey-on-inference-optimization-techniques","slug":"a-survey-on-inference-optimization-techniques","title":"A Survey on Inference Optimization Techniques for Mixture of Experts Models","date":"2024-12-18","arxiv_id":"2412.14219","repositories_listed":1,"syntology":null},{"url":"/paper/crossvit-augmented-geospatial-intelligence","slug":"crossvit-augmented-geospatial-intelligence","title":"CrossVIT-augmented Geospatial-Intelligence Visualization System for Tracking Economic Development Dynamics","date":"2024-12-13","arxiv_id":"2412.10474","repositories_listed":1,"syntology":null},{"url":"/paper/iterative-distributed-multinomial-regression","slug":"iterative-distributed-multinomial-regression","title":"Iterative Distributed Multinomial Regression","date":"2024-12-02","arxiv_id":"2412.01030","repositories_listed":1,"syntology":null},{"url":"/paper/online-parallel-multi-task-relationship","slug":"online-parallel-multi-task-relationship","title":"Online Parallel Multi-Task Relationship Learning via Alternating Direction Method of Multipliers","date":"2024-11-09","arxiv_id":"2411.06135","repositories_listed":1,"syntology":null},{"url":"/paper/v2x-assisted-distributed-computing-and","slug":"v2x-assisted-distributed-computing-and","title":"V2X-Assisted Distributed Computing and Control Framework for Connected and Automated Vehicles under Ramp Merging Scenario","date":"2024-10-30","arxiv_id":"2410.22987","repositories_listed":1,"syntology":null},{"url":"/paper/binary-bleed-fast-distributed-and-parallel","slug":"binary-bleed-fast-distributed-and-parallel","title":"Binary Bleed: Fast Distributed and Parallel Method for Automatic Model Selection","date":"2024-07-26","arxiv_id":"2407.19125","repositories_listed":1,"syntology":null},{"url":"/paper/correlations-are-ruining-your-gradient","slug":"correlations-are-ruining-your-gradient","title":"Correlations Are Ruining Your Gradient Descent","date":"2024-07-15","arxiv_id":"2407.10780","repositories_listed":1,"syntology":null},{"url":"/paper/distributed-computing-for-physics-based-data","slug":"distributed-computing-for-physics-based-data","title":"Distributed computing for physics-based data-driven reduced modeling at scale: Application to a rotating detonation rocket engine","date":"2024-07-13","arxiv_id":"2407.09994","repositories_listed":1,"syntology":null},{"url":"/paper/memory-efficient-gradient-unrolling-for-large","slug":"memory-efficient-gradient-unrolling-for-large","title":"Memory-Efficient Gradient Unrolling for Large-Scale Bi-level Optimization","date":"2024-06-20","arxiv_id":"2406.14095","repositories_listed":1,"syntology":null},{"url":"/paper/trust-dynamics-and-market-behavior-in","slug":"trust-dynamics-and-market-behavior-in","title":"Trust Dynamics and Market Behavior in Cryptocurrency: A Comparative Study of Centralized and Decentralized Exchanges","date":"2024-04-26","arxiv_id":"2404.17227","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-volt-var-optimization-using-rllib","slug":"scalable-volt-var-optimization-using-rllib","title":"Scalable Volt-VAR Optimization using RLlib-IMPALA Framework: A Reinforcement Learning Approach","date":"2024-02-24","arxiv_id":"2402.15932","repositories_listed":1,"syntology":null},{"url":"/paper/gaussian-ensemble-belief-propagation-for","slug":"gaussian-ensemble-belief-propagation-for","title":"Gaussian Ensemble Belief Propagation for Efficient Inference in High-Dimensional Systems","date":"2024-02-13","arxiv_id":"2402.08193","repositories_listed":1,"syntology":null},{"url":"/paper/flexmodel-a-framework-for-interpretability-of","slug":"flexmodel-a-framework-for-interpretability-of","title":"FlexModel: A Framework for Interpretability of Distributed Large Language Models","date":"2023-12-05","arxiv_id":"2312.03140","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":2,"n_instrument":4,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"6 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; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/flexmodel-a-framework-for-interpretability-of#ran","syntology_url":"https://syntology.ai/paper/2312.03140","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.03140"}},"official":{"repos":["vectorinstitute/flex_model"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/lockdown-backdoor-defense-for-federated","slug":"lockdown-backdoor-defense-for-federated","title":"Lockdown: Backdoor Defense for Federated Learning with Isolated Subspace Training","date":"2023-09-21","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/lockdown-backdoor-defense-for-federated-1","slug":"lockdown-backdoor-defense-for-federated-1","title":"Lockdown: Backdoor Defense for Federated Learning with Isolated Subspace Training","date":"2023-09-21","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/distributed-bundle-adjustment-with-block","slug":"distributed-bundle-adjustment-with-block","title":"Distributed bundle adjustment with block-based sparse matrix compression for super large scale datasets","date":"2023-07-17","arxiv_id":"2307.08383","repositories_listed":1,"syntology":null},{"url":"/paper/graph-convolution-based-efficient-re-ranking","slug":"graph-convolution-based-efficient-re-ranking","title":"Graph Convolution Based Efficient Re-Ranking for Visual Retrieval","date":"2023-06-15","arxiv_id":"2306.08792","repositories_listed":1,"syntology":null},{"url":"/paper/architectural-vision-for-quantum-computing-in","slug":"architectural-vision-for-quantum-computing-in","title":"Architectural Vision for Quantum Computing in the Edge-Cloud Continuum","date":"2023-05-09","arxiv_id":"2305.05238","repositories_listed":1,"syntology":null},{"url":"/paper/cooperative-coevolution-for-non-separable","slug":"cooperative-coevolution-for-non-separable","title":"Cooperative Coevolution for Non-Separable Large-Scale Black-Box Optimization: Convergence Analyses and Distributed Accelerations","date":"2023-04-11","arxiv_id":"2304.05020","repositories_listed":1,"syntology":null},{"url":"/paper/fseval-a-benchmarking-framework-for-feature","slug":"fseval-a-benchmarking-framework-for-feature","title":"fseval: A Benchmarking Framework for Feature Selection and Feature Ranking Algorithms","date":"2022-11-23","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/scalable-differentially-private-clustering","slug":"scalable-differentially-private-clustering","title":"Scalable Differentially Private Clustering via Hierarchically Separated Trees","date":"2022-06-17","arxiv_id":"2206.08646","repositories_listed":1,"syntology":null},{"url":"/paper/se-moe-a-scalable-and-efficient-mixture-of","slug":"se-moe-a-scalable-and-efficient-mixture-of","title":"MoESys: A Distributed and Efficient Mixture-of-Experts Training and Inference System for Internet Services","date":"2022-05-20","arxiv_id":"2205.10034","repositories_listed":1,"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/se-moe-a-scalable-and-efficient-mixture-of#ran","syntology_url":"https://syntology.ai/paper/2205.10034","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.10034"}},"official":{"repos":["PaddlePaddle/FleetX"],"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/nebula-i-a-general-framework-for","slug":"nebula-i-a-general-framework-for","title":"Nebula-I: A General Framework for Collaboratively Training Deep Learning Models on Low-Bandwidth Cloud Clusters","date":"2022-05-19","arxiv_id":"2205.09470","repositories_listed":1,"syntology":null},{"url":"/paper/bigdl-2-0-seamless-scaling-of-ai-pipelines","slug":"bigdl-2-0-seamless-scaling-of-ai-pipelines","title":"BigDL 2.0: Seamless Scaling of AI Pipelines from Laptops to Distributed Cluster","date":"2022-04-03","arxiv_id":"2204.01715","repositories_listed":1,"syntology":null},{"url":"/paper/improving-response-time-of-home-iot-services","slug":"improving-response-time-of-home-iot-services","title":"Improving Response Time of Home IoT Services in Federated Learning","date":"2022-02-28","arxiv_id":"2202.13626","repositories_listed":1,"syntology":null},{"url":"/paper/sky-computing-accelerating-geo-distributed","slug":"sky-computing-accelerating-geo-distributed","title":"Sky Computing: Accelerating Geo-distributed Computing in Federated Learning","date":"2022-02-24","arxiv_id":"2202.11836","repositories_listed":1,"syntology":null},{"url":"/paper/darl1n-distributed-multi-agent-reinforcement","slug":"darl1n-distributed-multi-agent-reinforcement","title":"Distributed Multi-Agent Reinforcement Learning with One-hop Neighbors and Compute Straggler Mitigation","date":"2022-02-18","arxiv_id":"2202.09019","repositories_listed":1,"syntology":null},{"url":"/paper/lbcf-a-large-scale-budget-constrained-causal","slug":"lbcf-a-large-scale-budget-constrained-causal","title":"LBCF: A Large-Scale Budget-Constrained Causal Forest Algorithm","date":"2022-01-29","arxiv_id":"2201.12585","repositories_listed":1,"syntology":null},{"url":"/paper/mcds-ai-augmented-workflow-scheduling-in","slug":"mcds-ai-augmented-workflow-scheduling-in","title":"MCDS: AI Augmented Workflow Scheduling in Mobile Edge Cloud Computing Systems","date":"2021-12-14","arxiv_id":"2112.07269","repositories_listed":1,"syntology":null},{"url":"/paper/fleetx","slug":"fleetx","title":"FleetX","date":"2021-12-06","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/heterps-distributed-deep-learning-with","slug":"heterps-distributed-deep-learning-with","title":"HeterPS: Distributed Deep Learning With Reinforcement Learning Based Scheduling in Heterogeneous Environments","date":"2021-11-20","arxiv_id":"2111.10635","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/asynchronous-and-distributed-data","slug":"asynchronous-and-distributed-data","title":"Asynchronous and Distributed Data Augmentation for Massive Data Settings","date":"2021-09-18","arxiv_id":"2109.08969","repositories_listed":1,"syntology":null},{"url":"/paper/malib-a-parallel-framework-for-population","slug":"malib-a-parallel-framework-for-population","title":"MALib: A Parallel Framework for Population-based Multi-agent Reinforcement Learning","date":"2021-06-05","arxiv_id":"2106.07551","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/malib-a-parallel-framework-for-population#ran","syntology_url":"https://syntology.ai/paper/2106.07551","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.07551"}},"official":{"repos":["sjtu-marl/malib"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/networked-federated-multi-task-learning","slug":"networked-federated-multi-task-learning","title":"Clustered Federated Learning via Generalized Total Variation Minimization","date":"2021-05-26","arxiv_id":"2105.12769","repositories_listed":1,"syntology":null},{"url":"/paper/foveated-neural-radiance-fields-for-real-time","slug":"foveated-neural-radiance-fields-for-real-time","title":"FoV-NeRF: Foveated Neural Radiance Fields for Virtual Reality","date":"2021-03-30","arxiv_id":"2103.16365","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/foveated-neural-radiance-fields-for-real-time#ran","syntology_url":"https://syntology.ai/paper/2103.16365","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.16365"}},"official":{"repos":["dengnianchen/fovnerf"],"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/efficient-mpi-based-communication-for-gpu","slug":"efficient-mpi-based-communication-for-gpu","title":"Efficient MPI-based Communication for GPU-Accelerated Dask Applications","date":"2021-01-21","arxiv_id":"2101.08878","repositories_listed":1,"syntology":null},{"url":"/paper/large-scale-neural-solvers-for-partial","slug":"large-scale-neural-solvers-for-partial","title":"Large-scale Neural Solvers for Partial Differential Equations","date":"2020-09-08","arxiv_id":"2009.03730","repositories_listed":1,"syntology":null},{"url":"/paper/communication-efficient-distributed-7","slug":"communication-efficient-distributed-7","title":"Communication-efficient distributed eigenspace estimation","date":"2020-09-05","arxiv_id":"2009.02436","repositories_listed":1,"syntology":null},{"url":"/paper/regulating-accuracy-efficiency-trade-offs-in","slug":"regulating-accuracy-efficiency-trade-offs-in","title":"Accuracy-Efficiency Trade-Offs and Accountability in Distributed ML Systems","date":"2020-07-04","arxiv_id":"2007.02203","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/fiber-a-platform-for-efficient-development","slug":"fiber-a-platform-for-efficient-development","title":"Fiber: A Platform for Efficient Development and Distributed Training for Reinforcement Learning and Population-Based Methods","date":"2020-03-25","arxiv_id":"2003.11164","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"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: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fiber-a-platform-for-efficient-development#ran","syntology_url":"https://syntology.ai/paper/2003.11164","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.11164"}},"official":null}},{"url":"/paper/communication-efficient-distributed-svd-via","slug":"communication-efficient-distributed-svd-via","title":"Communication-Efficient Distributed SVD via Local Power Iterations","date":"2020-02-19","arxiv_id":"2002.08014","repositories_listed":1,"syntology":null},{"url":"/paper/hoplite-efficient-collective-communication","slug":"hoplite-efficient-collective-communication","title":"Hoplite: Efficient and Fault-Tolerant Collective Communication for Task-Based Distributed Systems","date":"2020-02-13","arxiv_id":"2002.05814","repositories_listed":1,"syntology":null},{"url":"/paper/one-shot-distributed-ridge-regression-in-high","slug":"one-shot-distributed-ridge-regression-in-high","title":"WONDER: Weighted one-shot distributed ridge regression in high dimensions","date":"2019-03-22","arxiv_id":"1903.09321","repositories_listed":1,"syntology":null},{"url":"/paper/energy-efficient-edge-facilitated-wireless","slug":"energy-efficient-edge-facilitated-wireless","title":"Energy-Efficient Edge-Facilitated Wireless Collaborative Computing using Map-Reduce","date":"2019-03-06","arxiv_id":"1903.02294","repositories_listed":1,"syntology":null},{"url":"/paper/acceleration-of-expensive-computations-in","slug":"acceleration-of-expensive-computations-in","title":"Vector operations for accelerating expensive Bayesian computations -- a tutorial guide","date":"2019-02-25","arxiv_id":"1902.09046","repositories_listed":1,"syntology":null},{"url":"/paper/evolutionary-neural-automl-for-deep-learning","slug":"evolutionary-neural-automl-for-deep-learning","title":"Evolutionary Neural AutoML for Deep Learning","date":"2019-02-18","arxiv_id":"1902.06827","repositories_listed":1,"syntology":null},{"url":"/paper/quasi-newton-methods-for-deep-learning-forget","slug":"quasi-newton-methods-for-deep-learning-forget","title":"Quasi-Newton Methods for Machine Learning: Forget the Past, Just Sample","date":"2019-01-28","arxiv_id":"1901.09997","repositories_listed":1,"syntology":{"n":4,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 4 unverified","sample_list":"/paper/quasi-newton-methods-for-deep-learning-forget#ran","syntology_url":"https://syntology.ai/paper/1901.09997","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.09997"}},"official":{"repos":["OptMLGroup/SQN"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":4,"ran_from_kinds":[]}}},{"url":"/paper/dingo-distributed-newton-type-method-for","slug":"dingo-distributed-newton-type-method-for","title":"DINGO: Distributed Newton-Type Method for Gradient-Norm Optimization","date":"2019-01-16","arxiv_id":"1901.05134","repositories_listed":1,"syntology":{"n":19,"n_ran":16,"n_constructed":0,"n_ran_checked":16,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":16,"n_pointer_only":0,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 16 with no instrument failure: 0 honoured, 0 violated, 16 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/dingo-distributed-newton-type-method-for#ran","syntology_url":"https://syntology.ai/paper/1901.05134","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.05134"}},"official":{"repos":["RixonC/DINGO"],"state":"official (archive's flag): 16 ran","n_ran":16,"n_constructed":0,"n_ran_no_instrument_failure":16,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/real-time-cortical-simulations-energy-and","slug":"real-time-cortical-simulations-energy-and","title":"Real-time cortical simulations: energy and interconnect scaling on distributed systems","date":"2018-12-12","arxiv_id":"1812.04974","repositories_listed":1,"syntology":null},{"url":"/paper/mmlspark-unifying-machine-learning-ecosystems","slug":"mmlspark-unifying-machine-learning-ecosystems","title":"MMLSpark: Unifying Machine Learning Ecosystems at Massive Scales","date":"2018-10-20","arxiv_id":"1810.08744","repositories_listed":1,"syntology":null},{"url":"/paper/generalized-robust-bayesian-committee-machine","slug":"generalized-robust-bayesian-committee-machine","title":"Generalized Robust Bayesian Committee Machine for Large-scale Gaussian Process Regression","date":"2018-06-03","arxiv_id":"1806.00720","repositories_listed":1,"syntology":null},{"url":"/paper/flexible-and-scalable-deep-learning-with","slug":"flexible-and-scalable-deep-learning-with","title":"Flexible and Scalable Deep Learning with MMLSpark","date":"2018-04-11","arxiv_id":"1804.04031","repositories_listed":1,"syntology":null},{"url":"/paper/achieving-the-time-of-1-nn-but-the-accuracy","slug":"achieving-the-time-of-1-nn-but-the-accuracy","title":"Achieving the time of $1$-NN, but the accuracy of $k$-NN","date":"2017-12-06","arxiv_id":"1712.02369","repositories_listed":1,"syntology":null},{"url":"/paper/distributed-deep-neural-networks-over-the","slug":"distributed-deep-neural-networks-over-the","title":"Distributed Deep Neural Networks over the Cloud, the Edge and End Devices","date":"2017-09-06","arxiv_id":"1709.01921","repositories_listed":1,"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":1,"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/distributed-deep-neural-networks-over-the#ran","syntology_url":"https://syntology.ai/paper/1709.01921","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1709.01921"}},"official":{"repos":["kunglab/ddnn"],"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/parallelizing-over-artificial-neural-network","slug":"parallelizing-over-artificial-neural-network","title":"Parallelizing Over Artificial Neural Network Training Runs with Multigrid","date":"2017-08-07","arxiv_id":"1708.02276","repositories_listed":1,"syntology":null},{"url":"/paper/time-series-prediction-for-graphs-in-kernel","slug":"time-series-prediction-for-graphs-in-kernel","title":"Time Series Prediction for Graphs in Kernel and Dissimilarity Spaces","date":"2017-04-21","arxiv_id":"1704.06498","repositories_listed":1,"syntology":null},{"url":"/paper/a-security-monitoring-framework-for","slug":"a-security-monitoring-framework-for","title":"A Security Monitoring Framework For Virtualization Based HEP Infrastructures","date":"2017-04-16","arxiv_id":"1704.04782","repositories_listed":1,"syntology":null},{"url":"/paper/easily-parallelizable-and-distributable-class","slug":"easily-parallelizable-and-distributable-class","title":"Easily parallelizable and distributable class of algorithms for structured sparsity, with optimal acceleration","date":"2017-02-21","arxiv_id":"1702.06234","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/easily-parallelizable-and-distributable-class#ran","syntology_url":"https://syntology.ai/paper/1702.06234","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1702.06234"}},"official":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/encoding-cryptographic-functions-to-sat-using","slug":"encoding-cryptographic-functions-to-sat-using","title":"Encoding Cryptographic Functions to SAT Using Transalg System","date":"2016-07-04","arxiv_id":"1607.00888","repositories_listed":1,"syntology":null},{"url":"/paper/real-time-community-detection-in-large-social","slug":"real-time-community-detection-in-large-social","title":"Real-Time Community Detection in Large Social Networks on a Laptop","date":"2016-01-15","arxiv_id":"1601.03958","repositories_listed":1,"syntology":null},{"url":"/paper/staleness-aware-async-sgd-for-distributed","slug":"staleness-aware-async-sgd-for-distributed","title":"Staleness-aware Async-SGD for Distributed Deep Learning","date":"2015-11-18","arxiv_id":"1511.05950","repositories_listed":1,"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/staleness-aware-async-sgd-for-distributed#ran","syntology_url":"https://syntology.ai/paper/1511.05950","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1511.05950"}},"official":null}},{"url":"/paper/model-accuracy-and-runtime-tradeoff-in","slug":"model-accuracy-and-runtime-tradeoff-in","title":"Model Accuracy and Runtime Tradeoff in Distributed Deep Learning:A Systematic Study","date":"2015-09-14","arxiv_id":"1509.04210","repositories_listed":1,"syntology":null},{"url":"/paper/rankmap-a-platform-aware-framework-for","slug":"rankmap-a-platform-aware-framework-for","title":"RankMap: A Platform-Aware Framework for Distributed Learning from Dense Datasets","date":"2015-03-27","arxiv_id":"1503.08169","repositories_listed":1,"syntology":null},{"url":"/paper/mlitb-machine-learning-in-the-browser","slug":"mlitb-machine-learning-in-the-browser","title":"MLitB: Machine Learning in the Browser","date":"2014-12-08","arxiv_id":"1412.2432","repositories_listed":1,"syntology":null},{"url":"/paper/online-asynchronous-distributed-regression","slug":"online-asynchronous-distributed-regression","title":"Online Asynchronous Distributed Regression","date":"2014-07-16","arxiv_id":"1407.4373","repositories_listed":1,"syntology":null},{"url":"/paper/07120194","slug":"07120194","title":"Computing High Accuracy Power Spectra with Pico","date":"2007-12-02","arxiv_id":"0712.0194","repositories_listed":1,"syntology":null},{"url":null,"slug":"towards-an-introspective-dynamic-model-of","title":"Towards an Introspective Dynamic Model of Globally Distributed Computing Infrastructures","date":"2025-06-24","arxiv_id":"2506.19578","repositories_listed":0,"syntology":null},{"url":null,"slug":"centroid-approximation-for-byzantine-tolerant","title":"Centroid Approximation for Byzantine-Tolerant Federated Learning","date":"2025-06-18","arxiv_id":"2506.15264","repositories_listed":0,"syntology":null},{"url":null,"slug":"accessibility-barriers-in-multi-terabyte","title":"Accessibility Barriers in Multi-Terabyte Public Datasets: The Gap Between Promise and Practice","date":"2025-06-16","arxiv_id":"2506.13256","repositories_listed":0,"syntology":null},{"url":null,"slug":"banditware-a-contextual-bandit-based","title":"BanditWare: A Contextual Bandit-based Framework for Hardware Prediction","date":"2025-06-16","arxiv_id":"2506.13730","repositories_listed":0,"syntology":null},{"url":null,"slug":"compositional-and-equilibrium-free-conditions","title":"Compositional and Equilibrium-Free Conditions for Power System Stability -- Part II: Method and Application","date":"2025-06-13","arxiv_id":"2506.11411","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-beamforming-using-decentralized","title":"Distributed Beamforming Using Decentralized Time Synchronization in a Six-Element Array","date":"2025-05-19","arxiv_id":"2505.13248","repositories_listed":0,"syntology":null},{"url":null,"slug":"bridging-quantized-artificial-neural-networks","title":"Bridging Quantized Artificial Neural Networks and Neuromorphic Hardware","date":"2025-05-18","arxiv_id":"2505.12221","repositories_listed":0,"syntology":null},{"url":null,"slug":"edge-cloud-collaborative-computing-on","title":"Edge-Cloud Collaborative Computing on Distributed Intelligence and Model Optimization: A Survey","date":"2025-05-03","arxiv_id":"2505.01821","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-variable-selection-in-large-scale","title":"Enhancing Variable Selection in Large-scale Logistic Regression: Leveraging Manual Labeling with Beneficial Noise","date":"2025-04-23","arxiv_id":"2504.16585","repositories_listed":0,"syntology":null},{"url":null,"slug":"you-don-t-need-all-attentions-distributed","title":"You Don't Need All Attentions: Distributed Dynamic Fine-Tuning for Foundation Models","date":"2025-04-16","arxiv_id":"2504.12471","repositories_listed":0,"syntology":null},{"url":null,"slug":"goal-oriented-spectrum-sharing-trading-edge","title":"Goal-oriented Spectrum Sharing: Trading Edge Inference Power for Data Streaming Performance","date":"2025-03-14","arxiv_id":"2503.11552","repositories_listed":0,"syntology":null},{"url":null,"slug":"fundamental-limits-of-hierarchical-secure","title":"Fundamental Limits of Hierarchical Secure Aggregation with Cyclic User Association","date":"2025-03-06","arxiv_id":"2503.04564","repositories_listed":0,"syntology":null},{"url":null,"slug":"supporting-the-development-of-machine","title":"Supporting the development of Machine Learning for fundamental science in a federated Cloud with the AI_INFN platform","date":"2025-02-28","arxiv_id":"2502.21266","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-survey-of-model-extraction-attacks-and","title":"A Survey of Model Extraction Attacks and Defenses in Distributed Computing Environments","date":"2025-02-22","arxiv_id":"2502.16065","repositories_listed":0,"syntology":null},{"url":null,"slug":"evolutionary-algorithms-approach-for-search","title":"Evolutionary Algorithms Approach For Search Based On Semantic Document Similarity","date":"2025-02-20","arxiv_id":"2502.19437","repositories_listed":0,"syntology":null}],"syntology_records":13,"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":12,"papers_where_code_ran_first_page":"/task/distributed-computing/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":4,"url":"/task/distributed-computing/papers/2","json":"/task/distributed-computing/papers/2.json","rows":100},{"order":"archive","page":3,"of":4,"url":"/task/distributed-computing/papers/3","json":"/task/distributed-computing/papers/3.json","rows":100},{"order":"archive","page":4,"of":4,"url":"/task/distributed-computing/papers/4","json":"/task/distributed-computing/papers/4.json","rows":79},{"order":"ran","page":1,"of":1,"url":"/task/distributed-computing/papers/ran/1","json":"/task/distributed-computing/papers/ran/1.json","rows":12}],"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":"b8dbb6492e80f4ec6e0d5ede967d4d64e97e797db9f3242a0f77216e7272f881","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}