{"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/prediction/papers/23","list_of":"/task/prediction","task":"Prediction","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":23,"pages_in_order":88,"rows_per_page":100,"rows":[2201,2300],"of":8760,"counts":{"archive_papers_tagged":8760,"with_a_code_link":2835,"where_syntology_ran_a_sample":607,"not_listed_spam_title":0,"listed":8760,"listed_where_code_ran":607,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":519,"every_run_a_failure_of_syntologys_instrument":88,"listed_with_a_run_with_no_instrument_failure":519,"listed_every_run_a_failure_of_syntologys_instrument":88,"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/prediction","prev":"/task/prediction/papers/22","next":"/task/prediction/papers/24","papers":[{"url":"/paper/semantic-answer-type-prediction-task-smart-at","slug":"semantic-answer-type-prediction-task-smart-at","title":"SeMantic AnsweR Type prediction task (SMART) at ISWC 2020 Semantic Web Challenge","date":"2020-12-01","arxiv_id":"2012.00555","repositories_listed":1,"syntology":null},{"url":"/paper/unbiasing-review-ratings-with-tendency-based","slug":"unbiasing-review-ratings-with-tendency-based","title":"Unbiasing Review Ratings with Tendency Based Collaborative Filtering","date":"2020-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/early-life-cycle-software-defect-prediction","slug":"early-life-cycle-software-defect-prediction","title":"Early Life Cycle Software Defect Prediction. Why? How?","date":"2020-11-26","arxiv_id":"2011.13071","repositories_listed":1,"syntology":null},{"url":"/paper/explainable-tensorized-neural-ordinary","slug":"explainable-tensorized-neural-ordinary","title":"Explainable Tensorized Neural Ordinary Differential Equations forArbitrary-step Time Series Prediction","date":"2020-11-26","arxiv_id":"2011.13174","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-graph-neural-networks-for-molecular","slug":"bayesian-graph-neural-networks-for-molecular","title":"Bayesian Graph Neural Networks for Molecular Property Prediction","date":"2020-11-25","arxiv_id":"2012.02089","repositories_listed":1,"syntology":null},{"url":"/paper/revisit-graph-neural-networks-and-distance","slug":"revisit-graph-neural-networks-and-distance","title":"Revisiting graph neural networks and distance encoding from a practical view","date":"2020-11-22","arxiv_id":"2011.12228","repositories_listed":1,"syntology":null},{"url":"/paper/rethinking-transformer-based-set-prediction","slug":"rethinking-transformer-based-set-prediction","title":"Rethinking Transformer-based Set Prediction for Object Detection","date":"2020-11-21","arxiv_id":"2011.10881","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":3,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/rethinking-transformer-based-set-prediction#ran","syntology_url":"https://syntology.ai/paper/2011.10881","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.10881"}},"official":{"repos":["edward-sun/tsp-detection"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-knowledge-distillation-ensemble-framework","slug":"a-knowledge-distillation-ensemble-framework","title":"A Knowledge Distillation Ensemble Framework for Predicting Short and Long-term Hospitalisation Outcomes from Electronic Health Records Data","date":"2020-11-18","arxiv_id":"2011.09361","repositories_listed":1,"syntology":null},{"url":"/paper/quantum-deep-field-data-driven-wave-function","slug":"quantum-deep-field-data-driven-wave-function","title":"Quantum deep field: data-driven wave function, electron density generation, and atomization energy prediction and extrapolation with machine learning","date":"2020-11-16","arxiv_id":"2011.07923","repositories_listed":1,"syntology":null},{"url":"/paper/prototypical-contrast-and-reverse-prediction","slug":"prototypical-contrast-and-reverse-prediction","title":"Prototypical Contrast and Reverse Prediction: Unsupervised Skeleton Based Action Recognition","date":"2020-11-14","arxiv_id":"2011.07236","repositories_listed":1,"syntology":null},{"url":"/paper/author-s-sentiment-prediction","slug":"author-s-sentiment-prediction","title":"Author's Sentiment Prediction","date":"2020-11-12","arxiv_id":"2011.06128","repositories_listed":1,"syntology":null},{"url":"/paper/multi-label-classification-using-link","slug":"multi-label-classification-using-link","title":"Multi-Label Classification Using Link Prediction","date":"2020-11-11","arxiv_id":"2011.05476","repositories_listed":1,"syntology":null},{"url":"/paper/personal-ity-a-novel-youtube-based-corpus-for","slug":"personal-ity-a-novel-youtube-based-corpus-for","title":"Personal-ITY: A Novel YouTube-based Corpus for Personality Prediction in Italian","date":"2020-11-11","arxiv_id":"2011.05688","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-embeddings-for-interaction-prediction","slug":"dynamic-embeddings-for-interaction-prediction","title":"Dynamic Embeddings for Interaction Prediction","date":"2020-11-10","arxiv_id":"2011.05208","repositories_listed":1,"syntology":null},{"url":"/paper/explaining-deep-graph-networks-with-molecular","slug":"explaining-deep-graph-networks-with-molecular","title":"Explaining Deep Graph Networks with Molecular Counterfactuals","date":"2020-11-09","arxiv_id":"2011.05134","repositories_listed":1,"syntology":null},{"url":"/paper/prediction-problems-inspired-by-animal","slug":"prediction-problems-inspired-by-animal","title":"From Eye-blinks to State Construction: Diagnostic Benchmarks for Online Representation Learning","date":"2020-11-09","arxiv_id":"2011.04590","repositories_listed":1,"syntology":null},{"url":"/paper/seasondepth-cross-season-monocular-depth","slug":"seasondepth-cross-season-monocular-depth","title":"SeasonDepth: Cross-Season Monocular Depth Prediction Dataset and Benchmark under Multiple Environments","date":"2020-11-09","arxiv_id":"2011.04408","repositories_listed":1,"syntology":null},{"url":"/paper/multimodal-trajectory-prediction-via","slug":"multimodal-trajectory-prediction-via","title":"Multimodal Trajectory Prediction via Topological Invariance for Navigation at Uncontrolled Intersections","date":"2020-11-08","arxiv_id":"2011.03894","repositories_listed":1,"syntology":null},{"url":"/paper/performative-prediction-in-a-stateful-world","slug":"performative-prediction-in-a-stateful-world","title":"Performative Prediction in a Stateful World","date":"2020-11-08","arxiv_id":"2011.03885","repositories_listed":1,"syntology":null},{"url":"/paper/deep-learning-analysis-and-age-prediction","slug":"deep-learning-analysis-and-age-prediction","title":"Deep Learning Analysis and Age Prediction from Shoeprints","date":"2020-11-07","arxiv_id":"2011.03794","repositories_listed":1,"syntology":null},{"url":"/paper/context-aware-answer-extraction-in-question","slug":"context-aware-answer-extraction-in-question","title":"Context-Aware Answer Extraction in Question Answering","date":"2020-11-05","arxiv_id":"2011.02687","repositories_listed":1,"syntology":null},{"url":"/paper/retroxpert-decompose-retrosynthesis","slug":"retroxpert-decompose-retrosynthesis","title":"RetroXpert: Decompose Retrosynthesis Prediction like a Chemist","date":"2020-11-04","arxiv_id":"2011.02893","repositories_listed":1,"syntology":null},{"url":"/paper/trimnet-learning-molecular-representation","slug":"trimnet-learning-molecular-representation","title":"TrimNet: learning molecular representation from triplet messages for biomedicine","date":"2020-11-04","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/joint-entity-and-relation-extraction-with-set","slug":"joint-entity-and-relation-extraction-with-set","title":"Joint Entity and Relation Extraction with Set Prediction Networks","date":"2020-11-03","arxiv_id":"2011.01675","repositories_listed":1,"syntology":null},{"url":"/paper/learning-causal-semantic-representation-for-1","slug":"learning-causal-semantic-representation-for-1","title":"Learning Causal Semantic Representation for Out-of-Distribution Prediction","date":"2020-11-03","arxiv_id":"2011.01681","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/learning-causal-semantic-representation-for-1#ran","syntology_url":"https://syntology.ai/paper/2011.01681","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.01681"}},"official":{"repos":["changliu00/causal-semantic-generative-model"],"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/seoul-bike-trip-duration-prediction-using","slug":"seoul-bike-trip-duration-prediction-using","title":"Seoul bike trip duration prediction using data mining techniques","date":"2020-11-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/handling-missing-data-with-graph","slug":"handling-missing-data-with-graph","title":"Handling Missing Data with Graph Representation Learning","date":"2020-10-30","arxiv_id":"2010.16418","repositories_listed":1,"syntology":null},{"url":"/paper/how-many-pages-paper-length-prediction-from","slug":"how-many-pages-paper-length-prediction-from","title":"How Many Pages? Paper Length Prediction from the Metadata","date":"2020-10-29","arxiv_id":"2010.15924","repositories_listed":1,"syntology":null},{"url":"/paper/multi-agent-trajectory-prediction-with-fuzzy","slug":"multi-agent-trajectory-prediction-with-fuzzy","title":"Multi-agent Trajectory Prediction with Fuzzy Query Attention","date":"2020-10-29","arxiv_id":"2010.15891","repositories_listed":1,"syntology":null},{"url":"/paper/where-is-this-relationship-going","slug":"where-is-this-relationship-going","title":"\"where is this relationship going?\": Understanding Relationship Trajectories in Narrative Text","date":"2020-10-29","arxiv_id":"2010.15313","repositories_listed":1,"syntology":null},{"url":"/paper/explainable-artificial-intelligence-for-1","slug":"explainable-artificial-intelligence-for-1","title":"Explainable Artificial Intelligence for Manufacturing Cost Estimation and Machining Feature Visualization","date":"2020-10-28","arxiv_id":"2010.14824","repositories_listed":1,"syntology":null},{"url":"/paper/predicting-intubation-support-requirement-of","slug":"predicting-intubation-support-requirement-of","title":"Predicting intubation support requirement of patients using Chest X-ray with Deep Representation Learning","date":"2020-10-28","arxiv_id":"2011.01787","repositories_listed":1,"syntology":null},{"url":"/paper/g-models-generative-temporal-difference","slug":"g-models-generative-temporal-difference","title":"Generative Temporal Difference Learning for Infinite-Horizon Prediction","date":"2020-10-27","arxiv_id":"2010.14496","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"3 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/g-models-generative-temporal-difference#ran","syntology_url":"https://syntology.ai/paper/2010.14496","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.14496"}},"official":{"repos":["JannerM/gamma-models"],"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/interior-point-solving-for-lp-based","slug":"interior-point-solving-for-lp-based","title":"Interior Point Solving for LP-based prediction+optimisation","date":"2020-10-26","arxiv_id":"2010.13943","repositories_listed":1,"syntology":{"n":26,"n_ran":12,"n_constructed":0,"n_ran_checked":11,"n_instrument":1,"n_unverified":14,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":1,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 1 where Syntology's instrument failed) · 14 unverified","sample_list":"/paper/interior-point-solving-for-lp-based#ran","syntology_url":"https://syntology.ai/paper/2010.13943","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.13943"}},"official":{"repos":["JayMan91/NeurIPSIntopt"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":14,"ran_from_kinds":["official"]}}},{"url":"/paper/trajectory-wise-multiple-choice-learning-for","slug":"trajectory-wise-multiple-choice-learning-for","title":"Trajectory-wise Multiple Choice Learning for Dynamics Generalization in Reinforcement Learning","date":"2020-10-26","arxiv_id":"2010.13303","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":2,"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; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/trajectory-wise-multiple-choice-learning-for#ran","syntology_url":"https://syntology.ai/paper/2010.13303","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.13303"}},"official":{"repos":["younggyoseo/trajectory_mcl"],"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/multi-agent-active-perception-with-prediction","slug":"multi-agent-active-perception-with-prediction","title":"Multi-agent active perception with prediction rewards","date":"2020-10-22","arxiv_id":"2010.11835","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/multi-agent-active-perception-with-prediction#ran","syntology_url":"https://syntology.ai/paper/2010.11835","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.11835"}},"official":{"repos":["laurimi/multiagent-prediction-reward"],"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/multi-view-graph-contrastive-representation","slug":"multi-view-graph-contrastive-representation","title":"Multi-view Graph Contrastive Representation Learning for Drug-Drug Interaction Prediction","date":"2020-10-22","arxiv_id":"2010.11711","repositories_listed":1,"syntology":null},{"url":"/paper/should-graph-convolution-trust-neighbors-a","slug":"should-graph-convolution-trust-neighbors-a","title":"Should Graph Convolution Trust Neighbors? A Simple Causal Inference Method","date":"2020-10-22","arxiv_id":"2010.11797","repositories_listed":1,"syntology":null},{"url":"/paper/the-primal-dual-method-for-learning-augmented","slug":"the-primal-dual-method-for-learning-augmented","title":"The Primal-Dual method for Learning Augmented Algorithms","date":"2020-10-22","arxiv_id":"2010.11632","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/the-primal-dual-method-for-learning-augmented#ran","syntology_url":"https://syntology.ai/paper/2010.11632","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.11632"}},"official":{"repos":["etienne4/PDLA"],"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/attendaffectnet-self-attention-based-networks","slug":"attendaffectnet-self-attention-based-networks","title":"AttendAffectNet: Self-Attention based Networks for Predicting Affective Responses from Movies","date":"2020-10-21","arxiv_id":"2010.11188","repositories_listed":1,"syntology":null},{"url":"/paper/an-empirical-investigation-of-contextualized","slug":"an-empirical-investigation-of-contextualized","title":"An Empirical Investigation of Contextualized Number Prediction","date":"2020-10-20","arxiv_id":"2011.07961","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/an-empirical-investigation-of-contextualized#ran","syntology_url":"https://syntology.ai/paper/2011.07961","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.07961"}},"official":{"repos":["dspoka/mnm"],"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/feature-inference-attack-on-model-predictions","slug":"feature-inference-attack-on-model-predictions","title":"Feature Inference Attack on Model Predictions in Vertical Federated Learning","date":"2020-10-20","arxiv_id":"2010.10152","repositories_listed":1,"syntology":null},{"url":"/paper/pedestrian-intention-prediction-a-multi-task","slug":"pedestrian-intention-prediction-a-multi-task","title":"Pedestrian Intention Prediction: A Multi-task Perspective","date":"2020-10-20","arxiv_id":"2010.10270","repositories_listed":1,"syntology":null},{"url":"/paper/attention-augmented-convlstm-forenvironment","slug":"attention-augmented-convlstm-forenvironment","title":"Attention Augmented ConvLSTM for Environment Prediction","date":"2020-10-19","arxiv_id":"2010.09662","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-estimation-and-evaluation-of","slug":"efficient-estimation-and-evaluation-of","title":"Efficient Estimation and Evaluation of Prediction Rules in Semi-Supervised Settings under Stratified Sampling","date":"2020-10-19","arxiv_id":"2010.09443","repositories_listed":1,"syntology":null},{"url":"/paper/financial-data-analysis-using-expert-bayesian","slug":"financial-data-analysis-using-expert-bayesian","title":"Financial Data Analysis Using Expert Bayesian Framework For Bankruptcy Prediction","date":"2020-10-19","arxiv_id":"2010.13892","repositories_listed":1,"syntology":null},{"url":"/paper/multilayer-network-analysis-for-improved","slug":"multilayer-network-analysis-for-improved","title":"Multilayer Network Analysis for Improved Credit Risk Prediction","date":"2020-10-19","arxiv_id":"2010.09559","repositories_listed":1,"syntology":null},{"url":"/paper/deep-structured-prediction-for-facial-1","slug":"deep-structured-prediction-for-facial-1","title":"Deep Structured Prediction for Facial Landmark Detection","date":"2020-10-18","arxiv_id":"2010.09035","repositories_listed":1,"syntology":null},{"url":"/paper/example-driven-intent-prediction-with-1","slug":"example-driven-intent-prediction-with-1","title":"Example-Driven Intent Prediction with Observers","date":"2020-10-17","arxiv_id":"2010.08684","repositories_listed":1,"syntology":null},{"url":"/paper/predicting-biomedical-interactions-with","slug":"predicting-biomedical-interactions-with","title":"Predicting Biomedical Interactions with Higher-Order Graph Convolutional Networks","date":"2020-10-16","arxiv_id":"2010.08516","repositories_listed":1,"syntology":null},{"url":"/paper/double-robust-representation-learning-for","slug":"double-robust-representation-learning-for","title":"Double Robust Representation Learning for Counterfactual Prediction","date":"2020-10-15","arxiv_id":"2010.07866","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/double-robust-representation-learning-for#ran","syntology_url":"https://syntology.ai/paper/2010.07866","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.07866"}},"official":{"repos":["zengshx777/Double-Rouble-Representation-Learning"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/meme-generating-rnn-model-explanations-via-1","slug":"meme-generating-rnn-model-explanations-via-1","title":"MEME: Generating RNN Model Explanations via Model Extraction","date":"2020-10-15","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/rainfall-runoff-prediction-at-multiple","slug":"rainfall-runoff-prediction-at-multiple","title":"Rainfall-Runoff Prediction at Multiple Timescales with a Single Long Short-Term Memory Network","date":"2020-10-15","arxiv_id":"2010.07921","repositories_listed":1,"syntology":null},{"url":"/paper/selective-classification-via-one-sided","slug":"selective-classification-via-one-sided","title":"Selective Classification via One-Sided Prediction","date":"2020-10-15","arxiv_id":"2010.07853","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/selective-classification-via-one-sided#ran","syntology_url":"https://syntology.ai/paper/2010.07853","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.07853"}},"official":{"repos":["anilkagak2/SelectiveClassification_One_Sided_Prediction"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/are-some-words-worth-more-than-others","slug":"are-some-words-worth-more-than-others","title":"Are Some Words Worth More than Others?","date":"2020-10-12","arxiv_id":"2010.06069","repositories_listed":1,"syntology":null},{"url":"/paper/neural-representations-in-hybrid-recommender","slug":"neural-representations-in-hybrid-recommender","title":"Neural Representations in Hybrid Recommender Systems: Prediction versus Regularization","date":"2020-10-12","arxiv_id":"2010.06070","repositories_listed":1,"syntology":null},{"url":"/paper/pgm-explainer-probabilistic-graphical-model","slug":"pgm-explainer-probabilistic-graphical-model","title":"PGM-Explainer: Probabilistic Graphical Model Explanations for Graph Neural Networks","date":"2020-10-12","arxiv_id":"2010.05788","repositories_listed":1,"syntology":null},{"url":"/paper/set-prediction-without-imposing-structure-as-1","slug":"set-prediction-without-imposing-structure-as-1","title":"Set Prediction without Imposing Structure as Conditional Density Estimation","date":"2020-10-08","arxiv_id":"2010.04109","repositories_listed":1,"syntology":null},{"url":"/paper/characterizing-the-value-of-information-in","slug":"characterizing-the-value-of-information-in","title":"Characterizing the Value of Information in Medical Notes","date":"2020-10-07","arxiv_id":"2010.03574","repositories_listed":1,"syntology":null},{"url":"/paper/motion-prediction-using-temporal-inception","slug":"motion-prediction-using-temporal-inception","title":"Motion Prediction Using Temporal Inception Module","date":"2020-10-06","arxiv_id":"2010.03006","repositories_listed":1,"syntology":null},{"url":"/paper/conversational-document-prediction-to-assist","slug":"conversational-document-prediction-to-assist","title":"Conversational Document Prediction to Assist Customer Care Agents","date":"2020-10-05","arxiv_id":"2010.02305","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-attack-and-defense-of-structured","slug":"adversarial-attack-and-defense-of-structured","title":"Adversarial Attack and Defense of Structured Prediction Models","date":"2020-10-04","arxiv_id":"2010.01610","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/adversarial-attack-and-defense-of-structured#ran","syntology_url":"https://syntology.ai/paper/2010.01610","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.01610"}},"official":{"repos":["WinnieHAN/structure_adv"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/on-losses-for-modern-language-models","slug":"on-losses-for-modern-language-models","title":"On Losses for Modern Language Models","date":"2020-10-04","arxiv_id":"2010.01694","repositories_listed":1,"syntology":null},{"url":"/paper/sumgnn-multi-typed-drug-interaction","slug":"sumgnn-multi-typed-drug-interaction","title":"SumGNN: Multi-typed Drug Interaction Prediction via Efficient Knowledge Graph Summarization","date":"2020-10-04","arxiv_id":"2010.01450","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/sumgnn-multi-typed-drug-interaction#ran","syntology_url":"https://syntology.ai/paper/2010.01450","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.01450"}},"official":{"repos":["yueyu1030/SumGNN"],"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/deep-multi-interest-network-for-click-through","slug":"deep-multi-interest-network-for-click-through","title":"Deep Multi-Interest Network for Click-through Rate Prediction","date":"2020-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/modelisation-of-competition-between-times","slug":"modelisation-of-competition-between-times","title":"Concurrent Neural Network : A model of competition between times series","date":"2020-09-30","arxiv_id":"2009.14610","repositories_listed":1,"syntology":null},{"url":"/paper/bidirectional-representation-learning-from","slug":"bidirectional-representation-learning-from","title":"Bidirectional Representation Learning from Transformers using Multimodal Electronic Health Record Data to Predict Depression","date":"2020-09-26","arxiv_id":"2009.12656","repositories_listed":1,"syntology":null},{"url":"/paper/bitenet-bidirectional-temporal-encoder","slug":"bitenet-bidirectional-temporal-encoder","title":"BiteNet: Bidirectional Temporal Encoder Network to Predict Medical Outcomes","date":"2020-09-24","arxiv_id":"2009.13252","repositories_listed":1,"syntology":null},{"url":"/paper/boosting-algorithms-for-delivery-time","slug":"boosting-algorithms-for-delivery-time","title":"Boosting Algorithms for Delivery Time Prediction in Transportation Logistics","date":"2020-09-24","arxiv_id":"2009.11598","repositories_listed":1,"syntology":null},{"url":"/paper/a-real-time-vision-framework-for-pedestrian","slug":"a-real-time-vision-framework-for-pedestrian","title":"A Real-Time Predictive Pedestrian Collision Warning Service for Cooperative Intelligent Transportation Systems Using 3D Pose Estimation","date":"2020-09-23","arxiv_id":"2009.10868","repositories_listed":1,"syntology":null},{"url":"/paper/improving-graph-property-prediction-with","slug":"improving-graph-property-prediction-with","title":"Improving Graph Property Prediction with Generalized Readout Functions","date":"2020-09-21","arxiv_id":"2009.09919","repositories_listed":1,"syntology":null},{"url":"/paper/time-series-imputation-and-prediction-with-bi","slug":"time-series-imputation-and-prediction-with-bi","title":"Time-series Imputation and Prediction with Bi-Directional Generative Adversarial Networks","date":"2020-09-18","arxiv_id":"2009.08900","repositories_listed":1,"syntology":null},{"url":"/paper/asymptotic-analysis-of-admm-for-compressed","slug":"asymptotic-analysis-of-admm-for-compressed","title":"Asymptotic Performance Prediction for ADMM-Based Compressed Sensing","date":"2020-09-17","arxiv_id":"2009.08545","repositories_listed":1,"syntology":null},{"url":"/paper/variational-disentanglement-for-rare-event","slug":"variational-disentanglement-for-rare-event","title":"Variational Disentanglement for Rare Event Modeling","date":"2020-09-17","arxiv_id":"2009.08541","repositories_listed":1,"syntology":null},{"url":"/paper/supervised-learning-for-the-prediction-of","slug":"supervised-learning-for-the-prediction-of","title":"Supervised learning for the prediction of firm dynamics","date":"2020-09-11","arxiv_id":"2009.06413","repositories_listed":1,"syntology":null},{"url":"/paper/investigation-of-refined-cnn-ensemble","slug":"investigation-of-refined-cnn-ensemble","title":"Investigation of REFINED CNN ensemble learning for anti-cancer drug sensitivity prediction","date":"2020-09-09","arxiv_id":"2009.04076","repositories_listed":1,"syntology":null},{"url":"/paper/deepsun-machine-learning-as-a-service-for","slug":"deepsun-machine-learning-as-a-service-for","title":"DeepSun: Machine-Learning-as-a-Service for Solar Flare Prediction","date":"2020-09-04","arxiv_id":"2009.04238","repositories_listed":1,"syntology":null},{"url":"/paper/boosting-house-price-predictions-using-geo","slug":"boosting-house-price-predictions-using-geo","title":"Boosting House Price Predictions using Geo-Spatial Network Embedding","date":"2020-09-01","arxiv_id":"2009.00254","repositories_listed":1,"syntology":null},{"url":"/paper/propensity-to-pay-machine-learning-for","slug":"propensity-to-pay-machine-learning-for","title":"Propensity-to-Pay: Machine Learning for Estimating Prediction Uncertainty","date":"2020-08-27","arxiv_id":"2008.12065","repositories_listed":1,"syntology":null},{"url":"/paper/fastsal-a-computationally-efficient-network","slug":"fastsal-a-computationally-efficient-network","title":"FastSal: a Computationally Efficient Network for Visual Saliency Prediction","date":"2020-08-25","arxiv_id":"2008.11151","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/fastsal-a-computationally-efficient-network#ran","syntology_url":"https://syntology.ai/paper/2008.11151","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.11151"}},"official":{"repos":["feiyanhu/FastSal"],"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/lowfer-low-rank-bilinear-pooling-for-link","slug":"lowfer-low-rank-bilinear-pooling-for-link","title":"LowFER: Low-rank Bilinear Pooling for Link Prediction","date":"2020-08-25","arxiv_id":"2008.10858","repositories_listed":1,"syntology":{"n":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 3 unverified","sample_list":"/paper/lowfer-low-rank-bilinear-pooling-for-link#ran","syntology_url":"https://syntology.ai/paper/2008.10858","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.10858"}},"official":{"repos":["suamin/LowFER"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}},{"url":"/paper/what-if-motion-prediction-for-autonomous","slug":"what-if-motion-prediction-for-autonomous","title":"What-If Motion Prediction for Autonomous Driving","date":"2020-08-24","arxiv_id":"2008.10587","repositories_listed":1,"syntology":null},{"url":"/paper/multiverse-a-multiplex-and-multiplex","slug":"multiverse-a-multiplex-and-multiplex","title":"MultiVERSE: a multiplex and multiplex-heterogeneous network embedding approach","date":"2020-08-23","arxiv_id":"2008.10085","repositories_listed":1,"syntology":null},{"url":"/paper/single-image-depth-prediction-makes-feature","slug":"single-image-depth-prediction-makes-feature","title":"Single-Image Depth Prediction Makes Feature Matching Easier","date":"2020-08-21","arxiv_id":"2008.09497","repositories_listed":1,"syntology":null},{"url":"/paper/imagifilter-a-resource-to-enable-the-semi","slug":"imagifilter-a-resource-to-enable-the-semi","title":"ImagiFilter: A resource to enable the semi-automatic mining of images at scale","date":"2020-08-20","arxiv_id":"2008.09152","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-abstract-and-predict-human","slug":"learning-to-abstract-and-predict-human","title":"Learning to Abstract and Predict Human Actions","date":"2020-08-20","arxiv_id":"2008.09234","repositories_listed":1,"syntology":null},{"url":"/paper/cinc-gan-for-effective-f0-prediction-for","slug":"cinc-gan-for-effective-f0-prediction-for","title":"CinC-GAN for Effective F0 prediction for Whisper-to-Normal Speech Conversion","date":"2020-08-18","arxiv_id":"2008.07788","repositories_listed":1,"syntology":null},{"url":"/paper/nase-learning-knowledge-graph-embedding-for","slug":"nase-learning-knowledge-graph-embedding-for","title":"NASE: Learning Knowledge Graph Embedding for Link Prediction via Neural Architecture Search","date":"2020-08-18","arxiv_id":"2008.07723","repositories_listed":1,"syntology":null},{"url":"/paper/xnap-making-lstm-based-next-activity","slug":"xnap-making-lstm-based-next-activity","title":"XNAP: Making LSTM-based Next Activity Predictions Explainable by Using LRP","date":"2020-08-18","arxiv_id":"2008.07993","repositories_listed":1,"syntology":null},{"url":"/paper/self-supervised-video-representation-learning-4","slug":"self-supervised-video-representation-learning-4","title":"Self-supervised Video Representation Learning by Pace Prediction","date":"2020-08-13","arxiv_id":"2008.05861","repositories_listed":1,"syntology":null},{"url":"/paper/decoding-kinetic-features-of-hand-motor","slug":"decoding-kinetic-features-of-hand-motor","title":"Decoding kinetic features of hand motor preparation from single‐trial EEG using convolutional neural networks","date":"2020-08-11","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/individualized-prediction-of-covid-19-adverse","slug":"individualized-prediction-of-covid-19-adverse","title":"Individualized Prediction of COVID-19 Adverse outcomes with MLHO","date":"2020-08-10","arxiv_id":"2008.03869","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-energy-consumption-prediction-model","slug":"efficient-energy-consumption-prediction-model","title":"Efficient energy consumption prediction model for a data analytic-enabled industry building in a smart city","date":"2020-08-09","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/i2l-meshnet-image-to-lixel-prediction-network-1","slug":"i2l-meshnet-image-to-lixel-prediction-network-1","title":"I2L-MeshNet: Image-to-Lixel Prediction Network for Accurate 3D Human Pose and Mesh Estimation from a Single RGB Image","date":"2020-08-09","arxiv_id":"2008.03713","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":3,"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) · 0 unverified","sample_list":"/paper/i2l-meshnet-image-to-lixel-prediction-network-1#ran","syntology_url":"https://syntology.ai/paper/2008.03713","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.03713"}},"official":{"repos":["mks0601/I2L-MeshNet_RELEASE"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/minet-mixed-interest-network-for-cross-domain","slug":"minet-mixed-interest-network-for-cross-domain","title":"MiNet: Mixed Interest Network for Cross-Domain Click-Through Rate Prediction","date":"2020-08-07","arxiv_id":"2008.02974","repositories_listed":1,"syntology":null},{"url":"/paper/group-activity-prediction-with-sequential","slug":"group-activity-prediction-with-sequential","title":"Group Activity Prediction with Sequential Relational Anticipation Model","date":"2020-08-06","arxiv_id":"2008.02441","repositories_listed":1,"syntology":null},{"url":"/paper/diverse-and-admissible-trajectory-prediction","slug":"diverse-and-admissible-trajectory-prediction","title":"Diverse and Admissible Trajectory Prediction through Multimodal Context Understanding","date":"2020-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/multi-view-action-recognition-using-cross","slug":"multi-view-action-recognition-using-cross","title":"Multi-view Action Recognition using Cross-view Video Prediction","date":"2020-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/n-reference-transfer-learning-for-saliency-1","slug":"n-reference-transfer-learning-for-saliency-1","title":"n-Reference Transfer Learning for Saliency Prediction","date":"2020-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/single-image-depth-prediction-makes-feature-1","slug":"single-image-depth-prediction-makes-feature-1","title":"Single-Image Depth Prediction Makes Feature Matching Easier","date":"2020-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null}],"record_sha256":"6206a839b993cc7dbaef251df1e8b47c868b8cadfb97cb7ed3f4fbe200d60197","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}