{"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/decision-making/papers/ran/6","list_of":"/task/decision-making","task":"Decision Making","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":6,"pages_in_order":7,"rows_per_page":100,"rows":[501,600],"of":678,"counts":{"archive_papers_tagged":12311,"with_a_code_link":2946,"where_syntology_ran_a_sample":678,"not_listed_spam_title":0,"listed":12311,"listed_where_code_ran":678,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":560,"every_run_a_failure_of_syntologys_instrument":118,"listed_with_a_run_with_no_instrument_failure":560,"listed_every_run_a_failure_of_syntologys_instrument":118,"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/decision-making/papers/ran/1","prev":"/task/decision-making/papers/ran/5","next":"/task/decision-making/papers/ran/7","papers":[{"url":"/paper/differentially-private-regret-minimization-in","slug":"differentially-private-regret-minimization-in","title":"Differentially Private Regret Minimization in Episodic Markov Decision Processes","date":"2021-12-20","arxiv_id":"2112.10599","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/differentially-private-regret-minimization-in#ran","syntology_url":"https://syntology.ai/paper/2112.10599","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.10599"}},"official":{"repos":["xingyuzhou989/privatetabularrl"],"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/predict-and-optimize-through-the-lens-of","slug":"predict-and-optimize-through-the-lens-of","title":"Decision-Focused Learning: Through the Lens of Learning to Rank","date":"2021-12-07","arxiv_id":"2112.03609","repositories_listed":1,"syntology":{"n":12,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":9,"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) · 9 unverified","sample_list":"/paper/predict-and-optimize-through-the-lens-of#ran","syntology_url":"https://syntology.ai/paper/2112.03609","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.03609"}},"official":{"repos":["jayman91/ltr-predopt"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":9,"ran_from_kinds":["official"]}}},{"url":"/paper/neuralprophet-explainable-forecasting-at","slug":"neuralprophet-explainable-forecasting-at","title":"NeuralProphet: Explainable Forecasting at Scale","date":"2021-11-29","arxiv_id":"2111.15397","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/neuralprophet-explainable-forecasting-at#ran","syntology_url":"https://syntology.ai/paper/2111.15397","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.15397"}},"official":{"repos":["ourownstory/neural_prophet"],"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/explaining-machine-learned-particle-flow","slug":"explaining-machine-learned-particle-flow","title":"Explaining machine-learned particle-flow reconstruction","date":"2021-11-24","arxiv_id":"2111.12840","repositories_listed":2,"syntology":{"n":18,"n_ran":17,"n_constructed":0,"n_ran_checked":17,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/explaining-machine-learned-particle-flow#ran","syntology_url":"https://syntology.ai/paper/2111.12840","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.12840"}},"official":{"repos":["faroukmokhtar/particleflow"],"state":"official (archive's flag): 17 ran","n_ran":17,"n_constructed":0,"n_ran_no_instrument_failure":17,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/uncertainty-estimation-under-model","slug":"uncertainty-estimation-under-model","title":"Uncertainty estimation under model misspecification in neural network regression","date":"2021-11-23","arxiv_id":"2111.11763","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/uncertainty-estimation-under-model#ran","syntology_url":"https://syntology.ai/paper/2111.11763","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.11763"}},"official":null}},{"url":"/paper/sope-spectrum-of-off-policy-estimators","slug":"sope-spectrum-of-off-policy-estimators","title":"SOPE: Spectrum of Off-Policy Estimators","date":"2021-11-06","arxiv_id":"2111.03936","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/sope-spectrum-of-off-policy-estimators#ran","syntology_url":"https://syntology.ai/paper/2111.03936","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.03936"}},"official":{"repos":["pearl-utexas/sope"],"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/rlds-an-ecosystem-to-generate-share-and-use","slug":"rlds-an-ecosystem-to-generate-share-and-use","title":"RLDS: an Ecosystem to Generate, Share and Use Datasets in Reinforcement Learning","date":"2021-11-04","arxiv_id":"2111.02767","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/rlds-an-ecosystem-to-generate-share-and-use#ran","syntology_url":"https://syntology.ai/paper/2111.02767","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.02767"}},"official":{"repos":["google-research/rlds"],"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/conditioning-sparse-variational-gaussian","slug":"conditioning-sparse-variational-gaussian","title":"Conditioning Sparse Variational Gaussian Processes for Online Decision-making","date":"2021-10-28","arxiv_id":"2110.15172","repositories_listed":1,"syntology":{"n":13,"n_ran":11,"n_constructed":3,"n_ran_checked":4,"n_instrument":7,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":10,"phrase":"11 ran (of which 3 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 7 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/conditioning-sparse-variational-gaussian#ran","syntology_url":"https://syntology.ai/paper/2110.15172","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.15172"}},"official":{"repos":["wjmaddox/online_vargp"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/object-aware-regularization-for-addressing","slug":"object-aware-regularization-for-addressing","title":"Object-Aware Regularization for Addressing Causal Confusion in Imitation Learning","date":"2021-10-27","arxiv_id":"2110.14118","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":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/object-aware-regularization-for-addressing#ran","syntology_url":"https://syntology.ai/paper/2110.14118","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.14118"}},"official":{"repos":["alinlab/oreo"],"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/finding-regions-of-heterogeneity-in-decision","slug":"finding-regions-of-heterogeneity-in-decision","title":"Finding Regions of Heterogeneity in Decision-Making via Expected Conditional Covariance","date":"2021-10-27","arxiv_id":"2110.14508","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/finding-regions-of-heterogeneity-in-decision#ran","syntology_url":"https://syntology.ai/paper/2110.14508","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.14508"}},"official":{"repos":["clinicalml/finding-decision-heterogeneity-regions"],"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/dynamic-causal-bayesian-optimization","slug":"dynamic-causal-bayesian-optimization","title":"Dynamic Causal Bayesian Optimization","date":"2021-10-26","arxiv_id":"2110.13891","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/dynamic-causal-bayesian-optimization#ran","syntology_url":"https://syntology.ai/paper/2110.13891","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.13891"}},"official":{"repos":["neildhir/dcbo"],"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/boosted-cvar-classification","slug":"boosted-cvar-classification","title":"Boosted CVaR Classification","date":"2021-10-26","arxiv_id":"2110.13948","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":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) · 1 unverified","sample_list":"/paper/boosted-cvar-classification#ran","syntology_url":"https://syntology.ai/paper/2110.13948","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.13948"}},"official":{"repos":["runtianz/boosted_cvar"],"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/fault-tolerant-federated-reinforcement","slug":"fault-tolerant-federated-reinforcement","title":"Fault-Tolerant Federated Reinforcement Learning with Theoretical Guarantee","date":"2021-10-26","arxiv_id":"2110.14074","repositories_listed":2,"syntology":{"n":15,"n_ran":9,"n_constructed":3,"n_ran_checked":4,"n_instrument":5,"n_unverified":6,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":15,"phrase":"9 ran (of which 3 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 5 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/fault-tolerant-federated-reinforcement#ran","syntology_url":"https://syntology.ai/paper/2110.14074","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.14074"}},"official":{"repos":["flint-xf-fan/Byzantine-Federeated-RL"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":3,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/history-aware-multimodal-transformer-for","slug":"history-aware-multimodal-transformer-for","title":"History Aware Multimodal Transformer for Vision-and-Language Navigation","date":"2021-10-25","arxiv_id":"2110.13309","repositories_listed":1,"syntology":{"n":15,"n_ran":7,"n_constructed":3,"n_ran_checked":7,"n_instrument":0,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 3 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) · 8 unverified","sample_list":"/paper/history-aware-multimodal-transformer-for#ran","syntology_url":"https://syntology.ai/paper/2110.13309","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.13309"}},"official":null}},{"url":"/paper/a-closer-look-at-advantage-filtered","slug":"a-closer-look-at-advantage-filtered","title":"A Closer Look at Advantage-Filtered Behavioral Cloning in High-Noise Datasets","date":"2021-10-10","arxiv_id":"2110.04698","repositories_listed":3,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/a-closer-look-at-advantage-filtered#ran","syntology_url":"https://syntology.ai/paper/2110.04698","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.04698"}},"official":{"repos":["jakegrigsby/cc-afbc","jakegrigsby/deep_control","jakegrigsby/super_sac"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/transform2act-learning-a-transform-and","slug":"transform2act-learning-a-transform-and","title":"Transform2Act: Learning a Transform-and-Control Policy for Efficient Agent Design","date":"2021-10-07","arxiv_id":"2110.03659","repositories_listed":1,"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/transform2act-learning-a-transform-and#ran","syntology_url":"https://syntology.ai/paper/2110.03659","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.03659"}},"official":{"repos":["Khrylx/Transform2Act"],"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/camul-calibrated-and-accurate-multi-view-time","slug":"camul-calibrated-and-accurate-multi-view-time","title":"CAMul: Calibrated and Accurate Multi-view Time-Series Forecasting","date":"2021-09-15","arxiv_id":"2109.07438","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":4,"n_violates":1,"n_no_contract":1,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 4 honoured, 1 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/camul-calibrated-and-accurate-multi-view-time#ran","syntology_url":"https://syntology.ai/paper/2109.07438","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.07438"}},"official":{"repos":["adityalab/camul"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/robust-predictable-control","slug":"robust-predictable-control","title":"Robust Predictable Control","date":"2021-09-07","arxiv_id":"2109.03214","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/robust-predictable-control#ran","syntology_url":"https://syntology.ai/paper/2109.03214","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.03214"}},"official":{"repos":["eleurent/highway-env"],"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/tabfairgan-fair-tabular-data-generation-with","slug":"tabfairgan-fair-tabular-data-generation-with","title":"TabFairGAN: Fair Tabular Data Generation with Generative Adversarial Networks","date":"2021-09-02","arxiv_id":"2109.00666","repositories_listed":1,"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":2,"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/tabfairgan-fair-tabular-data-generation-with#ran","syntology_url":"https://syntology.ai/paper/2109.00666","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.00666"}},"official":{"repos":["amirarsalan90/TabFairGAN"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/warpdrive-extremely-fast-end-to-end-deep","slug":"warpdrive-extremely-fast-end-to-end-deep","title":"WarpDrive: Extremely Fast End-to-End Deep Multi-Agent Reinforcement Learning on a GPU","date":"2021-08-31","arxiv_id":"2108.13976","repositories_listed":3,"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/warpdrive-extremely-fast-end-to-end-deep#ran","syntology_url":"https://syntology.ai/paper/2108.13976","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.13976"}},"official":{"repos":["salesforce/warp-drive"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/multi-center-federated-learning-1","slug":"multi-center-federated-learning-1","title":"Multi-Center Federated Learning: Clients Clustering for Better Personalization","date":"2021-08-19","arxiv_id":"2108.08647","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":2,"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/multi-center-federated-learning-1#ran","syntology_url":"https://syntology.ai/paper/2108.08647","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.08647"}},"official":{"repos":["mingxuts/multi-center-fed-learning"],"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/edits-modeling-and-mitigating-data-bias-for","slug":"edits-modeling-and-mitigating-data-bias-for","title":"EDITS: Modeling and Mitigating Data Bias for Graph Neural Networks","date":"2021-08-11","arxiv_id":"2108.05233","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/edits-modeling-and-mitigating-data-bias-for#ran","syntology_url":"https://syntology.ai/paper/2108.05233","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.05233"}},"official":{"repos":["yushundong/edits"],"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/hift-hierarchical-feature-transformer-for","slug":"hift-hierarchical-feature-transformer-for","title":"HiFT: Hierarchical Feature Transformer for Aerial Tracking","date":"2021-07-31","arxiv_id":"2108.00202","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":3,"n_ran_checked":4,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"5 ran (of which 3 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) · 3 unverified","sample_list":"/paper/hift-hierarchical-feature-transformer-for#ran","syntology_url":"https://syntology.ai/paper/2108.00202","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.00202"}},"official":{"repos":["vision4robotics/HiFT"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":3,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/drive-deep-reinforced-accident-anticipation","slug":"drive-deep-reinforced-accident-anticipation","title":"DRIVE: Deep Reinforced Accident Anticipation with Visual Explanation","date":"2021-07-21","arxiv_id":"2107.10189","repositories_listed":1,"syntology":{"n":12,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/drive-deep-reinforced-accident-anticipation#ran","syntology_url":"https://syntology.ai/paper/2107.10189","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.10189"}},"official":{"repos":["Cogito2012/DRIVE"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/usco-solver-solving-undetermined-stochastic","slug":"usco-solver-solving-undetermined-stochastic","title":"USCO-Solver: Solving Undetermined Stochastic Combinatorial Optimization Problems","date":"2021-07-15","arxiv_id":"2107.07508","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/usco-solver-solving-undetermined-stochastic#ran","syntology_url":"https://syntology.ai/paper/2107.07508","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.07508"}},"official":null}},{"url":"/paper/fairness-in-ranking-under-uncertainty","slug":"fairness-in-ranking-under-uncertainty","title":"Fairness in Ranking under Uncertainty","date":"2021-07-14","arxiv_id":"2107.06720","repositories_listed":1,"syntology":{"n":14,"n_ran":10,"n_constructed":0,"n_ran_checked":2,"n_instrument":8,"n_unverified":4,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"10 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; 8 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/fairness-in-ranking-under-uncertainty#ran","syntology_url":"https://syntology.ai/paper/2107.06720","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.06720"}},"official":{"repos":["ashudeep/ranking-fairness-uncertainty"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-contextual-bandits-without-regret","slug":"neural-contextual-bandits-without-regret","title":"Neural Contextual Bandits without Regret","date":"2021-07-07","arxiv_id":"2107.03144","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/neural-contextual-bandits-without-regret#ran","syntology_url":"https://syntology.ai/paper/2107.03144","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.03144"}},"official":{"repos":["pkassraie/NNUCB"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/pragmatic-image-compression-for-human-in-the","slug":"pragmatic-image-compression-for-human-in-the","title":"Pragmatic Image Compression for Human-in-the-Loop Decision-Making","date":"2021-07-07","arxiv_id":"2108.04219","repositories_listed":1,"syntology":{"n":5,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/pragmatic-image-compression-for-human-in-the#ran","syntology_url":"https://syntology.ai/paper/2108.04219","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.04219"}},"official":{"repos":["rddy/pico"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/confidence-based-out-of-distribution","slug":"confidence-based-out-of-distribution","title":"Confidence-based Out-of-Distribution Detection: A Comparative Study and Analysis","date":"2021-07-06","arxiv_id":"2107.02568","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/confidence-based-out-of-distribution#ran","syntology_url":"https://syntology.ai/paper/2107.02568","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.02568"}},"official":{"repos":["christophbrgr/ood_detection_framework"],"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/arm-net-adaptive-relation-modeling-network","slug":"arm-net-adaptive-relation-modeling-network","title":"ARM-Net: Adaptive Relation Modeling Network for Structured Data","date":"2021-07-05","arxiv_id":"2107.01830","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/arm-net-adaptive-relation-modeling-network#ran","syntology_url":"https://syntology.ai/paper/2107.01830","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.01830"}},"official":{"repos":["nusdbsystem/ARM-Net"],"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/towards-understanding-and-mitigating-social","slug":"towards-understanding-and-mitigating-social","title":"Towards Understanding and Mitigating Social Biases in Language Models","date":"2021-06-24","arxiv_id":"2106.13219","repositories_listed":1,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":7,"n_pointer_only":1,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 1 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/towards-understanding-and-mitigating-social#ran","syntology_url":"https://syntology.ai/paper/2106.13219","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.13219"}},"official":{"repos":["pliang279/LM_bias"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/iq-learn-inverse-soft-q-learning-for","slug":"iq-learn-inverse-soft-q-learning-for","title":"IQ-Learn: Inverse soft-Q Learning for Imitation","date":"2021-06-23","arxiv_id":"2106.12142","repositories_listed":5,"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/iq-learn-inverse-soft-q-learning-for#ran","syntology_url":"https://syntology.ai/paper/2106.12142","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.12142"}},"official":{"repos":["Div99/IQ-Learn"],"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/robust-reinforcement-learning-under-minimax","slug":"robust-reinforcement-learning-under-minimax","title":"Robust Reinforcement Learning Under Minimax Regret for Green Security","date":"2021-06-15","arxiv_id":"2106.08413","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/robust-reinforcement-learning-under-minimax#ran","syntology_url":"https://syntology.ai/paper/2106.08413","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.08413"}},"official":{"repos":["lily-x/mirror"],"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/variational-causal-networks-approximate","slug":"variational-causal-networks-approximate","title":"Variational Causal Networks: Approximate Bayesian Inference over Causal Structures","date":"2021-06-14","arxiv_id":"2106.07635","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/variational-causal-networks-approximate#ran","syntology_url":"https://syntology.ai/paper/2106.07635","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.07635"}},"official":{"repos":["yannadani/vcn_pytorch"],"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/controlling-neural-networks-with-rule","slug":"controlling-neural-networks-with-rule","title":"Controlling Neural Networks with Rule Representations","date":"2021-06-14","arxiv_id":"2106.07804","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/controlling-neural-networks-with-rule#ran","syntology_url":"https://syntology.ai/paper/2106.07804","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.07804"}},"official":null}},{"url":"/paper/dynamic-sparse-training-for-deep","slug":"dynamic-sparse-training-for-deep","title":"Dynamic Sparse Training for Deep Reinforcement Learning","date":"2021-06-08","arxiv_id":"2106.04217","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/dynamic-sparse-training-for-deep#ran","syntology_url":"https://syntology.ai/paper/2106.04217","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.04217"}},"official":{"repos":["GhadaSokar/Dynamic-Sparse-Training-for-Deep-Reinforcement-Learning"],"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/curriculum-design-for-teaching-via","slug":"curriculum-design-for-teaching-via","title":"Curriculum Design for Teaching via Demonstrations: Theory and Applications","date":"2021-06-08","arxiv_id":"2106.04696","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":1,"n_ran_checked":2,"n_instrument":6,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":9,"phrase":"8 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 6 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/curriculum-design-for-teaching-via#ran","syntology_url":"https://syntology.ai/paper/2106.04696","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.04696"}},"official":{"repos":["adishs/neurips2021_curriculum-teaching-demonstrations_code"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-learning-with-self-supervision-and","slug":"deep-learning-with-self-supervision-and","title":"Deep learning with self-supervision and uncertainty regularization to count fish in underwater images","date":"2021-04-30","arxiv_id":"2104.14964","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-with-self-supervision-and#ran","syntology_url":"https://syntology.ai/paper/2104.14964","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.14964"}},"official":{"repos":["ptarling/DeepLearningFishCounting"],"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/universal-off-policy-evaluation","slug":"universal-off-policy-evaluation","title":"Universal Off-Policy Evaluation","date":"2021-04-26","arxiv_id":"2104.12820","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":0,"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/universal-off-policy-evaluation#ran","syntology_url":"https://syntology.ai/paper/2104.12820","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.12820"}},"official":{"repos":["yashchandak/UnO"],"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/faithfully-explainable-recommendation-via","slug":"faithfully-explainable-recommendation-via","title":"Faithfully Explainable Recommendation via Neural Logic Reasoning","date":"2021-04-16","arxiv_id":"2104.07869","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/faithfully-explainable-recommendation-via#ran","syntology_url":"https://syntology.ai/paper/2104.07869","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.07869"}},"official":{"repos":["orcax/LOGER"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/generalising-discrete-action-spaces-with","slug":"generalising-discrete-action-spaces-with","title":"Generalising Discrete Action Spaces with Conditional Action Trees","date":"2021-04-15","arxiv_id":"2104.07294","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/generalising-discrete-action-spaces-with#ran","syntology_url":"https://syntology.ai/paper/2104.07294","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.07294"}},"official":{"repos":["Bam4d/conditional-action-trees"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/skillful-precipitation-nowcasting-using-deep","slug":"skillful-precipitation-nowcasting-using-deep","title":"Skillful Precipitation Nowcasting using Deep Generative Models of Radar","date":"2021-04-02","arxiv_id":"2104.00954","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/skillful-precipitation-nowcasting-using-deep#ran","syntology_url":"https://syntology.ai/paper/2104.00954","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.00954"}},"official":null}},{"url":"/paper/benchmarks-for-deep-off-policy-evaluation-1","slug":"benchmarks-for-deep-off-policy-evaluation-1","title":"Benchmarks for Deep Off-Policy Evaluation","date":"2021-03-30","arxiv_id":"2103.16596","repositories_listed":3,"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/benchmarks-for-deep-off-policy-evaluation-1#ran","syntology_url":"https://syntology.ai/paper/2103.16596","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.16596"}},"official":{"repos":["google-research/deep_ope"],"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/beyond-trivial-counterfactual-explanations","slug":"beyond-trivial-counterfactual-explanations","title":"Beyond Trivial Counterfactual Explanations with Diverse Valuable Explanations","date":"2021-03-18","arxiv_id":"2103.10226","repositories_listed":4,"syntology":{"n":10,"n_ran":6,"n_constructed":0,"n_ran_checked":1,"n_instrument":5,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":9,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 5 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/beyond-trivial-counterfactual-explanations#ran","syntology_url":"https://syntology.ai/paper/2103.10226","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.10226"}},"official":{"repos":["ElementAI/beyond-trivial-explanations"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/mixed-policy-gradient","slug":"mixed-policy-gradient","title":"Mixed Policy Gradient: off-policy reinforcement learning driven jointly by data and model","date":"2021-02-23","arxiv_id":"2102.11513","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/mixed-policy-gradient#ran","syntology_url":"https://syntology.ai/paper/2102.11513","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.11513"}},"official":null}},{"url":"/paper/road-the-road-event-awareness-dataset-for","slug":"road-the-road-event-awareness-dataset-for","title":"ROAD: The ROad event Awareness Dataset for Autonomous Driving","date":"2021-02-23","arxiv_id":"2102.11585","repositories_listed":3,"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/road-the-road-event-awareness-dataset-for#ran","syntology_url":"https://syntology.ai/paper/2102.11585","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.11585"}},"official":{"repos":["gurkirt/3D-RetinaNet","gurkirt/road-dataset"],"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/private-prediction-sets","slug":"private-prediction-sets","title":"Private Prediction Sets","date":"2021-02-11","arxiv_id":"2102.06202","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":2,"n_instrument":3,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/private-prediction-sets#ran","syntology_url":"https://syntology.ai/paper/2102.06202","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.06202"}},"official":{"repos":["aangelopoulos/private_prediction_sets"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/covid-net-ct-2-enhanced-deep-neural-networks","slug":"covid-net-ct-2-enhanced-deep-neural-networks","title":"COVID-Net CT-2: Enhanced Deep Neural Networks for Detection of COVID-19 from Chest CT Images Through Bigger, More Diverse Learning","date":"2021-01-19","arxiv_id":"2101.07433","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/covid-net-ct-2-enhanced-deep-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2101.07433","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2101.07433"}},"official":{"repos":["haydengunraj/COVIDNet-CT"],"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/weakly-supervised-hierarchical-models-for","slug":"weakly-supervised-hierarchical-models-for","title":"Weakly-Supervised Hierarchical Models for Predicting Persuasive Strategies in Good-faith Textual Requests","date":"2021-01-16","arxiv_id":"2101.06351","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"2 ran (of which 2 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) · 2 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/weakly-supervised-hierarchical-models-for#ran","syntology_url":"https://syntology.ai/paper/2101.06351","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2101.06351"}},"official":{"repos":["GT-SALT/Persuasion_Strategy_WVAE"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":2,"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/deep-reinforcement-learning-of-graph-matching","slug":"deep-reinforcement-learning-of-graph-matching","title":"Revocable Deep Reinforcement Learning with Affinity Regularization for Outlier-Robust Graph Matching","date":"2020-12-16","arxiv_id":"2012.08950","repositories_listed":2,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":1,"n_instrument":6,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":8,"phrase":"7 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; 6 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/deep-reinforcement-learning-of-graph-matching#ran","syntology_url":"https://syntology.ai/paper/2012.08950","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.08950"}},"official":{"repos":["thinklab-sjtu/rgm","Thinklab-SJTU/awesome-ml4co"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/meme-generating-rnn-model-explanations-via","slug":"meme-generating-rnn-model-explanations-via","title":"MEME: Generating RNN Model Explanations via Model Extraction","date":"2020-12-13","arxiv_id":"2012.06954","repositories_listed":1,"syntology":{"n":14,"n_ran":7,"n_constructed":5,"n_ran_checked":5,"n_instrument":2,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":14,"phrase":"7 ran (of which 5 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/meme-generating-rnn-model-explanations-via#ran","syntology_url":"https://syntology.ai/paper/2012.06954","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.06954"}},"official":{"repos":["dmitrykazhdan/MEME-RNN-XAI"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":5,"n_ran_no_instrument_failure":5,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/policy-supervectors-general-characterization","slug":"policy-supervectors-general-characterization","title":"General Characterization of Agents by States they Visit","date":"2020-12-02","arxiv_id":"2012.01244","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":0,"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/policy-supervectors-general-characterization#ran","syntology_url":"https://syntology.ai/paper/2012.01244","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.01244"}},"official":{"repos":["Miffyli/policy-supervectors"],"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/explainable-ai-for-ml-jet-taggers-using","slug":"explainable-ai-for-ml-jet-taggers-using","title":"Explainable AI for ML jet taggers using expert variables and layerwise relevance propagation","date":"2020-11-26","arxiv_id":"2011.13466","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/explainable-ai-for-ml-jet-taggers-using#ran","syntology_url":"https://syntology.ai/paper/2011.13466","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.13466"}},"official":{"repos":["ubcms-xai/XAICoffea"],"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/discrete-solution-pools-and-noise-contrastive","slug":"discrete-solution-pools-and-noise-contrastive","title":"Contrastive Losses and Solution Caching for Predict-and-Optimize","date":"2020-11-10","arxiv_id":"2011.05354","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/discrete-solution-pools-and-noise-contrastive#ran","syntology_url":"https://syntology.ai/paper/2011.05354","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.05354"}},"official":{"repos":["CryoCardiogram/ijcai-cache-loss-pno"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/interior-point-solving-for-lp-based","slug":"interior-point-solving-for-lp-based","title":"Interior Point Solving for LP-based prediction+optimisation","date":"2020-10-26","arxiv_id":"2010.13943","repositories_listed":1,"syntology":{"n":26,"n_ran":12,"n_constructed":0,"n_ran_checked":11,"n_instrument":1,"n_unverified":14,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":1,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 1 where Syntology's instrument failed) · 14 unverified","sample_list":"/paper/interior-point-solving-for-lp-based#ran","syntology_url":"https://syntology.ai/paper/2010.13943","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.13943"}},"official":{"repos":["JayMan91/NeurIPSIntopt"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":14,"ran_from_kinds":["official"]}}},{"url":"/paper/measuring-association-between-labels-and-free","slug":"measuring-association-between-labels-and-free","title":"Measuring Association Between Labels and Free-Text Rationales","date":"2020-10-24","arxiv_id":"2010.12762","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":2,"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; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/measuring-association-between-labels-and-free#ran","syntology_url":"https://syntology.ai/paper/2010.12762","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.12762"}},"official":{"repos":["allenai/label_rationale_association"],"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/deep-reinforcement-learning-with-stacked","slug":"deep-reinforcement-learning-with-stacked","title":"Deep Reinforcement Learning with Stacked Hierarchical Attention for Text-based Games","date":"2020-10-22","arxiv_id":"2010.11655","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/deep-reinforcement-learning-with-stacked#ran","syntology_url":"https://syntology.ai/paper/2010.11655","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.11655"}},"official":{"repos":["YunqiuXu/SHA-KG"],"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/how-do-fair-decisions-fare-in-long-term","slug":"how-do-fair-decisions-fare-in-long-term","title":"How Do Fair Decisions Fare in Long-term Qualification?","date":"2020-10-21","arxiv_id":"2010.11300","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":3,"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; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/how-do-fair-decisions-fare-in-long-term#ran","syntology_url":"https://syntology.ai/paper/2010.11300","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.11300"}},"official":{"repos":["TURuibo/long-term-impact-of-fairness-constraints"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-uniformly-stable-algorithm-for-unsupervised","slug":"a-uniformly-stable-algorithm-for-unsupervised","title":"Algorithmic Stability and Generalization of an Unsupervised Feature Selection Algorithm","date":"2020-10-19","arxiv_id":"2010.09416","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/a-uniformly-stable-algorithm-for-unsupervised#ran","syntology_url":"https://syntology.ai/paper/2010.09416","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.09416"}},"official":{"repos":["xinxingwu-uk/ufs"],"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/double-robust-representation-learning-for","slug":"double-robust-representation-learning-for","title":"Double Robust Representation Learning for Counterfactual Prediction","date":"2020-10-15","arxiv_id":"2010.07866","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/double-robust-representation-learning-for#ran","syntology_url":"https://syntology.ai/paper/2010.07866","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.07866"}},"official":{"repos":["zengshx777/Double-Rouble-Representation-Learning"],"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/on-the-power-of-abstention-and-data-driven-1","slug":"on-the-power-of-abstention-and-data-driven-1","title":"An Analysis of Robustness of Non-Lipschitz Networks","date":"2020-10-13","arxiv_id":"2010.06154","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"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; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/on-the-power-of-abstention-and-data-driven-1#ran","syntology_url":"https://syntology.ai/paper/2010.06154","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.06154"}},"official":{"repos":["dravyanshsharma/adversarial-contrastive"],"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/online-anomaly-detection-in-surveillance","slug":"online-anomaly-detection-in-surveillance","title":"Online Anomaly Detection in Surveillance Videos with Asymptotic Bounds on False Alarm Rate","date":"2020-10-10","arxiv_id":"2010.07110","repositories_listed":1,"syntology":{"n":10,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/online-anomaly-detection-in-surveillance#ran","syntology_url":"https://syntology.ai/paper/2010.07110","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.07110"}},"official":{"repos":["kevaldoshi17/Prediction-based-Video-Anomaly-Detection-"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/text-based-rl-agents-with-commonsense","slug":"text-based-rl-agents-with-commonsense","title":"Text-based RL Agents with Commonsense Knowledge: New Challenges, Environments and Baselines","date":"2020-10-08","arxiv_id":"2010.03790","repositories_listed":2,"syntology":{"n":13,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/text-based-rl-agents-with-commonsense#ran","syntology_url":"https://syntology.ai/paper/2010.03790","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.03790"}},"official":{"repos":["IBM/commonsense-rl"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/steering-a-historical-disease-forecasting","slug":"steering-a-historical-disease-forecasting","title":"Steering a Historical Disease Forecasting Model Under a Pandemic: Case of Flu and COVID-19","date":"2020-09-23","arxiv_id":"2009.11407","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":1,"n_no_contract":5,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 1 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/steering-a-historical-disease-forecasting#ran","syntology_url":"https://syntology.ai/paper/2009.11407","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.11407"}},"official":null}},{"url":"/paper/interpretable-and-interactive-summaries","slug":"interpretable-and-interactive-summaries","title":"Beyond Individualized Recourse: Interpretable and Interactive Summaries of Actionable Recourses","date":"2020-09-15","arxiv_id":"2009.07165","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/interpretable-and-interactive-summaries#ran","syntology_url":"https://syntology.ai/paper/2009.07165","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.07165"}},"official":null}},{"url":"/paper/covidnet-ct-a-tailored-deep-convolutional","slug":"covidnet-ct-a-tailored-deep-convolutional","title":"COVIDNet-CT: A Tailored Deep Convolutional Neural Network Design for Detection of COVID-19 Cases from Chest CT Images","date":"2020-09-08","arxiv_id":"2009.05383","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/covidnet-ct-a-tailored-deep-convolutional#ran","syntology_url":"https://syntology.ai/paper/2009.05383","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.05383"}},"official":{"repos":["haydengunraj/COVIDNet-CT"],"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/occupancy-anticipation-for-efficient","slug":"occupancy-anticipation-for-efficient","title":"Occupancy Anticipation for Efficient Exploration and Navigation","date":"2020-08-21","arxiv_id":"2008.09285","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/occupancy-anticipation-for-efficient#ran","syntology_url":"https://syntology.ai/paper/2008.09285","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.09285"}},"official":{"repos":["facebookresearch/OccupancyAnticipation"],"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/stochastic-optimization-forests","slug":"stochastic-optimization-forests","title":"Stochastic Optimization Forests","date":"2020-08-17","arxiv_id":"2008.07473","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/stochastic-optimization-forests#ran","syntology_url":"https://syntology.ai/paper/2008.07473","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.07473"}},"official":{"repos":["CausalML/StochOptForest"],"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/qplex-duplex-dueling-multi-agent-q-learning","slug":"qplex-duplex-dueling-multi-agent-q-learning","title":"QPLEX: Duplex Dueling Multi-Agent Q-Learning","date":"2020-08-03","arxiv_id":"2008.01062","repositories_listed":6,"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":1,"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/qplex-duplex-dueling-multi-agent-q-learning#ran","syntology_url":"https://syntology.ai/paper/2008.01062","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.01062"}},"official":{"repos":["wjh720/QPLEX"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/low-rank-tensor-bandits","slug":"low-rank-tensor-bandits","title":"Stochastic Low-rank Tensor Bandits for Multi-dimensional Online Decision Making","date":"2020-07-31","arxiv_id":"2007.15788","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/low-rank-tensor-bandits#ran","syntology_url":"https://syntology.ai/paper/2007.15788","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.15788"}},"official":null}},{"url":"/paper/clinician-in-the-loop-decision-making","slug":"clinician-in-the-loop-decision-making","title":"Clinician-in-the-Loop Decision Making: Reinforcement Learning with Near-Optimal Set-Valued Policies","date":"2020-07-24","arxiv_id":"2007.12678","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/clinician-in-the-loop-decision-making#ran","syntology_url":"https://syntology.ai/paper/2007.12678","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.12678"}},"official":{"repos":["MLD3/RL-Set-Valued-Policy"],"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/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/timexplain-a-framework-for-explaining-the","slug":"timexplain-a-framework-for-explaining-the","title":"timeXplain -- A Framework for Explaining the Predictions of Time Series Classifiers","date":"2020-07-15","arxiv_id":"2007.07606","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/timexplain-a-framework-for-explaining-the#ran","syntology_url":"https://syntology.ai/paper/2007.07606","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.07606"}},"official":{"repos":["loadingbyte/timexplain"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/bayesian-optimization-of-risk-measures","slug":"bayesian-optimization-of-risk-measures","title":"Bayesian Optimization of Risk Measures","date":"2020-07-10","arxiv_id":"2007.05554","repositories_listed":2,"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/bayesian-optimization-of-risk-measures#ran","syntology_url":"https://syntology.ai/paper/2007.05554","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.05554"}},"official":{"repos":["saitcakmak/BoRisk"],"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/bidirectional-model-based-policy-optimization","slug":"bidirectional-model-based-policy-optimization","title":"Bidirectional Model-based Policy Optimization","date":"2020-07-04","arxiv_id":"2007.01995","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":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/bidirectional-model-based-policy-optimization#ran","syntology_url":"https://syntology.ai/paper/2007.01995","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.01995"}},"official":{"repos":["hanglai/bmpo"],"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/calibration-of-neural-networks-using-splines","slug":"calibration-of-neural-networks-using-splines","title":"Calibration of Neural Networks using Splines","date":"2020-06-23","arxiv_id":"2006.12800","repositories_listed":1,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/calibration-of-neural-networks-using-splines#ran","syntology_url":"https://syntology.ai/paper/2006.12800","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.12800"}},"official":{"repos":["kartikgupta-at-anu/spline-calibration"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/embed-me-if-you-can-a-geometric-perceptron","slug":"embed-me-if-you-can-a-geometric-perceptron","title":"Embed Me If You Can: A Geometric Perceptron","date":"2020-06-11","arxiv_id":"2006.06507","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/embed-me-if-you-can-a-geometric-perceptron#ran","syntology_url":"https://syntology.ai/paper/2006.06507","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.06507"}},"official":{"repos":["pavlo-melnyk/mlgp-embedme"],"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/deep-neural-networks-for-the-sequential","slug":"deep-neural-networks-for-the-sequential","title":"Sequential Density Ratio Estimation for Simultaneous Optimization of Speed and Accuracy","date":"2020-06-10","arxiv_id":"2006.05587","repositories_listed":2,"syntology":{"n":21,"n_ran":13,"n_constructed":0,"n_ran_checked":10,"n_instrument":3,"n_unverified":8,"n_honours":1,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 0 violated, 9 with no contract checked; 3 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/deep-neural-networks-for-the-sequential#ran","syntology_url":"https://syntology.ai/paper/2006.05587","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.05587"}},"official":{"repos":["TaikiMiyagawa/SPRT-TANDEM"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":6,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/reinforcement-learning-for-multi-product","slug":"reinforcement-learning-for-multi-product","title":"Reinforcement Learning for Multi-Product Multi-Node Inventory Management in Supply Chains","date":"2020-06-07","arxiv_id":"2006.04037","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/reinforcement-learning-for-multi-product#ran","syntology_url":"https://syntology.ai/paper/2006.04037","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.04037"}},"official":null}},{"url":"/paper/a-meta-bayesian-model-of-intentional-visual","slug":"a-meta-bayesian-model-of-intentional-visual","title":"A Meta-Bayesian Model of Intentional Visual Search","date":"2020-06-05","arxiv_id":"2006.03531","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":3,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":6,"phrase":"3 ran (of which 3 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; every one of the 3 samples that ran constructed an object rather than computing a result","sample_list":"/paper/a-meta-bayesian-model-of-intentional-visual#ran","syntology_url":"https://syntology.ai/paper/2006.03531","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.03531"}},"official":{"repos":["v2c08/M-BMVS"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/nile-natural-language-inference-with-faithful","slug":"nile-natural-language-inference-with-faithful","title":"NILE : Natural Language Inference with Faithful Natural Language Explanations","date":"2020-05-25","arxiv_id":"2005.12116","repositories_listed":1,"syntology":{"n":5,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/nile-natural-language-inference-with-faithful#ran","syntology_url":"https://syntology.ai/paper/2005.12116","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.12116"}},"official":{"repos":["SawanKumar28/nile"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"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/local-and-global-explanations-of-agent","slug":"local-and-global-explanations-of-agent","title":"Local and Global Explanations of Agent Behavior: Integrating Strategy Summaries with Saliency Maps","date":"2020-05-18","arxiv_id":"2005.08874","repositories_listed":1,"syntology":{"n":15,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/local-and-global-explanations-of-agent#ran","syntology_url":"https://syntology.ai/paper/2005.08874","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.08874"}},"official":{"repos":["HuTobias/HIGHLIGHTS-LRP"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/curating-a-covid-19-data-repository-and","slug":"curating-a-covid-19-data-repository-and","title":"Curating a COVID-19 data repository and forecasting county-level death counts in the United States","date":"2020-05-16","arxiv_id":"2005.07882","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/curating-a-covid-19-data-repository-and#ran","syntology_url":"https://syntology.ai/paper/2005.07882","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.07882"}},"official":{"repos":["Yu-Group/covid19-severity-prediction"],"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/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/the-notorious-difficulty-of-comparing-human","slug":"the-notorious-difficulty-of-comparing-human","title":"Five Points to Check when Comparing Visual Perception in Humans and Machines","date":"2020-04-20","arxiv_id":"2004.09406","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/the-notorious-difficulty-of-comparing-human#ran","syntology_url":"https://syntology.ai/paper/2004.09406","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.09406"}},"official":{"repos":["bethgelab/notorious_difficulty_of_comparing_human_and_machine_perception"],"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/learning-sparse-rewarded-tasks-from-sub","slug":"learning-sparse-rewarded-tasks-from-sub","title":"Learning Sparse Rewarded Tasks from Sub-Optimal Demonstrations","date":"2020-04-01","arxiv_id":"2004.00530","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":2,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 2 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-sparse-rewarded-tasks-from-sub#ran","syntology_url":"https://syntology.ai/paper/2004.00530","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.00530"}},"official":null}},{"url":"/paper/sequential-bayesian-experimental-design-for","slug":"sequential-bayesian-experimental-design-for","title":"Sequential Bayesian Experimental Design for Implicit Models via Mutual Information","date":"2020-03-20","arxiv_id":"2003.09379","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/sequential-bayesian-experimental-design-for#ran","syntology_url":"https://syntology.ai/paper/2003.09379","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.09379"}},"official":null}},{"url":"/paper/self-supervised-discovering-of-causal","slug":"self-supervised-discovering-of-causal","title":"Self-Supervised Discovering of Interpretable Features for Reinforcement Learning","date":"2020-03-16","arxiv_id":"2003.07069","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":2,"n_instrument":4,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/self-supervised-discovering-of-causal#ran","syntology_url":"https://syntology.ai/paper/2003.07069","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.07069"}},"official":{"repos":["shiwj16/SSINet"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/entmoot-a-framework-for-optimization-over","slug":"entmoot-a-framework-for-optimization-over","title":"ENTMOOT: A Framework for Optimization over Ensemble Tree Models","date":"2020-03-10","arxiv_id":"2003.04774","repositories_listed":1,"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/entmoot-a-framework-for-optimization-over#ran","syntology_url":"https://syntology.ai/paper/2003.04774","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.04774"}},"official":{"repos":["cog-imperial/entmoot"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-discrete-state-abstractions-with","slug":"learning-discrete-state-abstractions-with","title":"Learning Discrete State Abstractions With Deep Variational Inference","date":"2020-03-09","arxiv_id":"2003.04300","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/learning-discrete-state-abstractions-with#ran","syntology_url":"https://syntology.ai/paper/2003.04300","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.04300"}},"official":{"repos":["ondrejba/discrete_abstractions"],"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/adversarial-attacks-on-probabilistic","slug":"adversarial-attacks-on-probabilistic","title":"Adversarial Attacks on Probabilistic Autoregressive Forecasting Models","date":"2020-03-08","arxiv_id":"2003.03778","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/adversarial-attacks-on-probabilistic#ran","syntology_url":"https://syntology.ai/paper/2003.03778","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.03778"}},"official":{"repos":["eth-sri/probabilistic-forecasts-attacks"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/diverse-and-admissible-trajectory-forecasting","slug":"diverse-and-admissible-trajectory-forecasting","title":"Diverse and Admissible Trajectory Forecasting through Multimodal Context Understanding","date":"2020-03-06","arxiv_id":"2003.03212","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/diverse-and-admissible-trajectory-forecasting#ran","syntology_url":"https://syntology.ai/paper/2003.03212","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.03212"}},"official":{"repos":["kami93/CMU-DATF"],"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","unlocated"]}}},{"url":"/paper/predictive-coding-for-locally-linear-control","slug":"predictive-coding-for-locally-linear-control","title":"Predictive Coding for Locally-Linear Control","date":"2020-03-02","arxiv_id":"2003.01086","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":1,"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: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/predictive-coding-for-locally-linear-control#ran","syntology_url":"https://syntology.ai/paper/2003.01086","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.01086"}},"official":{"repos":["VinAIResearch/PC3-pytorch"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/decision-trees-for-decision-making-under-the","slug":"decision-trees-for-decision-making-under-the","title":"Decision Trees for Decision-Making under the Predict-then-Optimize Framework","date":"2020-02-29","arxiv_id":"2003.00360","repositories_listed":1,"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/decision-trees-for-decision-making-under-the#ran","syntology_url":"https://syntology.ai/paper/2003.00360","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.00360"}},"official":{"repos":["rtm2130/SPOTree"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/pddlgym-gym-environments-from-pddl-problems","slug":"pddlgym-gym-environments-from-pddl-problems","title":"PDDLGym: Gym Environments from PDDL Problems","date":"2020-02-15","arxiv_id":"2002.06432","repositories_listed":2,"syntology":{"n":11,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":8,"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) · 8 unverified","sample_list":"/paper/pddlgym-gym-environments-from-pddl-problems#ran","syntology_url":"https://syntology.ai/paper/2002.06432","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.06432"}},"official":{"repos":["tomsilver/pddlgym"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":8,"ran_from_kinds":["official"]}}},{"url":"/paper/thompson-sampling-algorithms-for-mean","slug":"thompson-sampling-algorithms-for-mean","title":"Thompson Sampling Algorithms for Mean-Variance Bandits","date":"2020-02-01","arxiv_id":"2002.00232","repositories_listed":2,"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/thompson-sampling-algorithms-for-mean#ran","syntology_url":"https://syntology.ai/paper/2002.00232","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.00232"}},"official":null}},{"url":"/paper/tree-structured-policy-based-progressive","slug":"tree-structured-policy-based-progressive","title":"Tree-Structured Policy based Progressive Reinforcement Learning for Temporally Language Grounding in Video","date":"2020-01-18","arxiv_id":"2001.06680","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/tree-structured-policy-based-progressive#ran","syntology_url":"https://syntology.ai/paper/2001.06680","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.06680"}},"official":{"repos":["WuJie1010/TSP-PRL"],"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"]}}}],"record_sha256":"0359372ed3bcdaf41f85754211e5b6b7c9abdcd4a59145ad9931b1d3ebb97b62","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}