{"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/ran/6","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":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":6,"pages_in_order":7,"rows_per_page":100,"rows":[501,600],"of":607,"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/papers/ran/1","prev":"/task/prediction/papers/ran/5","next":"/task/prediction/papers/ran/7","papers":[{"url":"/paper/spatio-temporal-graph-transformer-networks","slug":"spatio-temporal-graph-transformer-networks","title":"Spatio-Temporal Graph Transformer Networks for Pedestrian Trajectory Prediction","date":"2020-05-18","arxiv_id":"2005.08514","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":1,"n_no_contract":6,"n_pointer_only":2,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 1 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/spatio-temporal-graph-transformer-networks#ran","syntology_url":"https://syntology.ai/paper/2005.08514","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.08514"}},"official":{"repos":["Majiker/STAR"],"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/curating-a-covid-19-data-repository-and","slug":"curating-a-covid-19-data-repository-and","title":"Curating a COVID-19 data repository and forecasting county-level death counts in the United States","date":"2020-05-16","arxiv_id":"2005.07882","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/curating-a-covid-19-data-repository-and#ran","syntology_url":"https://syntology.ai/paper/2005.07882","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.07882"}},"official":{"repos":["Yu-Group/covid19-severity-prediction"],"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/pretraining-federated-text-models-for-next","slug":"pretraining-federated-text-models-for-next","title":"Pretraining Federated Text Models for Next Word Prediction","date":"2020-05-11","arxiv_id":"2005.04828","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/pretraining-federated-text-models-for-next#ran","syntology_url":"https://syntology.ai/paper/2005.04828","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.04828"}},"official":{"repos":["federated-learning-experiments/fl-text-models"],"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/temporal-knowledge-base-completion-new","slug":"temporal-knowledge-base-completion-new","title":"Temporal Knowledge Base Completion: New Algorithms and Evaluation Protocols","date":"2020-05-02","arxiv_id":"2005.05035","repositories_listed":1,"syntology":{"n":12,"n_ran":3,"n_constructed":1,"n_ran_checked":1,"n_instrument":2,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":12,"phrase":"3 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; 2 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/temporal-knowledge-base-completion-new#ran","syntology_url":"https://syntology.ai/paper/2005.05035","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.05035"}},"official":{"repos":["dair-iitd/tkbi"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":9,"ran_from_kinds":["official"]}}},{"url":"/paper/skipgnn-predicting-molecular-interactions","slug":"skipgnn-predicting-molecular-interactions","title":"SkipGNN: Predicting Molecular Interactions with Skip-Graph Networks","date":"2020-04-30","arxiv_id":"2004.14949","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":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) · 2 unverified","sample_list":"/paper/skipgnn-predicting-molecular-interactions#ran","syntology_url":"https://syntology.ai/paper/2004.14949","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.14949"}},"official":{"repos":["kexinhuang12345/SkipGNN"],"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/how-do-decisions-emerge-across-layers-in","slug":"how-do-decisions-emerge-across-layers-in","title":"How do Decisions Emerge across Layers in Neural Models? Interpretation with Differentiable Masking","date":"2020-04-30","arxiv_id":"2004.14992","repositories_listed":2,"syntology":{"n":10,"n_ran":6,"n_constructed":4,"n_ran_checked":6,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 4 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) · 4 unverified","sample_list":"/paper/how-do-decisions-emerge-across-layers-in#ran","syntology_url":"https://syntology.ai/paper/2004.14992","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.14992"}},"official":{"repos":["nicola-decao/diffmask"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/towards-prediction-explainability-through","slug":"towards-prediction-explainability-through","title":"The Explanation Game: Towards Prediction Explainability through Sparse Communication","date":"2020-04-28","arxiv_id":"2004.13876","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/towards-prediction-explainability-through#ran","syntology_url":"https://syntology.ai/paper/2004.13876","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.13876"}},"official":{"repos":["deep-spin/spec"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/tensor-decompositions-for-temporal-knowledge-1","slug":"tensor-decompositions-for-temporal-knowledge-1","title":"Tensor Decompositions for temporal knowledge base completion","date":"2020-04-10","arxiv_id":"2004.04926","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/tensor-decompositions-for-temporal-knowledge-1#ran","syntology_url":"https://syntology.ai/paper/2004.04926","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.04926"}},"official":{"repos":["facebookresearch/tkbc"],"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/tidying-deep-saliency-prediction","slug":"tidying-deep-saliency-prediction","title":"Tidying Deep Saliency Prediction Architectures","date":"2020-03-10","arxiv_id":"2003.04942","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":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/tidying-deep-saliency-prediction#ran","syntology_url":"https://syntology.ai/paper/2003.04942","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.04942"}},"official":{"repos":["samyak0210/saliency"],"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/rectifying-pseudo-label-learning-via","slug":"rectifying-pseudo-label-learning-via","title":"Rectifying Pseudo Label Learning via Uncertainty Estimation for Domain Adaptive Semantic Segmentation","date":"2020-03-08","arxiv_id":"2003.03773","repositories_listed":2,"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":1,"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/rectifying-pseudo-label-learning-via#ran","syntology_url":"https://syntology.ai/paper/2003.03773","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.03773"}},"official":null}},{"url":"/paper/disentangling-physical-dynamics-from-unknown","slug":"disentangling-physical-dynamics-from-unknown","title":"Disentangling Physical Dynamics from Unknown Factors for Unsupervised Video Prediction","date":"2020-03-03","arxiv_id":"2003.01460","repositories_listed":3,"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/disentangling-physical-dynamics-from-unknown#ran","syntology_url":"https://syntology.ai/paper/2003.01460","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.01460"}},"official":{"repos":["vincent-leguen/PhyDNet"],"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/decision-trees-for-decision-making-under-the","slug":"decision-trees-for-decision-making-under-the","title":"Decision Trees for Decision-Making under the Predict-then-Optimize Framework","date":"2020-02-29","arxiv_id":"2003.00360","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/decision-trees-for-decision-making-under-the#ran","syntology_url":"https://syntology.ai/paper/2003.00360","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.00360"}},"official":{"repos":["rtm2130/SPOTree"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/stochastic-latent-residual-video-prediction-1","slug":"stochastic-latent-residual-video-prediction-1","title":"Stochastic Latent Residual Video Prediction","date":"2020-02-21","arxiv_id":"2002.09219","repositories_listed":1,"syntology":{"n":12,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":2,"phrase":"10 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; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/stochastic-latent-residual-video-prediction-1#ran","syntology_url":"https://syntology.ai/paper/2002.09219","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.09219"}},"official":{"repos":["edouardelasalles/srvp"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/transformer-hawkes-process","slug":"transformer-hawkes-process","title":"Transformer Hawkes Process","date":"2020-02-21","arxiv_id":"2002.09291","repositories_listed":3,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/transformer-hawkes-process#ran","syntology_url":"https://syntology.ai/paper/2002.09291","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.09291"}},"official":{"repos":["SimiaoZuo/Transformer-Hawkes-Process"],"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":["listed","official"]}}},{"url":"/paper/performative-prediction","slug":"performative-prediction","title":"Performative Prediction","date":"2020-02-16","arxiv_id":"2002.06673","repositories_listed":2,"syntology":{"n":10,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/performative-prediction#ran","syntology_url":"https://syntology.ai/paper/2002.06673","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.06673"}},"official":null}},{"url":"/paper/rna-secondary-structure-prediction-by-1","slug":"rna-secondary-structure-prediction-by-1","title":"RNA Secondary Structure Prediction By Learning Unrolled Algorithms","date":"2020-02-13","arxiv_id":"2002.05810","repositories_listed":1,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":1,"phrase":"10 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/rna-secondary-structure-prediction-by-1#ran","syntology_url":"https://syntology.ai/paper/2002.05810","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.05810"}},"official":{"repos":["ml4bio/e2efold"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/molecule-property-prediction-and-1","slug":"molecule-property-prediction-and-1","title":"Molecule Property Prediction and Classification with Graph Hypernetworks","date":"2020-02-01","arxiv_id":"2002.00240","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/molecule-property-prediction-and-1#ran","syntology_url":"https://syntology.ai/paper/2002.00240","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.00240"}},"official":null}},{"url":"/paper/popcorn-partially-observed-prediction","slug":"popcorn-partially-observed-prediction","title":"POPCORN: Partially Observed Prediction COnstrained ReiNforcement Learning","date":"2020-01-13","arxiv_id":"2001.04032","repositories_listed":1,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/popcorn-partially-observed-prediction#ran","syntology_url":"https://syntology.ai/paper/2001.04032","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.04032"}},"official":{"repos":["dtak/POPCORN-POMDP"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/retrosynthesis-prediction-with-conditional-1","slug":"retrosynthesis-prediction-with-conditional-1","title":"Retrosynthesis Prediction with Conditional Graph Logic Network","date":"2020-01-06","arxiv_id":"2001.01408","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/retrosynthesis-prediction-with-conditional-1#ran","syntology_url":"https://syntology.ai/paper/2001.01408","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.01408"}},"official":{"repos":["Hanjun-Dai/GLN"],"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/language-models-are-an-effective-patient","slug":"language-models-are-an-effective-patient","title":"Language Models Are An Effective Patient Representation Learning Technique For Electronic Health Record Data","date":"2020-01-06","arxiv_id":"2001.05295","repositories_listed":2,"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":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/language-models-are-an-effective-patient#ran","syntology_url":"https://syntology.ai/paper/2001.05295","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.05295"}},"official":null}},{"url":"/paper/covernet-multimodal-behavior-prediction-using","slug":"covernet-multimodal-behavior-prediction-using","title":"CoverNet: Multimodal Behavior Prediction using Trajectory Sets","date":"2019-11-23","arxiv_id":"1911.10298","repositories_listed":3,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/covernet-multimodal-behavior-prediction-using#ran","syntology_url":"https://syntology.ai/paper/1911.10298","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.10298"}},"official":null}},{"url":"/paper/towards-physics-informed-deep-learning-for-1","slug":"towards-physics-informed-deep-learning-for-1","title":"Towards Physics-informed Deep Learning for Turbulent Flow Prediction","date":"2019-11-20","arxiv_id":"1911.08655","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"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) · 2 unverified","sample_list":"/paper/towards-physics-informed-deep-learning-for-1#ran","syntology_url":"https://syntology.ai/paper/1911.08655","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.08655"}},"official":null}},{"url":"/paper/inductive-relation-prediction-on-knowledge","slug":"inductive-relation-prediction-on-knowledge","title":"Inductive Relation Prediction by Subgraph Reasoning","date":"2019-11-16","arxiv_id":"1911.06962","repositories_listed":10,"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/inductive-relation-prediction-on-knowledge#ran","syntology_url":"https://syntology.ai/paper/1911.06962","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.06962"}},"official":{"repos":["kkteru/grail"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/gman-a-graph-multi-attention-network-for","slug":"gman-a-graph-multi-attention-network-for","title":"GMAN: A Graph Multi-Attention Network for Traffic Prediction","date":"2019-11-11","arxiv_id":"1911.08415","repositories_listed":6,"syntology":{"n":10,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":6,"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) · 6 unverified","sample_list":"/paper/gman-a-graph-multi-attention-network-for#ran","syntology_url":"https://syntology.ai/paper/1911.08415","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.08415"}},"official":{"repos":["zhengchuanpan/GMAN"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/multiple-futures-prediction","slug":"multiple-futures-prediction","title":"Multiple Futures Prediction","date":"2019-11-04","arxiv_id":"1911.00997","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/multiple-futures-prediction#ran","syntology_url":"https://syntology.ai/paper/1911.00997","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.00997"}},"official":null}},{"url":"/paper/interacte-improving-convolution-based","slug":"interacte-improving-convolution-based","title":"InteractE: Improving Convolution-based Knowledge Graph Embeddings by Increasing Feature Interactions","date":"2019-11-01","arxiv_id":"1911.00219","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/interacte-improving-convolution-based#ran","syntology_url":"https://syntology.ai/paper/1911.00219","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.00219"}},"official":{"repos":["malllabiisc/InteractE"],"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/select-answer-and-explain-interpretable-multi","slug":"select-answer-and-explain-interpretable-multi","title":"Select, Answer and Explain: Interpretable Multi-hop Reading Comprehension over Multiple Documents","date":"2019-11-01","arxiv_id":"1911.00484","repositories_listed":1,"syntology":{"n":15,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/select-answer-and-explain-interpretable-multi#ran","syntology_url":"https://syntology.ai/paper/1911.00484","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.00484"}},"official":null}},{"url":"/paper/structured-prediction-with-projection-oracles","slug":"structured-prediction-with-projection-oracles","title":"Structured Prediction with Projection Oracles","date":"2019-10-24","arxiv_id":"1910.11369","repositories_listed":1,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":8,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/structured-prediction-with-projection-oracles#ran","syntology_url":"https://syntology.ai/paper/1910.11369","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.11369"}},"official":{"repos":["mblondel/projection-losses"],"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/adversarial-examples-for-models-of-code","slug":"adversarial-examples-for-models-of-code","title":"Adversarial Examples for Models of Code","date":"2019-10-15","arxiv_id":"1910.07517","repositories_listed":4,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":5,"n_instrument":5,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":4,"phrase":"10 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; 5 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adversarial-examples-for-models-of-code#ran","syntology_url":"https://syntology.ai/paper/1910.07517","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.07517"}},"official":{"repos":["tech-srl/adversarial-examples"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/ngboost-natural-gradient-boosting-for","slug":"ngboost-natural-gradient-boosting-for","title":"NGBoost: Natural Gradient Boosting for Probabilistic Prediction","date":"2019-10-08","arxiv_id":"1910.03225","repositories_listed":4,"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/ngboost-natural-gradient-boosting-for#ran","syntology_url":"https://syntology.ai/paper/1910.03225","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.03225"}},"official":{"repos":["stanfordmlgroup/ngboost"],"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":["listed","official"]}}},{"url":"/paper/interpolation-prediction-networks-for-1","slug":"interpolation-prediction-networks-for-1","title":"Interpolation-Prediction Networks for Irregularly Sampled Time Series","date":"2019-09-13","arxiv_id":"1909.07782","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/interpolation-prediction-networks-for-1#ran","syntology_url":"https://syntology.ai/paper/1909.07782","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.07782"}},"official":{"repos":["mlds-lab/interp-net"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/building-calibrated-deep-models-via","slug":"building-calibrated-deep-models-via","title":"Building Calibrated Deep Models via Uncertainty Matching with Auxiliary Interval Predictors","date":"2019-09-09","arxiv_id":"1909.04079","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/building-calibrated-deep-models-via#ran","syntology_url":"https://syntology.ai/paper/1909.04079","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.04079"}},"official":null}},{"url":"/paper/span-selection-pre-training-for-question","slug":"span-selection-pre-training-for-question","title":"Span Selection Pre-training for Question Answering","date":"2019-09-09","arxiv_id":"1909.04120","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/span-selection-pre-training-for-question#ran","syntology_url":"https://syntology.ai/paper/1909.04120","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.04120"}},"official":{"repos":["IBM/span-selection-pretraining"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/kg-bert-bert-for-knowledge-graph-completion","slug":"kg-bert-bert-for-knowledge-graph-completion","title":"KG-BERT: BERT for Knowledge Graph Completion","date":"2019-09-07","arxiv_id":"1909.03193","repositories_listed":3,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"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) · 1 unverified","sample_list":"/paper/kg-bert-bert-for-knowledge-graph-completion#ran","syntology_url":"https://syntology.ai/paper/1909.03193","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.03193"}},"official":{"repos":["yao8839836/kg-bert"],"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/learning-trajectory-dependencies-for-human","slug":"learning-trajectory-dependencies-for-human","title":"Learning Trajectory Dependencies for Human Motion Prediction","date":"2019-08-15","arxiv_id":"1908.05436","repositories_listed":5,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/learning-trajectory-dependencies-for-human#ran","syntology_url":"https://syntology.ai/paper/1908.05436","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.05436"}},"official":{"repos":["wei-mao-2019/LearnTrajDep"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/predicting-dynamic-embedding-trajectory-in","slug":"predicting-dynamic-embedding-trajectory-in","title":"Predicting Dynamic Embedding Trajectory in Temporal Interaction Networks","date":"2019-08-03","arxiv_id":"1908.01207","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/predicting-dynamic-embedding-trajectory-in#ran","syntology_url":"https://syntology.ai/paper/1908.01207","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.01207"}},"official":null}},{"url":"/paper/feature-robustness-in-non-stationary-health","slug":"feature-robustness-in-non-stationary-health","title":"Feature Robustness in Non-stationary Health Records: Caveats to Deployable Model Performance in Common Clinical Machine Learning Tasks","date":"2019-08-02","arxiv_id":"1908.00690","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/feature-robustness-in-non-stationary-health#ran","syntology_url":"https://syntology.ai/paper/1908.00690","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.00690"}},"official":{"repos":["MLforHealth/MIMIC_Generalisation"],"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/deep-gamblers-learning-to-abstain-with","slug":"deep-gamblers-learning-to-abstain-with","title":"Deep Gamblers: Learning to Abstain with Portfolio Theory","date":"2019-06-29","arxiv_id":"1907.00208","repositories_listed":3,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":2,"phrase":"6 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/deep-gamblers-learning-to-abstain-with#ran","syntology_url":"https://syntology.ai/paper/1907.00208","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.00208"}},"official":{"repos":["Z-T-WANG/NIPS2019DeepGamblers"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-star-net-for-generalized-multi-task-1","slug":"graph-star-net-for-generalized-multi-task-1","title":"Graph Star Net for Generalized Multi-Task Learning","date":"2019-06-21","arxiv_id":"1906.12330","repositories_listed":1,"syntology":{"n":6,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"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) · 4 unverified","sample_list":"/paper/graph-star-net-for-generalized-multi-task-1#ran","syntology_url":"https://syntology.ai/paper/1906.12330","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.12330"}},"official":null}},{"url":"/paper/deep-set-prediction-networks","slug":"deep-set-prediction-networks","title":"Deep Set Prediction Networks","date":"2019-06-15","arxiv_id":"1906.06565","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/deep-set-prediction-networks#ran","syntology_url":"https://syntology.ai/paper/1906.06565","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.06565"}},"official":{"repos":["Cyanogenoid/dspn"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-embedding-on-biomedical-networks","slug":"graph-embedding-on-biomedical-networks","title":"Graph Embedding on Biomedical Networks: Methods, Applications, and Evaluations","date":"2019-06-12","arxiv_id":"1906.05017","repositories_listed":4,"syntology":{"n":11,"n_ran":6,"n_constructed":0,"n_ran_checked":3,"n_instrument":3,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 3 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/graph-embedding-on-biomedical-networks#ran","syntology_url":"https://syntology.ai/paper/1906.05017","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.05017"}},"official":{"repos":["xiangyue9607/BioNEV"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/position-aware-graph-neural-networks","slug":"position-aware-graph-neural-networks","title":"Position-aware Graph Neural Networks","date":"2019-06-11","arxiv_id":"1906.04817","repositories_listed":2,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/position-aware-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1906.04817","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.04817"}},"official":{"repos":["JiaxuanYou/P-GNN"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/overcoming-limitations-of-mixture-density-1","slug":"overcoming-limitations-of-mixture-density-1","title":"Overcoming Limitations of Mixture Density Networks: A Sampling and Fitting Framework for Multimodal Future Prediction","date":"2019-06-09","arxiv_id":"1906.03631","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/overcoming-limitations-of-mixture-density-1#ran","syntology_url":"https://syntology.ai/paper/1906.03631","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.03631"}},"official":{"repos":["lmb-freiburg/Multimodal-Future-Prediction"],"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/unsupervised-emergence-of-egocentric-spatial","slug":"unsupervised-emergence-of-egocentric-spatial","title":"Unsupervised Emergence of Egocentric Spatial Structure from Sensorimotor Prediction","date":"2019-06-04","arxiv_id":"1906.01401","repositories_listed":1,"syntology":{"n":16,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/unsupervised-emergence-of-egocentric-spatial#ran","syntology_url":"https://syntology.ai/paper/1906.01401","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.01401"}},"official":{"repos":["alaflaquiere/learn-spatial-structure"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":8,"ran_from_kinds":["official"]}}},{"url":"/paper/fair-regression-quantitative-definitions-and","slug":"fair-regression-quantitative-definitions-and","title":"Fair Regression: Quantitative Definitions and Reduction-based Algorithms","date":"2019-05-30","arxiv_id":"1905.12843","repositories_listed":4,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fair-regression-quantitative-definitions-and#ran","syntology_url":"https://syntology.ai/paper/1905.12843","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.12843"}},"official":null}},{"url":"/paper/structured-output-learning-with-conditional","slug":"structured-output-learning-with-conditional","title":"Structured Output Learning with Conditional Generative Flows","date":"2019-05-30","arxiv_id":"1905.13288","repositories_listed":2,"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/structured-output-learning-with-conditional#ran","syntology_url":"https://syntology.ai/paper/1905.13288","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.13288"}},"official":{"repos":["yolu1055/conditional-glow"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/generative-imputation-and-stochastic","slug":"generative-imputation-and-stochastic","title":"Generative Imputation and Stochastic Prediction","date":"2019-05-22","arxiv_id":"1905.09340","repositories_listed":2,"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":3,"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/generative-imputation-and-stochastic#ran","syntology_url":"https://syntology.ai/paper/1905.09340","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.09340"}},"official":{"repos":["mkachuee/GenerativeImputationStochasticPrediction"],"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/deep-session-interest-network-for-click","slug":"deep-session-interest-network-for-click","title":"Deep Session Interest Network for Click-Through Rate Prediction","date":"2019-05-16","arxiv_id":"1905.06482","repositories_listed":7,"syntology":{"n":11,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/deep-session-interest-network-for-click#ran","syntology_url":"https://syntology.ai/paper/1905.06482","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.06482"}},"official":{"repos":["shenweichen/DSIN"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/interpretable-outcome-prediction-with-sparse","slug":"interpretable-outcome-prediction-with-sparse","title":"Interpretable Outcome Prediction with Sparse Bayesian Neural Networks in Intensive Care","date":"2019-05-07","arxiv_id":"1905.02599","repositories_listed":2,"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/interpretable-outcome-prediction-with-sparse#ran","syntology_url":"https://syntology.ai/paper/1905.02599","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.02599"}},"official":{"repos":["microsoft/horseshoe-bnn"],"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/scene-graph-prediction-with-limited-labels","slug":"scene-graph-prediction-with-limited-labels","title":"Scene Graph Prediction with Limited Labels","date":"2019-04-25","arxiv_id":"1904.11622","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/scene-graph-prediction-with-limited-labels#ran","syntology_url":"https://syntology.ai/paper/1904.11622","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.11622"}},"official":null}},{"url":"/paper/document-expansion-by-query-prediction","slug":"document-expansion-by-query-prediction","title":"Document Expansion by Query Prediction","date":"2019-04-17","arxiv_id":"1904.08375","repositories_listed":5,"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/document-expansion-by-query-prediction#ran","syntology_url":"https://syntology.ai/paper/1904.08375","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.08375"}},"official":{"repos":["nyu-dl/dl4ir-doc2query"],"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/tafe-net-task-aware-feature-embeddings-for-1","slug":"tafe-net-task-aware-feature-embeddings-for-1","title":"TAFE-Net: Task-Aware Feature Embeddings for Low Shot Learning","date":"2019-04-11","arxiv_id":"1904.05967","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/tafe-net-task-aware-feature-embeddings-for-1#ran","syntology_url":"https://syntology.ai/paper/1904.05967","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.05967"}},"official":{"repos":["ucbdrive/tafe-net"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/are-learned-molecular-representations-ready","slug":"are-learned-molecular-representations-ready","title":"Analyzing Learned Molecular Representations for Property Prediction","date":"2019-04-02","arxiv_id":"1904.01561","repositories_listed":4,"syntology":{"n":15,"n_ran":14,"n_constructed":0,"n_ran_checked":14,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":3,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/are-learned-molecular-representations-ready#ran","syntology_url":"https://syntology.ai/paper/1904.01561","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.01561"}},"official":{"repos":["swansonk14/chemprop"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/the-simpler-the-better-constant-velocity-for","slug":"the-simpler-the-better-constant-velocity-for","title":"What the Constant Velocity Model Can Teach Us About Pedestrian Motion Prediction","date":"2019-03-19","arxiv_id":"1903.07933","repositories_listed":2,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"4 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; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/the-simpler-the-better-constant-velocity-for#ran","syntology_url":"https://syntology.ai/paper/1903.07933","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.07933"}},"official":{"repos":["cschoeller/constant_velocity_pedestrian_motion"],"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":["listed","official"]}}},{"url":"/paper/structured-knowledge-distillation-for","slug":"structured-knowledge-distillation-for","title":"Structured Knowledge Distillation for Dense Prediction","date":"2019-03-11","arxiv_id":"1903.04197","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":2,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"5 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/structured-knowledge-distillation-for#ran","syntology_url":"https://syntology.ai/paper/1903.04197","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.04197"}},"official":{"repos":["irfanICMLL/structure_knowledge_distillation"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/contextual-encoder-decoder-network-for-visual","slug":"contextual-encoder-decoder-network-for-visual","title":"Contextual Encoder-Decoder Network for Visual Saliency Prediction","date":"2019-02-18","arxiv_id":"1902.06634","repositories_listed":4,"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/contextual-encoder-decoder-network-for-visual#ran","syntology_url":"https://syntology.ai/paper/1902.06634","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.06634"}},"official":{"repos":["alexanderkroner/saliency"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["listed"]}}},{"url":"/paper/bayesian-online-detection-and-prediction-of","slug":"bayesian-online-detection-and-prediction-of","title":"Bayesian Online Prediction of Change Points","date":"2019-02-12","arxiv_id":"1902.04524","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/bayesian-online-detection-and-prediction-of#ran","syntology_url":"https://syntology.ai/paper/1902.04524","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.04524"}},"official":{"repos":["DiegoAE/BOSD"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/peeking-into-the-future-predicting-future","slug":"peeking-into-the-future-predicting-future","title":"Peeking into the Future: Predicting Future Person Activities and Locations in Videos","date":"2019-02-11","arxiv_id":"1902.03748","repositories_listed":2,"syntology":{"n":27,"n_ran":13,"n_constructed":0,"n_ran_checked":12,"n_instrument":1,"n_unverified":14,"n_honours":1,"n_violates":0,"n_no_contract":11,"n_pointer_only":22,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 1 honoured, 0 violated, 11 with no contract checked; 1 where Syntology's instrument failed) · 14 unverified","sample_list":"/paper/peeking-into-the-future-predicting-future#ran","syntology_url":"https://syntology.ai/paper/1902.03748","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.03748"}},"official":{"repos":["google/next-prediction"],"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":["listed","official"]}}},{"url":"/paper/gcn-gan-a-non-linear-temporal-link-prediction","slug":"gcn-gan-a-non-linear-temporal-link-prediction","title":"GCN-GAN: A Non-linear Temporal Link Prediction Model for Weighted Dynamic Networks","date":"2019-01-26","arxiv_id":"1901.09165","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/gcn-gan-a-non-linear-temporal-link-prediction#ran","syntology_url":"https://syntology.ai/paper/1901.09165","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.09165"}},"official":null}},{"url":"/paper/selectivenet-a-deep-neural-network-with-an","slug":"selectivenet-a-deep-neural-network-with-an","title":"SelectiveNet: A Deep Neural Network with an Integrated Reject Option","date":"2019-01-26","arxiv_id":"1901.09192","repositories_listed":5,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":3,"n_pointer_only":3,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 1 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/selectivenet-a-deep-neural-network-with-an#ran","syntology_url":"https://syntology.ai/paper/1901.09192","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.09192"}},"official":{"repos":["geifmany/SelectiveNet"],"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":["listed","official"]}}},{"url":"/paper/consistent-rank-logits-for-ordinal-regression","slug":"consistent-rank-logits-for-ordinal-regression","title":"Rank consistent ordinal regression for neural networks with application to age estimation","date":"2019-01-20","arxiv_id":"1901.07884","repositories_listed":4,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/consistent-rank-logits-for-ordinal-regression#ran","syntology_url":"https://syntology.ai/paper/1901.07884","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.07884"}},"official":{"repos":["Raschka-research-group/coral-cnn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/disentangling-propagation-and-generation-for","slug":"disentangling-propagation-and-generation-for","title":"Disentangling Propagation and Generation for Video Prediction","date":"2018-12-02","arxiv_id":"1812.00452","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":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) · 1 unverified","sample_list":"/paper/disentangling-propagation-and-generation-for#ran","syntology_url":"https://syntology.ai/paper/1812.00452","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.00452"}},"official":null}},{"url":"/paper/t-gcn-a-temporal-graph-convolutionalnetwork","slug":"t-gcn-a-temporal-graph-convolutionalnetwork","title":"T-GCN: A Temporal Graph ConvolutionalNetwork for Traffic Prediction","date":"2018-11-12","arxiv_id":"1811.05320","repositories_listed":10,"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":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/t-gcn-a-temporal-graph-convolutionalnetwork#ran","syntology_url":"https://syntology.ai/paper/1811.05320","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.05320"}},"official":{"repos":["lehaifeng/T-GCN"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/federated-learning-for-mobile-keyboard","slug":"federated-learning-for-mobile-keyboard","title":"Federated Learning for Mobile Keyboard Prediction","date":"2018-11-08","arxiv_id":"1811.03604","repositories_listed":6,"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/federated-learning-for-mobile-keyboard#ran","syntology_url":"https://syntology.ai/paper/1811.03604","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.03604"}},"official":null}},{"url":"/paper/deep-interest-evolution-network-for-click","slug":"deep-interest-evolution-network-for-click","title":"Deep Interest Evolution Network for Click-Through Rate Prediction","date":"2018-09-11","arxiv_id":"1809.03672","repositories_listed":15,"syntology":{"n":14,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/deep-interest-evolution-network-for-click#ran","syntology_url":"https://syntology.ai/paper/1809.03672","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.03672"}},"official":{"repos":["mouna99/dien"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/a-neural-temporal-model-for-human-motion","slug":"a-neural-temporal-model-for-human-motion","title":"A Neural Temporal Model for Human Motion Prediction","date":"2018-09-09","arxiv_id":"1809.03036","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-neural-temporal-model-for-human-motion#ran","syntology_url":"https://syntology.ai/paper/1809.03036","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.03036"}},"official":{"repos":["cr7anand/neural_temporal_models"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/adaptive-skip-intervals-temporal-abstraction","slug":"adaptive-skip-intervals-temporal-abstraction","title":"Adaptive Skip Intervals: Temporal Abstraction for Recurrent Dynamical Models","date":"2018-08-14","arxiv_id":"1808.04768","repositories_listed":2,"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/adaptive-skip-intervals-temporal-abstraction#ran","syntology_url":"https://syntology.ai/paper/1808.04768","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.04768"}},"official":{"repos":["neitzal/adaptive-skip-intervals"],"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/disentangled-representation-learning-for-non","slug":"disentangled-representation-learning-for-non","title":"Disentangled Representation Learning for Non-Parallel Text Style Transfer","date":"2018-08-13","arxiv_id":"1808.04339","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":3,"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; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/disentangled-representation-learning-for-non#ran","syntology_url":"https://syntology.ai/paper/1808.04339","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.04339"}},"official":{"repos":["vineetjohn/linguistic-style-transfer"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/large-scale-study-of-curiosity-driven","slug":"large-scale-study-of-curiosity-driven","title":"Large-Scale Study of Curiosity-Driven Learning","date":"2018-08-13","arxiv_id":"1808.04355","repositories_listed":5,"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":3,"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/large-scale-study-of-curiosity-driven#ran","syntology_url":"https://syntology.ai/paper/1808.04355","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.04355"}},"official":{"repos":["openai/large-scale-curiosity"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/deepinf-social-influence-prediction-with-deep","slug":"deepinf-social-influence-prediction-with-deep","title":"DeepInf: Social Influence Prediction with Deep Learning","date":"2018-07-15","arxiv_id":"1807.05560","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/deepinf-social-influence-prediction-with-deep#ran","syntology_url":"https://syntology.ai/paper/1807.05560","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1807.05560"}},"official":{"repos":["xptree/DeepInf"],"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/cail2018-a-large-scale-legal-dataset-for","slug":"cail2018-a-large-scale-legal-dataset-for","title":"CAIL2018: A Large-Scale Legal Dataset for Judgment Prediction","date":"2018-07-04","arxiv_id":"1807.02478","repositories_listed":3,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/cail2018-a-large-scale-legal-dataset-for#ran","syntology_url":"https://syntology.ai/paper/1807.02478","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1807.02478"}},"official":null}},{"url":"/paper/evidential-deep-learning-to-quantify","slug":"evidential-deep-learning-to-quantify","title":"Evidential Deep Learning to Quantify Classification Uncertainty","date":"2018-06-05","arxiv_id":"1806.01768","repositories_listed":10,"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":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/evidential-deep-learning-to-quantify#ran","syntology_url":"https://syntology.ai/paper/1806.01768","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.01768"}},"official":null}},{"url":"/paper/meta-learning-probabilistic-inference-for","slug":"meta-learning-probabilistic-inference-for","title":"Meta-Learning Probabilistic Inference For Prediction","date":"2018-05-24","arxiv_id":"1805.09921","repositories_listed":1,"syntology":{"n":8,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/meta-learning-probabilistic-inference-for#ran","syntology_url":"https://syntology.ai/paper/1805.09921","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.09921"}},"official":{"repos":["Gordonjo/versa"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/heterogeneous-multi-output-gaussian-process","slug":"heterogeneous-multi-output-gaussian-process","title":"Heterogeneous Multi-output Gaussian Process Prediction","date":"2018-05-19","arxiv_id":"1805.07633","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/heterogeneous-multi-output-gaussian-process#ran","syntology_url":"https://syntology.ai/paper/1805.07633","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.07633"}},"official":{"repos":["pmorenoz/HetMOGP"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/convolutional-social-pooling-for-vehicle","slug":"convolutional-social-pooling-for-vehicle","title":"Convolutional Social Pooling for Vehicle Trajectory Prediction","date":"2018-05-15","arxiv_id":"1805.06771","repositories_listed":3,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/convolutional-social-pooling-for-vehicle#ran","syntology_url":"https://syntology.ai/paper/1805.06771","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.06771"}},"official":{"repos":["nachiket92/conv-social-pooling"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/stochastic-adversarial-video-prediction","slug":"stochastic-adversarial-video-prediction","title":"Stochastic Adversarial Video Prediction","date":"2018-04-04","arxiv_id":"1804.01523","repositories_listed":4,"syntology":{"n":16,"n_ran":10,"n_constructed":0,"n_ran_checked":7,"n_instrument":3,"n_unverified":6,"n_honours":0,"n_violates":1,"n_no_contract":6,"n_pointer_only":3,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 1 violated, 6 with no contract checked; 3 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/stochastic-adversarial-video-prediction#ran","syntology_url":"https://syntology.ai/paper/1804.01523","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.01523"}},"official":{"repos":["alexlee-gk/video_prediction"],"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":["listed","official"]}}},{"url":"/paper/megadepth-learning-single-view-depth","slug":"megadepth-learning-single-view-depth","title":"MegaDepth: Learning Single-View Depth Prediction from Internet Photos","date":"2018-04-02","arxiv_id":"1804.00607","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/megadepth-learning-single-view-depth#ran","syntology_url":"https://syntology.ai/paper/1804.00607","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.00607"}},"official":null}},{"url":"/paper/learning-approximate-inference-networks-for","slug":"learning-approximate-inference-networks-for","title":"Learning Approximate Inference Networks for Structured Prediction","date":"2018-03-09","arxiv_id":"1803.03376","repositories_listed":3,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"2 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-approximate-inference-networks-for#ran","syntology_url":"https://syntology.ai/paper/1803.03376","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.03376"}},"official":null}},{"url":"/paper/explainable-prediction-of-medical-codes-from","slug":"explainable-prediction-of-medical-codes-from","title":"Explainable Prediction of Medical Codes from Clinical Text","date":"2018-02-15","arxiv_id":"1802.05695","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/explainable-prediction-of-medical-codes-from#ran","syntology_url":"https://syntology.ai/paper/1802.05695","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.05695"}},"official":{"repos":["jamesmullenbach/caml-mimic"],"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/faster-gaze-prediction-with-dense-networks","slug":"faster-gaze-prediction-with-dense-networks","title":"Faster gaze prediction with dense networks and Fisher pruning","date":"2018-01-17","arxiv_id":"1801.05787","repositories_listed":2,"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/faster-gaze-prediction-with-dense-networks#ran","syntology_url":"https://syntology.ai/paper/1801.05787","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1801.05787"}},"official":null}},{"url":"/paper/burst-denoising-with-kernel-prediction","slug":"burst-denoising-with-kernel-prediction","title":"Burst Denoising with Kernel Prediction Networks","date":"2017-12-06","arxiv_id":"1712.02327","repositories_listed":3,"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":3,"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/burst-denoising-with-kernel-prediction#ran","syntology_url":"https://syntology.ai/paper/1712.02327","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1712.02327"}},"official":null}},{"url":"/paper/sparse-to-dense-depth-prediction-from-sparse","slug":"sparse-to-dense-depth-prediction-from-sparse","title":"Sparse-to-Dense: Depth Prediction from Sparse Depth Samples and a Single Image","date":"2017-09-21","arxiv_id":"1709.07492","repositories_listed":6,"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/sparse-to-dense-depth-prediction-from-sparse#ran","syntology_url":"https://syntology.ai/paper/1709.07492","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1709.07492"}},"official":{"repos":["fangchangma/sparse-to-dense"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/deep-and-confident-prediction-for-time-series","slug":"deep-and-confident-prediction-for-time-series","title":"Deep and Confident Prediction for Time Series at Uber","date":"2017-09-06","arxiv_id":"1709.01907","repositories_listed":6,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":2,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 2 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/deep-and-confident-prediction-for-time-series#ran","syntology_url":"https://syntology.ai/paper/1709.01907","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1709.01907"}},"official":null}},{"url":"/paper/learning-to-prune-deep-neural-networks-via","slug":"learning-to-prune-deep-neural-networks-via","title":"Learning to Prune Deep Neural Networks via Layer-wise Optimal Brain Surgeon","date":"2017-05-22","arxiv_id":"1705.07565","repositories_listed":2,"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-prune-deep-neural-networks-via#ran","syntology_url":"https://syntology.ai/paper/1705.07565","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1705.07565"}},"official":{"repos":["csyhhu/L-OBS"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/curiosity-driven-exploration-by-self","slug":"curiosity-driven-exploration-by-self","title":"Curiosity-driven Exploration by Self-supervised Prediction","date":"2017-05-15","arxiv_id":"1705.05363","repositories_listed":13,"syntology":{"n":32,"n_ran":16,"n_constructed":9,"n_ran_checked":13,"n_instrument":3,"n_unverified":16,"n_honours":1,"n_violates":1,"n_no_contract":11,"n_pointer_only":14,"phrase":"16 ran (of which 9 constructed an object rather than computing a result; 13 with no instrument failure: 1 honoured, 1 violated, 11 with no contract checked; 3 where Syntology's instrument failed) · 16 unverified","sample_list":"/paper/curiosity-driven-exploration-by-self#ran","syntology_url":"https://syntology.ai/paper/1705.05363","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1705.05363"}},"official":{"repos":["pathak22/noreward-rl"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":7,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/on-human-motion-prediction-using-recurrent","slug":"on-human-motion-prediction-using-recurrent","title":"On human motion prediction using recurrent neural networks","date":"2017-05-06","arxiv_id":"1705.02445","repositories_listed":8,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/on-human-motion-prediction-using-recurrent#ran","syntology_url":"https://syntology.ai/paper/1705.02445","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1705.02445"}},"official":{"repos":["una-dinosauria/human-motion-prediction"],"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":["listed","official"]}}},{"url":"/paper/learning-to-generate-long-term-future-via","slug":"learning-to-generate-long-term-future-via","title":"Learning to Generate Long-term Future via Hierarchical Prediction","date":"2017-04-19","arxiv_id":"1704.05831","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/learning-to-generate-long-term-future-via#ran","syntology_url":"https://syntology.ai/paper/1704.05831","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1704.05831"}},"official":null}},{"url":"/paper/desire-distant-future-prediction-in-dynamic","slug":"desire-distant-future-prediction-in-dynamic","title":"DESIRE: Distant Future Prediction in Dynamic Scenes with Interacting Agents","date":"2017-04-14","arxiv_id":"1704.04394","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/desire-distant-future-prediction-in-dynamic#ran","syntology_url":"https://syntology.ai/paper/1704.04394","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1704.04394"}},"official":null}},{"url":"/paper/cnn-slam-real-time-dense-monocular-slam-with","slug":"cnn-slam-real-time-dense-monocular-slam-with","title":"CNN-SLAM: Real-time dense monocular SLAM with learned depth prediction","date":"2017-04-11","arxiv_id":"1704.03489","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":3,"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/cnn-slam-real-time-dense-monocular-slam-with#ran","syntology_url":"https://syntology.ai/paper/1704.03489","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1704.03489"}},"official":null}},{"url":"/paper/visualizing-deep-neural-network-decisions","slug":"visualizing-deep-neural-network-decisions","title":"Visualizing Deep Neural Network Decisions: Prediction Difference Analysis","date":"2017-02-15","arxiv_id":"1702.04595","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/visualizing-deep-neural-network-decisions#ran","syntology_url":"https://syntology.ai/paper/1702.04595","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1702.04595"}},"official":{"repos":["lmzintgraf/DeepVis-PredDiff"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/salgan-visual-saliency-prediction-with","slug":"salgan-visual-saliency-prediction-with","title":"SalGAN: Visual Saliency Prediction with Generative Adversarial Networks","date":"2017-01-04","arxiv_id":"1701.01081","repositories_listed":4,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":2,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/salgan-visual-saliency-prediction-with#ran","syntology_url":"https://syntology.ai/paper/1701.01081","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1701.01081"}},"official":{"repos":["imatge-upc/salgan"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/online-real-time-multiple-spatiotemporal","slug":"online-real-time-multiple-spatiotemporal","title":"Online Real-time Multiple Spatiotemporal Action Localisation and Prediction","date":"2016-11-25","arxiv_id":"1611.08563","repositories_listed":5,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":1,"n_instrument":6,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":7,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 6 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/online-real-time-multiple-spatiotemporal#ran","syntology_url":"https://syntology.ai/paper/1611.08563","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.08563"}},"official":{"repos":["gurkirt/realtime-action-detection","gurkirt/corrected-UCF101-Annots"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/variational-graph-auto-encoders","slug":"variational-graph-auto-encoders","title":"Variational Graph Auto-Encoders","date":"2016-11-21","arxiv_id":"1611.07308","repositories_listed":22,"syntology":{"n":13,"n_ran":11,"n_constructed":0,"n_ran_checked":7,"n_instrument":4,"n_unverified":2,"n_honours":3,"n_violates":0,"n_no_contract":4,"n_pointer_only":4,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 3 honoured, 0 violated, 4 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/variational-graph-auto-encoders#ran","syntology_url":"https://syntology.ai/paper/1611.07308","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.07308"}},"official":{"repos":["tkipf/gae"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/log-time-and-log-space-extreme-classification","slug":"log-time-and-log-space-extreme-classification","title":"Log-time and Log-space Extreme Classification","date":"2016-11-07","arxiv_id":"1611.01964","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/log-time-and-log-space-extreme-classification#ran","syntology_url":"https://syntology.ai/paper/1611.01964","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.01964"}},"official":null}},{"url":"/paper/a-deep-multi-level-network-for-saliency","slug":"a-deep-multi-level-network-for-saliency","title":"A Deep Multi-Level Network for Saliency Prediction","date":"2016-09-05","arxiv_id":"1609.01064","repositories_listed":2,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-deep-multi-level-network-for-saliency#ran","syntology_url":"https://syntology.ai/paper/1609.01064","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1609.01064"}},"official":{"repos":["marcellacornia/mlnet"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/higher-order-factorization-machines","slug":"higher-order-factorization-machines","title":"Higher-Order Factorization Machines","date":"2016-07-25","arxiv_id":"1607.07195","repositories_listed":4,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"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 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) · 1 unverified","sample_list":"/paper/higher-order-factorization-machines#ran","syntology_url":"https://syntology.ai/paper/1607.07195","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1607.07195"}},"official":null}},{"url":"/paper/rationalizing-neural-predictions","slug":"rationalizing-neural-predictions","title":"Rationalizing Neural Predictions","date":"2016-06-13","arxiv_id":"1606.04155","repositories_listed":3,"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/rationalizing-neural-predictions#ran","syntology_url":"https://syntology.ai/paper/1606.04155","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.04155"}},"official":{"repos":["taolei87/rcnn"],"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/recurrent-neural-networks-for-multivariate","slug":"recurrent-neural-networks-for-multivariate","title":"Recurrent Neural Networks for Multivariate Time Series with Missing Values","date":"2016-06-06","arxiv_id":"1606.01865","repositories_listed":7,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/recurrent-neural-networks-for-multivariate#ran","syntology_url":"https://syntology.ai/paper/1606.01865","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.01865"}},"official":{"repos":["WenjieDu/PyPOTS"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/smooth-imitation-learning-for-online-sequence","slug":"smooth-imitation-learning-for-online-sequence","title":"Smooth Imitation Learning for Online Sequence Prediction","date":"2016-06-03","arxiv_id":"1606.00968","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/smooth-imitation-learning-for-online-sequence#ran","syntology_url":"https://syntology.ai/paper/1606.00968","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.00968"}},"official":{"repos":["hoangminhle/SIMILE"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/stochastic-structured-prediction-under-bandit","slug":"stochastic-structured-prediction-under-bandit","title":"Stochastic Structured Prediction under Bandit Feedback","date":"2016-06-02","arxiv_id":"1606.00739","repositories_listed":1,"syntology":{"n":14,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/stochastic-structured-prediction-under-bandit#ran","syntology_url":"https://syntology.ai/paper/1606.00739","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.00739"}},"official":null}}],"record_sha256":"bf19a5c34c16db155d58194eec34a9d8f7b3598bc86203a7050f02d325f16aa3","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}