{"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/27","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":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":27,"pages_in_order":124,"rows_per_page":100,"rows":[2601,2700],"of":12311,"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","prev":"/task/decision-making/papers/26","next":"/task/decision-making/papers/28","papers":[{"url":"/paper/methods-for-individual-treatment-assignment","slug":"methods-for-individual-treatment-assignment","title":"A Comparison of Methods for Treatment Assignment with an Application to Playlist Generation","date":"2020-04-24","arxiv_id":"2004.11532","repositories_listed":1,"syntology":null},{"url":"/paper/the-two-kinds-of-free-energy-and-the-bayesian","slug":"the-two-kinds-of-free-energy-and-the-bayesian","title":"The Two Kinds of Free Energy and the Bayesian Revolution","date":"2020-04-24","arxiv_id":"2004.11763","repositories_listed":1,"syntology":null},{"url":"/paper/human-factors-in-model-interpretability","slug":"human-factors-in-model-interpretability","title":"Human Factors in Model Interpretability: Industry Practices, Challenges, and Needs","date":"2020-04-23","arxiv_id":"2004.11440","repositories_listed":1,"syntology":null},{"url":"/paper/tactical-decision-making-in-autonomous","slug":"tactical-decision-making-in-autonomous","title":"Tactical Decision-Making in Autonomous Driving by Reinforcement Learning with Uncertainty Estimation","date":"2020-04-22","arxiv_id":"2004.10439","repositories_listed":1,"syntology":null},{"url":"/paper/ttnet-real-time-temporal-and-spatial-video","slug":"ttnet-real-time-temporal-and-spatial-video","title":"TTNet: Real-time temporal and spatial video analysis of table tennis","date":"2020-04-21","arxiv_id":"2004.09927","repositories_listed":1,"syntology":null},{"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/top-down-networks-a-coarse-to-fine","slug":"top-down-networks-a-coarse-to-fine","title":"Top-Down Networks: A coarse-to-fine reimagination of CNNs","date":"2020-04-16","arxiv_id":"2004.07629","repositories_listed":1,"syntology":null},{"url":"/paper/bias-in-multimodal-ai-testbed-for-fair","slug":"bias-in-multimodal-ai-testbed-for-fair","title":"Bias in Multimodal AI: Testbed for Fair Automatic Recruitment","date":"2020-04-15","arxiv_id":"2004.07173","repositories_listed":1,"syntology":null},{"url":"/paper/power-constrained-bandits","slug":"power-constrained-bandits","title":"Power Constrained Bandits","date":"2020-04-13","arxiv_id":"2004.06230","repositories_listed":1,"syntology":null},{"url":"/paper/rapidly-deploying-a-neural-search-engine-for","slug":"rapidly-deploying-a-neural-search-engine-for","title":"Rapidly Deploying a Neural Search Engine for the COVID-19 Open Research Dataset: Preliminary Thoughts and Lessons Learned","date":"2020-04-10","arxiv_id":"2004.05125","repositories_listed":1,"syntology":null},{"url":"/paper/fairnn-conjoint-learning-of-fair","slug":"fairnn-conjoint-learning-of-fair","title":"FairNN- Conjoint Learning of Fair Representations for Fair Decisions","date":"2020-04-05","arxiv_id":"2004.02173","repositories_listed":1,"syntology":null},{"url":"/paper/fairalm-augmented-lagrangian-method-for","slug":"fairalm-augmented-lagrangian-method-for","title":"FairALM: Augmented Lagrangian Method for Training Fair Models with Little Regret","date":"2020-04-03","arxiv_id":"2004.01355","repositories_listed":1,"syntology":null},{"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/a-copula-based-visualization-technique-for-a","slug":"a-copula-based-visualization-technique-for-a","title":"A copula-based visualization technique for a neural network","date":"2020-03-27","arxiv_id":"2003.12317","repositories_listed":1,"syntology":null},{"url":"/paper/using-deep-reinforcement-learning-methods-for","slug":"using-deep-reinforcement-learning-methods-for","title":"Using Deep Reinforcement Learning Methods for Autonomous Vessels in 2D Environments","date":"2020-03-23","arxiv_id":"2003.10249","repositories_listed":1,"syntology":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/vision-dialog-navigation-by-exploring-cross","slug":"vision-dialog-navigation-by-exploring-cross","title":"Vision-Dialog Navigation by Exploring Cross-modal Memory","date":"2020-03-15","arxiv_id":"2003.06745","repositories_listed":1,"syntology":null},{"url":"/paper/off-policy-policy-evaluation-for-sequential","slug":"off-policy-policy-evaluation-for-sequential","title":"Off-policy Policy Evaluation For Sequential Decisions Under Unobserved Confounding","date":"2020-03-12","arxiv_id":"2003.05623","repositories_listed":1,"syntology":null},{"url":"/paper/addressing-multiple-metrics-of-group-fairness","slug":"addressing-multiple-metrics-of-group-fairness","title":"Addressing multiple metrics of group fairness in data-driven decision making","date":"2020-03-10","arxiv_id":"2003.04794","repositories_listed":1,"syntology":null},{"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/variational-learning-of-individual-survival","slug":"variational-learning-of-individual-survival","title":"Variational Learning of Individual Survival Distributions","date":"2020-03-09","arxiv_id":"2003.04430","repositories_listed":1,"syntology":null},{"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/causal-interaction-trees-tree-based-subgroup","slug":"causal-interaction-trees-tree-based-subgroup","title":"Causal Interaction Trees: Tree-Based Subgroup Identification for Observational Data","date":"2020-03-06","arxiv_id":"2003.03042","repositories_listed":1,"syntology":null},{"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/can-increasing-input-dimensionality-improve","slug":"can-increasing-input-dimensionality-improve","title":"Can Increasing Input Dimensionality Improve Deep Reinforcement Learning?","date":"2020-03-03","arxiv_id":"2003.01629","repositories_listed":1,"syntology":null},{"url":"/paper/differentiable-causal-backdoor-discovery","slug":"differentiable-causal-backdoor-discovery","title":"Differentiable Causal Backdoor Discovery","date":"2020-03-03","arxiv_id":"2003.01461","repositories_listed":1,"syntology":null},{"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/introducing-a-human-like-planner-for-reaching","slug":"introducing-a-human-like-planner-for-reaching","title":"Human-like Planning for Reaching in Cluttered Environments","date":"2020-02-28","arxiv_id":"2002.12738","repositories_listed":1,"syntology":null},{"url":"/paper/reinforcement-learning-of-risk-constrained","slug":"reinforcement-learning-of-risk-constrained","title":"Reinforcement Learning of Risk-Constrained Policies in Markov Decision Processes","date":"2020-02-27","arxiv_id":"2002.12086","repositories_listed":1,"syntology":null},{"url":"/paper/debayes-a-bayesian-method-for-debiasing","slug":"debayes-a-bayesian-method-for-debiasing","title":"DeBayes: a Bayesian Method for Debiasing Network Embeddings","date":"2020-02-26","arxiv_id":"2002.11442","repositories_listed":1,"syntology":null},{"url":"/paper/tanksworld-a-multi-agent-environment-for-ai","slug":"tanksworld-a-multi-agent-environment-for-ai","title":"TanksWorld: A Multi-Agent Environment for AI Safety Research","date":"2020-02-25","arxiv_id":"2002.11174","repositories_listed":1,"syntology":null},{"url":"/paper/discriminative-particle-filter-reinforcement-1","slug":"discriminative-particle-filter-reinforcement-1","title":"Discriminative Particle Filter Reinforcement Learning for Complex Partial Observations","date":"2020-02-23","arxiv_id":"2002.09884","repositories_listed":1,"syntology":null},{"url":"/paper/kryptooracle-a-real-time-cryptocurrency-price","slug":"kryptooracle-a-real-time-cryptocurrency-price","title":"KryptoOracle: A Real-Time Cryptocurrency Price Prediction Platform Using Twitter Sentiments","date":"2020-02-21","arxiv_id":"2003.04967","repositories_listed":1,"syntology":null},{"url":"/paper/learning-dynamic-knowledge-graphs-to","slug":"learning-dynamic-knowledge-graphs-to","title":"Learning Dynamic Belief Graphs to Generalize on Text-Based Games","date":"2020-02-21","arxiv_id":"2002.09127","repositories_listed":1,"syntology":null},{"url":"/paper/spatial-concept-based-navigation-with-human","slug":"spatial-concept-based-navigation-with-human","title":"Spatial Concept-Based Navigation with Human Speech Instructions via Probabilistic Inference on Bayesian Generative Model","date":"2020-02-18","arxiv_id":"2002.07381","repositories_listed":1,"syntology":null},{"url":"/paper/multi-variate-probabilistic-time-series","slug":"multi-variate-probabilistic-time-series","title":"Multivariate Probabilistic Time Series Forecasting via Conditioned Normalizing Flows","date":"2020-02-14","arxiv_id":"2002.06103","repositories_listed":1,"syntology":null},{"url":"/paper/effective-reinforcement-learning-through","slug":"effective-reinforcement-learning-through","title":"Effective Reinforcement Learning through Evolutionary Surrogate-Assisted Prescription","date":"2020-02-13","arxiv_id":"2002.05368","repositories_listed":1,"syntology":null},{"url":"/paper/online-algorithms-for-multi-shop-ski-rental","slug":"online-algorithms-for-multi-shop-ski-rental","title":"Online Algorithms for Multi-shop Ski Rental with Machine Learned Advice","date":"2020-02-13","arxiv_id":"2002.05808","repositories_listed":1,"syntology":null},{"url":"/paper/estimating-uncertainty-intervals-from","slug":"estimating-uncertainty-intervals-from","title":"Estimating Uncertainty Intervals from Collaborating Networks","date":"2020-02-12","arxiv_id":"2002.05212","repositories_listed":1,"syntology":null},{"url":"/paper/machine-learning-in-asset-management-part-1","slug":"machine-learning-in-asset-management-part-1","title":"Machine Learning in Asset Management—Part 1: Portfolio Construction—Trading Strategies","date":"2020-02-10","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/making-logic-learnable-with-neural-networks","slug":"making-logic-learnable-with-neural-networks","title":"Making Logic Learnable With Neural Networks","date":"2020-02-10","arxiv_id":"2002.03847","repositories_listed":1,"syntology":null},{"url":"/paper/does-the-markov-decision-process-fit-the-data","slug":"does-the-markov-decision-process-fit-the-data","title":"Does the Markov Decision Process Fit the Data: Testing for the Markov Property in Sequential Decision Making","date":"2020-02-05","arxiv_id":"2002.01751","repositories_listed":1,"syntology":{"n":4,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 4 unverified","sample_list":"/paper/does-the-markov-decision-process-fit-the-data#ran","syntology_url":"https://syntology.ai/paper/2002.01751","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.01751"}},"official":null}},{"url":"/paper/a-generalized-flow-for-b2b-sales-predictive","slug":"a-generalized-flow-for-b2b-sales-predictive","title":"A Generalized Flow for B2B Sales Predictive Modeling: An Azure Machine Learning Approach","date":"2020-02-04","arxiv_id":"2002.01441","repositories_listed":1,"syntology":null},{"url":"/paper/benchmarking-flexible-electric-loads","slug":"benchmarking-flexible-electric-loads","title":"Benchmarking Flexible Electric Loads Scheduling Algorithms under Market Price Uncertainty","date":"2020-02-04","arxiv_id":"2002.01246","repositories_listed":1,"syntology":null},{"url":"/paper/improving-the-robustness-of-graphs-through","slug":"improving-the-robustness-of-graphs-through","title":"Goal-directed graph construction using reinforcement learning","date":"2020-01-30","arxiv_id":"2001.11279","repositories_listed":1,"syntology":null},{"url":"/paper/reducing-complexity-and-unidentifiability","slug":"reducing-complexity-and-unidentifiability","title":"Reducing complexity and unidentifiability when modelling human atrial cells","date":"2020-01-29","arxiv_id":"2001.10954","repositories_listed":1,"syntology":null},{"url":"/paper/computing-the-feedback-capacity-of-finite","slug":"computing-the-feedback-capacity-of-finite","title":"Computing the Feedback Capacity of Finite State Channels using Reinforcement Learning","date":"2020-01-27","arxiv_id":"2001.09685","repositories_listed":1,"syntology":null},{"url":"/paper/case-study-predictive-fairness-to-reduce","slug":"case-study-predictive-fairness-to-reduce","title":"Case Study: Predictive Fairness to Reduce Misdemeanor Recidivism Through Social Service Interventions","date":"2020-01-24","arxiv_id":"2001.09233","repositories_listed":1,"syntology":null},{"url":"/paper/glib-exploration-via-goal-literal-babbling","slug":"glib-exploration-via-goal-literal-babbling","title":"GLIB: Efficient Exploration for Relational Model-Based Reinforcement Learning via Goal-Literal Babbling","date":"2020-01-22","arxiv_id":"2001.08299","repositories_listed":1,"syntology":null},{"url":"/paper/ghostimage-perception-domain-attacks-against","slug":"ghostimage-perception-domain-attacks-against","title":"GhostImage: Remote Perception Attacks against Camera-based Image Classification Systems","date":"2020-01-21","arxiv_id":"2001.07792","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-visual-patterns-in-projected-human","slug":"exploring-visual-patterns-in-projected-human","title":"ProjectionPathExplorer: Exploring Visual Patterns in Projected Decision-Making Paths","date":"2020-01-20","arxiv_id":"2001.08372","repositories_listed":1,"syntology":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"]}}},{"url":"/paper/the-gap-between-theory-and-practice-in","slug":"the-gap-between-theory-and-practice-in","title":"The gap between theory and practice in function approximation with deep neural networks","date":"2020-01-16","arxiv_id":"2001.07523","repositories_listed":1,"syntology":{"n":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 3 unverified","sample_list":"/paper/the-gap-between-theory-and-practice-in#ran","syntology_url":"https://syntology.ai/paper/2001.07523","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.07523"}},"official":{"repos":["ndexter/MLFA"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}},{"url":"/paper/popcorn-partially-observed-prediction","slug":"popcorn-partially-observed-prediction","title":"POPCORN: Partially Observed Prediction COnstrained ReiNforcement Learning","date":"2020-01-13","arxiv_id":"2001.04032","repositories_listed":1,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/popcorn-partially-observed-prediction#ran","syntology_url":"https://syntology.ai/paper/2001.04032","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.04032"}},"official":{"repos":["dtak/POPCORN-POMDP"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/statistical-inference-of-the-value-function","slug":"statistical-inference-of-the-value-function","title":"Statistical Inference of the Value Function for Reinforcement Learning in Infinite Horizon Settings","date":"2020-01-13","arxiv_id":"2001.04515","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/statistical-inference-of-the-value-function#ran","syntology_url":"https://syntology.ai/paper/2001.04515","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.04515"}},"official":{"repos":["shengzhang37/SAVE"],"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/unifying-and-generalizing-models-of-neural","slug":"unifying-and-generalizing-models-of-neural","title":"Unifying and generalizing models of neural dynamics during decision-making","date":"2020-01-13","arxiv_id":"2001.04571","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/unifying-and-generalizing-models-of-neural#ran","syntology_url":"https://syntology.ai/paper/2001.04571","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.04571"}},"official":{"repos":["davidzoltowski/ssmdm"],"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/learning-credit-assignment","slug":"learning-credit-assignment","title":"Learning credit assignment","date":"2020-01-10","arxiv_id":"2001.03354","repositories_listed":1,"syntology":null},{"url":"/paper/characterizing-the-decision-boundary-of-deep","slug":"characterizing-the-decision-boundary-of-deep","title":"Characterizing the Decision Boundary of Deep Neural Networks","date":"2019-12-24","arxiv_id":"1912.11460","repositories_listed":1,"syntology":null},{"url":"/paper/towards-multicellular-biological-deep-neural","slug":"towards-multicellular-biological-deep-neural","title":"Towards Multicellular Biological Deep Neural Nets Based on Transcriptional Regulation","date":"2019-12-24","arxiv_id":"1912.11423","repositories_listed":1,"syntology":null},{"url":"/paper/one-sh-ot-decision-making-with-and-without","slug":"one-sh-ot-decision-making-with-and-without","title":"One-Shot Decision-Making with and without Surrogates","date":"2019-12-19","arxiv_id":"1912.08956","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-networks-for-decentralized-multi","slug":"graph-neural-networks-for-decentralized-multi","title":"Graph Neural Networks for Decentralized Multi-Robot Path Planning","date":"2019-12-12","arxiv_id":"1912.06095","repositories_listed":1,"syntology":null},{"url":"/paper/modeling-somatic-computation-with-non-neural","slug":"modeling-somatic-computation-with-non-neural","title":"Modeling somatic computation with non-neural bioelectric networks","date":"2019-12-09","arxiv_id":"1912.04246","repositories_listed":1,"syntology":null},{"url":"/paper/increasing-performance-of-electric-vehicles","slug":"increasing-performance-of-electric-vehicles","title":"Increasing performance of electric vehicles in ride-hailing services using deep reinforcement learning","date":"2019-12-07","arxiv_id":"1912.03408","repositories_listed":1,"syntology":null},{"url":"/paper/perfectly-parallel-fairness-certification-of","slug":"perfectly-parallel-fairness-certification-of","title":"Perfectly Parallel Fairness Certification of Neural Networks","date":"2019-12-05","arxiv_id":"1912.02499","repositories_listed":1,"syntology":null},{"url":"/paper/fast-intent-classification-for-spoken","slug":"fast-intent-classification-for-spoken","title":"Fast Intent Classification for Spoken Language Understanding","date":"2019-12-03","arxiv_id":"1912.01728","repositories_listed":1,"syntology":null},{"url":"/paper/risk-averse-action-selection-using-extreme","slug":"risk-averse-action-selection-using-extreme","title":"Risk-Averse Action Selection Using Extreme Value Theory Estimates of the CVaR","date":"2019-12-03","arxiv_id":"1912.01718","repositories_listed":1,"syntology":null},{"url":"/paper/a-bayesian-theory-of-conformity-in-collective","slug":"a-bayesian-theory-of-conformity-in-collective","title":"A Bayesian Theory of Conformity in Collective Decision Making","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/disentangled-behavioural-representations","slug":"disentangled-behavioural-representations","title":"Disentangled behavioural representations","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/selecting-optimal-decisions-via","slug":"selecting-optimal-decisions-via","title":"Selecting Optimal Decisions via Distributionally Robust Nearest-Neighbor Regression","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/smile-scalable-meta-inverse-reinforcement","slug":"smile-scalable-meta-inverse-reinforcement","title":"SMILe: Scalable Meta Inverse Reinforcement Learning through Context-Conditional Policies","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/an-adaptive-view-of-adversarial-robustness","slug":"an-adaptive-view-of-adversarial-robustness","title":"An Adaptive View of Adversarial Robustness from Test-time Smoothing Defense","date":"2019-11-26","arxiv_id":"1911.11881","repositories_listed":1,"syntology":null},{"url":"/paper/fair-learning-to-rank-from-implicit-feedback","slug":"fair-learning-to-rank-from-implicit-feedback","title":"Policy-Gradient Training of Fair and Unbiased Ranking Functions","date":"2019-11-19","arxiv_id":"1911.08054","repositories_listed":1,"syntology":null},{"url":"/paper/planning-with-goal-conditioned-policies-1","slug":"planning-with-goal-conditioned-policies-1","title":"Planning with Goal-Conditioned Policies","date":"2019-11-19","arxiv_id":"1911.08453","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":3,"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) · 1 unverified","sample_list":"/paper/planning-with-goal-conditioned-policies-1#ran","syntology_url":"https://syntology.ai/paper/1911.08453","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.08453"}},"official":null}},{"url":"/paper/a-biologically-plausible-benchmark-for","slug":"a-biologically-plausible-benchmark-for","title":"A Biologically Plausible Benchmark for Contextual Bandit Algorithms in Precision Oncology Using in vitro Data","date":"2019-11-11","arxiv_id":"1911.04389","repositories_listed":1,"syntology":null},{"url":"/paper/a-perspective-on-multi-agent-communication","slug":"a-perspective-on-multi-agent-communication","title":"A perspective on multi-agent communication for information fusion","date":"2019-11-09","arxiv_id":"1911.03743","repositories_listed":1,"syntology":null},{"url":"/paper/optimal-experimental-design-for-staggered","slug":"optimal-experimental-design-for-staggered","title":"Optimal Experimental Design for Staggered Rollouts","date":"2019-11-09","arxiv_id":"1911.03764","repositories_listed":1,"syntology":null},{"url":"/paper/thompson-sampling-for-contextual-bandit","slug":"thompson-sampling-for-contextual-bandit","title":"Thompson Sampling for Contextual Bandit Problems with Auxiliary Safety Constraints","date":"2019-11-02","arxiv_id":"1911.00638","repositories_listed":1,"syntology":null},{"url":"/paper/probabilistic-formulation-of-the-take-the","slug":"probabilistic-formulation-of-the-take-the","title":"Probabilistic Formulation of the Take The Best Heuristic","date":"2019-11-01","arxiv_id":"1911.00572","repositories_listed":1,"syntology":null},{"url":"/paper/reading-like-her-human-reading-inspired","slug":"reading-like-her-human-reading-inspired","title":"Reading Like HER: Human Reading Inspired Extractive Summarization","date":"2019-11-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/thompson-sampling-via-local-uncertainty","slug":"thompson-sampling-via-local-uncertainty","title":"Thompson Sampling via Local Uncertainty","date":"2019-10-30","arxiv_id":"1910.13673","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/thompson-sampling-via-local-uncertainty#ran","syntology_url":"https://syntology.ai/paper/1910.13673","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.13673"}},"official":{"repos":["Zhendong-Wang/Thompson-Sampling-via-Local-Uncertainty"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-framework-for-deep-energy-based","slug":"a-framework-for-deep-energy-based","title":"Quantum enhancements for deep reinforcement learning in large spaces","date":"2019-10-28","arxiv_id":"1910.12760","repositories_listed":1,"syntology":null},{"url":"/paper/modelling-heterogeneous-distributions-with-an","slug":"modelling-heterogeneous-distributions-with-an","title":"Modelling heterogeneous distributions with an Uncountable Mixture of Asymmetric Laplacians","date":"2019-10-27","arxiv_id":"1910.12288","repositories_listed":1,"syntology":null},{"url":"/paper/a-deep-active-learning-system-for-species","slug":"a-deep-active-learning-system-for-species","title":"A deep active learning system for species identification and counting in camera trap images","date":"2019-10-22","arxiv_id":"1910.09716","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-deep-active-learning-system-for-species#ran","syntology_url":"https://syntology.ai/paper/1910.09716","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.09716"}},"official":null}},{"url":"/paper/smoothness-adaptive-stochastic-bandits","slug":"smoothness-adaptive-stochastic-bandits","title":"Smoothness-Adaptive Contextual Bandits","date":"2019-10-22","arxiv_id":"1910.09714","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/smoothness-adaptive-stochastic-bandits#ran","syntology_url":"https://syntology.ai/paper/1910.09714","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.09714"}},"official":{"repos":["armmn/Smoothness-Adaptive-Contextual-Bandits"],"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/collaborative-preference-embedding-against","slug":"collaborative-preference-embedding-against","title":"Collaborative Preference Embedding against Sparse Labels","date":"2019-10-21","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/multi-view-reinforcement-learning","slug":"multi-view-reinforcement-learning","title":"Multi-View Reinforcement Learning","date":"2019-10-18","arxiv_id":"1910.08285","repositories_listed":1,"syntology":null},{"url":"/paper/the-tcga-meta-dataset-clinical-benchmark","slug":"the-tcga-meta-dataset-clinical-benchmark","title":"The TCGA Meta-Dataset Clinical Benchmark","date":"2019-10-18","arxiv_id":"1910.08636","repositories_listed":1,"syntology":null},{"url":"/paper/achieving-robustness-to-aleatoric-uncertainty","slug":"achieving-robustness-to-aleatoric-uncertainty","title":"Achieving Robustness to Aleatoric Uncertainty with Heteroscedastic Bayesian Optimisation","date":"2019-10-17","arxiv_id":"1910.07779","repositories_listed":1,"syntology":null},{"url":"/paper/deep-reinforcement-learning-meets-graph","slug":"deep-reinforcement-learning-meets-graph","title":"Deep Reinforcement Learning meets Graph Neural Networks: exploring a routing optimization use case","date":"2019-10-16","arxiv_id":"1910.07421","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":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) · 2 unverified","sample_list":"/paper/deep-reinforcement-learning-meets-graph#ran","syntology_url":"https://syntology.ai/paper/1910.07421","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.07421"}},"official":{"repos":["knowledgedefinednetworking/DRL-GNN"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/approximate-inference-in-discrete","slug":"approximate-inference-in-discrete","title":"Approximate Inference in Discrete Distributions with Monte Carlo Tree Search and Value Functions","date":"2019-10-15","arxiv_id":"1910.06862","repositories_listed":1,"syntology":null},{"url":"/paper/counterfactual-diagnosis","slug":"counterfactual-diagnosis","title":"Counterfactual diagnosis","date":"2019-10-15","arxiv_id":"1910.06772","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/counterfactual-diagnosis#ran","syntology_url":"https://syntology.ai/paper/1910.06772","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.06772"}},"official":{"repos":["babylonhealth/counterfactual-diagnosis"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-learning-for-predicting-dynamic","slug":"deep-learning-for-predicting-dynamic","title":"Deep Learning for Predicting Dynamic Uncertain Opinions in Network Data","date":"2019-10-12","arxiv_id":"1910.05640","repositories_listed":1,"syntology":null},{"url":"/paper/from-visual-place-recognition-to-navigation","slug":"from-visual-place-recognition-to-navigation","title":"CityLearn: Diverse Real-World Environments for Sample-Efficient Navigation Policy Learning","date":"2019-10-10","arxiv_id":"1910.04335","repositories_listed":1,"syntology":null},{"url":"/paper/make-up-your-mind-adversarial-generation-of","slug":"make-up-your-mind-adversarial-generation-of","title":"Make Up Your Mind! Adversarial Generation of Inconsistent Natural Language Explanations","date":"2019-10-07","arxiv_id":"1910.03065","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/make-up-your-mind-adversarial-generation-of#ran","syntology_url":"https://syntology.ai/paper/1910.03065","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.03065"}},"official":{"repos":["OanaMariaCamburu/e-SNLI"],"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-q-network-for-angry-birds","slug":"deep-q-network-for-angry-birds","title":"Deep Q-Network for Angry Birds","date":"2019-10-04","arxiv_id":"1910.01806","repositories_listed":1,"syntology":null},{"url":"/paper/mabwiser-a-parallelizable-contextual-multi","slug":"mabwiser-a-parallelizable-contextual-multi","title":"MABWiser: A Parallelizable Contextual Multi-Armed Bandit Library for Python","date":"2019-10-04","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/towards-understanding-of-medical-randomized","slug":"towards-understanding-of-medical-randomized","title":"Towards Understanding of Medical Randomized Controlled Trials by Conclusion Generation","date":"2019-10-03","arxiv_id":"1910.01462","repositories_listed":1,"syntology":null}],"record_sha256":"15037b027e8b21bbd8735cced1ad6b242380d16790f79b5ae41c70f70ed4394d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}