{"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/28","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":28,"pages_in_order":124,"rows_per_page":100,"rows":[2701,2800],"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/27","next":"/task/decision-making/papers/29","papers":[{"url":"/paper/quantized-reinforcement-learning-quarl","slug":"quantized-reinforcement-learning-quarl","title":"QuaRL: Quantization for Fast and Environmentally Sustainable Reinforcement Learning","date":"2019-10-02","arxiv_id":"1910.01055","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/quantized-reinforcement-learning-quarl#ran","syntology_url":"https://syntology.ai/paper/1910.01055","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.01055"}},"official":{"repos":["harvard-edge/quarl"],"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/affordable-uplift-supervised-randomization-in","slug":"affordable-uplift-supervised-randomization-in","title":"Affordable Uplift: Supervised Randomization in Controlled Experiments","date":"2019-10-01","arxiv_id":"1910.00393","repositories_listed":1,"syntology":null},{"url":"/paper/190909902","slug":"190909902","title":"Deep Reinforcement Learning with Modulated Hebbian plus Q Network Architecture","date":"2019-09-21","arxiv_id":"1909.09902","repositories_listed":1,"syntology":null},{"url":"/paper/adafair-cumulative-fairness-adaptive-boosting","slug":"adafair-cumulative-fairness-adaptive-boosting","title":"AdaFair: Cumulative Fairness Adaptive Boosting","date":"2019-09-17","arxiv_id":"1909.08982","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/adafair-cumulative-fairness-adaptive-boosting#ran","syntology_url":"https://syntology.ai/paper/1909.08982","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.08982"}},"official":{"repos":["iosifidisvasileios/AdaFair"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/multimodal-multitask-representation-learning","slug":"multimodal-multitask-representation-learning","title":"Multimodal Multitask Representation Learning for Pathology Biobank Metadata Prediction","date":"2019-09-17","arxiv_id":"1909.07846","repositories_listed":1,"syntology":null},{"url":"/paper/co-attentive-cross-modal-deep-learning-for","slug":"co-attentive-cross-modal-deep-learning-for","title":"Co-Attentive Cross-Modal Deep Learning for Medical Evidence Synthesis and Decision Making","date":"2019-09-13","arxiv_id":"1909.06442","repositories_listed":1,"syntology":null},{"url":"/paper/correcting-predictions-for-approximate","slug":"correcting-predictions-for-approximate","title":"Correcting Predictions for Approximate Bayesian Inference","date":"2019-09-11","arxiv_id":"1909.04919","repositories_listed":1,"syntology":null},{"url":"/paper/reinforcement-learning-for-temporal-logic","slug":"reinforcement-learning-for-temporal-logic","title":"Reinforcement Learning for Temporal Logic Control Synthesis with Probabilistic Satisfaction Guarantees","date":"2019-09-11","arxiv_id":"1909.05304","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/reinforcement-learning-for-temporal-logic#ran","syntology_url":"https://syntology.ai/paper/1909.05304","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.05304"}},"official":{"repos":["grockious/lcrl"],"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/revisit-recurrent-attention-model-from-an","slug":"revisit-recurrent-attention-model-from-an","title":"Revisit Recurrent Attention Model from an Active Sampling Perspective","date":"2019-09-11","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/learning-fair-rule-lists","slug":"learning-fair-rule-lists","title":"Learning Fair Rule Lists","date":"2019-09-09","arxiv_id":"1909.03977","repositories_listed":1,"syntology":null},{"url":"/paper/back-to-the-future-sequential-alignment-of","slug":"back-to-the-future-sequential-alignment-of","title":"Back to the Future -- Sequential Alignment of Text Representations","date":"2019-09-08","arxiv_id":"1909.03464","repositories_listed":1,"syntology":null},{"url":"/paper/multi-objective-multi-agent-decision-making-a","slug":"multi-objective-multi-agent-decision-making-a","title":"Multi-Objective Multi-Agent Decision Making: A Utility-based Analysis and Survey","date":"2019-09-06","arxiv_id":"1909.02964","repositories_listed":1,"syntology":null},{"url":"/paper/help-anna-visual-navigation-with-natural","slug":"help-anna-visual-navigation-with-natural","title":"Help, Anna! Visual Navigation with Natural Multimodal Assistance via Retrospective Curiosity-Encouraging Imitation Learning","date":"2019-09-04","arxiv_id":"1909.01871","repositories_listed":1,"syntology":null},{"url":"/paper/prediction-consistency-curvature","slug":"prediction-consistency-curvature","title":"Prediction, Consistency, Curvature: Representation Learning for Locally-Linear Control","date":"2019-09-04","arxiv_id":"1909.01506","repositories_listed":1,"syntology":{"n":12,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":8,"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, 1 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/prediction-consistency-curvature#ran","syntology_url":"https://syntology.ai/paper/1909.01506","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.01506"}},"official":null}},{"url":"/paper/improving-disentangled-representation","slug":"improving-disentangled-representation","title":"Improving Disentangled Representation Learning with the Beta Bernoulli Process","date":"2019-09-03","arxiv_id":"1909.01839","repositories_listed":1,"syntology":null},{"url":"/paper/multi-level-attention-network-using-text","slug":"multi-level-attention-network-using-text","title":"Multi-level Attention network using text, audio and video for Depression Prediction","date":"2019-09-03","arxiv_id":"1909.01417","repositories_listed":1,"syntology":null},{"url":"/paper/counterfactual-risk-assessments-evaluation","slug":"counterfactual-risk-assessments-evaluation","title":"Counterfactual Risk Assessments, Evaluation, and Fairness","date":"2019-08-30","arxiv_id":"1909.00066","repositories_listed":1,"syntology":null},{"url":"/paper/interactive-machine-comprehension-with","slug":"interactive-machine-comprehension-with","title":"Interactive Machine Comprehension with Information Seeking Agents","date":"2019-08-27","arxiv_id":"1908.10449","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":6,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/interactive-machine-comprehension-with#ran","syntology_url":"https://syntology.ai/paper/1908.10449","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.10449"}},"official":{"repos":["xingdi-eric-yuan/imrc_public"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-review-on-deep-reinforcement-learning-for","slug":"a-review-on-deep-reinforcement-learning-for","title":"A review on Deep Reinforcement Learning for Fluid Mechanics","date":"2019-08-12","arxiv_id":"1908.04127","repositories_listed":1,"syntology":null},{"url":"/paper/free-lunch-saliency-via-attention-in-atari","slug":"free-lunch-saliency-via-attention-in-atari","title":"Free-Lunch Saliency via Attention in Atari Agents","date":"2019-08-07","arxiv_id":"1908.02511","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-computation-of-counterfactual","slug":"efficient-computation-of-counterfactual","title":"Efficient computation of counterfactual explanations of LVQ models","date":"2019-08-02","arxiv_id":"1908.00735","repositories_listed":1,"syntology":null},{"url":"/paper/a-survey-on-deep-learning-of-small-sample-in","slug":"a-survey-on-deep-learning-of-small-sample-in","title":"A Survey on Deep Learning of Small Sample in Biomedical Image Analysis","date":"2019-08-01","arxiv_id":"1908.00473","repositories_listed":1,"syntology":null},{"url":"/paper/fairsight-visual-analytics-for-fairness-in","slug":"fairsight-visual-analytics-for-fairness-in","title":"FairSight: Visual Analytics for Fairness in Decision Making","date":"2019-08-01","arxiv_id":"1908.00176","repositories_listed":1,"syntology":null},{"url":"/paper/reward-learning-for-efficient-reinforcement","slug":"reward-learning-for-efficient-reinforcement","title":"Reward Learning for Efficient Reinforcement Learning in Extractive Document Summarisation","date":"2019-07-30","arxiv_id":"1907.12894","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/reward-learning-for-efficient-reinforcement#ran","syntology_url":"https://syntology.ai/paper/1907.12894","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.12894"}},"official":{"repos":["UKPLab/ijcai2019-relis"],"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/faht-an-adaptive-fairness-aware-decision-tree","slug":"faht-an-adaptive-fairness-aware-decision-tree","title":"FAHT: An Adaptive Fairness-aware Decision Tree Classifier","date":"2019-07-16","arxiv_id":"1907.07237","repositories_listed":1,"syntology":null},{"url":"/paper/hello-its-gpt-2-how-can-i-help-you-towards","slug":"hello-its-gpt-2-how-can-i-help-you-towards","title":"Hello, It's GPT-2 -- How Can I Help You? Towards the Use of Pretrained Language Models for Task-Oriented Dialogue Systems","date":"2019-07-12","arxiv_id":"1907.05774","repositories_listed":1,"syntology":null},{"url":"/paper/visualization-of-emergency-department","slug":"visualization-of-emergency-department","title":"Visualization of Emergency Department Clinical Data for Interpretable Patient Phenotyping","date":"2019-07-05","arxiv_id":"1907.11039","repositories_listed":1,"syntology":null},{"url":"/paper/co-training-for-policy-learning","slug":"co-training-for-policy-learning","title":"Co-training for Policy Learning","date":"2019-07-03","arxiv_id":"1907.04484","repositories_listed":1,"syntology":null},{"url":"/paper/bridging-by-word-image-grounded-vocabulary","slug":"bridging-by-word-image-grounded-vocabulary","title":"Bridging by Word: Image Grounded Vocabulary Construction for Visual Captioning","date":"2019-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/who-sides-with-whom-towards-computational","slug":"who-sides-with-whom-towards-computational","title":"Who Sides with Whom? Towards Computational Construction of Discourse Networks for Political Debates","date":"2019-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/variational-quantum-circuits-and-deep","slug":"variational-quantum-circuits-and-deep","title":"Variational Quantum Circuits for Deep Reinforcement Learning","date":"2019-06-30","arxiv_id":"1907.00397","repositories_listed":1,"syntology":null},{"url":"/paper/cooperation-aware-reinforcement-learning-for","slug":"cooperation-aware-reinforcement-learning-for","title":"Cooperation-Aware Reinforcement Learning for Merging in Dense Traffic","date":"2019-06-26","arxiv_id":"1906.11021","repositories_listed":1,"syntology":null},{"url":"/paper/image-to-images-translation-for-multi-task","slug":"image-to-images-translation-for-multi-task","title":"Image to Images Translation for Multi-Task Organ Segmentation and Bone Suppression in Chest X-Ray Radiography","date":"2019-06-24","arxiv_id":"1906.10089","repositories_listed":1,"syntology":null},{"url":"/paper/reinforcement-learning-models-of-human","slug":"reinforcement-learning-models-of-human","title":"A Story of Two Streams: Reinforcement Learning Models from Human Behavior and Neuropsychiatry","date":"2019-06-21","arxiv_id":"1906.11286","repositories_listed":1,"syntology":null},{"url":"/paper/split-q-learning-reinforcement-learning-with","slug":"split-q-learning-reinforcement-learning-with","title":"Split Q Learning: Reinforcement Learning with Two-Stream Rewards","date":"2019-06-21","arxiv_id":"1906.12350","repositories_listed":1,"syntology":null},{"url":"/paper/a-hierarchical-architecture-for-sequential","slug":"a-hierarchical-architecture-for-sequential","title":"A Hierarchical Architecture for Sequential Decision-Making in Autonomous Driving using Deep Reinforcement Learning","date":"2019-06-20","arxiv_id":"1906.08464","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-modelling-in-practice-using","slug":"bayesian-modelling-in-practice-using","title":"Bayesian Modelling in Practice: Using Uncertainty to Improve Trustworthiness in Medical Applications","date":"2019-06-20","arxiv_id":"1906.08619","repositories_listed":1,"syntology":null},{"url":"/paper/the-price-of-local-fairness-in-multistage","slug":"the-price-of-local-fairness-in-multistage","title":"The Price of Local Fairness in Multistage Selection","date":"2019-06-15","arxiv_id":"1906.06613","repositories_listed":1,"syntology":null},{"url":"/paper/personalized-apprenticeship-learning-from","slug":"personalized-apprenticeship-learning-from","title":"Interpretable and Personalized Apprenticeship Scheduling: Learning Interpretable Scheduling Policies from Heterogeneous User Demonstrations","date":"2019-06-14","arxiv_id":"1906.06397","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/personalized-apprenticeship-learning-from#ran","syntology_url":"https://syntology.ai/paper/1906.06397","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.06397"}},"official":{"repos":["core-robotics-lab/personalized_neural_trees"],"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/reinforcement-knowledge-graph-reasoning-for","slug":"reinforcement-knowledge-graph-reasoning-for","title":"Reinforcement Knowledge Graph Reasoning for Explainable Recommendation","date":"2019-06-12","arxiv_id":"1906.05237","repositories_listed":1,"syntology":null},{"url":"/paper/reinforcement-learning-for-channel-coding","slug":"reinforcement-learning-for-channel-coding","title":"Reinforcement Learning for Channel Coding: Learned Bit-Flipping Decoding","date":"2019-06-11","arxiv_id":"1906.04448","repositories_listed":1,"syntology":null},{"url":"/paper/learning-fair-naive-bayes-classifiers-by","slug":"learning-fair-naive-bayes-classifiers-by","title":"Learning Fair Naive Bayes Classifiers by Discovering and Eliminating Discrimination Patterns","date":"2019-06-10","arxiv_id":"1906.03843","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/learning-fair-naive-bayes-classifiers-by#ran","syntology_url":"https://syntology.ai/paper/1906.03843","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.03843"}},"official":{"repos":["UCLA-StarAI/LearnFairNB"],"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/visual-field-prediction-using-recurrent","slug":"visual-field-prediction-using-recurrent","title":"Visual Field Prediction using Recurrent Neural Network","date":"2019-06-10","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/does-causal-coherence-predict-online-spread","slug":"does-causal-coherence-predict-online-spread","title":"Does Causal Coherence Predict Online Spread of Social Media?","date":"2019-06-05","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/lifelong-learning-with-a-changing-action-set","slug":"lifelong-learning-with-a-changing-action-set","title":"Lifelong Learning with a Changing Action Set","date":"2019-06-05","arxiv_id":"1906.01770","repositories_listed":1,"syntology":null},{"url":"/paper/reinforcement-learning-when-all-actions-are","slug":"reinforcement-learning-when-all-actions-are","title":"Reinforcement Learning When All Actions are Not Always Available","date":"2019-06-05","arxiv_id":"1906.01772","repositories_listed":1,"syntology":null},{"url":"/paper/a-meta-learning-recommender-system-for","slug":"a-meta-learning-recommender-system-for","title":"A meta-learning recommender system for hyperparameter tuning: predicting when tuning improves SVM classifiers","date":"2019-06-04","arxiv_id":"1906.01684","repositories_listed":1,"syntology":null},{"url":"/paper/190600744","slug":"190600744","title":"Hierarchical Decision Making by Generating and Following Natural Language Instructions","date":"2019-06-03","arxiv_id":"1906.00744","repositories_listed":1,"syntology":null},{"url":"/paper/eidos-indra-delphi-from-free-text-to","slug":"eidos-indra-delphi-from-free-text-to","title":"Eidos, INDRA, \\& Delphi: From Free Text to Executable Causal Models","date":"2019-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/exploring-computational-user-models-for-agent","slug":"exploring-computational-user-models-for-agent","title":"Exploring Computational User Models for Agent Policy Summarization","date":"2019-05-30","arxiv_id":"1905.13271","repositories_listed":1,"syntology":null},{"url":"/paper/neural-consciousness-flow","slug":"neural-consciousness-flow","title":"Neural Consciousness Flow","date":"2019-05-30","arxiv_id":"1905.13049","repositories_listed":1,"syntology":null},{"url":"/paper/quantifying-consensus-of-rankings-based-on-q","slug":"quantifying-consensus-of-rankings-based-on-q","title":"Quantifying consensus of rankings based on q-support patterns","date":"2019-05-30","arxiv_id":"1905.12966","repositories_listed":1,"syntology":null},{"url":"/paper/accelerating-monte-carlo-bayesian-inference","slug":"accelerating-monte-carlo-bayesian-inference","title":"Accelerating Monte Carlo Bayesian Inference via Approximating Predictive Uncertainty over Simplex","date":"2019-05-29","arxiv_id":"1905.12194","repositories_listed":1,"syntology":null},{"url":"/paper/fairness-and-missing-values","slug":"fairness-and-missing-values","title":"Fairness and Missing Values","date":"2019-05-29","arxiv_id":"1905.12728","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-discretize-solving-1d-scalar","slug":"learning-to-discretize-solving-1d-scalar","title":"Learning to Discretize: Solving 1D Scalar Conservation Laws via Deep Reinforcement Learning","date":"2019-05-27","arxiv_id":"1905.11079","repositories_listed":1,"syntology":null},{"url":"/paper/model-agnostic-counterfactual-explanations","slug":"model-agnostic-counterfactual-explanations","title":"Model-Agnostic Counterfactual Explanations for Consequential Decisions","date":"2019-05-27","arxiv_id":"1905.11190","repositories_listed":1,"syntology":null},{"url":"/paper/not-all-features-are-equal-feature-leveling","slug":"not-all-features-are-equal-feature-leveling","title":"Not All Features Are Equal: Feature Leveling Deep Neural Networks for Better Interpretation","date":"2019-05-24","arxiv_id":"1905.10009","repositories_listed":1,"syntology":null},{"url":"/paper/learning-when-to-treat-policies","slug":"learning-when-to-treat-policies","title":"Learning When-to-Treat Policies","date":"2019-05-23","arxiv_id":"1905.09751","repositories_listed":1,"syntology":null},{"url":"/paper/multi-hop-reading-comprehension-via-deep","slug":"multi-hop-reading-comprehension-via-deep","title":"Multi-hop Reading Comprehension via Deep Reinforcement Learning based Document Traversal","date":"2019-05-23","arxiv_id":"1905.09438","repositories_listed":1,"syntology":null},{"url":"/paper/optimal-decision-making-under-strategic","slug":"optimal-decision-making-under-strategic","title":"Optimal Decision Making Under Strategic Behavior","date":"2019-05-22","arxiv_id":"1905.09239","repositories_listed":1,"syntology":null},{"url":"/paper/thresholding-graph-bandits-with-grapl","slug":"thresholding-graph-bandits-with-grapl","title":"Thresholding Graph Bandits with GrAPL","date":"2019-05-22","arxiv_id":"1905.09190","repositories_listed":1,"syntology":null},{"url":"/paper/enabling-explainable-fusion-in-deep-learning","slug":"enabling-explainable-fusion-in-deep-learning","title":"Enabling Explainable Fusion in Deep Learning with Fuzzy Integral Neural Networks","date":"2019-05-10","arxiv_id":"1905.04394","repositories_listed":1,"syntology":null},{"url":"/paper/are-graph-neural-networks-miscalibrated","slug":"are-graph-neural-networks-miscalibrated","title":"Are Graph Neural Networks Miscalibrated?","date":"2019-05-07","arxiv_id":"1905.02296","repositories_listed":1,"syntology":null},{"url":"/paper/the-minerl-competition-on-sample-efficient","slug":"the-minerl-competition-on-sample-efficient","title":"The MineRL 2019 Competition on Sample Efficient Reinforcement Learning using Human Priors","date":"2019-04-22","arxiv_id":"1904.10079","repositories_listed":1,"syntology":null},{"url":"/paper/feature-forwarding-for-efficient-single-image","slug":"feature-forwarding-for-efficient-single-image","title":"Feature Forwarding for Efficient Single Image Dehazing","date":"2019-04-19","arxiv_id":"1904.09059","repositories_listed":1,"syntology":null},{"url":"/paper/visualizing-the-decision-making-process-in","slug":"visualizing-the-decision-making-process-in","title":"Visualizing the decision-making process in deep neural decision forest","date":"2019-04-19","arxiv_id":"1904.09201","repositories_listed":1,"syntology":null},{"url":"/paper/explaining-deep-classification-of-time-series","slug":"explaining-deep-classification-of-time-series","title":"Explaining Deep Classification of Time-Series Data with Learned Prototypes","date":"2019-04-18","arxiv_id":"1904.08935","repositories_listed":1,"syntology":null},{"url":"/paper/uncovering-convolutional-neural-network","slug":"uncovering-convolutional-neural-network","title":"Uncovering convolutional neural network decisions for diagnosing multiple sclerosis on conventional MRI using layer-wise relevance propagation","date":"2019-04-18","arxiv_id":"1904.08771","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":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) · 1 unverified","sample_list":"/paper/uncovering-convolutional-neural-network#ran","syntology_url":"https://syntology.ai/paper/1904.08771","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.08771"}},"official":{"repos":["derEitel/explainableMS"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/190408141","slug":"190408141","title":"MHP-VOS: Multiple Hypotheses Propagation for Video Object Segmentation","date":"2019-04-17","arxiv_id":"1904.08141","repositories_listed":1,"syntology":null},{"url":"/paper/moralstrength-exploiting-a-moral-lexicon-and","slug":"moralstrength-exploiting-a-moral-lexicon-and","title":"MoralStrength: Exploiting a Moral Lexicon and Embedding Similarity for Moral Foundations Prediction","date":"2019-04-17","arxiv_id":"1904.08314","repositories_listed":1,"syntology":null},{"url":"/paper/active-learning-for-decision-making-from","slug":"active-learning-for-decision-making-from","title":"Active Learning for Decision-Making from Imbalanced Observational Data","date":"2019-04-10","arxiv_id":"1904.05268","repositories_listed":1,"syntology":null},{"url":"/paper/quizbowl-the-case-for-incremental-question","slug":"quizbowl-the-case-for-incremental-question","title":"Quizbowl: The Case for Incremental Question Answering","date":"2019-04-09","arxiv_id":"1904.04792","repositories_listed":1,"syntology":{"n":14,"n_ran":14,"n_constructed":0,"n_ran_checked":14,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":0,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/quizbowl-the-case-for-incremental-question#ran","syntology_url":"https://syntology.ai/paper/1904.04792","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.04792"}},"official":null}},{"url":"/paper/regression-concept-vectors-for-bidirectional","slug":"regression-concept-vectors-for-bidirectional","title":"Regression Concept Vectors for Bidirectional Explanations in Histopathology","date":"2019-04-09","arxiv_id":"1904.04520","repositories_listed":1,"syntology":null},{"url":"/paper/190311198","slug":"190311198","title":"Parallel Experimentation and Competitive Interference on Online Advertising Platforms","date":"2019-03-27","arxiv_id":"1903.11198","repositories_listed":1,"syntology":null},{"url":"/paper/symbolic-regression-for-constructing-analytic","slug":"symbolic-regression-for-constructing-analytic","title":"Constructing Parsimonious Analytic Models for Dynamic Systems via Symbolic Regression","date":"2019-03-27","arxiv_id":"1903.11483","repositories_listed":1,"syntology":null},{"url":"/paper/analyzing-dynamic-decision-making-models","slug":"analyzing-dynamic-decision-making-models","title":"Analyzing dynamic decision-making models using Chapman-Kolmogorov equations","date":"2019-03-25","arxiv_id":"1903.10131","repositories_listed":1,"syntology":null},{"url":"/paper/predicting-multiple-demographic-attributes","slug":"predicting-multiple-demographic-attributes","title":"Predicting Multiple Demographic Attributes with Task Specific Embedding Transformation and Attention Network","date":"2019-03-25","arxiv_id":"1903.10144","repositories_listed":1,"syntology":null},{"url":"/paper/deep-gaussian-processes-for-multi-fidelity","slug":"deep-gaussian-processes-for-multi-fidelity","title":"Deep Gaussian Processes for Multi-fidelity Modeling","date":"2019-03-18","arxiv_id":"1903.07320","repositories_listed":1,"syntology":null},{"url":"/paper/atari-head-atari-human-eye-tracking-and","slug":"atari-head-atari-human-eye-tracking-and","title":"Atari-HEAD: Atari Human Eye-Tracking and Demonstration Dataset","date":"2019-03-15","arxiv_id":"1903.06754","repositories_listed":1,"syntology":null},{"url":"/paper/deep-distribution-regression","slug":"deep-distribution-regression","title":"Deep Distribution Regression","date":"2019-03-14","arxiv_id":"1903.06023","repositories_listed":1,"syntology":null},{"url":"/paper/fair-logistic-regression-an-adversarial","slug":"fair-logistic-regression-an-adversarial","title":"Fairness for Robust Log Loss Classification","date":"2019-03-10","arxiv_id":"1903.03910","repositories_listed":1,"syntology":null},{"url":"/paper/the-regretful-navigation-agent-for-vision-and","slug":"the-regretful-navigation-agent-for-vision-and","title":"The Regretful Navigation Agent for Vision-and-Language Navigation","date":"2019-03-05","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/on-the-long-term-impact-of-algorithmic","slug":"on-the-long-term-impact-of-algorithmic","title":"On the Long-term Impact of Algorithmic Decision Policies: Effort Unfairness and Feature Segregation through Social Learning","date":"2019-03-04","arxiv_id":"1903.01209","repositories_listed":1,"syntology":null},{"url":"/paper/information-gathering-in-decentralized-pomdps","slug":"information-gathering-in-decentralized-pomdps","title":"Information Gathering in Decentralized POMDPs by Policy Graph Improvement","date":"2019-02-26","arxiv_id":"1902.09840","repositories_listed":1,"syntology":null},{"url":"/paper/seeing-through-fog-without-seeing-fog-deep","slug":"seeing-through-fog-without-seeing-fog-deep","title":"Seeing Through Fog Without Seeing Fog: Deep Multimodal Sensor Fusion in Unseen Adverse Weather","date":"2019-02-24","arxiv_id":"1902.08913","repositories_listed":1,"syntology":null},{"url":"/paper/stable-and-fair-classification","slug":"stable-and-fair-classification","title":"Stable and Fair Classification","date":"2019-02-21","arxiv_id":"1902.07823","repositories_listed":1,"syntology":null},{"url":"/paper/meaningful-representations-emerge-from-sparse","slug":"meaningful-representations-emerge-from-sparse","title":"Sparse Deep Predictive Coding captures contour integration capabilities of the early visual system","date":"2019-02-20","arxiv_id":"1902.07651","repositories_listed":1,"syntology":null},{"url":"/paper/evaluating-model-calibration-in","slug":"evaluating-model-calibration-in","title":"Evaluating model calibration in classification","date":"2019-02-19","arxiv_id":"1902.06977","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/evaluating-model-calibration-in#ran","syntology_url":"https://syntology.ai/paper/1902.06977","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.06977"}},"official":{"repos":["uu-sml/calibration"],"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/adaptive-sequence-submodularity","slug":"adaptive-sequence-submodularity","title":"Adaptive Sequence Submodularity","date":"2019-02-15","arxiv_id":"1902.05981","repositories_listed":1,"syntology":null},{"url":"/paper/a-survey-on-session-based-recommender-systems","slug":"a-survey-on-session-based-recommender-systems","title":"A Survey on Session-based Recommender Systems","date":"2019-02-13","arxiv_id":"1902.04864","repositories_listed":1,"syntology":null},{"url":"/paper/nail-a-general-interactive-fiction-agent","slug":"nail-a-general-interactive-fiction-agent","title":"NAIL: A General Interactive Fiction Agent","date":"2019-02-12","arxiv_id":"1902.04259","repositories_listed":1,"syntology":null},{"url":"/paper/improving-consequential-decision-making-under","slug":"improving-consequential-decision-making-under","title":"Fair Decisions Despite Imperfect Predictions","date":"2019-02-08","arxiv_id":"1902.02979","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-real-time-multimodal-routing-with","slug":"dynamic-real-time-multimodal-routing-with","title":"Dynamic Real-time Multimodal Routing with Hierarchical Hybrid Planning","date":"2019-02-05","arxiv_id":"1902.01560","repositories_listed":1,"syntology":null},{"url":"/paper/certified-reinforcement-learning-with-logic","slug":"certified-reinforcement-learning-with-logic","title":"Certified Reinforcement Learning with Logic Guidance","date":"2019-02-02","arxiv_id":"1902.00778","repositories_listed":1,"syntology":null},{"url":"/paper/variational-bayesian-decision-making-for","slug":"variational-bayesian-decision-making-for","title":"Variational Bayesian Decision-making for Continuous Utilities","date":"2019-02-02","arxiv_id":"1902.00792","repositories_listed":1,"syntology":null},{"url":"/paper/the-hanabi-challenge-a-new-frontier-for-ai","slug":"the-hanabi-challenge-a-new-frontier-for-ai","title":"The Hanabi Challenge: A New Frontier for AI Research","date":"2019-02-01","arxiv_id":"1902.00506","repositories_listed":1,"syntology":null},{"url":"/paper/end-to-end-knowledge-routed-relational","slug":"end-to-end-knowledge-routed-relational","title":"End-to-End Knowledge-Routed Relational Dialogue System for Automatic Diagnosis","date":"2019-01-30","arxiv_id":"1901.10623","repositories_listed":1,"syntology":null},{"url":"/paper/multi-agent-generalized-recursive-reasoning","slug":"multi-agent-generalized-recursive-reasoning","title":"Modelling Bounded Rationality in Multi-Agent Interactions by Generalized Recursive Reasoning","date":"2019-01-26","arxiv_id":"1901.09216","repositories_listed":1,"syntology":{"n":10,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/multi-agent-generalized-recursive-reasoning#ran","syntology_url":"https://syntology.ai/paper/1901.09216","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.09216"}},"official":{"repos":["ying-wen/gr2"],"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/bottom-up-broadcast-neural-network-for-music","slug":"bottom-up-broadcast-neural-network-for-music","title":"Bottom-up Broadcast Neural Network For Music Genre Classification","date":"2019-01-24","arxiv_id":"1901.08928","repositories_listed":1,"syntology":null},{"url":"/paper/fairness-with-dynamics","slug":"fairness-with-dynamics","title":"Algorithms for Fairness in Sequential Decision Making","date":"2019-01-24","arxiv_id":"1901.08568","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/fairness-with-dynamics#ran","syntology_url":"https://syntology.ai/paper/1901.08568","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.08568"}},"official":{"repos":["wmgithub/fairness"],"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"]}}}],"record_sha256":"b04bd31a5dd37a6e6da9704975566d667e07f37a7faa4e1a116357650d74cd67","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}