{"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/19","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":19,"pages_in_order":124,"rows_per_page":100,"rows":[1801,1900],"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/18","next":"/task/decision-making/papers/20","papers":[{"url":"/paper/semi-supervised-semantics-guided-adversarial-1","slug":"semi-supervised-semantics-guided-adversarial-1","title":"Semi-supervised Semantics-guided Adversarial Training for Robust Trajectory Prediction","date":"2023-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/toward-multi-granularity-decision-making","slug":"toward-multi-granularity-decision-making","title":"Toward Multi-Granularity Decision-Making: Explicit Visual Reasoning with Hierarchical Knowledge","date":"2023-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/risk-sensitive-policy-with-distributional","slug":"risk-sensitive-policy-with-distributional","title":"Risk-Sensitive Policy with Distributional Reinforcement Learning","date":"2022-12-30","arxiv_id":"2212.14743","repositories_listed":1,"syntology":null},{"url":"/paper/transformer-in-transformer-as-backbone-for","slug":"transformer-in-transformer-as-backbone-for","title":"Transformer in Transformer as Backbone for Deep Reinforcement Learning","date":"2022-12-30","arxiv_id":"2212.14538","repositories_listed":1,"syntology":null},{"url":"/paper/near-optimal-non-parametric-sequential-tests","slug":"near-optimal-non-parametric-sequential-tests","title":"Near-Optimal Non-Parametric Sequential Tests and Confidence Sequences with Possibly Dependent Observations","date":"2022-12-29","arxiv_id":"2212.14411","repositories_listed":1,"syntology":null},{"url":"/paper/on-realization-of-intelligent-decision-making","slug":"on-realization-of-intelligent-decision-making","title":"On Realization of Intelligent Decision-Making in the Real World: A Foundation Decision Model Perspective","date":"2022-12-24","arxiv_id":"2212.12669","repositories_listed":1,"syntology":null},{"url":"/paper/a-learning-based-approach-to-multi-agent","slug":"a-learning-based-approach-to-multi-agent","title":"An active learning method for solving competitive multi-agent decision-making and control problems","date":"2022-12-23","arxiv_id":"2212.12561","repositories_listed":1,"syntology":null},{"url":"/paper/decision-making-and-control-with-metasurface","slug":"decision-making-and-control-with-metasurface","title":"Decision-making and control with diffractive optical networks","date":"2022-12-21","arxiv_id":"2212.11278","repositories_listed":1,"syntology":null},{"url":"/paper/towards-reasoning-in-large-language-models-a","slug":"towards-reasoning-in-large-language-models-a","title":"Towards Reasoning in Large Language Models: A Survey","date":"2022-12-20","arxiv_id":"2212.10403","repositories_listed":1,"syntology":null},{"url":"/paper/cognitive-accident-prediction-in-driving","slug":"cognitive-accident-prediction-in-driving","title":"Cognitive Accident Prediction in Driving Scenes: A Multimodality Benchmark","date":"2022-12-19","arxiv_id":"2212.09381","repositories_listed":1,"syntology":null},{"url":"/paper/robust-predictive-output-feedback-safety","slug":"robust-predictive-output-feedback-safety","title":"Robust Predictive Output-Feedback Safety Filter for Uncertain Nonlinear Control Systems","date":"2022-12-17","arxiv_id":"2212.08900","repositories_listed":1,"syntology":null},{"url":"/paper/reco-reliable-causal-chain-reasoning-via","slug":"reco-reliable-causal-chain-reasoning-via","title":"ReCo: Reliable Causal Chain Reasoning via Structural Causal Recurrent Neural Networks","date":"2022-12-16","arxiv_id":"2212.08322","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":2,"n_ran_checked":3,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":6,"phrase":"4 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/reco-reliable-causal-chain-reasoning-via#ran","syntology_url":"https://syntology.ai/paper/2212.08322","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.08322"}},"official":{"repos":["waste-wood/reco"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":2,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/bridging-pomdps-and-bayesian-decision-making","slug":"bridging-pomdps-and-bayesian-decision-making","title":"Bridging POMDPs and Bayesian decision making for robust maintenance planning under model uncertainty: An application to railway systems","date":"2022-12-15","arxiv_id":"2212.07933","repositories_listed":1,"syntology":null},{"url":"/paper/multi-resolution-online-deterministic","slug":"multi-resolution-online-deterministic","title":"Multi-Resolution Online Deterministic Annealing: A Hierarchical and Progressive Learning Architecture","date":"2022-12-15","arxiv_id":"2212.08189","repositories_listed":1,"syntology":null},{"url":"/paper/hybrid-multi-agent-deep-reinforcement","slug":"hybrid-multi-agent-deep-reinforcement","title":"Hybrid Multi-agent Deep Reinforcement Learning for Autonomous Mobility on Demand Systems","date":"2022-12-14","arxiv_id":"2212.07313","repositories_listed":1,"syntology":null},{"url":"/paper/autoregressive-bandits","slug":"autoregressive-bandits","title":"Autoregressive Bandits","date":"2022-12-12","arxiv_id":"2212.06251","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/autoregressive-bandits#ran","syntology_url":"https://syntology.ai/paper/2212.06251","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.06251"}},"official":{"repos":["gianmarcogenalti/autoregressive-bandits"],"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/optimal-planning-of-hybrid-energy-storage","slug":"optimal-planning-of-hybrid-energy-storage","title":"Optimal Planning of Hybrid Energy Storage Systems using Curtailed Renewable Energy through Deep Reinforcement Learning","date":"2022-12-12","arxiv_id":"2212.05662","repositories_listed":1,"syntology":null},{"url":"/paper/reinforcement-learning-and-tree-search","slug":"reinforcement-learning-and-tree-search","title":"Reinforcement Learning and Tree Search Methods for the Unit Commitment Problem","date":"2022-12-12","arxiv_id":"2212.06001","repositories_listed":1,"syntology":null},{"url":"/paper/lookahead-pathology-in-monte-carlo-tree","slug":"lookahead-pathology-in-monte-carlo-tree","title":"Lookahead Pathology in Monte-Carlo Tree Search","date":"2022-12-10","arxiv_id":"2212.05208","repositories_listed":1,"syntology":null},{"url":"/paper/scoring-rules-in-survival-analysis","slug":"scoring-rules-in-survival-analysis","title":"Examining marginal properness in the external validation of survival models with squared and logarithmic losses","date":"2022-12-10","arxiv_id":"2212.05260","repositories_listed":1,"syntology":null},{"url":"/paper/information-theoretic-safe-exploration-with","slug":"information-theoretic-safe-exploration-with","title":"Information-Theoretic Safe Exploration with Gaussian Processes","date":"2022-12-09","arxiv_id":"2212.04914","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":2,"n_ran_checked":5,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":4,"n_pointer_only":8,"phrase":"6 ran (of which 2 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 1 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/information-theoretic-safe-exploration-with#ran","syntology_url":"https://syntology.ai/paper/2212.04914","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.04914"}},"official":{"repos":["boschresearch/information-theoretic-safe-exploration"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":2,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/fairify-fairness-verification-of-neural","slug":"fairify-fairness-verification-of-neural","title":"Fairify: Fairness Verification of Neural Networks","date":"2022-12-08","arxiv_id":"2212.06140","repositories_listed":1,"syntology":{"n":5,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 5 unverified","sample_list":"/paper/fairify-fairness-verification-of-neural#ran","syntology_url":"https://syntology.ai/paper/2212.06140","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.06140"}},"official":{"repos":["sumonbis/farify"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":5,"ran_from_kinds":[]}}},{"url":"/paper/fairness-and-explainability-bridging-the-gap","slug":"fairness-and-explainability-bridging-the-gap","title":"Fairness and Explainability: Bridging the Gap Towards Fair Model Explanations","date":"2022-12-07","arxiv_id":"2212.03840","repositories_listed":1,"syntology":null},{"url":"/paper/solving-the-side-chain-packing-arrangement-of","slug":"solving-the-side-chain-packing-arrangement-of","title":"Reinforcement Learning for Molecular Dynamics Optimization: A Stochastic Pontryagin Maximum Principle Approach","date":"2022-12-06","arxiv_id":"2212.03320","repositories_listed":1,"syntology":null},{"url":"/paper/super-resolution-probabilistic-rain","slug":"super-resolution-probabilistic-rain","title":"Super-resolution Probabilistic Rain Prediction from Satellite Data Using 3D U-Nets and EarthFormers","date":"2022-12-06","arxiv_id":"2212.02998","repositories_listed":1,"syntology":{"n":20,"n_ran":18,"n_constructed":0,"n_ran_checked":15,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":15,"n_pointer_only":0,"phrase":"18 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 0 honoured, 0 violated, 15 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/super-resolution-probabilistic-rain#ran","syntology_url":"https://syntology.ai/paper/2212.02998","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.02998"}},"official":{"repos":["bugsuse/weather4cast-2022-stage2"],"state":"official (archive's flag): 18 ran","n_ran":18,"n_constructed":0,"n_ran_no_instrument_failure":15,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/certifying-fairness-of-probabilistic-circuits","slug":"certifying-fairness-of-probabilistic-circuits","title":"Certifying Fairness of Probabilistic Circuits","date":"2022-12-05","arxiv_id":"2212.02474","repositories_listed":1,"syntology":null},{"url":"/paper/this-changes-to-that-combining-causal-and-non","slug":"this-changes-to-that-combining-causal-and-non","title":"This changes to that : Combining causal and non-causal explanations to generate disease progression in capsule endoscopy","date":"2022-12-05","arxiv_id":"2212.02506","repositories_listed":1,"syntology":null},{"url":"/paper/rlogist-fast-observation-strategy-on-whole","slug":"rlogist-fast-observation-strategy-on-whole","title":"RLogist: Fast Observation Strategy on Whole-slide Images with Deep Reinforcement Learning","date":"2022-12-04","arxiv_id":"2212.01737","repositories_listed":1,"syntology":null},{"url":"/paper/laplacian-convolutional-representation-for","slug":"laplacian-convolutional-representation-for","title":"Laplacian Convolutional Representation for Traffic Time Series Imputation","date":"2022-12-03","arxiv_id":"2212.01529","repositories_listed":1,"syntology":null},{"url":"/paper/simplemind-adds-thinking-to-deep-neural","slug":"simplemind-adds-thinking-to-deep-neural","title":"SimpleMind adds thinking to deep neural networks","date":"2022-12-02","arxiv_id":"2212.00951","repositories_listed":1,"syntology":null},{"url":"/paper/evidential-conditional-neural-processes","slug":"evidential-conditional-neural-processes","title":"Evidential Conditional Neural Processes","date":"2022-11-30","arxiv_id":"2212.00131","repositories_listed":1,"syntology":null},{"url":"/paper/one-risk-to-rule-them-all-a-risk-sensitive-1","slug":"one-risk-to-rule-them-all-a-risk-sensitive-1","title":"One Risk to Rule Them All: A Risk-Sensitive Perspective on Model-Based Offline Reinforcement Learning","date":"2022-11-30","arxiv_id":"2212.00124","repositories_listed":1,"syntology":{"n":23,"n_ran":14,"n_constructed":4,"n_ran_checked":8,"n_instrument":6,"n_unverified":9,"n_honours":2,"n_violates":0,"n_no_contract":6,"n_pointer_only":3,"phrase":"14 ran (of which 4 constructed an object rather than computing a result; 8 with no instrument failure: 2 honoured, 0 violated, 6 with no contract checked; 6 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/one-risk-to-rule-them-all-a-risk-sensitive-1#ran","syntology_url":"https://syntology.ai/paper/2212.00124","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.00124"}},"official":{"repos":["marc-rigter/1r2r"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["found_in_text","official","unlocated"]}}},{"url":"/paper/ace-cooperative-multi-agent-q-learning-with","slug":"ace-cooperative-multi-agent-q-learning-with","title":"ACE: Cooperative Multi-agent Q-learning with Bidirectional Action-Dependency","date":"2022-11-29","arxiv_id":"2211.16068","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/ace-cooperative-multi-agent-q-learning-with#ran","syntology_url":"https://syntology.ai/paper/2211.16068","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.16068"}},"official":{"repos":["opendilab/ace"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/anderson-acceleration-for-partially","slug":"anderson-acceleration-for-partially","title":"Anderson Acceleration for Partially Observable Markov Decision Processes: A Maximum Entropy Approach","date":"2022-11-28","arxiv_id":"2211.14998","repositories_listed":1,"syntology":null},{"url":"/paper/semi-supervised-specific-emitter","slug":"semi-supervised-specific-emitter","title":"Semi-Supervised Specific Emitter Identification Method Using Metric-Adversarial Training","date":"2022-11-28","arxiv_id":"2211.15379","repositories_listed":1,"syntology":null},{"url":"/paper/task-aware-asynchronous-multi-task-model-with","slug":"task-aware-asynchronous-multi-task-model-with","title":"Task-Aware Asynchronous Multi-Task Model with Class Incremental Contrastive Learning for Surgical Scene Understanding","date":"2022-11-28","arxiv_id":"2211.15327","repositories_listed":1,"syntology":null},{"url":"/paper/explain-it-in-the-same-way-model-agnostic","slug":"explain-it-in-the-same-way-model-agnostic","title":"\"Explain it in the Same Way!\" -- Model-Agnostic Group Fairness of Counterfactual Explanations","date":"2022-11-27","arxiv_id":"2211.14858","repositories_listed":1,"syntology":null},{"url":"/paper/how-crucial-is-transformer-in-decision","slug":"how-crucial-is-transformer-in-decision","title":"How Crucial is Transformer in Decision Transformer?","date":"2022-11-26","arxiv_id":"2211.14655","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/how-crucial-is-transformer-in-decision#ran","syntology_url":"https://syntology.ai/paper/2211.14655","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.14655"}},"official":{"repos":["max7born/decision-lstm"],"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","unlocated"]}}},{"url":"/paper/towards-interpretable-anomaly-detection-via","slug":"towards-interpretable-anomaly-detection-via","title":"Learning Invariant Rules from Data for Interpretable Anomaly Detection","date":"2022-11-24","arxiv_id":"2211.13577","repositories_listed":1,"syntology":null},{"url":"/paper/masked-autoencoding-for-scalable-and","slug":"masked-autoencoding-for-scalable-and","title":"Masked Autoencoding for Scalable and Generalizable Decision Making","date":"2022-11-23","arxiv_id":"2211.12740","repositories_listed":1,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":8,"n_instrument":2,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":7,"n_pointer_only":1,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/masked-autoencoding-for-scalable-and#ran","syntology_url":"https://syntology.ai/paper/2211.12740","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.12740"}},"official":{"repos":["fangchenliu/maskdp_public"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/b-multivariational-autoencoder-for-entangled","slug":"b-multivariational-autoencoder-for-entangled","title":"$β$-Multivariational Autoencoder for Entangled Representation Learning in Video Frames","date":"2022-11-22","arxiv_id":"2211.12627","repositories_listed":1,"syntology":null},{"url":"/paper/big-earth-data-and-machine-learning-for","slug":"big-earth-data-and-machine-learning-for","title":"Big Earth Data and Machine Learning for Sustainable and Resilient Agriculture","date":"2022-11-22","arxiv_id":"2211.12584","repositories_listed":1,"syntology":null},{"url":"/paper/decision-making-with-imaginary-opponent","slug":"decision-making-with-imaginary-opponent","title":"Decision-making with Speculative Opponent Models","date":"2022-11-22","arxiv_id":"2211.11940","repositories_listed":1,"syntology":null},{"url":"/paper/unimask-unified-inference-in-sequential","slug":"unimask-unified-inference-in-sequential","title":"UniMASK: Unified Inference in Sequential Decision Problems","date":"2022-11-20","arxiv_id":"2211.10869","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/unimask-unified-inference-in-sequential#ran","syntology_url":"https://syntology.ai/paper/2211.10869","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.10869"}},"official":{"repos":["micahcarroll/unimask"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/data-adaptive-discriminative-feature","slug":"data-adaptive-discriminative-feature","title":"Data-Adaptive Discriminative Feature Localization with Statistically Guaranteed Interpretation","date":"2022-11-18","arxiv_id":"2211.10061","repositories_listed":1,"syntology":null},{"url":"/paper/do-graph-neural-networks-learn-traditional","slug":"do-graph-neural-networks-learn-traditional","title":"Do graph neural networks learn traditional jet substructure?","date":"2022-11-17","arxiv_id":"2211.09912","repositories_listed":1,"syntology":{"n":7,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/do-graph-neural-networks-learn-traditional#ran","syntology_url":"https://syntology.ai/paper/2211.09912","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.09912"}},"official":{"repos":["farakiko/xai4hep"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/dynamical-linear-bandits","slug":"dynamical-linear-bandits","title":"Dynamical Linear Bandits","date":"2022-11-16","arxiv_id":"2211.08997","repositories_listed":1,"syntology":null},{"url":"/paper/agent-state-construction-with-auxiliary","slug":"agent-state-construction-with-auxiliary","title":"Agent-State Construction with Auxiliary Inputs","date":"2022-11-15","arxiv_id":"2211.07805","repositories_listed":1,"syntology":null},{"url":"/paper/neural-bayesian-network-understudy","slug":"neural-bayesian-network-understudy","title":"Neural Bayesian Network Understudy","date":"2022-11-15","arxiv_id":"2211.08243","repositories_listed":1,"syntology":null},{"url":"/paper/weighted-sum-rate-maximization-with-causal","slug":"weighted-sum-rate-maximization-with-causal","title":"Weighted Sum-Rate Maximization With Causal Inference for Latent Interference Estimation","date":"2022-11-15","arxiv_id":"2211.08327","repositories_listed":1,"syntology":null},{"url":"/paper/towards-data-driven-offline-simulations-for","slug":"towards-data-driven-offline-simulations-for","title":"Towards Data-Driven Offline Simulations for Online Reinforcement Learning","date":"2022-11-14","arxiv_id":"2211.07614","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/towards-data-driven-offline-simulations-for#ran","syntology_url":"https://syntology.ai/paper/2211.07614","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.07614"}},"official":{"repos":["microsoft/rl-offline-simulation"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/treatment-rspn-recurrent-sum-product-networks","slug":"treatment-rspn-recurrent-sum-product-networks","title":"Treatment-RSPN: Recurrent Sum-Product Networks for Sequential Treatment Regimes","date":"2022-11-14","arxiv_id":"2211.07052","repositories_listed":1,"syntology":null},{"url":"/paper/language-model-classifier-aligns-better-with","slug":"language-model-classifier-aligns-better-with","title":"Language Model Classifier Aligns Better with Physician Word Sensitivity than XGBoost on Readmission Prediction","date":"2022-11-13","arxiv_id":"2211.07047","repositories_listed":1,"syntology":null},{"url":"/paper/rise-robust-individualized-decision-learning","slug":"rise-robust-individualized-decision-learning","title":"RISE: Robust Individualized Decision Learning with Sensitive Variables","date":"2022-11-12","arxiv_id":"2211.06569","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/rise-robust-individualized-decision-learning#ran","syntology_url":"https://syntology.ai/paper/2211.06569","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.06569"}},"official":{"repos":["ellenxtan/rise"],"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/adaptive-real-time-exploration-and","slug":"adaptive-real-time-exploration-and","title":"Safe and Adaptive Decision-Making for Optimization of Safety-Critical Systems: The ARTEO Algorithm","date":"2022-11-10","arxiv_id":"2211.05495","repositories_listed":1,"syntology":null},{"url":"/paper/doubly-inhomogeneous-reinforcement-learning","slug":"doubly-inhomogeneous-reinforcement-learning","title":"Doubly Inhomogeneous Reinforcement Learning","date":"2022-11-08","arxiv_id":"2211.03983","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-follow-instructions-in-text-based","slug":"learning-to-follow-instructions-in-text-based","title":"Learning to Follow Instructions in Text-Based Games","date":"2022-11-08","arxiv_id":"2211.04591","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-to-follow-instructions-in-text-based#ran","syntology_url":"https://syntology.ai/paper/2211.04591","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.04591"}},"official":{"repos":["mathieutuli/ltl-gata"],"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/sotif-entropy-online-sotif-risk","slug":"sotif-entropy-online-sotif-risk","title":"SOTIF Entropy: Online SOTIF Risk Quantification and Mitigation for Autonomous Driving","date":"2022-11-08","arxiv_id":"2211.04009","repositories_listed":1,"syntology":null},{"url":"/paper/developing-decentralised-resilience-to","slug":"developing-decentralised-resilience-to","title":"Developing Decentralised Resilience to Malicious Influence in Collective Perception Problem","date":"2022-11-06","arxiv_id":"2211.03063","repositories_listed":1,"syntology":null},{"url":"/paper/beyond-spiking-networks-the-computational","slug":"beyond-spiking-networks-the-computational","title":"Beyond spiking networks: the computational advantages of dendritic amplification and input segregation","date":"2022-11-04","arxiv_id":"2211.02553","repositories_listed":1,"syntology":null},{"url":"/paper/fair-and-optimal-classification-via","slug":"fair-and-optimal-classification-via","title":"Fair and Optimal Classification via Post-Processing","date":"2022-11-03","arxiv_id":"2211.01528","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/fair-and-optimal-classification-via#ran","syntology_url":"https://syntology.ai/paper/2211.01528","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.01528"}},"official":{"repos":["rxian/fair-classification"],"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/pinto-faithful-language-reasoning-using","slug":"pinto-faithful-language-reasoning-using","title":"PINTO: Faithful Language Reasoning Using Prompt-Generated Rationales","date":"2022-11-03","arxiv_id":"2211.01562","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/pinto-faithful-language-reasoning-using#ran","syntology_url":"https://syntology.ai/paper/2211.01562","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.01562"}},"official":{"repos":["wangpf3/pinto-faithful-language-reasoning"],"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/robust-few-shot-learning-without-using-any","slug":"robust-few-shot-learning-without-using-any","title":"Robust Few-shot Learning Without Using any Adversarial Samples","date":"2022-11-03","arxiv_id":"2211.01598","repositories_listed":1,"syntology":null},{"url":"/paper/adptriage-approximate-dynamic-programming-for","slug":"adptriage-approximate-dynamic-programming-for","title":"ADPTriage: Approximate Dynamic Programming for Bug Triage","date":"2022-11-02","arxiv_id":"2211.00872","repositories_listed":1,"syntology":null},{"url":"/paper/camanet-class-activation-map-guided-attention","slug":"camanet-class-activation-map-guided-attention","title":"CAMANet: Class Activation Map Guided Attention Network for Radiology Report Generation","date":"2022-11-02","arxiv_id":"2211.01412","repositories_listed":1,"syntology":null},{"url":"/paper/dungeons-and-data-a-large-scale-nethack","slug":"dungeons-and-data-a-large-scale-nethack","title":"Dungeons and Data: A Large-Scale NetHack Dataset","date":"2022-11-01","arxiv_id":"2211.00539","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/dungeons-and-data-a-large-scale-nethack#ran","syntology_url":"https://syntology.ai/paper/2211.00539","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.00539"}},"official":{"repos":["facebookresearch/nle"],"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/robust-data-valuation-via-variance-reduced","slug":"robust-data-valuation-via-variance-reduced","title":"Variance reduced Shapley value estimation for trustworthy data valuation","date":"2022-10-30","arxiv_id":"2210.16835","repositories_listed":1,"syntology":null},{"url":"/paper/towards-versatile-embodied-navigation","slug":"towards-versatile-embodied-navigation","title":"Towards Versatile Embodied Navigation","date":"2022-10-30","arxiv_id":"2210.16822","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/towards-versatile-embodied-navigation#ran","syntology_url":"https://syntology.ai/paper/2210.16822","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.16822"}},"official":{"repos":["hanqingwangai/vxn"],"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/a-knowledge-driven-vowel-based-approach-of","slug":"a-knowledge-driven-vowel-based-approach-of","title":"A knowledge-driven vowel-based approach of depression classification from speech using data augmentation","date":"2022-10-27","arxiv_id":"2210.15261","repositories_listed":1,"syntology":null},{"url":"/paper/bionli-generating-a-biomedical-nli-dataset","slug":"bionli-generating-a-biomedical-nli-dataset","title":"BioNLI: Generating a Biomedical NLI Dataset Using Lexico-semantic Constraints for Adversarial Examples","date":"2022-10-26","arxiv_id":"2210.14814","repositories_listed":1,"syntology":null},{"url":"/paper/clinically-inspired-multi-agent-transformers","slug":"clinically-inspired-multi-agent-transformers","title":"Clinically-Inspired Multi-Agent Transformers for Disease Trajectory Forecasting from Multimodal Data","date":"2022-10-25","arxiv_id":"2210.13889","repositories_listed":1,"syntology":null},{"url":"/paper/i-prefer-not-to-say-operationalizing-fair-and","slug":"i-prefer-not-to-say-operationalizing-fair-and","title":"I Prefer not to Say: Protecting User Consent in Models with Optional Personal Data","date":"2022-10-25","arxiv_id":"2210.13954","repositories_listed":1,"syntology":{"n":5,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"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) · 4 unverified","sample_list":"/paper/i-prefer-not-to-say-operationalizing-fair-and#ran","syntology_url":"https://syntology.ai/paper/2210.13954","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.13954"}},"official":{"repos":["tleemann/protectedconsent"],"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/popart-efficient-sparse-regression-and","slug":"popart-efficient-sparse-regression-and","title":"PopArt: Efficient Sparse Regression and Experimental Design for Optimal Sparse Linear Bandits","date":"2022-10-25","arxiv_id":"2210.15345","repositories_listed":1,"syntology":null},{"url":"/paper/graded-q-reinforcement-learning-with","slug":"graded-q-reinforcement-learning-with","title":"Graded-Q Reinforcement Learning with Information-Enhanced State Encoder for Hierarchical Collaborative Multi-Vehicle Pursuit","date":"2022-10-24","arxiv_id":"2210.13470","repositories_listed":1,"syntology":null},{"url":"/paper/fmri-from-eeg-is-only-deep-learning-away-the","slug":"fmri-from-eeg-is-only-deep-learning-away-the","title":"fMRI from EEG is only Deep Learning away: the use of interpretable DL to unravel EEG-fMRI relationships","date":"2022-10-23","arxiv_id":"2211.02024","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-optimization-with-conformal-coverage","slug":"bayesian-optimization-with-conformal-coverage","title":"Bayesian Optimization with Conformal Prediction Sets","date":"2022-10-22","arxiv_id":"2210.12496","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/bayesian-optimization-with-conformal-coverage#ran","syntology_url":"https://syntology.ai/paper/2210.12496","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.12496"}},"official":{"repos":["samuelstanton/conformal-bayesopt"],"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/policy-optimization-with-advantage","slug":"policy-optimization-with-advantage","title":"Policy Optimization with Advantage Regularization for Long-Term Fairness in Decision Systems","date":"2022-10-22","arxiv_id":"2210.12546","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/policy-optimization-with-advantage#ran","syntology_url":"https://syntology.ai/paper/2210.12546","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.12546"}},"official":{"repos":["ericyangyu/pocar"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/calibration-tests-beyond-classification-1","slug":"calibration-tests-beyond-classification-1","title":"Calibration tests beyond classification","date":"2022-10-21","arxiv_id":"2210.13355","repositories_listed":1,"syntology":null},{"url":"/paper/group-fairness-in-prediction-based-decision","slug":"group-fairness-in-prediction-based-decision","title":"Group Fairness in Prediction-Based Decision Making: From Moral Assessment to Implementation","date":"2022-10-19","arxiv_id":"2210.10456","repositories_listed":1,"syntology":null},{"url":"/paper/stochastic-differentially-private-and-fair","slug":"stochastic-differentially-private-and-fair","title":"Stochastic Differentially Private and Fair Learning","date":"2022-10-17","arxiv_id":"2210.08781","repositories_listed":1,"syntology":null},{"url":"/paper/pareto-set-learning-for-expensive-multi","slug":"pareto-set-learning-for-expensive-multi","title":"Pareto Set Learning for Expensive Multi-Objective Optimization","date":"2022-10-16","arxiv_id":"2210.08495","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/pareto-set-learning-for-expensive-multi#ran","syntology_url":"https://syntology.ai/paper/2210.08495","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.08495"}},"official":{"repos":["xi-l/psl-mobo"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/streaming-pac-bayes-gaussian-process","slug":"streaming-pac-bayes-gaussian-process","title":"Streaming PAC-Bayes Gaussian process regression with a performance guarantee for online decision making","date":"2022-10-16","arxiv_id":"2210.08486","repositories_listed":1,"syntology":null},{"url":"/paper/numerically-stable-sparse-gaussian-processes","slug":"numerically-stable-sparse-gaussian-processes","title":"Numerically Stable Sparse Gaussian Processes via Minimum Separation using Cover Trees","date":"2022-10-14","arxiv_id":"2210.07893","repositories_listed":1,"syntology":null},{"url":"/paper/wild-scav-benchmarking-fps-gaming-ai-on","slug":"wild-scav-benchmarking-fps-gaming-ai-on","title":"WILD-SCAV: Benchmarking FPS Gaming AI on Unity3D-based Environments","date":"2022-10-14","arxiv_id":"2210.09026","repositories_listed":1,"syntology":null},{"url":"/paper/harfang3d-dog-fight-sandbox-a-reinforcement","slug":"harfang3d-dog-fight-sandbox-a-reinforcement","title":"Harfang3D Dog-Fight Sandbox: A Reinforcement Learning Research Platform for the Customized Control Tasks of Fighter Aircrafts","date":"2022-10-13","arxiv_id":"2210.07282","repositories_listed":1,"syntology":null},{"url":"/paper/towards-end-to-end-open-conversational","slug":"towards-end-to-end-open-conversational","title":"Towards End-to-End Open Conversational Machine Reading","date":"2022-10-13","arxiv_id":"2210.07113","repositories_listed":1,"syntology":null},{"url":"/paper/phantom-an-rl-driven-framework-for-agent","slug":"phantom-an-rl-driven-framework-for-agent","title":"Phantom -- A RL-driven multi-agent framework to model complex systems","date":"2022-10-12","arxiv_id":"2210.06012","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":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/phantom-an-rl-driven-framework-for-agent#ran","syntology_url":"https://syntology.ai/paper/2210.06012","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.06012"}},"official":{"repos":["jpmorganchase/Phantom"],"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/markup-to-image-diffusion-models-with","slug":"markup-to-image-diffusion-models-with","title":"Markup-to-Image Diffusion Models with Scheduled Sampling","date":"2022-10-11","arxiv_id":"2210.05147","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/markup-to-image-diffusion-models-with#ran","syntology_url":"https://syntology.ai/paper/2210.05147","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.05147"}},"official":{"repos":["da03/markup2im"],"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/benchmarking-saliency-methods-for-chest-x-ray","slug":"benchmarking-saliency-methods-for-chest-x-ray","title":"Benchmarking saliency methods for chest X-ray interpretation","date":"2022-10-10","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/decomposed-mutual-information-optimization","slug":"decomposed-mutual-information-optimization","title":"Decomposed Mutual Information Optimization for Generalized Context in Meta-Reinforcement Learning","date":"2022-10-09","arxiv_id":"2210.04209","repositories_listed":1,"syntology":null},{"url":"/paper/continuous-monte-carlo-graph-search","slug":"continuous-monte-carlo-graph-search","title":"Continuous Monte Carlo Graph Search","date":"2022-10-04","arxiv_id":"2210.01426","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-bayes-inference-in-neural-networks","slug":"efficient-bayes-inference-in-neural-networks","title":"Efficient Bayes Inference in Neural Networks through Adaptive Importance Sampling","date":"2022-10-03","arxiv_id":"2210.00993","repositories_listed":1,"syntology":null},{"url":"/paper/deep-perceptual-enhancement-for-medical-image","slug":"deep-perceptual-enhancement-for-medical-image","title":"Deep Perceptual Enhancement for Medical Image Analysis","date":"2022-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/higher-order-neural-additive-models-an","slug":"higher-order-neural-additive-models-an","title":"Higher-order Neural Additive Models: An Interpretable Machine Learning Model with Feature Interactions","date":"2022-09-30","arxiv_id":"2209.15409","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/higher-order-neural-additive-models-an#ran","syntology_url":"https://syntology.ai/paper/2209.15409","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.15409"}},"official":{"repos":["gim4855744/honam"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/prioritizing-emergency-evacuations-under","slug":"prioritizing-emergency-evacuations-under","title":"Prioritizing emergency evacuations under compounding levels of uncertainty","date":"2022-09-30","arxiv_id":"2210.08975","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-neural-network-versus-ex-post","slug":"bayesian-neural-network-versus-ex-post","title":"Bayesian Neural Network Versus Ex-Post Calibration For Prediction Uncertainty","date":"2022-09-29","arxiv_id":"2209.14594","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-robustness-of-ensemble-based-machine","slug":"on-the-robustness-of-ensemble-based-machine","title":"On the Robustness of Random Forest Against Untargeted Data Poisoning: An Ensemble-Based Approach","date":"2022-09-28","arxiv_id":"2209.14013","repositories_listed":1,"syntology":null},{"url":"/paper/radacs-towards-higher-order-reasoning-using","slug":"radacs-towards-higher-order-reasoning-using","title":"RALACs: Action Recognition in Autonomous Vehicles using Interaction Encoding and Optical Flow","date":"2022-09-28","arxiv_id":"2209.14408","repositories_listed":1,"syntology":null},{"url":"/paper/collaborative-decision-making-using-action","slug":"collaborative-decision-making-using-action","title":"Collaborative Decision Making Using Action Suggestions","date":"2022-09-27","arxiv_id":"2209.13160","repositories_listed":1,"syntology":null},{"url":"/paper/explainable-reinforcement-learning-via-model","slug":"explainable-reinforcement-learning-via-model","title":"Explainable Reinforcement Learning via Model Transforms","date":"2022-09-24","arxiv_id":"2209.12006","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":3,"phrase":"0 ran · 3 unverified","sample_list":"/paper/explainable-reinforcement-learning-via-model#ran","syntology_url":"https://syntology.ai/paper/2209.12006","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.12006"}},"official":{"repos":["sarah-keren/rlpe"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}}],"record_sha256":"b5423e44df273175be9005f37268d5bf9118fcf38e5921636c2aecc26e31d148","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}