{"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/papers/ran/2","list_of":"/task/machine-learning","task":"BIG-bench Machine Learning","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":2,"pages_in_order":4,"rows_per_page":100,"rows":[101,200],"of":356,"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":290,"every_run_a_failure_of_syntologys_instrument":66,"listed_with_a_run_with_no_instrument_failure":290,"listed_every_run_a_failure_of_syntologys_instrument":66,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/machine-learning/papers/ran/1","prev":"/task/machine-learning/papers/ran/1","next":"/task/machine-learning/papers/ran/3","papers":[{"url":"/paper/therapeutics-data-commons-machine-learning","slug":"therapeutics-data-commons-machine-learning","title":"Therapeutics Data Commons: Machine Learning Datasets and Tasks for Drug Discovery and Development","date":"2021-02-18","arxiv_id":"2102.09548","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/therapeutics-data-commons-machine-learning#ran","syntology_url":"https://syntology.ai/paper/2102.09548","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.09548"}},"official":{"repos":["mims-harvard/TDC"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/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/discovering-conservation-laws-from","slug":"discovering-conservation-laws-from","title":"Discovering conservation laws from trajectories via machine learning","date":"2021-02-08","arxiv_id":"2102.04008","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/discovering-conservation-laws-from#ran","syntology_url":"https://syntology.ai/paper/2102.04008","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.04008"}},"official":null}},{"url":"/paper/federated-depression-detection-from-multi","slug":"federated-depression-detection-from-multi","title":"FedMood: Federated Learning on Mobile Health Data for Mood Detection","date":"2021-02-06","arxiv_id":"2102.09342","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"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) · 2 unverified","sample_list":"/paper/federated-depression-detection-from-multi#ran","syntology_url":"https://syntology.ai/paper/2102.09342","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.09342"}},"official":{"repos":["RingBDStack/Fed_mood"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/ml-doctor-holistic-risk-assessment-of","slug":"ml-doctor-holistic-risk-assessment-of","title":"ML-Doctor: Holistic Risk Assessment of Inference Attacks Against Machine Learning Models","date":"2021-02-04","arxiv_id":"2102.02551","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/ml-doctor-holistic-risk-assessment-of#ran","syntology_url":"https://syntology.ai/paper/2102.02551","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.02551"}},"official":{"repos":["liuyugeng/ml-doctor"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"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/distribution-free-risk-controlling-prediction","slug":"distribution-free-risk-controlling-prediction","title":"Distribution-Free, Risk-Controlling Prediction Sets","date":"2021-01-07","arxiv_id":"2101.02703","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":3,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 3 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/distribution-free-risk-controlling-prediction#ran","syntology_url":"https://syntology.ai/paper/2101.02703","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2101.02703"}},"official":{"repos":["aangelopoulos/rcps"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/predicting-forest-fire-using-remote-sensing","slug":"predicting-forest-fire-using-remote-sensing","title":"Predicting Forest Fire Using Remote Sensing Data And Machine Learning","date":"2021-01-06","arxiv_id":"2101.01975","repositories_listed":0,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/predicting-forest-fire-using-remote-sensing#ran","syntology_url":"https://syntology.ai/paper/2101.01975","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2101.01975"}},"official":null}},{"url":"/paper/exacerbating-algorithmic-bias-through","slug":"exacerbating-algorithmic-bias-through","title":"Exacerbating Algorithmic Bias through Fairness Attacks","date":"2020-12-16","arxiv_id":"2012.08723","repositories_listed":1,"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/exacerbating-algorithmic-bias-through#ran","syntology_url":"https://syntology.ai/paper/2012.08723","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.08723"}},"official":{"repos":["Ninarehm/attack"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/state-of-the-art-machine-learning-mri","slug":"state-of-the-art-machine-learning-mri","title":"Results of the 2020 fastMRI Challenge for Machine Learning MR Image Reconstruction","date":"2020-12-09","arxiv_id":"2012.06318","repositories_listed":3,"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/state-of-the-art-machine-learning-mri#ran","syntology_url":"https://syntology.ai/paper/2012.06318","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.06318"}},"official":{"repos":["directgroup/direct","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":["official"]}}},{"url":"/paper/fairbatch-batch-selection-for-model-fairness-1","slug":"fairbatch-batch-selection-for-model-fairness-1","title":"FairBatch: Batch Selection for Model Fairness","date":"2020-12-03","arxiv_id":"2012.01696","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/fairbatch-batch-selection-for-model-fairness-1#ran","syntology_url":"https://syntology.ai/paper/2012.01696","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.01696"}},"official":{"repos":["yuji-roh/fairbatch"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-outside-the-black-box-the-pursuit-of-1","slug":"learning-outside-the-black-box-the-pursuit-of-1","title":"Learning outside the Black-Box: The pursuit of interpretable models","date":"2020-11-17","arxiv_id":"2011.08596","repositories_listed":1,"syntology":{"n":6,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":6,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/learning-outside-the-black-box-the-pursuit-of-1#ran","syntology_url":"https://syntology.ai/paper/2011.08596","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.08596"}},"official":{"repos":["JonathanCrabbe/Symbolic-Pursuit"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/ecole-a-gym-like-library-for-machine-learning","slug":"ecole-a-gym-like-library-for-machine-learning","title":"Ecole: A Gym-like Library for Machine Learning in Combinatorial Optimization Solvers","date":"2020-11-11","arxiv_id":"2011.06069","repositories_listed":2,"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/ecole-a-gym-like-library-for-machine-learning#ran","syntology_url":"https://syntology.ai/paper/2011.06069","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.06069"}},"official":{"repos":["ds4dm/ecole"],"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/hurricane-forecasting-a-novel-multimodal","slug":"hurricane-forecasting-a-novel-multimodal","title":"Hurricane Forecasting: A Novel Multimodal Machine Learning Framework","date":"2020-11-11","arxiv_id":"2011.06125","repositories_listed":3,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/hurricane-forecasting-a-novel-multimodal#ran","syntology_url":"https://syntology.ai/paper/2011.06125","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.06125"}},"official":{"repos":["leobix/hurricast"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/the-power-of-quantum-neural-networks","slug":"the-power-of-quantum-neural-networks","title":"The power of quantum neural networks","date":"2020-10-30","arxiv_id":"2011.00027","repositories_listed":2,"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/the-power-of-quantum-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2011.00027","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.00027"}},"official":null}},{"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/gradient-flows-in-dataset-space","slug":"gradient-flows-in-dataset-space","title":"Dataset Dynamics via Gradient Flows in Probability Space","date":"2020-10-24","arxiv_id":"2010.12760","repositories_listed":1,"syntology":{"n":22,"n_ran":14,"n_constructed":0,"n_ran_checked":14,"n_instrument":0,"n_unverified":8,"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) · 8 unverified","sample_list":"/paper/gradient-flows-in-dataset-space#ran","syntology_url":"https://syntology.ai/paper/2010.12760","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.12760"}},"official":null}},{"url":"/paper/sidechainnet-an-all-atom-protein-structure","slug":"sidechainnet-an-all-atom-protein-structure","title":"SidechainNet: An All-Atom Protein Structure Dataset for Machine Learning","date":"2020-10-16","arxiv_id":"2010.08162","repositories_listed":3,"syntology":{"n":12,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":4,"n_no_contract":5,"n_pointer_only":4,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 4 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/sidechainnet-an-all-atom-protein-structure#ran","syntology_url":"https://syntology.ai/paper/2010.08162","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.08162"}},"official":{"repos":["jonathanking/sidechainnet"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/k-simplex2vec-a-simplicial-extension-of","slug":"k-simplex2vec-a-simplicial-extension-of","title":"k-simplex2vec: a simplicial extension of node2vec","date":"2020-10-12","arxiv_id":"2010.05636","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/k-simplex2vec-a-simplicial-extension-of#ran","syntology_url":"https://syntology.ai/paper/2010.05636","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.05636"}},"official":null}},{"url":"/paper/detecting-attackable-sentences-in-arguments","slug":"detecting-attackable-sentences-in-arguments","title":"Detecting Attackable Sentences in Arguments","date":"2020-10-06","arxiv_id":"2010.02660","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":2,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 2 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/detecting-attackable-sentences-in-arguments#ran","syntology_url":"https://syntology.ai/paper/2010.02660","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.02660"}},"official":{"repos":["yohanjo/emnlp20_arg_attack"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-bootstrapper","slug":"neural-bootstrapper","title":"Neural Bootstrapper","date":"2020-10-02","arxiv_id":"2010.01051","repositories_listed":2,"syntology":{"n":15,"n_ran":13,"n_constructed":1,"n_ran_checked":10,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":3,"phrase":"13 ran (of which 1 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/neural-bootstrapper#ran","syntology_url":"https://syntology.ai/paper/2010.01051","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.01051"}},"official":{"repos":["sungbinlim/GBS","sungbinlim/neuboots"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":1,"n_ran_no_instrument_failure":10,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/analyzing-koopman-approaches-to-physics","slug":"analyzing-koopman-approaches-to-physics","title":"Analyzing Koopman approaches to physics-informed machine learning for long-term sea-surface temperature forecasting","date":"2020-09-15","arxiv_id":"2010.00399","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":1,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":5,"phrase":"4 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/analyzing-koopman-approaches-to-physics#ran","syntology_url":"https://syntology.ai/paper/2010.00399","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.00399"}},"official":{"repos":["JRice15/physics-informed-autoencoders"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"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/coarse-graining-molecular-dynamics-with-graph","slug":"coarse-graining-molecular-dynamics-with-graph","title":"Coarse Graining Molecular Dynamics with Graph Neural Networks","date":"2020-07-22","arxiv_id":"2007.11412","repositories_listed":1,"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/coarse-graining-molecular-dynamics-with-graph#ran","syntology_url":"https://syntology.ai/paper/2007.11412","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.11412"}},"official":{"repos":["coarse-graining/cgnet"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/an-empirical-characterization-of-fair-machine","slug":"an-empirical-characterization-of-fair-machine","title":"An Empirical Characterization of Fair Machine Learning For Clinical Risk Prediction","date":"2020-07-20","arxiv_id":"2007.10306","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/an-empirical-characterization-of-fair-machine#ran","syntology_url":"https://syntology.ai/paper/2007.10306","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.10306"}},"official":{"repos":["som-shahlab/fairness_benchmark"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-topology-inference-benchmarks-for","slug":"graph-topology-inference-benchmarks-for","title":"Graph topology inference benchmarks for machine learning","date":"2020-07-16","arxiv_id":"2007.08216","repositories_listed":1,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/graph-topology-inference-benchmarks-for#ran","syntology_url":"https://syntology.ai/paper/2007.08216","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.08216"}},"official":{"repos":["cadurosar/benchmark_graphinference"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-robust-classification-with-deep","slug":"towards-robust-classification-with-deep","title":"Towards Robust Classification with Deep Generative Forests","date":"2020-07-11","arxiv_id":"2007.05721","repositories_listed":1,"syntology":{"n":25,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":15,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 15 unverified","sample_list":"/paper/towards-robust-classification-with-deep#ran","syntology_url":"https://syntology.ai/paper/2007.05721","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.05721"}},"official":{"repos":["AlCorreia/GeFs"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":15,"ran_from_kinds":["official"]}}},{"url":"/paper/gama-a-general-automated-machine-learning","slug":"gama-a-general-automated-machine-learning","title":"GAMA: a General Automated Machine learning Assistant","date":"2020-07-09","arxiv_id":"2007.04911","repositories_listed":3,"syntology":{"n":17,"n_ran":17,"n_constructed":0,"n_ran_checked":17,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/gama-a-general-automated-machine-learning#ran","syntology_url":"https://syntology.ai/paper/2007.04911","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.04911"}},"official":{"repos":["PGijsbers/gama"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"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/graph-neural-networks-for-the-prediction-of","slug":"graph-neural-networks-for-the-prediction-of","title":"Graph Neural Networks for the Prediction of Substrate-Specific Organic Reaction Conditions","date":"2020-07-08","arxiv_id":"2007.04275","repositories_listed":1,"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":1,"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/graph-neural-networks-for-the-prediction-of#ran","syntology_url":"https://syntology.ai/paper/2007.04275","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.04275"}},"official":{"repos":["slryou41/reaction-gcnn"],"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/efficient-continuous-pareto-exploration-in","slug":"efficient-continuous-pareto-exploration-in","title":"Efficient Continuous Pareto Exploration in Multi-Task Learning","date":"2020-06-29","arxiv_id":"2006.16434","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":1,"n_instrument":4,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"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) · 0 unverified","sample_list":"/paper/efficient-continuous-pareto-exploration-in#ran","syntology_url":"https://syntology.ai/paper/2006.16434","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.16434"}},"official":{"repos":["mit-gfx/ContinuousParetoMTL"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/the-gaussian-equivalence-of-generative-models","slug":"the-gaussian-equivalence-of-generative-models","title":"The Gaussian equivalence of generative models for learning with shallow neural networks","date":"2020-06-25","arxiv_id":"2006.14709","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/the-gaussian-equivalence-of-generative-models#ran","syntology_url":"https://syntology.ai/paper/2006.14709","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.14709"}},"official":{"repos":["sgoldt/gaussian-equiv-2layer"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/statistical-mechanics-of-generalization-in","slug":"statistical-mechanics-of-generalization-in","title":"Spectral Bias and Task-Model Alignment Explain Generalization in Kernel Regression and Infinitely Wide Neural Networks","date":"2020-06-23","arxiv_id":"2006.13198","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":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/statistical-mechanics-of-generalization-in#ran","syntology_url":"https://syntology.ai/paper/2006.13198","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.13198"}},"official":{"repos":["Pehlevan-Group/kernel-generalization"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/auditing-differentially-private-machine","slug":"auditing-differentially-private-machine","title":"Auditing Differentially Private Machine Learning: How Private is Private SGD?","date":"2020-06-13","arxiv_id":"2006.07709","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/auditing-differentially-private-machine#ran","syntology_url":"https://syntology.ai/paper/2006.07709","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.07709"}},"official":{"repos":["jagielski/auditing-dpsgd"],"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":["official"]}}},{"url":"/paper/ensemble-distillation-for-robust-model-fusion","slug":"ensemble-distillation-for-robust-model-fusion","title":"Ensemble Distillation for Robust Model Fusion in Federated Learning","date":"2020-06-12","arxiv_id":"2006.07242","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/ensemble-distillation-for-robust-model-fusion#ran","syntology_url":"https://syntology.ai/paper/2006.07242","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.07242"}},"official":{"repos":["epfml/federated-learning-public-code"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/picket-self-supervised-data-diagnostics-for","slug":"picket-self-supervised-data-diagnostics-for","title":"Picket: Guarding Against Corrupted Data in Tabular Data during Learning and Inference","date":"2020-06-08","arxiv_id":"2006.04730","repositories_listed":1,"syntology":{"n":17,"n_ran":13,"n_constructed":0,"n_ran_checked":12,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":1,"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) · 4 unverified","sample_list":"/paper/picket-self-supervised-data-diagnostics-for#ran","syntology_url":"https://syntology.ai/paper/2006.04730","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.04730"}},"official":null}},{"url":"/paper/reinforcement-learning-under-moral","slug":"reinforcement-learning-under-moral","title":"Reinforcement Learning Under Moral Uncertainty","date":"2020-06-08","arxiv_id":"2006.04734","repositories_listed":1,"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/reinforcement-learning-under-moral#ran","syntology_url":"https://syntology.ai/paper/2006.04734","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.04734"}},"official":{"repos":["uber-research/normative-uncertainty"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/predictive-coding-approximates-backprop-along","slug":"predictive-coding-approximates-backprop-along","title":"Predictive Coding Approximates Backprop along Arbitrary Computation Graphs","date":"2020-06-07","arxiv_id":"2006.04182","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"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) · 1 unverified","sample_list":"/paper/predictive-coding-approximates-backprop-along#ran","syntology_url":"https://syntology.ai/paper/2006.04182","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.04182"}},"official":{"repos":["BerenMillidge/PredictiveCodingBackprop"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/fuzzy-c-means-clustering-for-persistence","slug":"fuzzy-c-means-clustering-for-persistence","title":"Fuzzy c-Means Clustering for Persistence Diagrams","date":"2020-06-04","arxiv_id":"2006.02796","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":1,"n_no_contract":0,"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, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fuzzy-c-means-clustering-for-persistence#ran","syntology_url":"https://syntology.ai/paper/2006.02796","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.02796"}},"official":{"repos":["tomogwen/fpdcluster"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"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/head2head-video-based-neural-head-synthesis","slug":"head2head-video-based-neural-head-synthesis","title":"Head2Head: Video-based Neural Head Synthesis","date":"2020-05-22","arxiv_id":"2005.10954","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":1,"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; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/head2head-video-based-neural-head-synthesis#ran","syntology_url":"https://syntology.ai/paper/2005.10954","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.10954"}},"official":null}},{"url":"/paper/do-the-machine-learning-models-on-a-crowd","slug":"do-the-machine-learning-models-on-a-crowd","title":"Do the Machine Learning Models on a Crowd Sourced Platform Exhibit Bias? An Empirical Study on Model Fairness","date":"2020-05-21","arxiv_id":"2005.12379","repositories_listed":2,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"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) · 3 unverified","sample_list":"/paper/do-the-machine-learning-models-on-a-crowd#ran","syntology_url":"https://syntology.ai/paper/2005.12379","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.12379"}},"official":{"repos":["sumonbis/ML-Fairness"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/autoclint-the-winning-method-in-autocv","slug":"autoclint-the-winning-method-in-autocv","title":"AutoCLINT: The Winning Method in AutoCV Challenge 2019","date":"2020-05-09","arxiv_id":"2005.04373","repositories_listed":1,"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/autoclint-the-winning-method-in-autocv#ran","syntology_url":"https://syntology.ai/paper/2005.04373","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.04373"}},"official":{"repos":["kakaobrain/autoclint"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/machine-learning-on-graphs-a-model-and","slug":"machine-learning-on-graphs-a-model-and","title":"Machine Learning on Graphs: A Model and Comprehensive Taxonomy","date":"2020-05-07","arxiv_id":"2005.03675","repositories_listed":1,"syntology":{"n":8,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":6,"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) · 6 unverified","sample_list":"/paper/machine-learning-on-graphs-a-model-and#ran","syntology_url":"https://syntology.ai/paper/2005.03675","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.03675"}},"official":{"repos":["google/gcnn-survey-paper"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/heuristic-based-weak-learning-for-moral","slug":"heuristic-based-weak-learning-for-moral","title":"Heuristic-Based Weak Learning for Automated Decision-Making","date":"2020-05-05","arxiv_id":"2005.02342","repositories_listed":1,"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/heuristic-based-weak-learning-for-moral#ran","syntology_url":"https://syntology.ai/paper/2005.02342","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.02342"}},"official":{"repos":["ryansteed/heuristic-moral-machine"],"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/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/axcell-automatic-extraction-of-results-from","slug":"axcell-automatic-extraction-of-results-from","title":"AxCell: Automatic Extraction of Results from Machine Learning Papers","date":"2020-04-29","arxiv_id":"2004.14356","repositories_listed":1,"syntology":{"n":14,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"12 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; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/axcell-automatic-extraction-of-results-from#ran","syntology_url":"https://syntology.ai/paper/2004.14356","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.14356"}},"official":{"repos":["paperswithcode/axcell"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/splitfed-when-federated-learning-meets-split","slug":"splitfed-when-federated-learning-meets-split","title":"SplitFed: When Federated Learning Meets Split Learning","date":"2020-04-25","arxiv_id":"2004.12088","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"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) · 1 unverified","sample_list":"/paper/splitfed-when-federated-learning-meets-split#ran","syntology_url":"https://syntology.ai/paper/2004.12088","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.12088"}},"official":{"repos":["chandra2thapa/SplitFed-When-Federated-Learning-Meets-Split-Learning"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"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":133,"n_instrument":9,"n_unverified":42,"n_honours":6,"n_violates":0,"n_no_contract":127,"n_pointer_only":21,"phrase":"142 ran (of which 0 constructed an object rather than computing a result; 133 with no instrument failure: 6 honoured, 0 violated, 127 with no contract checked; 9 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/tensor-networks-for-medical-image","slug":"tensor-networks-for-medical-image","title":"Tensor Networks for Medical Image Classification","date":"2020-04-21","arxiv_id":"2004.10076","repositories_listed":2,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":2,"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) · 1 unverified","sample_list":"/paper/tensor-networks-for-medical-image#ran","syntology_url":"https://syntology.ai/paper/2004.10076","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.10076"}},"official":{"repos":["bitbucket.org/raghavian/lotenet_pytorch","raghavian/loTeNet_pytorch"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-forecasting-introduction-and","slug":"neural-forecasting-introduction-and","title":"Deep Learning for Time Series Forecasting: Tutorial and Literature Survey","date":"2020-04-21","arxiv_id":"2004.10240","repositories_listed":2,"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/neural-forecasting-introduction-and#ran","syntology_url":"https://syntology.ai/paper/2004.10240","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.10240"}},"official":null}},{"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/vibe-a-tool-for-measuring-and-mitigating-bias","slug":"vibe-a-tool-for-measuring-and-mitigating-bias","title":"REVISE: A Tool for Measuring and Mitigating Bias in Visual Datasets","date":"2020-04-16","arxiv_id":"2004.07999","repositories_listed":2,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"4 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/vibe-a-tool-for-measuring-and-mitigating-bias#ran","syntology_url":"https://syntology.ai/paper/2004.07999","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.07999"}},"official":{"repos":["princetonvisualai/revise-tool","princetonvisualai/vibe-tool"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/poisoning-attacks-on-algorithmic-fairness","slug":"poisoning-attacks-on-algorithmic-fairness","title":"Poisoning Attacks on Algorithmic Fairness","date":"2020-04-15","arxiv_id":"2004.07401","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/poisoning-attacks-on-algorithmic-fairness#ran","syntology_url":"https://syntology.ai/paper/2004.07401","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.07401"}},"official":{"repos":["dsolanno/Poisoning-Attacks-on-Algorithmic-Fairness"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-non-parametric-test-to-detect-data-copying","slug":"a-non-parametric-test-to-detect-data-copying","title":"A Non-Parametric Test to Detect Data-Copying in Generative Models","date":"2020-04-12","arxiv_id":"2004.05675","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/a-non-parametric-test-to-detect-data-copying#ran","syntology_url":"https://syntology.ai/paper/2004.05675","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.05675"}},"official":{"repos":["casey-meehan/data-copying"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/giotto-tda-a-topological-data-analysis","slug":"giotto-tda-a-topological-data-analysis","title":"giotto-tda: A Topological Data Analysis Toolkit for Machine Learning and Data Exploration","date":"2020-04-06","arxiv_id":"2004.02551","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"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) · 1 unverified","sample_list":"/paper/giotto-tda-a-topological-data-analysis#ran","syntology_url":"https://syntology.ai/paper/2004.02551","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.02551"}},"official":{"repos":["giotto-ai/giotto-tda"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"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/systematic-evaluation-of-privacy-risks-of","slug":"systematic-evaluation-of-privacy-risks-of","title":"Systematic Evaluation of Privacy Risks of Machine Learning Models","date":"2020-03-24","arxiv_id":"2003.10595","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/systematic-evaluation-of-privacy-risks-of#ran","syntology_url":"https://syntology.ai/paper/2003.10595","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.10595"}},"official":{"repos":["inspire-group/membership-inference-evaluation"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/born-again-tree-ensembles","slug":"born-again-tree-ensembles","title":"Born-Again Tree Ensembles","date":"2020-03-24","arxiv_id":"2003.11132","repositories_listed":1,"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/born-again-tree-ensembles#ran","syntology_url":"https://syntology.ai/paper/2003.11132","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.11132"}},"official":{"repos":["vidalt/BA-Trees"],"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/arda-automatic-relational-data-augmentation","slug":"arda-automatic-relational-data-augmentation","title":"ARDA: Automatic Relational Data Augmentation for Machine Learning","date":"2020-03-21","arxiv_id":"2003.09758","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/arda-automatic-relational-data-augmentation#ran","syntology_url":"https://syntology.ai/paper/2003.09758","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.09758"}},"official":null}},{"url":"/paper/ternary-compression-for-communication","slug":"ternary-compression-for-communication","title":"Ternary Compression for Communication-Efficient Federated Learning","date":"2020-03-07","arxiv_id":"2003.03564","repositories_listed":1,"syntology":{"n":11,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/ternary-compression-for-communication#ran","syntology_url":"https://syntology.ai/paper/2003.03564","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.03564"}},"official":{"repos":["VeritasXu/Ternary-Federated"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":4,"ran_from_kinds":["official"]}}},{"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/vice-visual-counterfactual-explanations-for","slug":"vice-visual-counterfactual-explanations-for","title":"ViCE: Visual Counterfactual Explanations for Machine Learning Models","date":"2020-03-05","arxiv_id":"2003.02428","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/vice-visual-counterfactual-explanations-for#ran","syntology_url":"https://syntology.ai/paper/2003.02428","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.02428"}},"official":{"repos":["5teffen/ViCE"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/imbalance-learning-for-variable-star","slug":"imbalance-learning-for-variable-star","title":"Imbalance Learning for Variable Star Classification","date":"2020-02-27","arxiv_id":"2002.12386","repositories_listed":2,"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":4,"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/imbalance-learning-for-variable-star#ran","syntology_url":"https://syntology.ai/paper/2002.12386","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.12386"}},"official":null}},{"url":"/paper/kaokore-a-pre-modern-japanese-art-facial","slug":"kaokore-a-pre-modern-japanese-art-facial","title":"KaoKore: A Pre-modern Japanese Art Facial Expression Dataset","date":"2020-02-20","arxiv_id":"2002.08595","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/kaokore-a-pre-modern-japanese-art-facial#ran","syntology_url":"https://syntology.ai/paper/2002.08595","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.08595"}},"official":{"repos":["rois-codh/kaokore"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/computationally-tractable-riemannian","slug":"computationally-tractable-riemannian","title":"Computationally Tractable Riemannian Manifolds for Graph Embeddings","date":"2020-02-20","arxiv_id":"2002.08665","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"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; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/computationally-tractable-riemannian#ran","syntology_url":"https://syntology.ai/paper/2002.08665","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.08665"}},"official":{"repos":["dalab/matrix-manifolds"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/roto-translation-equivariant-convolutional","slug":"roto-translation-equivariant-convolutional","title":"Roto-Translation Equivariant Convolutional Networks: Application to Histopathology Image Analysis","date":"2020-02-20","arxiv_id":"2002.08725","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/roto-translation-equivariant-convolutional#ran","syntology_url":"https://syntology.ai/paper/2002.08725","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.08725"}},"official":{"repos":["tueimage/se2cnn"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/set2graph-learning-graphs-from-sets","slug":"set2graph-learning-graphs-from-sets","title":"Set2Graph: Learning Graphs From Sets","date":"2020-02-20","arxiv_id":"2002.08772","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"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) · 1 unverified","sample_list":"/paper/set2graph-learning-graphs-from-sets#ran","syntology_url":"https://syntology.ai/paper/2002.08772","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.08772"}},"official":{"repos":["hadarser/SetToGraphPaper"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/query-efficient-physical-hard-label-attacks","slug":"query-efficient-physical-hard-label-attacks","title":"GRAPHITE: Generating Automatic Physical Examples for Machine-Learning Attacks on Computer Vision Systems","date":"2020-02-17","arxiv_id":"2002.07088","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/query-efficient-physical-hard-label-attacks#ran","syntology_url":"https://syntology.ai/paper/2002.07088","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.07088"}},"official":{"repos":["ryan-feng/graphite"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/combining-schnet-and-sharc-the-schnarc","slug":"combining-schnet-and-sharc-the-schnarc","title":"Combining SchNet and SHARC: The SchNarc machine learning approach for excited-state dynamics","date":"2020-02-17","arxiv_id":"2002.07264","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/combining-schnet-and-sharc-the-schnarc#ran","syntology_url":"https://syntology.ai/paper/2002.07264","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.07264"}},"official":{"repos":["schnarc/schnarc"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/jelly-bean-world-a-testbed-for-never-ending-1","slug":"jelly-bean-world-a-testbed-for-never-ending-1","title":"Jelly Bean World: A Testbed for Never-Ending Learning","date":"2020-02-15","arxiv_id":"2002.06306","repositories_listed":3,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/jelly-bean-world-a-testbed-for-never-ending-1#ran","syntology_url":"https://syntology.ai/paper/2002.06306","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.06306"}},"official":{"repos":["eaplatanios/jelly-bean-world"],"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":["official"]}}},{"url":"/paper/machine-learning-based-multiple-abnormality","slug":"machine-learning-based-multiple-abnormality","title":"Machine-Learning-Based Multiple Abnormality Prediction with Large-Scale Chest Computed Tomography Volumes","date":"2020-02-12","arxiv_id":"2002.04752","repositories_listed":1,"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/machine-learning-based-multiple-abnormality#ran","syntology_url":"https://syntology.ai/paper/2002.04752","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.04752"}},"official":{"repos":["rachellea/ct-net-models"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/machine-learning-in-python-main-developments","slug":"machine-learning-in-python-main-developments","title":"Machine Learning in Python: Main developments and technology trends in data science, machine learning, and artificial intelligence","date":"2020-02-12","arxiv_id":"2002.04803","repositories_listed":2,"syntology":{"n":17,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":13,"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) · 13 unverified","sample_list":"/paper/machine-learning-in-python-main-developments#ran","syntology_url":"https://syntology.ai/paper/2002.04803","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.04803"}},"official":{"repos":["rapidsai/cuml"],"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/convex-density-constraints-for-computing","slug":"convex-density-constraints-for-computing","title":"Convex Density Constraints for Computing Plausible Counterfactual Explanations","date":"2020-02-12","arxiv_id":"2002.04862","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/convex-density-constraints-for-computing#ran","syntology_url":"https://syntology.ai/paper/2002.04862","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.04862"}},"official":{"repos":["andreArtelt/ConvexDensityConstraintsForPlausibleCounterfactuals"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/adversarial-robustness-for-code","slug":"adversarial-robustness-for-code","title":"Adversarial Robustness for Code","date":"2020-02-11","arxiv_id":"2002.04694","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":1,"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: 0 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adversarial-robustness-for-code#ran","syntology_url":"https://syntology.ai/paper/2002.04694","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.04694"}},"official":null}},{"url":"/paper/machine-learning-based-diagnostics-of-eeg","slug":"machine-learning-based-diagnostics-of-eeg","title":"Machine-Learning-Based Diagnostics of EEG Pathology","date":"2020-02-11","arxiv_id":"2002.05115","repositories_listed":1,"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":1,"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/machine-learning-based-diagnostics-of-eeg#ran","syntology_url":"https://syntology.ai/paper/2002.05115","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.05115"}},"official":{"repos":["gemeinl/auto-eeg-diagnosis-comparison"],"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/supervised-learning-on-relational-databases","slug":"supervised-learning-on-relational-databases","title":"Supervised Learning on Relational Databases with Graph Neural Networks","date":"2020-02-06","arxiv_id":"2002.02046","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"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/supervised-learning-on-relational-databases#ran","syntology_url":"https://syntology.ai/paper/2002.02046","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.02046"}},"official":{"repos":["mwcvitkovic/Supervised-Learning-on-Relational-Databases-with-GNNs"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-learning-enabled-simulated-annealing-for","slug":"deep-learning-enabled-simulated-annealing-for","title":"Self-Directed Online Machine Learning for Topology Optimization","date":"2020-02-04","arxiv_id":"2002.01927","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/deep-learning-enabled-simulated-annealing-for#ran","syntology_url":"https://syntology.ai/paper/2002.01927","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.01927"}},"official":{"repos":["deng-cy/deep_learning_topology_opt"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-the-systematic-reporting-of-the","slug":"towards-the-systematic-reporting-of-the","title":"Towards the Systematic Reporting of the Energy and Carbon Footprints of Machine Learning","date":"2020-01-31","arxiv_id":"2002.05651","repositories_listed":2,"syntology":{"n":11,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/towards-the-systematic-reporting-of-the#ran","syntology_url":"https://syntology.ai/paper/2002.05651","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.05651"}},"official":{"repos":["Breakend/ClimateChangeFromMachineLearningResearch","Breakend/experiment-impact-tracker"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/hamiltonian-neural-networks-for-solving","slug":"hamiltonian-neural-networks-for-solving","title":"Hamiltonian neural networks for solving equations of motion","date":"2020-01-29","arxiv_id":"2001.11107","repositories_listed":1,"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":1,"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/hamiltonian-neural-networks-for-solving#ran","syntology_url":"https://syntology.ai/paper/2001.11107","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.11107"}},"official":{"repos":["mariosmat/hamiltoniannnetodes"],"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/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/fsnet-feature-selection-network-on-high","slug":"fsnet-feature-selection-network-on-high","title":"FsNet: Feature Selection Network on High-dimensional Biological Data","date":"2020-01-23","arxiv_id":"2001.08322","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":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/fsnet-feature-selection-network-on-high#ran","syntology_url":"https://syntology.ai/paper/2001.08322","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.08322"}},"official":{"repos":["dineshsinghindian/fsnet"],"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/optimal-binning-mathematical-programming","slug":"optimal-binning-mathematical-programming","title":"Optimal binning: mathematical programming formulation","date":"2020-01-22","arxiv_id":"2001.08025","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/optimal-binning-mathematical-programming#ran","syntology_url":"https://syntology.ai/paper/2001.08025","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.08025"}},"official":{"repos":["guillermo-navas-palencia/optbinning"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/fairness-measures-for-regression-via","slug":"fairness-measures-for-regression-via","title":"Fairness Measures for Regression via Probabilistic Classification","date":"2020-01-16","arxiv_id":"2001.06089","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fairness-measures-for-regression-via#ran","syntology_url":"https://syntology.ai/paper/2001.06089","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.06089"}},"official":null}},{"url":"/paper/right-for-the-wrong-scientific-reasons","slug":"right-for-the-wrong-scientific-reasons","title":"Making deep neural networks right for the right scientific reasons by interacting with their explanations","date":"2020-01-15","arxiv_id":"2001.05371","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"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) · 2 unverified","sample_list":"/paper/right-for-the-wrong-scientific-reasons#ran","syntology_url":"https://syntology.ai/paper/2001.05371","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.05371"}},"official":{"repos":["ml-research/xil"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["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/advbox-a-toolbox-to-generate-adversarial","slug":"advbox-a-toolbox-to-generate-adversarial","title":"Advbox: a toolbox to generate adversarial examples that fool neural networks","date":"2020-01-13","arxiv_id":"2001.05574","repositories_listed":2,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":4,"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, 1 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/advbox-a-toolbox-to-generate-adversarial#ran","syntology_url":"https://syntology.ai/paper/2001.05574","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.05574"}},"official":{"repos":["advboxes/AdvBox","baidu/AdvBox"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/machine-learning-enables-completely-automatic","slug":"machine-learning-enables-completely-automatic","title":"Machine learning enables completely automatic tuning of a quantum device faster than human experts","date":"2020-01-08","arxiv_id":"2001.02589","repositories_listed":2,"syntology":{"n":19,"n_ran":16,"n_constructed":0,"n_ran_checked":15,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":15,"n_pointer_only":0,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 0 honoured, 0 violated, 15 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/machine-learning-enables-completely-automatic#ran","syntology_url":"https://syntology.ai/paper/2001.02589","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.02589"}},"official":null}},{"url":"/paper/incorporating-physical-constraints-in-a-deep","slug":"incorporating-physical-constraints-in-a-deep","title":"Incorporating physical constraints in a deep probabilistic machine learning framework for coarse-graining dynamical systems","date":"2019-12-30","arxiv_id":"1912.12976","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/incorporating-physical-constraints-in-a-deep#ran","syntology_url":"https://syntology.ai/paper/1912.12976","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.12976"}},"official":{"repos":["SebastianKaltenbach/PhysicalConstraints_ProbabilisticCG"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/measuring-compositional-generalization-a-1","slug":"measuring-compositional-generalization-a-1","title":"Measuring Compositional Generalization: A Comprehensive Method on Realistic Data","date":"2019-12-20","arxiv_id":"1912.09713","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/measuring-compositional-generalization-a-1#ran","syntology_url":"https://syntology.ai/paper/1912.09713","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.09713"}},"official":{"repos":["google-research/google-research"],"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/secml-a-python-library-for-secure-and","slug":"secml-a-python-library-for-secure-and","title":"secml: A Python Library for Secure and Explainable Machine Learning","date":"2019-12-20","arxiv_id":"1912.10013","repositories_listed":2,"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/secml-a-python-library-for-secure-and#ran","syntology_url":"https://syntology.ai/paper/1912.10013","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.10013"}},"official":{"repos":["pralab/secml"],"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/so2sat-lcz42-a-benchmark-dataset-for-global","slug":"so2sat-lcz42-a-benchmark-dataset-for-global","title":"So2Sat LCZ42: A Benchmark Dataset for Global Local Climate Zones Classification","date":"2019-12-19","arxiv_id":"1912.12171","repositories_listed":1,"syntology":{"n":7,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/so2sat-lcz42-a-benchmark-dataset-for-global#ran","syntology_url":"https://syntology.ai/paper/1912.12171","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.12171"}},"official":null}},{"url":"/paper/direction-concentration-learning-enhancing","slug":"direction-concentration-learning-enhancing","title":"Direction Concentration Learning: Enhancing Congruency in Machine Learning","date":"2019-12-17","arxiv_id":"1912.08136","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":3,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/direction-concentration-learning-enhancing#ran","syntology_url":"https://syntology.ai/paper/1912.08136","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.08136"}},"official":{"repos":["luoyan407/congruency"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/openbiolink-a-resource-and-benchmarking","slug":"openbiolink-a-resource-and-benchmarking","title":"OpenBioLink: A benchmarking framework for large-scale biomedical link prediction","date":"2019-12-10","arxiv_id":"1912.04616","repositories_listed":1,"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/openbiolink-a-resource-and-benchmarking#ran","syntology_url":"https://syntology.ai/paper/1912.04616","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.04616"}},"official":{"repos":["OpenBioLink/OpenBioLink"],"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/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/preserving-causal-constraints-in","slug":"preserving-causal-constraints-in","title":"Preserving Causal Constraints in Counterfactual Explanations for Machine Learning Classifiers","date":"2019-12-06","arxiv_id":"1912.03277","repositories_listed":2,"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":1,"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/preserving-causal-constraints-in#ran","syntology_url":"https://syntology.ai/paper/1912.03277","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.03277"}},"official":{"repos":["divyat09/cf-feasibility"],"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/failure-modes-in-machine-learning-systems","slug":"failure-modes-in-machine-learning-systems","title":"Failure Modes in Machine Learning Systems","date":"2019-11-25","arxiv_id":"1911.11034","repositories_listed":2,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/failure-modes-in-machine-learning-systems#ran","syntology_url":"https://syntology.ai/paper/1911.11034","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.11034"}},"official":null}},{"url":"/paper/pyannoteaudio-neural-building-blocks-for","slug":"pyannoteaudio-neural-building-blocks-for","title":"pyannote.audio: neural building blocks for speaker diarization","date":"2019-11-04","arxiv_id":"1911.01255","repositories_listed":3,"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/pyannoteaudio-neural-building-blocks-for#ran","syntology_url":"https://syntology.ai/paper/1911.01255","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.01255"}},"official":{"repos":["pyannote/pyannote-audio"],"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/a-richly-annotated-corpus-for-different-tasks-1","slug":"a-richly-annotated-corpus-for-different-tasks-1","title":"A Richly Annotated Corpus for Different Tasks in Automated Fact-Checking","date":"2019-10-29","arxiv_id":"1911.01214","repositories_listed":2,"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/a-richly-annotated-corpus-for-different-tasks-1#ran","syntology_url":"https://syntology.ai/paper/1911.01214","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.01214"}},"official":{"repos":["UKPLab/conll2019-snopes-crawling","UKPLab/conll2019-snopes-experiments"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/cxplain-causal-explanations-for-model","slug":"cxplain-causal-explanations-for-model","title":"CXPlain: Causal Explanations for Model Interpretation under Uncertainty","date":"2019-10-27","arxiv_id":"1910.12336","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/cxplain-causal-explanations-for-model#ran","syntology_url":"https://syntology.ai/paper/1910.12336","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.12336"}},"official":{"repos":["d909b/cxplain"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}}],"record_sha256":"3fd993d9890486ad8b031b7e21ca73a4835a73a6bc7dfaf66cbce59f9ee0080f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}