{"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/17","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":17,"pages_in_order":124,"rows_per_page":100,"rows":[1601,1700],"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/16","next":"/task/decision-making/papers/18","papers":[{"url":"/paper/steve-1-a-generative-model-for-text-to","slug":"steve-1-a-generative-model-for-text-to","title":"STEVE-1: A Generative Model for Text-to-Behavior in Minecraft","date":"2023-06-01","arxiv_id":"2306.00937","repositories_listed":1,"syntology":null},{"url":"/paper/betazero-belief-state-planning-for-long","slug":"betazero-belief-state-planning-for-long","title":"BetaZero: Belief-State Planning for Long-Horizon POMDPs using Learned Approximations","date":"2023-05-31","arxiv_id":"2306.00249","repositories_listed":1,"syntology":null},{"url":"/paper/designing-closed-loop-models-for-task","slug":"designing-closed-loop-models-for-task","title":"Designing Closed-Loop Models for Task Allocation","date":"2023-05-31","arxiv_id":"2305.19864","repositories_listed":1,"syntology":null},{"url":"/paper/diffload-uncertainty-quantification-in-load","slug":"diffload-uncertainty-quantification-in-load","title":"DiffLoad: Uncertainty Quantification in Electrical Load Forecasting with the Diffusion Model","date":"2023-05-31","arxiv_id":"2306.01001","repositories_listed":1,"syntology":null},{"url":"/paper/human-aligned-calibration-for-ai-assisted","slug":"human-aligned-calibration-for-ai-assisted","title":"Human-Aligned Calibration for AI-Assisted Decision Making","date":"2023-05-31","arxiv_id":"2306.00074","repositories_listed":1,"syntology":null},{"url":"/paper/signal-is-harder-to-learn-than-bias-debiasing","slug":"signal-is-harder-to-learn-than-bias-debiasing","title":"Signal Is Harder To Learn Than Bias: Debiasing with Focal Loss","date":"2023-05-31","arxiv_id":"2305.19671","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":4,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":4,"phrase":"4 ran (of which 4 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; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/signal-is-harder-to-learn-than-bias-debiasing#ran","syntology_url":"https://syntology.ai/paper/2305.19671","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.19671"}},"official":{"repos":["mvandenhi/signal-is-harder"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/chatgpt-powered-conversational-drug-editing","slug":"chatgpt-powered-conversational-drug-editing","title":"ChatGPT-powered Conversational Drug Editing Using Retrieval and Domain Feedback","date":"2023-05-29","arxiv_id":"2305.18090","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/chatgpt-powered-conversational-drug-editing#ran","syntology_url":"https://syntology.ai/paper/2305.18090","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.18090"}},"official":{"repos":["chao1224/chatdrug"],"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/counterpart-fairness-addressing-systematic","slug":"counterpart-fairness-addressing-systematic","title":"Counterpart Fairness -- Addressing Systematic between-group Differences in Fairness Evaluation","date":"2023-05-29","arxiv_id":"2305.18160","repositories_listed":1,"syntology":null},{"url":"/paper/faithfulness-tests-for-natural-language","slug":"faithfulness-tests-for-natural-language","title":"Faithfulness Tests for Natural Language Explanations","date":"2023-05-29","arxiv_id":"2305.18029","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/faithfulness-tests-for-natural-language#ran","syntology_url":"https://syntology.ai/paper/2305.18029","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.18029"}},"official":{"repos":["copenlu/nle_faithfulness"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/bayesian-decision-making-to-localize-visual","slug":"bayesian-decision-making-to-localize-visual","title":"Bayesian Decision Making to Localize Visual Queries in 2D","date":"2023-05-28","arxiv_id":"2305.17611","repositories_listed":1,"syntology":null},{"url":"/paper/indl-a-new-datasets-and-benchmark-for-in","slug":"indl-a-new-datasets-and-benchmark-for-in","title":"InDL: A New Dataset and Benchmark for In-Diagram Logic Interpretation based on Visual Illusion","date":"2023-05-28","arxiv_id":"2305.17716","repositories_listed":1,"syntology":null},{"url":"/paper/an-investigation-into-the-effects-of-pre","slug":"an-investigation-into-the-effects-of-pre","title":"Diagnosing Transformers: Illuminating Feature Spaces for Clinical Decision-Making","date":"2023-05-27","arxiv_id":"2305.17588","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-deep-counterfactual-regret","slug":"hierarchical-deep-counterfactual-regret","title":"Hierarchical Deep Counterfactual Regret Minimization","date":"2023-05-27","arxiv_id":"2305.17327","repositories_listed":1,"syntology":null},{"url":"/paper/modeling-adversarial-attack-on-pre-trained","slug":"modeling-adversarial-attack-on-pre-trained","title":"Modeling Adversarial Attack on Pre-trained Language Models as Sequential Decision Making","date":"2023-05-27","arxiv_id":"2305.17440","repositories_listed":1,"syntology":null},{"url":"/paper/adaplanner-adaptive-planning-from-feedback-1","slug":"adaplanner-adaptive-planning-from-feedback-1","title":"AdaPlanner: Adaptive Planning from Feedback with Language Models","date":"2023-05-26","arxiv_id":"2305.16653","repositories_listed":1,"syntology":{"n":11,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adaplanner-adaptive-planning-from-feedback-1#ran","syntology_url":"https://syntology.ai/paper/2305.16653","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.16653"}},"official":{"repos":["haotiansun14/adaplanner"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/better-batch-for-deep-probabilistic-time","slug":"better-batch-for-deep-probabilistic-time","title":"Better Batch for Deep Probabilistic Time Series Forecasting","date":"2023-05-26","arxiv_id":"2305.17028","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/better-batch-for-deep-probabilistic-time#ran","syntology_url":"https://syntology.ai/paper/2305.17028","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.17028"}},"official":{"repos":["rottenivy/betterbatch"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/future-conditioned-unsupervised-pretraining","slug":"future-conditioned-unsupervised-pretraining","title":"Future-conditioned Unsupervised Pretraining for Decision Transformer","date":"2023-05-26","arxiv_id":"2305.16683","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":1,"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/future-conditioned-unsupervised-pretraining#ran","syntology_url":"https://syntology.ai/paper/2305.16683","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.16683"}},"official":{"repos":["fffffarmer/pdt"],"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/c-mcts-safe-planning-with-monte-carlo-tree","slug":"c-mcts-safe-planning-with-monte-carlo-tree","title":"C-MCTS: Safe Planning with Monte Carlo Tree Search","date":"2023-05-25","arxiv_id":"2305.16209","repositories_listed":1,"syntology":null},{"url":"/paper/counterfactual-generative-models-for-time","slug":"counterfactual-generative-models-for-time","title":"Counterfactual Generative Models for Time-Varying Treatments","date":"2023-05-25","arxiv_id":"2305.15742","repositories_listed":1,"syntology":null},{"url":"/paper/koopman-kernel-regression-1","slug":"koopman-kernel-regression-1","title":"Koopman Kernel Regression","date":"2023-05-25","arxiv_id":"2305.16215","repositories_listed":1,"syntology":{"n":39,"n_ran":30,"n_constructed":0,"n_ran_checked":30,"n_instrument":0,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":30,"n_pointer_only":0,"phrase":"30 ran (of which 0 constructed an object rather than computing a result; 30 with no instrument failure: 0 honoured, 0 violated, 30 with no contract checked; 0 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/koopman-kernel-regression-1#ran","syntology_url":"https://syntology.ai/paper/2305.16215","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.16215"}},"official":{"repos":["TUM-ITR/koopcore"],"state":"official (archive's flag): 23 ran","n_ran":23,"n_constructed":0,"n_ran_no_instrument_failure":23,"n_unverified":4,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/market-making-with-deep-reinforcement","slug":"market-making-with-deep-reinforcement","title":"Market Making with Deep Reinforcement Learning from Limit Order Books","date":"2023-05-25","arxiv_id":"2305.15821","repositories_listed":1,"syntology":null},{"url":"/paper/transworldng-traffic-simulation-via","slug":"transworldng-traffic-simulation-via","title":"TransWorldNG: Traffic Simulation via Foundation Model","date":"2023-05-25","arxiv_id":"2305.15743","repositories_listed":1,"syntology":null},{"url":"/paper/value-of-information-analysis-for","slug":"value-of-information-analysis-for","title":"Value of Information Analysis for rationalising information gathering in building energy analysis","date":"2023-05-25","arxiv_id":"2305.16117","repositories_listed":1,"syntology":null},{"url":"/paper/comparing-humans-and-models-on-a-similar","slug":"comparing-humans-and-models-on-a-similar","title":"Comparing Humans and Models on a Similar Scale: Towards Cognitive Gender Bias Evaluation in Coreference Resolution","date":"2023-05-24","arxiv_id":"2305.15389","repositories_listed":1,"syntology":null},{"url":"/paper/high-throughput-ai-inference-for-medical","slug":"high-throughput-ai-inference-for-medical","title":"ISLE: An Intelligent Streaming Framework for High-Throughput AI Inference in Medical Imaging","date":"2023-05-24","arxiv_id":"2305.15617","repositories_listed":1,"syntology":null},{"url":"/paper/prompt-optimization-of-large-language-model","slug":"prompt-optimization-of-large-language-model","title":"AutoPlan: Automatic Planning of Interactive Decision-Making Tasks With Large Language Models","date":"2023-05-24","arxiv_id":"2305.15064","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"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) · 2 unverified","sample_list":"/paper/prompt-optimization-of-large-language-model#ran","syntology_url":"https://syntology.ai/paper/2305.15064","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.15064"}},"official":{"repos":["owaski/autoplan"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/safety-aware-semi-end-to-end-coordinated","slug":"safety-aware-semi-end-to-end-coordinated","title":"Safety-aware Semi-end-to-end Coordinated Decision Model for Voltage Regulation in Active Distribution Network","date":"2023-05-24","arxiv_id":"2305.15395","repositories_listed":1,"syntology":null},{"url":"/paper/sentecon-leveraging-lexicons-to-learn-human","slug":"sentecon-leveraging-lexicons-to-learn-human","title":"SenteCon: Leveraging Lexicons to Learn Human-Interpretable Language Representations","date":"2023-05-24","arxiv_id":"2305.14728","repositories_listed":1,"syntology":null},{"url":"/paper/think-before-you-act-decision-transformers","slug":"think-before-you-act-decision-transformers","title":"Think Before You Act: Decision Transformers with Working Memory","date":"2023-05-24","arxiv_id":"2305.16338","repositories_listed":1,"syntology":{"n":12,"n_ran":7,"n_constructed":3,"n_ran_checked":5,"n_instrument":2,"n_unverified":5,"n_honours":2,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"7 ran (of which 3 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/think-before-you-act-decision-transformers#ran","syntology_url":"https://syntology.ai/paper/2305.16338","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.16338"}},"official":{"repos":["luciferkonn/dt_mem"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":3,"n_ran_no_instrument_failure":5,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/beyond-labels-empowering-human-with-natural","slug":"beyond-labels-empowering-human-with-natural","title":"Beyond Labels: Empowering Human Annotators with Natural Language Explanations through a Novel Active-Learning Architecture","date":"2023-05-22","arxiv_id":"2305.12710","repositories_listed":1,"syntology":null},{"url":"/paper/bio-inspired-spike-based-hippocampus-and","slug":"bio-inspired-spike-based-hippocampus-and","title":"Bio-inspired spike-based Hippocampus and Posterior Parietal Cortex models for robot navigation and environment pseudo-mapping","date":"2023-05-22","arxiv_id":"2305.12892","repositories_listed":1,"syntology":null},{"url":"/paper/class-meet-spock-an-education-tutoring","slug":"class-meet-spock-an-education-tutoring","title":"CLASS: A Design Framework for building Intelligent Tutoring Systems based on Learning Science principles","date":"2023-05-22","arxiv_id":"2305.13272","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":2,"n_no_contract":0,"n_pointer_only":5,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 2 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/class-meet-spock-an-education-tutoring#ran","syntology_url":"https://syntology.ai/paper/2305.13272","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.13272"}},"official":{"repos":["luffycodes/tutorbot-spock"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/enhancing-small-medical-learners-with-privacy","slug":"enhancing-small-medical-learners-with-privacy","title":"Enhancing Small Medical Learners with Privacy-preserving Contextual Prompting","date":"2023-05-22","arxiv_id":"2305.12723","repositories_listed":1,"syntology":null},{"url":"/paper/iterative-forward-tuning-boosts-in-context","slug":"iterative-forward-tuning-boosts-in-context","title":"Iterative Forward Tuning Boosts In-Context Learning in Language Models","date":"2023-05-22","arxiv_id":"2305.13016","repositories_listed":1,"syntology":null},{"url":"/paper/mmgp-a-mesh-morphing-gaussian-process-based","slug":"mmgp-a-mesh-morphing-gaussian-process-based","title":"MMGP: a Mesh Morphing Gaussian Process-based machine learning method for regression of physical problems under non-parameterized geometrical variability","date":"2023-05-22","arxiv_id":"2305.12871","repositories_listed":1,"syntology":null},{"url":"/paper/up5-unbiased-foundation-model-for-fairness","slug":"up5-unbiased-foundation-model-for-fairness","title":"UP5: Unbiased Foundation Model for Fairness-aware Recommendation","date":"2023-05-20","arxiv_id":"2305.12090","repositories_listed":1,"syntology":null},{"url":"/paper/appraising-the-potential-uses-and-harms-of","slug":"appraising-the-potential-uses-and-harms-of","title":"Appraising the Potential Uses and Harms of LLMs for Medical Systematic Reviews","date":"2023-05-19","arxiv_id":"2305.11828","repositories_listed":1,"syntology":null},{"url":"/paper/diving-into-the-inter-consistency-of-large","slug":"diving-into-the-inter-consistency-of-large","title":"Examining Inter-Consistency of Large Language Models Collaboration: An In-depth Analysis via Debate","date":"2023-05-19","arxiv_id":"2305.11595","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/diving-into-the-inter-consistency-of-large#ran","syntology_url":"https://syntology.ai/paper/2305.11595","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.11595"}},"official":{"repos":["waste-wood/ford"],"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/the-inside-story-towards-better-understanding","slug":"the-inside-story-towards-better-understanding","title":"The Inside Story: Towards Better Understanding of Machine Translation Neural Evaluation Metrics","date":"2023-05-19","arxiv_id":"2305.11806","repositories_listed":1,"syntology":null},{"url":"/paper/physics-inspired-approaches-towards","slug":"physics-inspired-approaches-towards","title":"Physics Inspired Approaches To Understanding Gaussian Processes","date":"2023-05-18","arxiv_id":"2305.10748","repositories_listed":1,"syntology":null},{"url":"/paper/counterfactually-comparing-abstaining-1","slug":"counterfactually-comparing-abstaining-1","title":"Counterfactually Comparing Abstaining Classifiers","date":"2023-05-17","arxiv_id":"2305.10564","repositories_listed":1,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/counterfactually-comparing-abstaining-1#ran","syntology_url":"https://syntology.ai/paper/2305.10564","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.10564"}},"official":{"repos":["yjchoe/comparingabstainingclassifiers"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/human-choice-prediction-in-non-cooperative","slug":"human-choice-prediction-in-non-cooperative","title":"Human Choice Prediction in Language-based Persuasion Games: Simulation-based Off-Policy Evaluation","date":"2023-05-17","arxiv_id":"2305.10361","repositories_listed":1,"syntology":null},{"url":"/paper/the-brain-tumor-segmentation-brats-challenge-1","slug":"the-brain-tumor-segmentation-brats-challenge-1","title":"The Brain Tumor Segmentation (BraTS) Challenge: Local Synthesis of Healthy Brain Tissue via Inpainting","date":"2023-05-15","arxiv_id":"2305.08992","repositories_listed":1,"syntology":null},{"url":"/paper/topological-interpretability-for-deep","slug":"topological-interpretability-for-deep","title":"Topological Interpretability for Deep-Learning","date":"2023-05-15","arxiv_id":"2305.08642","repositories_listed":1,"syntology":null},{"url":"/paper/a-surprisingly-simple-continuous-action-pomdp","slug":"a-surprisingly-simple-continuous-action-pomdp","title":"A Surprisingly Simple Continuous-Action POMDP Solver: Lazy Cross-Entropy Search Over Policy Trees","date":"2023-05-14","arxiv_id":"2305.08049","repositories_listed":1,"syntology":null},{"url":"/paper/a-flow-based-generative-model-for-rare-event","slug":"a-flow-based-generative-model-for-rare-event","title":"A Flow-Based Generative Model for Rare-Event Simulation","date":"2023-05-13","arxiv_id":"2305.07863","repositories_listed":1,"syntology":null},{"url":"/paper/research-on-cooperative-search-technology-of","slug":"research-on-cooperative-search-technology-of","title":"Heterogeneous Unmanned Aerial Vehicles Cooperative Search Approach for Complex Environments","date":"2023-05-13","arxiv_id":"2305.07862","repositories_listed":1,"syntology":null},{"url":"/paper/unlocking-the-black-box-of-cnns-visualising","slug":"unlocking-the-black-box-of-cnns-visualising","title":"Unlocking the black box of CNNs: Visualising the decision-making process with PRISM","date":"2023-05-13","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/designing-optimal-behavioral-experiments","slug":"designing-optimal-behavioral-experiments","title":"Designing Optimal Behavioral Experiments Using Machine Learning","date":"2023-05-12","arxiv_id":"2305.07721","repositories_listed":1,"syntology":null},{"url":"/paper/a-classification-of-feedback-loops-and-their","slug":"a-classification-of-feedback-loops-and-their","title":"A Classification of Feedback Loops and Their Relation to Biases in Automated Decision-Making Systems","date":"2023-05-10","arxiv_id":"2305.06055","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-classification-of-feedback-loops-and-their#ran","syntology_url":"https://syntology.ai/paper/2305.06055","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.06055"}},"official":{"repos":["paganick/feedback-loops-and-biases"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/cuts-high-dimensional-causal-discovery-from","slug":"cuts-high-dimensional-causal-discovery-from","title":"CUTS+: High-dimensional Causal Discovery from Irregular Time-series","date":"2023-05-10","arxiv_id":"2305.05890","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":2,"n_instrument":6,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 6 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/cuts-high-dimensional-causal-discovery-from#ran","syntology_url":"https://syntology.ai/paper/2305.05890","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.05890"}},"official":{"repos":["jarrycyx/unn"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/dual-intent-enhanced-graph-neural-network-for","slug":"dual-intent-enhanced-graph-neural-network-for","title":"Dual Intent Enhanced Graph Neural Network for Session-based New Item Recommendation","date":"2023-05-10","arxiv_id":"2305.05848","repositories_listed":1,"syntology":null},{"url":"/paper/extracting-diagnosis-pathways-from-electronic","slug":"extracting-diagnosis-pathways-from-electronic","title":"Extracting Diagnosis Pathways from Electronic Health Records Using Deep Reinforcement Learning","date":"2023-05-10","arxiv_id":"2305.06295","repositories_listed":1,"syntology":null},{"url":"/paper/v2x-seq-a-large-scale-sequential-dataset-for","slug":"v2x-seq-a-large-scale-sequential-dataset-for","title":"V2X-Seq: A Large-Scale Sequential Dataset for Vehicle-Infrastructure Cooperative Perception and Forecasting","date":"2023-05-10","arxiv_id":"2305.05938","repositories_listed":1,"syntology":null},{"url":"/paper/dexart-benchmarking-generalizable-dexterous","slug":"dexart-benchmarking-generalizable-dexterous","title":"DexArt: Benchmarking Generalizable Dexterous Manipulation with Articulated Objects","date":"2023-05-09","arxiv_id":"2305.05706","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/dexart-benchmarking-generalizable-dexterous#ran","syntology_url":"https://syntology.ai/paper/2305.05706","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.05706"}},"official":{"repos":["Kami-code/dexart-release"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/distributional-multi-objective-decision","slug":"distributional-multi-objective-decision","title":"Distributional Multi-Objective Decision Making","date":"2023-05-09","arxiv_id":"2305.05560","repositories_listed":1,"syntology":null},{"url":"/paper/flexible-job-shop-scheduling-via-dual","slug":"flexible-job-shop-scheduling-via-dual","title":"Flexible Job Shop Scheduling via Dual Attention Network Based Reinforcement Learning","date":"2023-05-09","arxiv_id":"2305.05119","repositories_listed":1,"syntology":null},{"url":"/paper/uncertainty-quantification-in-machine","slug":"uncertainty-quantification-in-machine","title":"Uncertainty Quantification in Machine Learning for Engineering Design and Health Prognostics: A Tutorial","date":"2023-05-07","arxiv_id":"2305.04933","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"8 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; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/uncertainty-quantification-in-machine#ran","syntology_url":"https://syntology.ai/paper/2305.04933","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.04933"}},"official":{"repos":["vnemani14/uq_ml_review"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/white-box-multi-objective-adversarial-attack","slug":"white-box-multi-objective-adversarial-attack","title":"White-Box Multi-Objective Adversarial Attack on Dialogue Generation","date":"2023-05-05","arxiv_id":"2305.03655","repositories_listed":1,"syntology":null},{"url":"/paper/faithful-question-answering-with-monte-carlo","slug":"faithful-question-answering-with-monte-carlo","title":"Faithful Question Answering with Monte-Carlo Planning","date":"2023-05-04","arxiv_id":"2305.02556","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":3,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; every one of the 3 samples that ran constructed an object rather than computing a result","sample_list":"/paper/faithful-question-answering-with-monte-carlo#ran","syntology_url":"https://syntology.ai/paper/2305.02556","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.02556"}},"official":{"repos":["Raising-hrx/FAME"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/masked-trajectory-models-for-prediction","slug":"masked-trajectory-models-for-prediction","title":"Masked Trajectory Models for Prediction, Representation, and Control","date":"2023-05-04","arxiv_id":"2305.02968","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/masked-trajectory-models-for-prediction#ran","syntology_url":"https://syntology.ai/paper/2305.02968","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.02968"}},"official":{"repos":["facebookresearch/mtm"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-hierarchical-policy-learning-for","slug":"towards-hierarchical-policy-learning-for","title":"Towards Hierarchical Policy Learning for Conversational Recommendation with Hypergraph-based Reinforcement Learning","date":"2023-05-04","arxiv_id":"2305.02575","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-safety-validation-for-black-box","slug":"bayesian-safety-validation-for-black-box","title":"Bayesian Safety Validation for Failure Probability Estimation of Black-Box Systems","date":"2023-05-03","arxiv_id":"2305.02449","repositories_listed":1,"syntology":null},{"url":"/paper/chatgraph-interpretable-text-classification","slug":"chatgraph-interpretable-text-classification","title":"ChatGraph: Interpretable Text Classification by Converting ChatGPT Knowledge to Graphs","date":"2023-05-03","arxiv_id":"2305.03513","repositories_listed":1,"syntology":null},{"url":"/paper/sim2rec-a-simulator-based-decision-making","slug":"sim2rec-a-simulator-based-decision-making","title":"Sim2Rec: A Simulator-based Decision-making Approach to Optimize Real-World Long-term User Engagement in Sequential Recommender Systems","date":"2023-05-03","arxiv_id":"2305.04832","repositories_listed":1,"syntology":null},{"url":"/paper/read-it-twice-towards-faithfully","slug":"read-it-twice-towards-faithfully","title":"Read it Twice: Towards Faithfully Interpretable Fact Verification by Revisiting Evidence","date":"2023-05-02","arxiv_id":"2305.03507","repositories_listed":1,"syntology":null},{"url":"/paper/probabilistic-3d-segmentation-for-aleatoric","slug":"probabilistic-3d-segmentation-for-aleatoric","title":"Probabilistic 3D segmentation for aleatoric uncertainty quantification in full 3D medical data","date":"2023-05-01","arxiv_id":"2305.00950","repositories_listed":1,"syntology":null},{"url":"/paper/beyond-classification-financial-reasoning-in","slug":"beyond-classification-financial-reasoning-in","title":"Beyond Classification: Financial Reasoning in State-of-the-Art Language Models","date":"2023-04-30","arxiv_id":"2305.01505","repositories_listed":1,"syntology":null},{"url":"/paper/catch-collaborative-feature-set-search-for","slug":"catch-collaborative-feature-set-search-for","title":"Catch: Collaborative Feature Set Search for Automated Feature Engineering","date":"2023-04-30","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/scaling-pareto-efficient-decision-making-via","slug":"scaling-pareto-efficient-decision-making-via","title":"Scaling Pareto-Efficient Decision Making Via Offline Multi-Objective RL","date":"2023-04-30","arxiv_id":"2305.00567","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/scaling-pareto-efficient-decision-making-via#ran","syntology_url":"https://syntology.ai/paper/2305.00567","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.00567"}},"official":{"repos":["baitingzbt/peda"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/semi-infinitely-constrained-markov-decision","slug":"semi-infinitely-constrained-markov-decision","title":"Semi-Infinitely Constrained Markov Decision Processes and Efficient Reinforcement Learning","date":"2023-04-29","arxiv_id":"2305.00254","repositories_listed":1,"syntology":null},{"url":"/paper/x-rlflow-graph-reinforcement-learning-for","slug":"x-rlflow-graph-reinforcement-learning-for","title":"X-RLflow: Graph Reinforcement Learning for Neural Network Subgraphs Transformation","date":"2023-04-28","arxiv_id":"2304.14698","repositories_listed":1,"syntology":null},{"url":"/paper/pybibx-a-python-library-for-bibliometric-and","slug":"pybibx-a-python-library-for-bibliometric-and","title":"pyBibX -- A Python Library for Bibliometric and Scientometric Analysis Powered with Artificial Intelligence Tools","date":"2023-04-27","arxiv_id":"2304.14516","repositories_listed":1,"syntology":null},{"url":"/paper/towards-explainable-collaborative-filtering","slug":"towards-explainable-collaborative-filtering","title":"Towards Explainable Collaborative Filtering with Taste Clusters Learning","date":"2023-04-27","arxiv_id":"2304.13937","repositories_listed":1,"syntology":null},{"url":"/paper/distance-weighted-supervised-learning-for","slug":"distance-weighted-supervised-learning-for","title":"Distance Weighted Supervised Learning for Offline Interaction Data","date":"2023-04-26","arxiv_id":"2304.13774","repositories_listed":1,"syntology":{"n":27,"n_ran":14,"n_constructed":0,"n_ran_checked":4,"n_instrument":10,"n_unverified":13,"n_honours":2,"n_violates":1,"n_no_contract":1,"n_pointer_only":0,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 2 honoured, 1 violated, 1 with no contract checked; 10 where Syntology's instrument failed) · 13 unverified","sample_list":"/paper/distance-weighted-supervised-learning-for#ran","syntology_url":"https://syntology.ai/paper/2304.13774","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.13774"}},"official":null}},{"url":"/paper/multi-scale-feature-fusion-using-parallel","slug":"multi-scale-feature-fusion-using-parallel","title":"Multi-Scale Feature Fusion using Parallel-Attention Block for COVID-19 Chest X-ray Diagnosis","date":"2023-04-25","arxiv_id":"2304.12988","repositories_listed":1,"syntology":null},{"url":"/paper/addressing-distributional-shifts-in","slug":"addressing-distributional-shifts-in","title":"Addressing distributional shifts in operations management: The case of order fulfillment in customized production","date":"2023-04-24","arxiv_id":"2304.11910","repositories_listed":1,"syntology":null},{"url":"/paper/benchmarking-chatgpt-4-on-acr-radiation","slug":"benchmarking-chatgpt-4-on-acr-radiation","title":"Benchmarking ChatGPT-4 on ACR Radiation Oncology In-Training (TXIT) Exam and Red Journal Gray Zone Cases: Potentials and Challenges for AI-Assisted Medical Education and Decision Making in Radiation Oncology","date":"2023-04-24","arxiv_id":"2304.11957","repositories_listed":1,"syntology":null},{"url":"/paper/data-driven-knowledge-fusion-for-deep-multi","slug":"data-driven-knowledge-fusion-for-deep-multi","title":"Data-driven Knowledge Fusion for Deep Multi-instance Learning","date":"2023-04-24","arxiv_id":"2304.11905","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-state-abstraction-based-on","slug":"hierarchical-state-abstraction-based-on","title":"Hierarchical State Abstraction Based on Structural Information Principles","date":"2023-04-24","arxiv_id":"2304.12000","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":7,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/hierarchical-state-abstraction-based-on#ran","syntology_url":"https://syntology.ai/paper/2304.12000","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.12000"}},"official":{"repos":["ringbdstack/sisa"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/synthpop-a-hybrid-framework-for-generating-a","slug":"synthpop-a-hybrid-framework-for-generating-a","title":"Synthpop++: A Hybrid Framework for Generating A Country-scale Synthetic Population","date":"2023-04-24","arxiv_id":"2304.12284","repositories_listed":1,"syntology":null},{"url":"/paper/how-to-control-hydrodynamic-force-on-fluidic","slug":"how-to-control-hydrodynamic-force-on-fluidic","title":"How to Control Hydrodynamic Force on Fluidic Pinball via Deep Reinforcement Learning","date":"2023-04-23","arxiv_id":"2304.11526","repositories_listed":1,"syntology":null},{"url":"/paper/smart-a-decision-making-framework-with-multi","slug":"smart-a-decision-making-framework-with-multi","title":"SMART: A Decision-Making Framework with Multi-modality Fusion for Autonomous Driving Based on Reinforcement Learning","date":"2023-04-23","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/multi-modal-deep-learning-for-credit-rating","slug":"multi-modal-deep-learning-for-credit-rating","title":"Multi-Modal Deep Learning for Credit Rating Prediction Using Text and Numerical Data Streams","date":"2023-04-21","arxiv_id":"2304.10740","repositories_listed":1,"syntology":null},{"url":"/paper/temporl-laser-pulse-temporal-shape","slug":"temporl-laser-pulse-temporal-shape","title":"TempoRL: laser pulse temporal shape optimization with Deep Reinforcement Learning","date":"2023-04-20","arxiv_id":"2304.12187","repositories_listed":1,"syntology":null},{"url":"/paper/ai-coherent-data-driven-forecasting-model-for","slug":"ai-coherent-data-driven-forecasting-model-for","title":"AI-coherent data-driven forecasting model for a combined cycle power plant","date":"2023-04-19","arxiv_id":"2304.10009","repositories_listed":1,"syntology":null},{"url":"/paper/optimizing-carbon-storage-operations-for-long","slug":"optimizing-carbon-storage-operations-for-long","title":"Optimizing Carbon Storage Operations for Long-Term Safety","date":"2023-04-19","arxiv_id":"2304.09352","repositories_listed":1,"syntology":null},{"url":"/paper/a-hybrid-model-for-day-ahead-electricity","slug":"a-hybrid-model-for-day-ahead-electricity","title":"A hybrid model for day-ahead electricity price forecasting: Combining fundamental and stochastic modelling","date":"2023-04-18","arxiv_id":"2304.09336","repositories_listed":1,"syntology":null},{"url":"/paper/unveiling-and-unraveling-aggregation-and","slug":"unveiling-and-unraveling-aggregation-and","title":"Unveiling and unraveling aggregation and dispersion fallacies in group MCDM","date":"2023-04-18","arxiv_id":"2304.08859","repositories_listed":1,"syntology":null},{"url":"/paper/on-fast-converged-reinforcement-learning-for","slug":"on-fast-converged-reinforcement-learning-for","title":"Fast-Converged Deep Reinforcement Learning for Optimal Dispatch of Large-Scale Power Systems under Transient Security Constraints","date":"2023-04-17","arxiv_id":"2304.08320","repositories_listed":1,"syntology":null},{"url":"/paper/pgmpy-a-python-toolkit-for-bayesian-networks","slug":"pgmpy-a-python-toolkit-for-bayesian-networks","title":"pgmpy: A Python Toolkit for Bayesian Networks","date":"2023-04-17","arxiv_id":"2304.08639","repositories_listed":1,"syntology":null},{"url":"/paper/promises-and-pitfalls-of-the-linearized","slug":"promises-and-pitfalls-of-the-linearized","title":"Promises and Pitfalls of the Linearized Laplace in Bayesian Optimization","date":"2023-04-17","arxiv_id":"2304.08309","repositories_listed":1,"syntology":null},{"url":"/paper/pcpnet-an-efficient-and-semantic-enhanced","slug":"pcpnet-an-efficient-and-semantic-enhanced","title":"PCPNet: An Efficient and Semantic-Enhanced Transformer Network for Point Cloud Prediction","date":"2023-04-16","arxiv_id":"2304.07773","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/pcpnet-an-efficient-and-semantic-enhanced#ran","syntology_url":"https://syntology.ai/paper/2304.07773","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.07773"}},"official":{"repos":["blurryface0814/pcpnet"],"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/long-term-instabilities-of-deep-learning","slug":"long-term-instabilities-of-deep-learning","title":"Challenges of learning multi-scale dynamics with AI weather models: Implications for stability and one solution","date":"2023-04-14","arxiv_id":"2304.07029","repositories_listed":1,"syntology":null},{"url":"/paper/towards-evaluating-explanations-of-vision","slug":"towards-evaluating-explanations-of-vision","title":"Towards Evaluating Explanations of Vision Transformers for Medical Imaging","date":"2023-04-12","arxiv_id":"2304.06133","repositories_listed":1,"syntology":null},{"url":"/paper/automaton-guided-curriculum-generation-for","slug":"automaton-guided-curriculum-generation-for","title":"Automaton-Guided Curriculum Generation for Reinforcement Learning Agents","date":"2023-04-11","arxiv_id":"2304.05271","repositories_listed":1,"syntology":null},{"url":"/paper/did-we-personalize-assessing-personalization","slug":"did-we-personalize-assessing-personalization","title":"Did we personalize? Assessing personalization by an online reinforcement learning algorithm using resampling","date":"2023-04-11","arxiv_id":"2304.05365","repositories_listed":1,"syntology":null},{"url":"/paper/feudal-graph-reinforcement-learning","slug":"feudal-graph-reinforcement-learning","title":"Feudal Graph Reinforcement Learning","date":"2023-04-11","arxiv_id":"2304.05099","repositories_listed":1,"syntology":null},{"url":"/paper/evkg-an-interlinked-and-interoperable","slug":"evkg-an-interlinked-and-interoperable","title":"EVKG: An Interlinked and Interoperable Electric Vehicle Knowledge Graph for Smart Transportation System","date":"2023-04-10","arxiv_id":"2304.04893","repositories_listed":1,"syntology":null},{"url":"/paper/vars-video-assistant-referee-system-for","slug":"vars-video-assistant-referee-system-for","title":"VARS: Video Assistant Referee System for Automated Soccer Decision Making from Multiple Views","date":"2023-04-10","arxiv_id":"2304.04617","repositories_listed":1,"syntology":null}],"record_sha256":"d9deb0e709c12e2782875603dc6c0aac02de72f5e46af641f26693d3d1c9cc5b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}