{"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/machine-learning","name":"BIG-bench Machine Learning","slug":"machine-learning","description_markdown":"This branch include most common machine learning fundamental algorithms.","categories":[{"name":"Methodology","url":"/area/methodology"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":10033,"papers_with_code":2352,"benchmarks":2,"benchmark_tables_in_archive":2,"benchmark_tables_shown":2,"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":0,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/big-bench-machine-learning-on-38-cloud","slug":"big-bench-machine-learning-on-38-cloud","dataset":"38-Cloud","dataset_url":null,"rows_in_archive":1,"metrics":["account and password "],"first_row_in_archive_order":{"model":"Fb232","paper_title":"(1,1)-Cluster Editing is Polynomial-time Solvable","paper_url":"/paper/11-cluster-editing-is-polynomial-time","paper_date":"2022-10-14","arxiv_id":"2210.07722","code_links":[],"syntology":null}},{"leaderboard":"/sota/machine-learning-on-big-bench","slug":"machine-learning-on-big-bench","dataset":"BIG-bench","dataset_url":"/dataset/big-bench","rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"Gopher-280B (few-shot, k=5)","paper_title":"Scaling Language Models: Methods, Analysis & Insights from Training Gopher","paper_url":"/paper/scaling-language-models-methods-analysis-1","paper_date":"2021-12-08","arxiv_id":"2112.11446","code_links":[{"title":"allenai/dolma","url":"https://github.com/allenai/dolma"},{"title":"rvlopes/gloria","url":"https://github.com/rvlopes/gloria"},{"title":"bramiozo/PubScience","url":"https://github.com/bramiozo/PubScience"}],"syntology":null}}],"datasets":[{"url":"/dataset/big-bench","name":"BIG-bench","full_name":"Beyond the Imitation Game Benchmark","num_papers_in_archive":349}],"subtasks":[],"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":101,"rows_per_page":100,"shown":100,"of":10033,"of_with_code":2352,"tagged_in_all":10033,"counts":{"archive_papers_tagged":10033,"with_a_code_link":2352,"where_syntology_ran_a_sample":356,"not_listed_spam_title":0,"listed":10033,"listed_where_code_ran":356,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":289,"every_run_a_failure_of_syntologys_instrument":67,"listed_with_a_run_with_no_instrument_failure":289,"listed_every_run_a_failure_of_syntologys_instrument":67,"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/yolov4-optimal-speed-and-accuracy-of-object","slug":"yolov4-optimal-speed-and-accuracy-of-object","title":"YOLOv4: Optimal Speed and Accuracy of Object Detection","date":"2020-04-23","arxiv_id":"2004.10934","repositories_listed":223,"syntology":{"n":184,"n_ran":142,"n_constructed":0,"n_ran_checked":128,"n_instrument":14,"n_unverified":42,"n_honours":8,"n_violates":0,"n_no_contract":120,"n_pointer_only":21,"phrase":"142 ran (of which 0 constructed an object rather than computing a result; 128 with no instrument failure: 8 honoured, 0 violated, 120 with no contract checked; 14 where Syntology's instrument failed) · 42 unverified","sample_list":"/paper/yolov4-optimal-speed-and-accuracy-of-object#ran","syntology_url":"https://syntology.ai/paper/2004.10934","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.10934"}},"official":{"repos":["AlexeyAB/darknet"],"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/umap-uniform-manifold-approximation-and","slug":"umap-uniform-manifold-approximation-and","title":"UMAP: Uniform Manifold Approximation and Projection for Dimension Reduction","date":"2018-02-09","arxiv_id":"1802.03426","repositories_listed":39,"syntology":null},{"url":"/paper/fashion-mnist-a-novel-image-dataset-for","slug":"fashion-mnist-a-novel-image-dataset-for","title":"Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithms","date":"2017-08-25","arxiv_id":"1708.07747","repositories_listed":37,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fashion-mnist-a-novel-image-dataset-for#ran","syntology_url":"https://syntology.ai/paper/1708.07747","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1708.07747"}},"official":{"repos":["zalandoresearch/fashion-mnist"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/density-estimation-using-real-nvp","slug":"density-estimation-using-real-nvp","title":"Density estimation using Real NVP","date":"2016-05-27","arxiv_id":"1605.08803","repositories_listed":35,"syntology":{"n":70,"n_ran":48,"n_constructed":26,"n_ran_checked":38,"n_instrument":10,"n_unverified":22,"n_honours":2,"n_violates":0,"n_no_contract":36,"n_pointer_only":33,"phrase":"48 ran (of which 26 constructed an object rather than computing a result; 38 with no instrument failure: 2 honoured, 0 violated, 36 with no contract checked; 10 where Syntology's instrument failed) · 22 unverified","sample_list":"/paper/density-estimation-using-real-nvp#ran","syntology_url":"https://syntology.ai/paper/1605.08803","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1605.08803"}},"official":null}},{"url":"/paper/xgboost-a-scalable-tree-boosting-system","slug":"xgboost-a-scalable-tree-boosting-system","title":"XGBoost: A Scalable Tree Boosting System","date":"2016-03-09","arxiv_id":"1603.02754","repositories_listed":28,"syntology":{"n":17,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":10,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/xgboost-a-scalable-tree-boosting-system#ran","syntology_url":"https://syntology.ai/paper/1603.02754","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1603.02754"}},"official":{"repos":["dmlc/xgboost"],"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/pennylane-automatic-differentiation-of-hybrid","slug":"pennylane-automatic-differentiation-of-hybrid","title":"PennyLane: Automatic differentiation of hybrid quantum-classical computations","date":"2018-11-12","arxiv_id":"1811.04968","repositories_listed":27,"syntology":{"n":25,"n_ran":17,"n_constructed":0,"n_ran_checked":17,"n_instrument":0,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":17,"n_pointer_only":0,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 17 with no instrument failure: 0 honoured, 0 violated, 17 with no contract checked; 0 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/pennylane-automatic-differentiation-of-hybrid#ran","syntology_url":"https://syntology.ai/paper/1811.04968","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.04968"}},"official":{"repos":["PennyLaneAI/pennylane"],"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/deep-learning-with-differential-privacy","slug":"deep-learning-with-differential-privacy","title":"Deep Learning with Differential Privacy","date":"2016-07-01","arxiv_id":"1607.00133","repositories_listed":26,"syntology":{"n":24,"n_ran":22,"n_constructed":0,"n_ran_checked":19,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":18,"n_pointer_only":3,"phrase":"22 ran (of which 0 constructed an object rather than computing a result; 19 with no instrument failure: 0 honoured, 1 violated, 18 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/deep-learning-with-differential-privacy#ran","syntology_url":"https://syntology.ai/paper/1607.00133","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1607.00133"}},"official":{"repos":["tensorflow/models"],"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/datasheets-for-datasets","slug":"datasheets-for-datasets","title":"Datasheets for Datasets","date":"2018-03-23","arxiv_id":"1803.09010","repositories_listed":25,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/datasheets-for-datasets#ran","syntology_url":"https://syntology.ai/paper/1803.09010","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.09010"}},"official":null}},{"url":"/paper/convolutional-lstm-network-a-machine-learning","slug":"convolutional-lstm-network-a-machine-learning","title":"Convolutional LSTM Network: A Machine Learning Approach for Precipitation Nowcasting","date":"2015-06-13","arxiv_id":"1506.04214","repositories_listed":23,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"2 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/convolutional-lstm-network-a-machine-learning#ran","syntology_url":"https://syntology.ai/paper/1506.04214","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1506.04214"}},"official":null}},{"url":"/paper/noise2noise-learning-image-restoration","slug":"noise2noise-learning-image-restoration","title":"Noise2Noise: Learning Image Restoration without Clean Data","date":"2018-03-12","arxiv_id":"1803.04189","repositories_listed":21,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/noise2noise-learning-image-restoration#ran","syntology_url":"https://syntology.ai/paper/1803.04189","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.04189"}},"official":{"repos":["NVlabs/noise2noise"],"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/facial-key-points-detection-using-deep","slug":"facial-key-points-detection-using-deep","title":"Facial Key Points Detection using Deep Convolutional Neural Network - NaimishNet","date":"2017-10-03","arxiv_id":"1710.00977","repositories_listed":19,"syntology":null},{"url":"/paper/practical-black-box-attacks-against-machine","slug":"practical-black-box-attacks-against-machine","title":"Practical Black-Box Attacks against Machine Learning","date":"2016-02-08","arxiv_id":"1602.02697","repositories_listed":18,"syntology":{"n":11,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":5,"n_honours":3,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 3 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/practical-black-box-attacks-against-machine#ran","syntology_url":"https://syntology.ai/paper/1602.02697","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1602.02697"}},"official":null}},{"url":"/paper/snips-voice-platform-an-embedded-spoken","slug":"snips-voice-platform-an-embedded-spoken","title":"Snips Voice Platform: an embedded Spoken Language Understanding system for private-by-design voice interfaces","date":"2018-05-25","arxiv_id":"1805.10190","repositories_listed":16,"syntology":{"n":15,"n_ran":13,"n_constructed":0,"n_ran_checked":12,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/snips-voice-platform-an-embedded-spoken#ran","syntology_url":"https://syntology.ai/paper/1805.10190","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.10190"}},"official":{"repos":["snipsco/nlu-benchmark","snipsco/snips-nlu"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/fastmri-an-open-dataset-and-benchmarks-for","slug":"fastmri-an-open-dataset-and-benchmarks-for","title":"fastMRI: An Open Dataset and Benchmarks for Accelerated MRI","date":"2018-11-21","arxiv_id":"1811.08839","repositories_listed":13,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":0,"n_honours":0,"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; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fastmri-an-open-dataset-and-benchmarks-for#ran","syntology_url":"https://syntology.ai/paper/1811.08839","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.08839"}},"official":{"repos":["facebookresearch/fastMRI"],"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":["listed","official"]}}},{"url":"/paper/the-ham10000-dataset-a-large-collection-of","slug":"the-ham10000-dataset-a-large-collection-of","title":"The HAM10000 dataset, a large collection of multi-source dermatoscopic images of common pigmented skin lesions","date":"2018-03-28","arxiv_id":"1803.10417","repositories_listed":13,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/the-ham10000-dataset-a-large-collection-of#ran","syntology_url":"https://syntology.ai/paper/1803.10417","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.10417"}},"official":{"repos":["ptschandl/HAM10000_dataset"],"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/self-normalizing-neural-networks","slug":"self-normalizing-neural-networks","title":"Self-Normalizing Neural Networks","date":"2017-06-08","arxiv_id":"1706.02515","repositories_listed":13,"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/self-normalizing-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1706.02515","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1706.02515"}},"official":{"repos":["bioinf-jku/SNNs"],"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/gnn-explainer-a-tool-for-post-hoc-explanation","slug":"gnn-explainer-a-tool-for-post-hoc-explanation","title":"GNNExplainer: Generating Explanations for Graph Neural Networks","date":"2019-03-10","arxiv_id":"1903.03894","repositories_listed":12,"syntology":{"n":22,"n_ran":18,"n_constructed":0,"n_ran_checked":17,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":17,"n_pointer_only":1,"phrase":"18 ran (of which 0 constructed an object rather than computing a result; 17 with no instrument failure: 0 honoured, 0 violated, 17 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/gnn-explainer-a-tool-for-post-hoc-explanation#ran","syntology_url":"https://syntology.ai/paper/1903.03894","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.03894"}},"official":{"repos":["RexYing/gnn-model-explainer"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/model-cards-for-model-reporting","slug":"model-cards-for-model-reporting","title":"Model Cards for Model Reporting","date":"2018-10-05","arxiv_id":"1810.03993","repositories_listed":12,"syntology":{"n":9,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/model-cards-for-model-reporting#ran","syntology_url":"https://syntology.ai/paper/1810.03993","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.03993"}},"official":null}},{"url":"/paper/challenges-in-representation-learning-a","slug":"challenges-in-representation-learning-a","title":"Challenges in Representation Learning: A report on three machine learning contests","date":"2013-07-01","arxiv_id":"1307.0414","repositories_listed":12,"syntology":{"n":12,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"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) · 6 unverified","sample_list":"/paper/challenges-in-representation-learning-a#ran","syntology_url":"https://syntology.ai/paper/1307.0414","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1307.0414"}},"official":null}},{"url":"/paper/badnets-identifying-vulnerabilities-in-the","slug":"badnets-identifying-vulnerabilities-in-the","title":"BadNets: Identifying Vulnerabilities in the Machine Learning Model Supply Chain","date":"2017-08-22","arxiv_id":"1708.06733","repositories_listed":11,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":3,"n_instrument":3,"n_unverified":2,"n_honours":2,"n_violates":1,"n_no_contract":0,"n_pointer_only":8,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 1 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/badnets-identifying-vulnerabilities-in-the#ran","syntology_url":"https://syntology.ai/paper/1708.06733","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1708.06733"}},"official":null}},{"url":"/paper/multitask-learning-and-benchmarking-with","slug":"multitask-learning-and-benchmarking-with","title":"Multitask learning and benchmarking with clinical time series data","date":"2017-03-22","arxiv_id":"1703.07771","repositories_listed":11,"syntology":{"n":40,"n_ran":25,"n_constructed":0,"n_ran_checked":18,"n_instrument":7,"n_unverified":15,"n_honours":1,"n_violates":0,"n_no_contract":17,"n_pointer_only":5,"phrase":"25 ran (of which 0 constructed an object rather than computing a result; 18 with no instrument failure: 1 honoured, 0 violated, 17 with no contract checked; 7 where Syntology's instrument failed) · 15 unverified","sample_list":"/paper/multitask-learning-and-benchmarking-with#ran","syntology_url":"https://syntology.ai/paper/1703.07771","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.07771"}},"official":{"repos":["yerevann/mimic3-benchmarks"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/membership-inference-attacks-against-machine","slug":"membership-inference-attacks-against-machine","title":"Membership Inference Attacks against Machine Learning Models","date":"2016-10-18","arxiv_id":"1610.05820","repositories_listed":11,"syntology":{"n":14,"n_ran":10,"n_constructed":0,"n_ran_checked":8,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/membership-inference-attacks-against-machine#ran","syntology_url":"https://syntology.ai/paper/1610.05820","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1610.05820"}},"official":{"repos":["csong27/membership-inference"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["found_in_text","listed"]}}},{"url":"/paper/deep-learning-for-classical-japanese","slug":"deep-learning-for-classical-japanese","title":"Deep Learning for Classical Japanese Literature","date":"2018-12-03","arxiv_id":"1812.01718","repositories_listed":10,"syntology":{"n":11,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":1,"n_no_contract":6,"n_pointer_only":2,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 1 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/deep-learning-for-classical-japanese#ran","syntology_url":"https://syntology.ai/paper/1812.01718","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.01718"}},"official":{"repos":["rois-codh/kmnist"],"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":["listed","official"]}}},{"url":"/paper/universal-differential-equations-for","slug":"universal-differential-equations-for","title":"Universal Differential Equations for Scientific Machine Learning","date":"2020-01-13","arxiv_id":"2001.04385","repositories_listed":9,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/universal-differential-equations-for#ran","syntology_url":"https://syntology.ai/paper/2001.04385","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.04385"}},"official":{"repos":["ChrisRackauckas/universal_differential_equations","titu1994/tfdiffeq","sciml/differentialequations.jl"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/advances-and-open-problems-in-federated","slug":"advances-and-open-problems-in-federated","title":"Advances and Open Problems in Federated Learning","date":"2019-12-10","arxiv_id":"1912.04977","repositories_listed":9,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/advances-and-open-problems-in-federated#ran","syntology_url":"https://syntology.ai/paper/1912.04977","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.04977"}},"official":null}},{"url":"/paper/neural-additive-models-interpretable-machine","slug":"neural-additive-models-interpretable-machine","title":"Neural Additive Models: Interpretable Machine Learning with Neural Nets","date":"2020-04-29","arxiv_id":"2004.13912","repositories_listed":8,"syntology":{"n":33,"n_ran":26,"n_constructed":14,"n_ran_checked":26,"n_instrument":0,"n_unverified":7,"n_honours":5,"n_violates":0,"n_no_contract":21,"n_pointer_only":14,"phrase":"26 ran (of which 14 constructed an object rather than computing a result; 26 with no instrument failure: 5 honoured, 0 violated, 21 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/neural-additive-models-interpretable-machine#ran","syntology_url":"https://syntology.ai/paper/2004.13912","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.13912"}},"official":{"repos":["lemeln/nam"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/the-machine-learning-bazaar-harnessing-the-ml","slug":"the-machine-learning-bazaar-harnessing-the-ml","title":"The Machine Learning Bazaar: Harnessing the ML Ecosystem for Effective System Development","date":"2019-05-22","arxiv_id":"1905.08942","repositories_listed":8,"syntology":null},{"url":"/paper/consistent-individualized-feature-attribution","slug":"consistent-individualized-feature-attribution","title":"Consistent Individualized Feature Attribution for Tree Ensembles","date":"2018-02-12","arxiv_id":"1802.03888","repositories_listed":8,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/consistent-individualized-feature-attribution#ran","syntology_url":"https://syntology.ai/paper/1802.03888","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.03888"}},"official":null}},{"url":"/paper/man-is-to-computer-programmer-as-woman-is-to","slug":"man-is-to-computer-programmer-as-woman-is-to","title":"Man is to Computer Programmer as Woman is to Homemaker? Debiasing Word Embeddings","date":"2016-07-21","arxiv_id":"1607.06520","repositories_listed":8,"syntology":{"n":8,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/man-is-to-computer-programmer-as-woman-is-to#ran","syntology_url":"https://syntology.ai/paper/1607.06520","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1607.06520"}},"official":null}},{"url":"/paper/codexglue-a-machine-learning-benchmark","slug":"codexglue-a-machine-learning-benchmark","title":"CodeXGLUE: A Machine Learning Benchmark Dataset for Code Understanding and Generation","date":"2021-02-09","arxiv_id":"2102.04664","repositories_listed":7,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/codexglue-a-machine-learning-benchmark#ran","syntology_url":"https://syntology.ai/paper/2102.04664","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.04664"}},"official":{"repos":["microsoft/CodeXGLUE"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-federated-learning-at-scale-system","slug":"towards-federated-learning-at-scale-system","title":"Towards Federated Learning at Scale: System Design","date":"2019-02-04","arxiv_id":"1902.01046","repositories_listed":7,"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/towards-federated-learning-at-scale-system#ran","syntology_url":"https://syntology.ai/paper/1902.01046","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.01046"}},"official":null}},{"url":"/paper/adversarial-robustness-toolbox-v040","slug":"adversarial-robustness-toolbox-v040","title":"Adversarial Robustness Toolbox v1.0.0","date":"2018-07-03","arxiv_id":"1807.01069","repositories_listed":7,"syntology":null},{"url":"/paper/ml-leaks-model-and-data-independent","slug":"ml-leaks-model-and-data-independent","title":"ML-Leaks: Model and Data Independent Membership Inference Attacks and Defenses on Machine Learning Models","date":"2018-06-04","arxiv_id":"1806.01246","repositories_listed":7,"syntology":{"n":18,"n_ran":17,"n_constructed":0,"n_ran_checked":15,"n_instrument":2,"n_unverified":1,"n_honours":1,"n_violates":2,"n_no_contract":12,"n_pointer_only":2,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 1 honoured, 2 violated, 12 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/ml-leaks-model-and-data-independent#ran","syntology_url":"https://syntology.ai/paper/1806.01246","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.01246"}},"official":{"repos":["AhmedSalem2/ML-Leaks"],"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":["listed","official"]}}},{"url":"/paper/a-high-bias-low-variance-introduction-to","slug":"a-high-bias-low-variance-introduction-to","title":"A high-bias, low-variance introduction to Machine Learning for physicists","date":"2018-03-23","arxiv_id":"1803.08823","repositories_listed":7,"syntology":{"n":14,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":3,"n_honours":2,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 2 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/a-high-bias-low-variance-introduction-to#ran","syntology_url":"https://syntology.ai/paper/1803.08823","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.08823"}},"official":{"repos":["drckf/mlreview_notebooks","alexandreday/fast_density_clustering"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/introducing-request-an-open-platform-for","slug":"introducing-request-an-open-platform-for","title":"Introducing ReQuEST: an Open Platform for Reproducible and Quality-Efficient Systems-ML Tournaments","date":"2018-01-19","arxiv_id":"1801.06378","repositories_listed":7,"syntology":null},{"url":"/paper/one-pixel-attack-for-fooling-deep-neural","slug":"one-pixel-attack-for-fooling-deep-neural","title":"One pixel attack for fooling deep neural networks","date":"2017-10-24","arxiv_id":"1710.08864","repositories_listed":7,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/one-pixel-attack-for-fooling-deep-neural#ran","syntology_url":"https://syntology.ai/paper/1710.08864","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.08864"}},"official":null}},{"url":"/paper/foolbox-a-python-toolbox-to-benchmark-the","slug":"foolbox-a-python-toolbox-to-benchmark-the","title":"Foolbox: A Python toolbox to benchmark the robustness of machine learning models","date":"2017-07-13","arxiv_id":"1707.04131","repositories_listed":7,"syntology":null},{"url":"/paper/adversarial-machine-learning-at-scale","slug":"adversarial-machine-learning-at-scale","title":"Adversarial Machine Learning at Scale","date":"2016-11-04","arxiv_id":"1611.01236","repositories_listed":7,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"0 ran · 2 unverified","sample_list":"/paper/adversarial-machine-learning-at-scale#ran","syntology_url":"https://syntology.ai/paper/1611.01236","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.01236"}},"official":null}},{"url":"/paper/ogb-lsc-a-large-scale-challenge-for-machine","slug":"ogb-lsc-a-large-scale-challenge-for-machine","title":"OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphs","date":"2021-03-17","arxiv_id":"2103.09430","repositories_listed":6,"syntology":null},{"url":"/paper/chickenpox-cases-in-hungary-a-benchmark","slug":"chickenpox-cases-in-hungary-a-benchmark","title":"Chickenpox Cases in Hungary: a Benchmark Dataset for Spatiotemporal Signal Processing with Graph Neural Networks","date":"2021-02-16","arxiv_id":"2102.08100","repositories_listed":6,"syntology":null},{"url":"/paper/representations-of-molecules-and-materials","slug":"representations-of-molecules-and-materials","title":"Representations of molecules and materials for interpolation of quantum-mechanical simulations via machine learning","date":"2020-03-26","arxiv_id":"2003.12081","repositories_listed":6,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/representations-of-molecules-and-materials#ran","syntology_url":"https://syntology.ai/paper/2003.12081","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.12081"}},"official":{"repos":["gitlab.com/qmml/qmmlpack","sirmarcel/cmlkit","gitlab.com/repbench/repbench-datasets","gitlab.com/repbench/repbench-results","gitlab.com/sirmarcel/mortimer","gitlab.com/sirmarcel/skrrt"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/metric-learn-metric-learning-algorithms-in","slug":"metric-learn-metric-learning-algorithms-in","title":"metric-learn: Metric Learning Algorithms in Python","date":"2019-08-13","arxiv_id":"1908.04710","repositories_listed":6,"syntology":null},{"url":"/paper/explaining-machine-learning-classifiers","slug":"explaining-machine-learning-classifiers","title":"Explaining Machine Learning Classifiers through Diverse Counterfactual Explanations","date":"2019-05-19","arxiv_id":"1905.07697","repositories_listed":6,"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/explaining-machine-learning-classifiers#ran","syntology_url":"https://syntology.ai/paper/1905.07697","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.07697"}},"official":null}},{"url":"/paper/data-shapley-equitable-valuation-of-data-for","slug":"data-shapley-equitable-valuation-of-data-for","title":"Data Shapley: Equitable Valuation of Data for Machine Learning","date":"2019-04-05","arxiv_id":"1904.02868","repositories_listed":6,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/data-shapley-equitable-valuation-of-data-for#ran","syntology_url":"https://syntology.ai/paper/1904.02868","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.02868"}},"official":{"repos":["amiratag/DataShapley"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/particlenet-jet-tagging-via-particle-clouds","slug":"particlenet-jet-tagging-via-particle-clouds","title":"ParticleNet: Jet Tagging via Particle Clouds","date":"2019-02-22","arxiv_id":"1902.08570","repositories_listed":6,"syntology":{"n":23,"n_ran":19,"n_constructed":0,"n_ran_checked":18,"n_instrument":1,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":17,"n_pointer_only":1,"phrase":"19 ran (of which 0 constructed an object rather than computing a result; 18 with no instrument failure: 1 honoured, 0 violated, 17 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/particlenet-jet-tagging-via-particle-clouds#ran","syntology_url":"https://syntology.ai/paper/1902.08570","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.08570"}},"official":{"repos":["hqucms/weaver-core"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":4,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/interpretable-machine-learning-definitions","slug":"interpretable-machine-learning-definitions","title":"Interpretable machine learning: definitions, methods, and applications","date":"2019-01-14","arxiv_id":"1901.04592","repositories_listed":6,"syntology":{"n":27,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":16,"n_honours":2,"n_violates":0,"n_no_contract":9,"n_pointer_only":2,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 2 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 16 unverified","sample_list":"/paper/interpretable-machine-learning-definitions#ran","syntology_url":"https://syntology.ai/paper/1901.04592","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.04592"}},"official":{"repos":["csinva/imodels"],"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/adversarial-reprogramming-of-neural-networks","slug":"adversarial-reprogramming-of-neural-networks","title":"Adversarial Reprogramming of Neural Networks","date":"2018-06-28","arxiv_id":"1806.11146","repositories_listed":6,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/adversarial-reprogramming-of-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1806.11146","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.11146"}},"official":null}},{"url":"/paper/decision-based-adversarial-attacks-reliable","slug":"decision-based-adversarial-attacks-reliable","title":"Decision-Based Adversarial Attacks: Reliable Attacks Against Black-Box Machine Learning Models","date":"2017-12-12","arxiv_id":"1712.04248","repositories_listed":6,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":1,"n_instrument":4,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":6,"phrase":"5 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; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/decision-based-adversarial-attacks-reliable#ran","syntology_url":"https://syntology.ai/paper/1712.04248","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1712.04248"}},"official":{"repos":["bethgelab/foolbox"],"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/augmentor-an-image-augmentation-library-for","slug":"augmentor-an-image-augmentation-library-for","title":"Augmentor: An Image Augmentation Library for Machine Learning","date":"2017-08-11","arxiv_id":"1708.04680","repositories_listed":6,"syntology":null},{"url":"/paper/adversarial-examples-in-the-physical-world","slug":"adversarial-examples-in-the-physical-world","title":"Adversarial examples in the physical world","date":"2016-07-08","arxiv_id":"1607.02533","repositories_listed":6,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adversarial-examples-in-the-physical-world#ran","syntology_url":"https://syntology.ai/paper/1607.02533","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1607.02533"}},"official":null}},{"url":"/paper/pylearn2-a-machine-learning-research-library","slug":"pylearn2-a-machine-learning-research-library","title":"Pylearn2: a machine learning research library","date":"2013-08-20","arxiv_id":"1308.4214","repositories_listed":6,"syntology":null},{"url":"/paper/retiring-adult-new-datasets-for-fair-machine","slug":"retiring-adult-new-datasets-for-fair-machine","title":"Retiring Adult: New Datasets for Fair Machine Learning","date":"2021-08-10","arxiv_id":"2108.04884","repositories_listed":5,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/retiring-adult-new-datasets-for-fair-machine#ran","syntology_url":"https://syntology.ai/paper/2108.04884","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.04884"}},"official":{"repos":["zykls/folktables"],"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/pytorch-geometric-temporal-spatiotemporal","slug":"pytorch-geometric-temporal-spatiotemporal","title":"PyTorch Geometric Temporal: Spatiotemporal Signal Processing with Neural Machine Learning Models","date":"2021-04-15","arxiv_id":"2104.07788","repositories_listed":5,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/pytorch-geometric-temporal-spatiotemporal#ran","syntology_url":"https://syntology.ai/paper/2104.07788","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.07788"}},"official":{"repos":["benedekrozemberczki/pytorch_geometric_temporal"],"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/low-latency-asynchronous-logic-design-for","slug":"low-latency-asynchronous-logic-design-for","title":"Low-Latency Asynchronous Logic Design for Inference at the Edge","date":"2020-12-07","arxiv_id":"2012.03402","repositories_listed":5,"syntology":null},{"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/deep-transformer-models-for-time-series","slug":"deep-transformer-models-for-time-series","title":"Deep Transformer Models for Time Series Forecasting: The Influenza Prevalence Case","date":"2020-01-23","arxiv_id":"2001.08317","repositories_listed":5,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/deep-transformer-models-for-time-series#ran","syntology_url":"https://syntology.ai/paper/2001.08317","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.08317"}},"official":null}},{"url":"/paper/lung-and-colon-cancer-histopathological-image","slug":"lung-and-colon-cancer-histopathological-image","title":"Lung and Colon Cancer Histopathological Image Dataset (LC25000)","date":"2019-12-16","arxiv_id":"1912.12142","repositories_listed":5,"syntology":null},{"url":"/paper/neural-oblivious-decision-ensembles-for-deep","slug":"neural-oblivious-decision-ensembles-for-deep","title":"Neural Oblivious Decision Ensembles for Deep Learning on Tabular Data","date":"2019-09-13","arxiv_id":"1909.06312","repositories_listed":5,"syntology":{"n":7,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 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; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/neural-oblivious-decision-ensembles-for-deep#ran","syntology_url":"https://syntology.ai/paper/1909.06312","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.06312"}},"official":{"repos":["Qwicen/node","anonICLR2020/node"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/madminer-machine-learning-based-inference-for","slug":"madminer-machine-learning-based-inference-for","title":"MadMiner: Machine learning-based inference for particle physics","date":"2019-07-24","arxiv_id":"1907.10621","repositories_listed":5,"syntology":{"n":14,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/madminer-machine-learning-based-inference-for#ran","syntology_url":"https://syntology.ai/paper/1907.10621","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.10621"}},"official":{"repos":["diana-hep/madminer"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/evaluating-protein-transfer-learning-with","slug":"evaluating-protein-transfer-learning-with","title":"Evaluating Protein Transfer Learning with TAPE","date":"2019-06-19","arxiv_id":"1906.08230","repositories_listed":5,"syntology":{"n":18,"n_ran":16,"n_constructed":0,"n_ran_checked":12,"n_instrument":4,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/evaluating-protein-transfer-learning-with#ran","syntology_url":"https://syntology.ai/paper/1906.08230","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.08230"}},"official":{"repos":["songlab-cal/tape"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/guidelines-for-responsible-and-human-centered","slug":"guidelines-for-responsible-and-human-centered","title":"Proposed Guidelines for the Responsible Use of Explainable Machine Learning","date":"2019-06-08","arxiv_id":"1906.03533","repositories_listed":5,"syntology":null},{"url":"/paper/multimodal-speech-emotion-recognition-and","slug":"multimodal-speech-emotion-recognition-and","title":"Multimodal Speech Emotion Recognition and Ambiguity Resolution","date":"2019-04-12","arxiv_id":"1904.06022","repositories_listed":5,"syntology":null},{"url":"/paper/nuanced-metrics-for-measuring-unintended-bias","slug":"nuanced-metrics-for-measuring-unintended-bias","title":"Nuanced Metrics for Measuring Unintended Bias with Real Data for Text Classification","date":"2019-03-11","arxiv_id":"1903.04561","repositories_listed":5,"syntology":null},{"url":"/paper/diffeqfluxjl-a-julia-library-for-neural","slug":"diffeqfluxjl-a-julia-library-for-neural","title":"DiffEqFlux.jl - A Julia Library for Neural Differential Equations","date":"2019-02-06","arxiv_id":"1902.02376","repositories_listed":5,"syntology":null},{"url":"/paper/a-machine-learning-benchmark-for-facies","slug":"a-machine-learning-benchmark-for-facies","title":"A Machine Learning Benchmark for Facies Classification","date":"2019-01-12","arxiv_id":"1901.07659","repositories_listed":5,"syntology":{"n":12,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":2,"phrase":"6 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; 1 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/a-machine-learning-benchmark-for-facies#ran","syntology_url":"https://syntology.ai/paper/1901.07659","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.07659"}},"official":null}},{"url":"/paper/a-comprehensive-survey-on-graph-neural","slug":"a-comprehensive-survey-on-graph-neural","title":"A Comprehensive Survey on Graph Neural Networks","date":"2019-01-03","arxiv_id":"1901.00596","repositories_listed":5,"syntology":null},{"url":"/paper/an-introduction-to-deep-reinforcement","slug":"an-introduction-to-deep-reinforcement","title":"An Introduction to Deep Reinforcement Learning","date":"2018-11-30","arxiv_id":"1811.12560","repositories_listed":5,"syntology":null},{"url":"/paper/evaluating-shallow-and-deep-neural-networks","slug":"evaluating-shallow-and-deep-neural-networks","title":"Evaluating Shallow and Deep Neural Networks for Network Intrusion Detection Systems in Cyber Security","date":"2018-10-08","arxiv_id":null,"repositories_listed":5,"syntology":null},{"url":"/paper/on-the-art-and-science-of-machine-learning","slug":"on-the-art-and-science-of-machine-learning","title":"On the Art and Science of Machine Learning Explanations","date":"2018-10-05","arxiv_id":"1810.02909","repositories_listed":5,"syntology":null},{"url":"/paper/an-empirical-study-of-rich-subgroup-fairness","slug":"an-empirical-study-of-rich-subgroup-fairness","title":"An Empirical Study of Rich Subgroup Fairness for Machine Learning","date":"2018-08-24","arxiv_id":"1808.08166","repositories_listed":5,"syntology":{"n":11,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":4,"phrase":"3 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; 2 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/an-empirical-study-of-rich-subgroup-fairness#ran","syntology_url":"https://syntology.ai/paper/1808.08166","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.08166"}},"official":null}},{"url":"/paper/meta-learning-with-differentiable-closed-form","slug":"meta-learning-with-differentiable-closed-form","title":"Meta-learning with differentiable closed-form solvers","date":"2018-05-21","arxiv_id":"1805.08136","repositories_listed":5,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/meta-learning-with-differentiable-closed-form#ran","syntology_url":"https://syntology.ai/paper/1805.08136","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.08136"}},"official":null}},{"url":"/paper/an-overview-of-multi-task-learning-in-deep","slug":"an-overview-of-multi-task-learning-in-deep","title":"An Overview of Multi-Task Learning in Deep Neural Networks","date":"2017-06-15","arxiv_id":"1706.05098","repositories_listed":5,"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/an-overview-of-multi-task-learning-in-deep#ran","syntology_url":"https://syntology.ai/paper/1706.05098","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1706.05098"}},"official":null}},{"url":"/paper/moleculenet-a-benchmark-for-molecular-machine","slug":"moleculenet-a-benchmark-for-molecular-machine","title":"MoleculeNet: A Benchmark for Molecular Machine Learning","date":"2017-03-02","arxiv_id":"1703.00564","repositories_listed":5,"syntology":null},{"url":"/paper/deepmind-lab","slug":"deepmind-lab","title":"DeepMind Lab","date":"2016-12-12","arxiv_id":"1612.03801","repositories_listed":5,"syntology":null},{"url":"/paper/predicting-the-direction-of-stock-market","slug":"predicting-the-direction-of-stock-market","title":"Predicting the direction of stock market prices using random forest","date":"2016-04-29","arxiv_id":"1605.00003","repositories_listed":5,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/predicting-the-direction-of-stock-market#ran","syntology_url":"https://syntology.ai/paper/1605.00003","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1605.00003"}},"official":null}},{"url":"/paper/blocks-and-fuel-frameworks-for-deep-learning","slug":"blocks-and-fuel-frameworks-for-deep-learning","title":"Blocks and Fuel: Frameworks for deep learning","date":"2015-06-01","arxiv_id":"1506.00619","repositories_listed":5,"syntology":null},{"url":"/paper/determinantal-point-processes-for-machine","slug":"determinantal-point-processes-for-machine","title":"Determinantal point processes for machine learning","date":"2012-07-25","arxiv_id":"1207.6083","repositories_listed":5,"syntology":null},{"url":"/paper/efficient-active-search-for-combinatorial","slug":"efficient-active-search-for-combinatorial","title":"Efficient Active Search for Combinatorial Optimization Problems","date":"2021-06-09","arxiv_id":"2106.05126","repositories_listed":4,"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/efficient-active-search-for-combinatorial#ran","syntology_url":"https://syntology.ai/paper/2106.05126","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.05126"}},"official":{"repos":["ahottung/EAS"],"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/beyond-trivial-counterfactual-explanations","slug":"beyond-trivial-counterfactual-explanations","title":"Beyond Trivial Counterfactual Explanations with Diverse Valuable Explanations","date":"2021-03-18","arxiv_id":"2103.10226","repositories_listed":4,"syntology":{"n":10,"n_ran":6,"n_constructed":0,"n_ran_checked":1,"n_instrument":5,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":9,"phrase":"6 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; 5 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/beyond-trivial-counterfactual-explanations#ran","syntology_url":"https://syntology.ai/paper/2103.10226","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.10226"}},"official":{"repos":["ElementAI/beyond-trivial-explanations"],"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/white-paper-machine-learning-in-certified","slug":"white-paper-machine-learning-in-certified","title":"White Paper Machine Learning in Certified Systems","date":"2021-03-18","arxiv_id":"2103.10529","repositories_listed":4,"syntology":null},{"url":"/paper/doubleml-an-object-oriented-implementation-of","slug":"doubleml-an-object-oriented-implementation-of","title":"DoubleML -- An Object-Oriented Implementation of Double Machine Learning in R","date":"2021-03-17","arxiv_id":"2103.09603","repositories_listed":4,"syntology":null},{"url":"/paper/modern-koopman-theory-for-dynamical-systems","slug":"modern-koopman-theory-for-dynamical-systems","title":"Modern Koopman Theory for Dynamical Systems","date":"2021-02-24","arxiv_id":"2102.12086","repositories_listed":4,"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":0,"phrase":"0 ran · 3 unverified","sample_list":"/paper/modern-koopman-theory-for-dynamical-systems#ran","syntology_url":"https://syntology.ai/paper/2102.12086","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.12086"}},"official":null}},{"url":"/paper/federated-learning-on-non-iid-data-silos-an","slug":"federated-learning-on-non-iid-data-silos-an","title":"Federated Learning on Non-IID Data Silos: An Experimental Study","date":"2021-02-03","arxiv_id":"2102.02079","repositories_listed":4,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":3,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/federated-learning-on-non-iid-data-silos-an#ran","syntology_url":"https://syntology.ai/paper/2102.02079","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.02079"}},"official":{"repos":["Xtra-Computing/NIID-Bench"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/gputreeshap-fast-parallel-tree","slug":"gputreeshap-fast-parallel-tree","title":"GPUTreeShap: Massively Parallel Exact Calculation of SHAP Scores for Tree Ensembles","date":"2020-10-27","arxiv_id":"2010.13972","repositories_listed":4,"syntology":{"n":8,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":4,"n_honours":2,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/gputreeshap-fast-parallel-tree#ran","syntology_url":"https://syntology.ai/paper/2010.13972","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.13972"}},"official":{"repos":["rapidsai/gputreeshap"],"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/stock-price-prediction-using-machine-learning","slug":"stock-price-prediction-using-machine-learning","title":"Stock Price Prediction Using Machine Learning and LSTM-Based Deep Learning Models","date":"2020-09-20","arxiv_id":"2009.10819","repositories_listed":4,"syntology":null},{"url":"/paper/hands-on-bayesian-neural-networks-a-tutorial","slug":"hands-on-bayesian-neural-networks-a-tutorial","title":"Hands-on Bayesian Neural Networks -- a Tutorial for Deep Learning Users","date":"2020-07-14","arxiv_id":"2007.06823","repositories_listed":4,"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/hands-on-bayesian-neural-networks-a-tutorial#ran","syntology_url":"https://syntology.ai/paper/2007.06823","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.06823"}},"official":{"repos":["french-paragon/BayesianMnist"],"state":"official: not harvested","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]}}},{"url":"/paper/auto-sklearn-2-0-the-next-generation","slug":"auto-sklearn-2-0-the-next-generation","title":"Auto-Sklearn 2.0: Hands-free AutoML via Meta-Learning","date":"2020-07-08","arxiv_id":"2007.04074","repositories_listed":4,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 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; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/auto-sklearn-2-0-the-next-generation#ran","syntology_url":"https://syntology.ai/paper/2007.04074","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.04074"}},"official":{"repos":["automl/ASKL2.0_experiments"],"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/exploring-automatic-diagnosis-of-covid-19","slug":"exploring-automatic-diagnosis-of-covid-19","title":"Exploring Automatic Diagnosis of COVID-19 from Crowdsourced Respiratory Sound Data","date":"2020-06-10","arxiv_id":"2006.05919","repositories_listed":4,"syntology":null},{"url":"/paper/adahessian-an-adaptive-second-order-optimizer","slug":"adahessian-an-adaptive-second-order-optimizer","title":"ADAHESSIAN: An Adaptive Second Order Optimizer for Machine Learning","date":"2020-06-01","arxiv_id":"2006.00719","repositories_listed":4,"syntology":{"n":11,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/adahessian-an-adaptive-second-order-optimizer#ran","syntology_url":"https://syntology.ai/paper/2006.00719","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.00719"}},"official":{"repos":["amirgholami/adahessian"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/ktrain-a-low-code-library-for-augmented","slug":"ktrain-a-low-code-library-for-augmented","title":"ktrain: A Low-Code Library for Augmented Machine Learning","date":"2020-04-19","arxiv_id":"2004.10703","repositories_listed":4,"syntology":{"n":16,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":12,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 12 unverified","sample_list":"/paper/ktrain-a-low-code-library-for-augmented#ran","syntology_url":"https://syntology.ai/paper/2004.10703","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.10703"}},"official":{"repos":["amaiya/ktrain"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":10,"ran_from_kinds":["listed"]}}},{"url":"/paper/tensorflow-quantum-a-software-framework-for","slug":"tensorflow-quantum-a-software-framework-for","title":"TensorFlow Quantum: A Software Framework for Quantum Machine Learning","date":"2020-03-06","arxiv_id":"2003.02989","repositories_listed":4,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 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; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/tensorflow-quantum-a-software-framework-for#ran","syntology_url":"https://syntology.ai/paper/2003.02989","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.02989"}},"official":{"repos":["tensorflow/quantum"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/neuroevolution-of-neural-network","slug":"neuroevolution-of-neural-network","title":"Neuroevolution of Neural Network Architectures Using CoDeepNEAT and Keras","date":"2020-02-11","arxiv_id":"2002.04634","repositories_listed":4,"syntology":null},{"url":"/paper/lift-learn-physics-informed-machine-learning","slug":"lift-learn-physics-informed-machine-learning","title":"Lift & Learn: Physics-informed machine learning for large-scale nonlinear dynamical systems","date":"2019-12-17","arxiv_id":"1912.08177","repositories_listed":4,"syntology":null},{"url":"/paper/federated-learning-with-personalization","slug":"federated-learning-with-personalization","title":"Federated Learning with Personalization Layers","date":"2019-12-02","arxiv_id":"1912.00818","repositories_listed":4,"syntology":null},{"url":"/paper/making-ai-forget-you-data-deletion-in-machine","slug":"making-ai-forget-you-data-deletion-in-machine","title":"Making AI Forget You: Data Deletion in Machine Learning","date":"2019-07-11","arxiv_id":"1907.05012","repositories_listed":4,"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/making-ai-forget-you-data-deletion-in-machine#ran","syntology_url":"https://syntology.ai/paper/1907.05012","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.05012"}},"official":{"repos":["tginart/deletion-efficient-kmeans"],"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/parameterized-quantum-circuits-as-machine","slug":"parameterized-quantum-circuits-as-machine","title":"Parameterized quantum circuits as machine learning models","date":"2019-06-18","arxiv_id":"1906.07682","repositories_listed":4,"syntology":null},{"url":"/paper/data-sketching-for-faster-training-of-machine","slug":"data-sketching-for-faster-training-of-machine","title":"Coresets for Data-efficient Training of Machine Learning Models","date":"2019-06-05","arxiv_id":"1906.01827","repositories_listed":4,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/data-sketching-for-faster-training-of-machine#ran","syntology_url":"https://syntology.ai/paper/1906.01827","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.01827"}},"official":{"repos":["baharanm/craig"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/adversarial-examples-are-not-bugs-they-are","slug":"adversarial-examples-are-not-bugs-they-are","title":"Adversarial Examples Are Not Bugs, They Are Features","date":"2019-05-06","arxiv_id":"1905.02175","repositories_listed":4,"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/adversarial-examples-are-not-bugs-they-are#ran","syntology_url":"https://syntology.ai/paper/1905.02175","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.02175"}},"official":{"repos":["MadryLab/robustness"],"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/few-shot-learning-a-survey","slug":"few-shot-learning-a-survey","title":"Generalizing from a Few Examples: A Survey on Few-Shot Learning","date":"2019-04-10","arxiv_id":"1904.05046","repositories_listed":4,"syntology":null}],"syntology_records":66,"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":356,"papers_where_code_ran_first_page":"/task/machine-learning/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":101,"url":"/task/machine-learning/papers/2","json":"/task/machine-learning/papers/2.json","rows":100},{"order":"archive","page":3,"of":101,"url":"/task/machine-learning/papers/3","json":"/task/machine-learning/papers/3.json","rows":100},{"order":"archive","page":4,"of":101,"url":"/task/machine-learning/papers/4","json":"/task/machine-learning/papers/4.json","rows":100},{"order":"archive","page":5,"of":101,"url":"/task/machine-learning/papers/5","json":"/task/machine-learning/papers/5.json","rows":100},{"order":"archive","page":6,"of":101,"url":"/task/machine-learning/papers/6","json":"/task/machine-learning/papers/6.json","rows":100},{"order":"archive","page":7,"of":101,"url":"/task/machine-learning/papers/7","json":"/task/machine-learning/papers/7.json","rows":100},{"order":"archive","page":8,"of":101,"url":"/task/machine-learning/papers/8","json":"/task/machine-learning/papers/8.json","rows":100},{"order":"archive","page":9,"of":101,"url":"/task/machine-learning/papers/9","json":"/task/machine-learning/papers/9.json","rows":100},{"order":"archive","page":10,"of":101,"url":"/task/machine-learning/papers/10","json":"/task/machine-learning/papers/10.json","rows":100},{"order":"archive","page":11,"of":101,"url":"/task/machine-learning/papers/11","json":"/task/machine-learning/papers/11.json","rows":100},{"order":"archive","page":12,"of":101,"url":"/task/machine-learning/papers/12","json":"/task/machine-learning/papers/12.json","rows":100},{"order":"archive","page":13,"of":101,"url":"/task/machine-learning/papers/13","json":"/task/machine-learning/papers/13.json","rows":100},{"order":"archive","page":14,"of":101,"url":"/task/machine-learning/papers/14","json":"/task/machine-learning/papers/14.json","rows":100},{"order":"archive","page":15,"of":101,"url":"/task/machine-learning/papers/15","json":"/task/machine-learning/papers/15.json","rows":100},{"order":"archive","page":16,"of":101,"url":"/task/machine-learning/papers/16","json":"/task/machine-learning/papers/16.json","rows":100},{"order":"archive","page":17,"of":101,"url":"/task/machine-learning/papers/17","json":"/task/machine-learning/papers/17.json","rows":100},{"order":"archive","page":18,"of":101,"url":"/task/machine-learning/papers/18","json":"/task/machine-learning/papers/18.json","rows":100},{"order":"archive","page":19,"of":101,"url":"/task/machine-learning/papers/19","json":"/task/machine-learning/papers/19.json","rows":100},{"order":"archive","page":20,"of":101,"url":"/task/machine-learning/papers/20","json":"/task/machine-learning/papers/20.json","rows":100},{"order":"archive","page":21,"of":101,"url":"/task/machine-learning/papers/21","json":"/task/machine-learning/papers/21.json","rows":100},{"order":"archive","page":22,"of":101,"url":"/task/machine-learning/papers/22","json":"/task/machine-learning/papers/22.json","rows":100},{"order":"archive","page":23,"of":101,"url":"/task/machine-learning/papers/23","json":"/task/machine-learning/papers/23.json","rows":100},{"order":"archive","page":24,"of":101,"url":"/task/machine-learning/papers/24","json":"/task/machine-learning/papers/24.json","rows":100},{"order":"archive","page":25,"of":101,"url":"/task/machine-learning/papers/25","json":"/task/machine-learning/papers/25.json","rows":100},{"order":"archive","page":26,"of":101,"url":"/task/machine-learning/papers/26","json":"/task/machine-learning/papers/26.json","rows":100},{"order":"archive","page":27,"of":101,"url":"/task/machine-learning/papers/27","json":"/task/machine-learning/papers/27.json","rows":100},{"order":"archive","page":28,"of":101,"url":"/task/machine-learning/papers/28","json":"/task/machine-learning/papers/28.json","rows":100},{"order":"archive","page":29,"of":101,"url":"/task/machine-learning/papers/29","json":"/task/machine-learning/papers/29.json","rows":100},{"order":"archive","page":30,"of":101,"url":"/task/machine-learning/papers/30","json":"/task/machine-learning/papers/30.json","rows":100},{"order":"archive","page":31,"of":101,"url":"/task/machine-learning/papers/31","json":"/task/machine-learning/papers/31.json","rows":100},{"order":"archive","page":32,"of":101,"url":"/task/machine-learning/papers/32","json":"/task/machine-learning/papers/32.json","rows":100},{"order":"archive","page":33,"of":101,"url":"/task/machine-learning/papers/33","json":"/task/machine-learning/papers/33.json","rows":100},{"order":"archive","page":34,"of":101,"url":"/task/machine-learning/papers/34","json":"/task/machine-learning/papers/34.json","rows":100},{"order":"archive","page":35,"of":101,"url":"/task/machine-learning/papers/35","json":"/task/machine-learning/papers/35.json","rows":100},{"order":"archive","page":36,"of":101,"url":"/task/machine-learning/papers/36","json":"/task/machine-learning/papers/36.json","rows":100},{"order":"archive","page":37,"of":101,"url":"/task/machine-learning/papers/37","json":"/task/machine-learning/papers/37.json","rows":100},{"order":"archive","page":38,"of":101,"url":"/task/machine-learning/papers/38","json":"/task/machine-learning/papers/38.json","rows":100},{"order":"archive","page":39,"of":101,"url":"/task/machine-learning/papers/39","json":"/task/machine-learning/papers/39.json","rows":100},{"order":"archive","page":40,"of":101,"url":"/task/machine-learning/papers/40","json":"/task/machine-learning/papers/40.json","rows":100},{"order":"archive","page":41,"of":101,"url":"/task/machine-learning/papers/41","json":"/task/machine-learning/papers/41.json","rows":100},{"order":"archive","page":42,"of":101,"url":"/task/machine-learning/papers/42","json":"/task/machine-learning/papers/42.json","rows":100},{"order":"archive","page":43,"of":101,"url":"/task/machine-learning/papers/43","json":"/task/machine-learning/papers/43.json","rows":100},{"order":"archive","page":44,"of":101,"url":"/task/machine-learning/papers/44","json":"/task/machine-learning/papers/44.json","rows":100},{"order":"archive","page":45,"of":101,"url":"/task/machine-learning/papers/45","json":"/task/machine-learning/papers/45.json","rows":100},{"order":"archive","page":46,"of":101,"url":"/task/machine-learning/papers/46","json":"/task/machine-learning/papers/46.json","rows":100},{"order":"archive","page":47,"of":101,"url":"/task/machine-learning/papers/47","json":"/task/machine-learning/papers/47.json","rows":100},{"order":"archive","page":48,"of":101,"url":"/task/machine-learning/papers/48","json":"/task/machine-learning/papers/48.json","rows":100},{"order":"archive","page":49,"of":101,"url":"/task/machine-learning/papers/49","json":"/task/machine-learning/papers/49.json","rows":100},{"order":"archive","page":50,"of":101,"url":"/task/machine-learning/papers/50","json":"/task/machine-learning/papers/50.json","rows":100},{"order":"archive","page":51,"of":101,"url":"/task/machine-learning/papers/51","json":"/task/machine-learning/papers/51.json","rows":100},{"order":"archive","page":52,"of":101,"url":"/task/machine-learning/papers/52","json":"/task/machine-learning/papers/52.json","rows":100},{"order":"archive","page":53,"of":101,"url":"/task/machine-learning/papers/53","json":"/task/machine-learning/papers/53.json","rows":100},{"order":"archive","page":54,"of":101,"url":"/task/machine-learning/papers/54","json":"/task/machine-learning/papers/54.json","rows":100},{"order":"archive","page":55,"of":101,"url":"/task/machine-learning/papers/55","json":"/task/machine-learning/papers/55.json","rows":100},{"order":"archive","page":56,"of":101,"url":"/task/machine-learning/papers/56","json":"/task/machine-learning/papers/56.json","rows":100},{"order":"archive","page":57,"of":101,"url":"/task/machine-learning/papers/57","json":"/task/machine-learning/papers/57.json","rows":100},{"order":"archive","page":58,"of":101,"url":"/task/machine-learning/papers/58","json":"/task/machine-learning/papers/58.json","rows":100},{"order":"archive","page":59,"of":101,"url":"/task/machine-learning/papers/59","json":"/task/machine-learning/papers/59.json","rows":100},{"order":"archive","page":60,"of":101,"url":"/task/machine-learning/papers/60","json":"/task/machine-learning/papers/60.json","rows":100},{"order":"archive","page":61,"of":101,"url":"/task/machine-learning/papers/61","json":"/task/machine-learning/papers/61.json","rows":100},{"order":"archive","page":62,"of":101,"url":"/task/machine-learning/papers/62","json":"/task/machine-learning/papers/62.json","rows":100},{"order":"archive","page":63,"of":101,"url":"/task/machine-learning/papers/63","json":"/task/machine-learning/papers/63.json","rows":100},{"order":"archive","page":64,"of":101,"url":"/task/machine-learning/papers/64","json":"/task/machine-learning/papers/64.json","rows":100},{"order":"archive","page":65,"of":101,"url":"/task/machine-learning/papers/65","json":"/task/machine-learning/papers/65.json","rows":100},{"order":"archive","page":66,"of":101,"url":"/task/machine-learning/papers/66","json":"/task/machine-learning/papers/66.json","rows":100},{"order":"archive","page":67,"of":101,"url":"/task/machine-learning/papers/67","json":"/task/machine-learning/papers/67.json","rows":100},{"order":"archive","page":68,"of":101,"url":"/task/machine-learning/papers/68","json":"/task/machine-learning/papers/68.json","rows":100},{"order":"archive","page":69,"of":101,"url":"/task/machine-learning/papers/69","json":"/task/machine-learning/papers/69.json","rows":100},{"order":"archive","page":70,"of":101,"url":"/task/machine-learning/papers/70","json":"/task/machine-learning/papers/70.json","rows":100},{"order":"archive","page":71,"of":101,"url":"/task/machine-learning/papers/71","json":"/task/machine-learning/papers/71.json","rows":100},{"order":"archive","page":72,"of":101,"url":"/task/machine-learning/papers/72","json":"/task/machine-learning/papers/72.json","rows":100},{"order":"archive","page":73,"of":101,"url":"/task/machine-learning/papers/73","json":"/task/machine-learning/papers/73.json","rows":100},{"order":"archive","page":74,"of":101,"url":"/task/machine-learning/papers/74","json":"/task/machine-learning/papers/74.json","rows":100},{"order":"archive","page":75,"of":101,"url":"/task/machine-learning/papers/75","json":"/task/machine-learning/papers/75.json","rows":100},{"order":"archive","page":76,"of":101,"url":"/task/machine-learning/papers/76","json":"/task/machine-learning/papers/76.json","rows":100},{"order":"archive","page":77,"of":101,"url":"/task/machine-learning/papers/77","json":"/task/machine-learning/papers/77.json","rows":100},{"order":"archive","page":78,"of":101,"url":"/task/machine-learning/papers/78","json":"/task/machine-learning/papers/78.json","rows":100},{"order":"archive","page":79,"of":101,"url":"/task/machine-learning/papers/79","json":"/task/machine-learning/papers/79.json","rows":100},{"order":"archive","page":80,"of":101,"url":"/task/machine-learning/papers/80","json":"/task/machine-learning/papers/80.json","rows":100},{"order":"archive","page":81,"of":101,"url":"/task/machine-learning/papers/81","json":"/task/machine-learning/papers/81.json","rows":100},{"order":"archive","page":82,"of":101,"url":"/task/machine-learning/papers/82","json":"/task/machine-learning/papers/82.json","rows":100},{"order":"archive","page":83,"of":101,"url":"/task/machine-learning/papers/83","json":"/task/machine-learning/papers/83.json","rows":100},{"order":"archive","page":84,"of":101,"url":"/task/machine-learning/papers/84","json":"/task/machine-learning/papers/84.json","rows":100},{"order":"archive","page":85,"of":101,"url":"/task/machine-learning/papers/85","json":"/task/machine-learning/papers/85.json","rows":100},{"order":"archive","page":86,"of":101,"url":"/task/machine-learning/papers/86","json":"/task/machine-learning/papers/86.json","rows":100},{"order":"archive","page":87,"of":101,"url":"/task/machine-learning/papers/87","json":"/task/machine-learning/papers/87.json","rows":100},{"order":"archive","page":88,"of":101,"url":"/task/machine-learning/papers/88","json":"/task/machine-learning/papers/88.json","rows":100},{"order":"archive","page":89,"of":101,"url":"/task/machine-learning/papers/89","json":"/task/machine-learning/papers/89.json","rows":100},{"order":"archive","page":90,"of":101,"url":"/task/machine-learning/papers/90","json":"/task/machine-learning/papers/90.json","rows":100},{"order":"archive","page":91,"of":101,"url":"/task/machine-learning/papers/91","json":"/task/machine-learning/papers/91.json","rows":100},{"order":"archive","page":92,"of":101,"url":"/task/machine-learning/papers/92","json":"/task/machine-learning/papers/92.json","rows":100},{"order":"archive","page":93,"of":101,"url":"/task/machine-learning/papers/93","json":"/task/machine-learning/papers/93.json","rows":100},{"order":"archive","page":94,"of":101,"url":"/task/machine-learning/papers/94","json":"/task/machine-learning/papers/94.json","rows":100},{"order":"archive","page":95,"of":101,"url":"/task/machine-learning/papers/95","json":"/task/machine-learning/papers/95.json","rows":100},{"order":"archive","page":96,"of":101,"url":"/task/machine-learning/papers/96","json":"/task/machine-learning/papers/96.json","rows":100},{"order":"archive","page":97,"of":101,"url":"/task/machine-learning/papers/97","json":"/task/machine-learning/papers/97.json","rows":100},{"order":"archive","page":98,"of":101,"url":"/task/machine-learning/papers/98","json":"/task/machine-learning/papers/98.json","rows":100},{"order":"archive","page":99,"of":101,"url":"/task/machine-learning/papers/99","json":"/task/machine-learning/papers/99.json","rows":100},{"order":"archive","page":100,"of":101,"url":"/task/machine-learning/papers/100","json":"/task/machine-learning/papers/100.json","rows":100},{"order":"archive","page":101,"of":101,"url":"/task/machine-learning/papers/101","json":"/task/machine-learning/papers/101.json","rows":33},{"order":"ran","page":1,"of":4,"url":"/task/machine-learning/papers/ran/1","json":"/task/machine-learning/papers/ran/1.json","rows":100},{"order":"ran","page":2,"of":4,"url":"/task/machine-learning/papers/ran/2","json":"/task/machine-learning/papers/ran/2.json","rows":100},{"order":"ran","page":3,"of":4,"url":"/task/machine-learning/papers/ran/3","json":"/task/machine-learning/papers/ran/3.json","rows":100},{"order":"ran","page":4,"of":4,"url":"/task/machine-learning/papers/ran/4","json":"/task/machine-learning/papers/ran/4.json","rows":56}],"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":"e24766fe206c6f5ae6ce7a69974c386896f3307599c4e2d84ab60ab8bfd05aab","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}