{"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/language-modelling/papers/ran/24","list_of":"/task/language-modelling","task":"Language Modelling","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":24,"pages_in_order":25,"rows_per_page":100,"rows":[2301,2400],"of":2428,"counts":{"archive_papers_tagged":17610,"with_a_code_link":7012,"where_syntology_ran_a_sample":2428,"not_listed_spam_title":0,"listed":17610,"listed_where_code_ran":2428,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":2027,"every_run_a_failure_of_syntologys_instrument":401,"listed_with_a_run_with_no_instrument_failure":2027,"listed_every_run_a_failure_of_syntologys_instrument":401,"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/language-modelling/papers/ran/1","prev":"/task/language-modelling/papers/ran/23","next":"/task/language-modelling/papers/ran/25","papers":[{"url":"/paper/commonsense-knowledge-mining-from-pretrained","slug":"commonsense-knowledge-mining-from-pretrained","title":"Commonsense Knowledge Mining from Pretrained Models","date":"2019-09-02","arxiv_id":"1909.00505","repositories_listed":1,"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":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) · 1 unverified","sample_list":"/paper/commonsense-knowledge-mining-from-pretrained#ran","syntology_url":"https://syntology.ai/paper/1909.00505","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.00505"}},"official":null}},{"url":"/paper/adapt-or-get-left-behind-domain-adaptation","slug":"adapt-or-get-left-behind-domain-adaptation","title":"Adapt or Get Left Behind: Domain Adaptation through BERT Language Model Finetuning for Aspect-Target Sentiment Classification","date":"2019-08-30","arxiv_id":"1908.11860","repositories_listed":3,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/adapt-or-get-left-behind-domain-adaptation#ran","syntology_url":"https://syntology.ai/paper/1908.11860","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.11860"}},"official":{"repos":["deepopinion/domain-adapted-atsc"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed"]}}},{"url":"/paper/finbert-financial-sentiment-analysis-with-pre","slug":"finbert-financial-sentiment-analysis-with-pre","title":"FinBERT: Financial Sentiment Analysis with Pre-trained Language Models","date":"2019-08-27","arxiv_id":"1908.10063","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/finbert-financial-sentiment-analysis-with-pre#ran","syntology_url":"https://syntology.ai/paper/1908.10063","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.10063"}},"official":null}},{"url":"/paper/unsupervised-domain-adaptation-for-neural","slug":"unsupervised-domain-adaptation-for-neural","title":"Unsupervised Domain Adaptation for Neural Machine Translation with Domain-Aware Feature Embeddings","date":"2019-08-27","arxiv_id":"1908.10430","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"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) · 2 unverified","sample_list":"/paper/unsupervised-domain-adaptation-for-neural#ran","syntology_url":"https://syntology.ai/paper/1908.10430","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.10430"}},"official":{"repos":["zdou0830/DAFE"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/uniblock-scoring-and-filtering-corpus-with","slug":"uniblock-scoring-and-filtering-corpus-with","title":"uniblock: Scoring and Filtering Corpus with Unicode Block Information","date":"2019-08-26","arxiv_id":"1908.09716","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":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) · 0 unverified","sample_list":"/paper/uniblock-scoring-and-filtering-corpus-with#ran","syntology_url":"https://syntology.ai/paper/1908.09716","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.09716"}},"official":{"repos":["ringoreality/uniblock"],"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/well-read-students-learn-better-the-impact-of","slug":"well-read-students-learn-better-the-impact-of","title":"Well-Read Students Learn Better: On the Importance of Pre-training Compact Models","date":"2019-08-23","arxiv_id":"1908.08962","repositories_listed":40,"syntology":{"n":32,"n_ran":21,"n_constructed":0,"n_ran_checked":16,"n_instrument":5,"n_unverified":11,"n_honours":1,"n_violates":0,"n_no_contract":15,"n_pointer_only":4,"phrase":"21 ran (of which 0 constructed an object rather than computing a result; 16 with no instrument failure: 1 honoured, 0 violated, 15 with no contract checked; 5 where Syntology's instrument failed) · 11 unverified","sample_list":"/paper/well-read-students-learn-better-the-impact-of#ran","syntology_url":"https://syntology.ai/paper/1908.08962","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.08962"}},"official":{"repos":["google-research/bert"],"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/vl-bert-pre-training-of-generic-visual","slug":"vl-bert-pre-training-of-generic-visual","title":"VL-BERT: Pre-training of Generic Visual-Linguistic Representations","date":"2019-08-22","arxiv_id":"1908.08530","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/vl-bert-pre-training-of-generic-visual#ran","syntology_url":"https://syntology.ai/paper/1908.08530","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.08530"}},"official":{"repos":["jackroos/VL-BERT"],"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/190807724","slug":"190807724","title":"Restricted Recurrent Neural Networks","date":"2019-08-21","arxiv_id":"1908.07724","repositories_listed":1,"syntology":{"n":9,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/190807724#ran","syntology_url":"https://syntology.ai/paper/1908.07724","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.07724"}},"official":{"repos":["diaoenmao/Restricted-Recurrent-Neural-Networks"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/universal-adversarial-triggers-for-nlp","slug":"universal-adversarial-triggers-for-nlp","title":"Universal Adversarial Triggers for Attacking and Analyzing NLP","date":"2019-08-20","arxiv_id":"1908.07125","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/universal-adversarial-triggers-for-nlp#ran","syntology_url":"https://syntology.ai/paper/1908.07125","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.07125"}},"official":{"repos":["Eric-Wallace/universal-triggers"],"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/lxmert-learning-cross-modality-encoder","slug":"lxmert-learning-cross-modality-encoder","title":"LXMERT: Learning Cross-Modality Encoder Representations from Transformers","date":"2019-08-20","arxiv_id":"1908.07490","repositories_listed":9,"syntology":{"n":15,"n_ran":4,"n_constructed":4,"n_ran_checked":4,"n_instrument":0,"n_unverified":11,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":3,"phrase":"4 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 11 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/lxmert-learning-cross-modality-encoder#ran","syntology_url":"https://syntology.ai/paper/1908.07490","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.07490"}},"official":{"repos":["airsplay/lxmert"],"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/predicting-3d-human-dynamics-from-video","slug":"predicting-3d-human-dynamics-from-video","title":"Predicting 3D Human Dynamics from Video","date":"2019-08-13","arxiv_id":"1908.04781","repositories_listed":1,"syntology":{"n":17,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":10,"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) · 10 unverified","sample_list":"/paper/predicting-3d-human-dynamics-from-video#ran","syntology_url":"https://syntology.ai/paper/1908.04781","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.04781"}},"official":{"repos":["jasonyzhang/phd"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":10,"ran_from_kinds":["official"]}}},{"url":"/paper/taper-time-aware-patient-ehr-representation","slug":"taper-time-aware-patient-ehr-representation","title":"TAPER: Time-Aware Patient EHR Representation","date":"2019-08-11","arxiv_id":"1908.03971","repositories_listed":2,"syntology":{"n":12,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":2,"n_honours":1,"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; 9 with no instrument failure: 1 honoured, 0 violated, 8 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/taper-time-aware-patient-ehr-representation#ran","syntology_url":"https://syntology.ai/paper/1908.03971","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.03971"}},"official":{"repos":["sajaddarabi/TAPER","sajaddarabi/TAPER-EHR"],"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/visualbert-a-simple-and-performant-baseline","slug":"visualbert-a-simple-and-performant-baseline","title":"VisualBERT: A Simple and Performant Baseline for Vision and Language","date":"2019-08-09","arxiv_id":"1908.03557","repositories_listed":10,"syntology":{"n":9,"n_ran":4,"n_constructed":2,"n_ran_checked":2,"n_instrument":2,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":6,"phrase":"4 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/visualbert-a-simple-and-performant-baseline#ran","syntology_url":"https://syntology.ai/paper/1908.03557","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.03557"}},"official":null}},{"url":"/paper/on-the-variance-of-the-adaptive-learning-rate","slug":"on-the-variance-of-the-adaptive-learning-rate","title":"On the Variance of the Adaptive Learning Rate and Beyond","date":"2019-08-08","arxiv_id":"1908.03265","repositories_listed":21,"syntology":{"n":13,"n_ran":12,"n_constructed":0,"n_ran_checked":11,"n_instrument":1,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":9,"n_pointer_only":1,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 2 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/on-the-variance-of-the-adaptive-learning-rate#ran","syntology_url":"https://syntology.ai/paper/1908.03265","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.03265"}},"official":{"repos":["LiyuanLucasLiu/RAdam"],"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":["listed","official"]}}},{"url":"/paper/what-bert-is-not-lessons-from-a-new-suite-of","slug":"what-bert-is-not-lessons-from-a-new-suite-of","title":"What BERT is not: Lessons from a new suite of psycholinguistic diagnostics for language models","date":"2019-07-31","arxiv_id":"1907.13528","repositories_listed":2,"syntology":{"n":10,"n_ran":5,"n_constructed":0,"n_ran_checked":0,"n_instrument":5,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"5 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; 5 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/what-bert-is-not-lessons-from-a-new-suite-of#ran","syntology_url":"https://syntology.ai/paper/1907.13528","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.13528"}},"official":{"repos":["aetting/lm-diagnostics"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":5,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/roberta-a-robustly-optimized-bert-pretraining","slug":"roberta-a-robustly-optimized-bert-pretraining","title":"RoBERTa: A Robustly Optimized BERT Pretraining Approach","date":"2019-07-26","arxiv_id":"1907.11692","repositories_listed":67,"syntology":{"n":48,"n_ran":37,"n_constructed":11,"n_ran_checked":36,"n_instrument":1,"n_unverified":11,"n_honours":0,"n_violates":0,"n_no_contract":36,"n_pointer_only":24,"phrase":"37 ran (of which 11 constructed an object rather than computing a result; 36 with no instrument failure: 0 honoured, 0 violated, 36 with no contract checked; 1 where Syntology's instrument failed) · 11 unverified","sample_list":"/paper/roberta-a-robustly-optimized-bert-pretraining#ran","syntology_url":"https://syntology.ai/paper/1907.11692","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.11692"}},"official":{"repos":["pytorch/fairseq"],"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/eli5-long-form-question-answering","slug":"eli5-long-form-question-answering","title":"ELI5: Long Form Question Answering","date":"2019-07-22","arxiv_id":"1907.09190","repositories_listed":3,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":7,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":6,"n_pointer_only":4,"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) · 1 unverified","sample_list":"/paper/eli5-long-form-question-answering#ran","syntology_url":"https://syntology.ai/paper/1907.09190","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.09190"}},"official":{"repos":["facebookresearch/ELI5"],"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/neural-shuffle-exchange-networks-sequence","slug":"neural-shuffle-exchange-networks-sequence","title":"Neural Shuffle-Exchange Networks -- Sequence Processing in O(n log n) Time","date":"2019-07-18","arxiv_id":"1907.07897","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/neural-shuffle-exchange-networks-sequence#ran","syntology_url":"https://syntology.ai/paper/1907.07897","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.07897"}},"official":{"repos":["LUMII-Syslab/shuffle-exchange"],"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/r-transformer-recurrent-neural-network","slug":"r-transformer-recurrent-neural-network","title":"R-Transformer: Recurrent Neural Network Enhanced Transformer","date":"2019-07-12","arxiv_id":"1907.05572","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/r-transformer-recurrent-neural-network#ran","syntology_url":"https://syntology.ai/paper/1907.05572","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.05572"}},"official":{"repos":["DSE-MSU/R-transformer"],"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/large-memory-layers-with-product-keys","slug":"large-memory-layers-with-product-keys","title":"Large Memory Layers with Product Keys","date":"2019-07-10","arxiv_id":"1907.05242","repositories_listed":7,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":2,"n_no_contract":0,"n_pointer_only":2,"phrase":"4 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/large-memory-layers-with-product-keys#ran","syntology_url":"https://syntology.ai/paper/1907.05242","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.05242"}},"official":{"repos":["facebookresearch/XLM"],"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/augmenting-self-attention-with-persistent","slug":"augmenting-self-attention-with-persistent","title":"Augmenting Self-attention with Persistent Memory","date":"2019-07-02","arxiv_id":"1907.01470","repositories_listed":2,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":2,"n_violates":3,"n_no_contract":0,"n_pointer_only":4,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 3 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/augmenting-self-attention-with-persistent#ran","syntology_url":"https://syntology.ai/paper/1907.01470","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.01470"}},"official":null}},{"url":"/paper/xlnet-generalized-autoregressive-pretraining","slug":"xlnet-generalized-autoregressive-pretraining","title":"XLNet: Generalized Autoregressive Pretraining for Language Understanding","date":"2019-06-19","arxiv_id":"1906.08237","repositories_listed":27,"syntology":{"n":24,"n_ran":15,"n_constructed":2,"n_ran_checked":10,"n_instrument":5,"n_unverified":9,"n_honours":2,"n_violates":0,"n_no_contract":8,"n_pointer_only":4,"phrase":"15 ran (of which 2 constructed an object rather than computing a result; 10 with no instrument failure: 2 honoured, 0 violated, 8 with no contract checked; 5 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/xlnet-generalized-autoregressive-pretraining#ran","syntology_url":"https://syntology.ai/paper/1906.08237","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.08237"}},"official":{"repos":["zihangdai/xlnet"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/continual-and-multi-task-architecture-search","slug":"continual-and-multi-task-architecture-search","title":"Continual and Multi-Task Architecture Search","date":"2019-06-12","arxiv_id":"1906.05226","repositories_listed":1,"syntology":{"n":12,"n_ran":11,"n_constructed":0,"n_ran_checked":10,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":9,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 1 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/continual-and-multi-task-architecture-search#ran","syntology_url":"https://syntology.ai/paper/1906.05226","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.05226"}},"official":{"repos":["ramakanth-pasunuru/CAS-MAS"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/how-multilingual-is-multilingual-bert","slug":"how-multilingual-is-multilingual-bert","title":"How multilingual is Multilingual BERT?","date":"2019-06-04","arxiv_id":"1906.01502","repositories_listed":3,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/how-multilingual-is-multilingual-bert#ran","syntology_url":"https://syntology.ai/paper/1906.01502","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.01502"}},"official":null}},{"url":"/paper/190600346","slug":"190600346","title":"Pre-training of Graph Augmented Transformers for Medication Recommendation","date":"2019-06-02","arxiv_id":"1906.00346","repositories_listed":1,"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":0,"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/190600346#ran","syntology_url":"https://syntology.ai/paper/1906.00346","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.00346"}},"official":{"repos":["jshang123/G-Bert"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/190600363","slug":"190600363","title":"Does It Make Sense? And Why? A Pilot Study for Sense Making and Explanation","date":"2019-06-02","arxiv_id":"1906.00363","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/190600363#ran","syntology_url":"https://syntology.ai/paper/1906.00363","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.00363"}},"official":{"repos":["wangcunxiang/Sen-Making-and-Explanation"],"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/analysis-of-gradient-clipping-and-adaptive","slug":"analysis-of-gradient-clipping-and-adaptive","title":"Why gradient clipping accelerates training: A theoretical justification for adaptivity","date":"2019-05-28","arxiv_id":"1905.11881","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 2 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/analysis-of-gradient-clipping-and-adaptive#ran","syntology_url":"https://syntology.ai/paper/1905.11881","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.11881"}},"official":{"repos":["JingzhaoZhang/why-clipping-accelerates"],"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/is-a-single-vector-enough-exploring-node","slug":"is-a-single-vector-enough-exploring-node","title":"Is a Single Vector Enough? Exploring Node Polysemy for Network Embedding","date":"2019-05-25","arxiv_id":"1905.10668","repositories_listed":1,"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":4,"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/is-a-single-vector-enough-exploring-node#ran","syntology_url":"https://syntology.ai/paper/1905.10668","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.10668"}},"official":null}},{"url":"/paper/deeper-text-understanding-for-ir-with","slug":"deeper-text-understanding-for-ir-with","title":"Deeper Text Understanding for IR with Contextual Neural Language Modeling","date":"2019-05-22","arxiv_id":"1905.09217","repositories_listed":1,"syntology":{"n":7,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/deeper-text-understanding-for-ir-with#ran","syntology_url":"https://syntology.ai/paper/1905.09217","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.09217"}},"official":{"repos":["AdeDZY/SIGIR19-BERT-IR"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/enriching-pre-trained-language-model-with","slug":"enriching-pre-trained-language-model-with","title":"Enriching Pre-trained Language Model with Entity Information for Relation Classification","date":"2019-05-20","arxiv_id":"1905.08284","repositories_listed":6,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":4,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"7 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; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/enriching-pre-trained-language-model-with#ran","syntology_url":"https://syntology.ai/paper/1905.08284","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.08284"}},"official":null}},{"url":"/paper/adaptively-truncating-backpropagation-through","slug":"adaptively-truncating-backpropagation-through","title":"Adaptively Truncating Backpropagation Through Time to Control Gradient Bias","date":"2019-05-17","arxiv_id":"1905.07473","repositories_listed":1,"syntology":{"n":21,"n_ran":18,"n_constructed":0,"n_ran_checked":18,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":18,"n_pointer_only":0,"phrase":"18 ran (of which 0 constructed an object rather than computing a result; 18 with no instrument failure: 0 honoured, 0 violated, 18 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/adaptively-truncating-backpropagation-through#ran","syntology_url":"https://syntology.ai/paper/1905.07473","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.07473"}},"official":{"repos":["aicherc/adaptive_tbptt"],"state":"official (archive's flag): 18 ran","n_ran":18,"n_constructed":0,"n_ran_no_instrument_failure":18,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/online-normalization-for-training-neural","slug":"online-normalization-for-training-neural","title":"Online Normalization for Training Neural Networks","date":"2019-05-15","arxiv_id":"1905.05894","repositories_listed":1,"syntology":{"n":16,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":7,"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) · 7 unverified","sample_list":"/paper/online-normalization-for-training-neural#ran","syntology_url":"https://syntology.ai/paper/1905.05894","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.05894"}},"official":{"repos":["cerebras/online-normalization"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/how-to-fine-tune-bert-for-text-classification","slug":"how-to-fine-tune-bert-for-text-classification","title":"How to Fine-Tune BERT for Text Classification?","date":"2019-05-14","arxiv_id":"1905.05583","repositories_listed":15,"syntology":{"n":18,"n_ran":12,"n_constructed":0,"n_ran_checked":7,"n_instrument":5,"n_unverified":6,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":5,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 5 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/how-to-fine-tune-bert-for-text-classification#ran","syntology_url":"https://syntology.ai/paper/1905.05583","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.05583"}},"official":{"repos":["xuyige/BERT4doc-Classification"],"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":["listed","official"]}}},{"url":"/paper/on-the-use-of-arxiv-as-a-dataset","slug":"on-the-use-of-arxiv-as-a-dataset","title":"On the Use of ArXiv as a Dataset","date":"2019-04-30","arxiv_id":"1905.00075","repositories_listed":1,"syntology":{"n":19,"n_ran":15,"n_constructed":0,"n_ran_checked":15,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":15,"n_pointer_only":0,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 0 honoured, 0 violated, 15 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/on-the-use-of-arxiv-as-a-dataset#ran","syntology_url":"https://syntology.ai/paper/1905.00075","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.00075"}},"official":{"repos":["mattbierbaum/arxiv-public-datasets"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":15,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/routing-networks-and-the-challenges-of","slug":"routing-networks-and-the-challenges-of","title":"Routing Networks and the Challenges of Modular and Compositional Computation","date":"2019-04-29","arxiv_id":"1904.12774","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/routing-networks-and-the-challenges-of#ran","syntology_url":"https://syntology.ai/paper/1904.12774","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.12774"}},"official":null}},{"url":"/paper/190410509","slug":"190410509","title":"Generating Long Sequences with Sparse Transformers","date":"2019-04-23","arxiv_id":"1904.10509","repositories_listed":7,"syntology":{"n":6,"n_ran":5,"n_constructed":4,"n_ran_checked":4,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"5 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/190410509#ran","syntology_url":"https://syntology.ai/paper/1904.10509","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.10509"}},"official":{"repos":["openai/sparse_attention"],"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-curious-case-of-neural-text-degeneration","slug":"the-curious-case-of-neural-text-degeneration","title":"The Curious Case of Neural Text Degeneration","date":"2019-04-22","arxiv_id":"1904.09751","repositories_listed":17,"syntology":{"n":17,"n_ran":10,"n_constructed":1,"n_ran_checked":5,"n_instrument":5,"n_unverified":7,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":11,"phrase":"10 ran (of which 1 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 5 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/the-curious-case-of-neural-text-degeneration#ran","syntology_url":"https://syntology.ai/paper/1904.09751","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.09751"}},"official":{"repos":["ari-holtzman/degen"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/190409408","slug":"190409408","title":"Language Models with Transformers","date":"2019-04-20","arxiv_id":"1904.09408","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/190409408#ran","syntology_url":"https://syntology.ai/paper/1904.09408","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.09408"}},"official":{"repos":["cgraywang/gluon-nlp-1"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/190409324","slug":"190409324","title":"Mask-Predict: Parallel Decoding of Conditional Masked Language Models","date":"2019-04-19","arxiv_id":"1904.09324","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/190409324#ran","syntology_url":"https://syntology.ai/paper/1904.09324","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.09324"}},"official":{"repos":["facebookresearch/Mask-Predict"],"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/specaugment-a-simple-data-augmentation-method","slug":"specaugment-a-simple-data-augmentation-method","title":"SpecAugment: A Simple Data Augmentation Method for Automatic Speech Recognition","date":"2019-04-18","arxiv_id":"1904.08779","repositories_listed":30,"syntology":{"n":18,"n_ran":14,"n_constructed":0,"n_ran_checked":13,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":0,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/specaugment-a-simple-data-augmentation-method#ran","syntology_url":"https://syntology.ai/paper/1904.08779","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.08779"}},"official":null}},{"url":"/paper/effective-estimation-of-deep-generative","slug":"effective-estimation-of-deep-generative","title":"Effective Estimation of Deep Generative Language Models","date":"2019-04-17","arxiv_id":"1904.08194","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/effective-estimation-of-deep-generative#ran","syntology_url":"https://syntology.ai/paper/1904.08194","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.08194"}},"official":{"repos":["tom-pelsmaeker/deep-generative-lm"],"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/rare-words-a-major-problem-for-contextualized","slug":"rare-words-a-major-problem-for-contextualized","title":"Rare Words: A Major Problem for Contextualized Embeddings And How to Fix it by Attentive Mimicking","date":"2019-04-14","arxiv_id":"1904.06707","repositories_listed":2,"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/rare-words-a-major-problem-for-contextualized#ran","syntology_url":"https://syntology.ai/paper/1904.06707","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.06707"}},"official":{"repos":["timoschick/am-for-bert","timoschick/one-token-approximation"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/riemannian-normalizing-flow-on-variational","slug":"riemannian-normalizing-flow-on-variational","title":"Riemannian Normalizing Flow on Variational Wasserstein Autoencoder for Text Modeling","date":"2019-04-04","arxiv_id":"1904.02399","repositories_listed":1,"syntology":{"n":14,"n_ran":13,"n_constructed":0,"n_ran_checked":12,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":1,"phrase":"13 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/riemannian-normalizing-flow-on-variational#ran","syntology_url":"https://syntology.ai/paper/1904.02399","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.02399"}},"official":{"repos":["kingofspace0wzz/wae-rnf-lm"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/videobert-a-joint-model-for-video-and","slug":"videobert-a-joint-model-for-video-and","title":"VideoBERT: A Joint Model for Video and Language Representation Learning","date":"2019-04-03","arxiv_id":"1904.01766","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/videobert-a-joint-model-for-video-and#ran","syntology_url":"https://syntology.ai/paper/1904.01766","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.01766"}},"official":null}},{"url":"/paper/fairseq-a-fast-extensible-toolkit-for","slug":"fairseq-a-fast-extensible-toolkit-for","title":"fairseq: A Fast, Extensible Toolkit for Sequence Modeling","date":"2019-04-01","arxiv_id":"1904.01038","repositories_listed":6,"syntology":{"n":11,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":5,"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) · 8 unverified","sample_list":"/paper/fairseq-a-fast-extensible-toolkit-for#ran","syntology_url":"https://syntology.ai/paper/1904.01038","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.01038"}},"official":{"repos":["pytorch/fairseq"],"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/bert-has-a-mouth-and-it-must-speak-bert-as-a","slug":"bert-has-a-mouth-and-it-must-speak-bert-as-a","title":"BERT has a Mouth, and It Must Speak: BERT as a Markov Random Field Language Model","date":"2019-02-11","arxiv_id":"1902.04094","repositories_listed":13,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":8,"n_instrument":2,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":6,"n_pointer_only":2,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 2 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/bert-has-a-mouth-and-it-must-speak-bert-as-a#ran","syntology_url":"https://syntology.ai/paper/1902.04094","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.04094"}},"official":{"repos":["kyunghyuncho/bert-gen","nyu-dl/bert-gen"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/multi-task-deep-neural-networks-for-natural","slug":"multi-task-deep-neural-networks-for-natural","title":"Multi-Task Deep Neural Networks for Natural Language Understanding","date":"2019-01-31","arxiv_id":"1901.11504","repositories_listed":7,"syntology":{"n":13,"n_ran":9,"n_constructed":0,"n_ran_checked":6,"n_instrument":3,"n_unverified":4,"n_honours":1,"n_violates":1,"n_no_contract":4,"n_pointer_only":4,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 1 violated, 4 with no contract checked; 3 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/multi-task-deep-neural-networks-for-natural#ran","syntology_url":"https://syntology.ai/paper/1901.11504","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.11504"}},"official":{"repos":["namisan/mt-dnn"],"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/glyce-glyph-vectors-for-chinese-character","slug":"glyce-glyph-vectors-for-chinese-character","title":"Glyce: Glyph-vectors for Chinese Character Representations","date":"2019-01-29","arxiv_id":"1901.10125","repositories_listed":2,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 2 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/glyce-glyph-vectors-for-chinese-character#ran","syntology_url":"https://syntology.ai/paper/1901.10125","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.10125"}},"official":{"repos":["ShannonAI/glyce"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/latent-normalizing-flows-for-discrete","slug":"latent-normalizing-flows-for-discrete","title":"Latent Normalizing Flows for Discrete Sequences","date":"2019-01-29","arxiv_id":"1901.10548","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/latent-normalizing-flows-for-discrete#ran","syntology_url":"https://syntology.ai/paper/1901.10548","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.10548"}},"official":{"repos":["harvardnlp/TextFlow"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/improving-neural-network-quantization-without","slug":"improving-neural-network-quantization-without","title":"Improving Neural Network Quantization without Retraining using Outlier Channel Splitting","date":"2019-01-28","arxiv_id":"1901.09504","repositories_listed":3,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":1,"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; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/improving-neural-network-quantization-without#ran","syntology_url":"https://syntology.ai/paper/1901.09504","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.09504"}},"official":{"repos":["NervanaSystems/distiller","cornell-zhang/dnn-quant-ocs"],"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":["listed","official"]}}},{"url":"/paper/biobert-a-pre-trained-biomedical-language","slug":"biobert-a-pre-trained-biomedical-language","title":"BioBERT: a pre-trained biomedical language representation model for biomedical text mining","date":"2019-01-25","arxiv_id":"1901.08746","repositories_listed":19,"syntology":{"n":25,"n_ran":15,"n_constructed":0,"n_ran_checked":12,"n_instrument":3,"n_unverified":10,"n_honours":1,"n_violates":0,"n_no_contract":11,"n_pointer_only":3,"phrase":"15 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; 3 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/biobert-a-pre-trained-biomedical-language#ran","syntology_url":"https://syntology.ai/paper/1901.08746","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.08746"}},"official":{"repos":["dmis-lab/biobert","naver/biobert-pretrained"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","unlocated"]}}},{"url":"/paper/cross-lingual-language-model-pretraining","slug":"cross-lingual-language-model-pretraining","title":"Cross-lingual Language Model Pretraining","date":"2019-01-22","arxiv_id":"1901.07291","repositories_listed":17,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":4,"n_pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 1 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/cross-lingual-language-model-pretraining#ran","syntology_url":"https://syntology.ai/paper/1901.07291","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.07291"}},"official":null}},{"url":"/paper/transformer-xl-attentive-language-models","slug":"transformer-xl-attentive-language-models","title":"Transformer-XL: Attentive Language Models Beyond a Fixed-Length Context","date":"2019-01-09","arxiv_id":"1901.02860","repositories_listed":37,"syntology":{"n":143,"n_ran":67,"n_constructed":37,"n_ran_checked":49,"n_instrument":18,"n_unverified":76,"n_honours":4,"n_violates":1,"n_no_contract":44,"n_pointer_only":43,"phrase":"67 ran (of which 37 constructed an object rather than computing a result; 49 with no instrument failure: 4 honoured, 1 violated, 44 with no contract checked; 18 where Syntology's instrument failed) · 76 unverified","sample_list":"/paper/transformer-xl-attentive-language-models#ran","syntology_url":"https://syntology.ai/paper/1901.02860","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.02860"}},"official":{"repos":["kimiyoung/transformer-xl"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":7,"n_ran_no_instrument_failure":7,"n_unverified":5,"ran_from_kinds":["listed","official","unlocated"]}}},{"url":"/paper/transfer-learning-from-language-models-to","slug":"transfer-learning-from-language-models-to","title":"Transfer learning from language models to image caption generators: Better models may not transfer better","date":"2019-01-01","arxiv_id":"1901.01216","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/transfer-learning-from-language-models-to#ran","syntology_url":"https://syntology.ai/paper/1901.01216","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.01216"}},"official":{"repos":["mtanti/mtanti-phd"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/exploring-weight-symmetry-in-deep-neural","slug":"exploring-weight-symmetry-in-deep-neural","title":"Exploring Weight Symmetry in Deep Neural Networks","date":"2018-12-28","arxiv_id":"1812.11027","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"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) · 3 unverified","sample_list":"/paper/exploring-weight-symmetry-in-deep-neural#ran","syntology_url":"https://syntology.ai/paper/1812.11027","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.11027"}},"official":{"repos":["hushell/deep-symmetry"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/conditional-bert-contextual-augmentation","slug":"conditional-bert-contextual-augmentation","title":"Conditional BERT Contextual Augmentation","date":"2018-12-17","arxiv_id":"1812.06705","repositories_listed":5,"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/conditional-bert-contextual-augmentation#ran","syntology_url":"https://syntology.ai/paper/1812.06705","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.06705"}},"official":null}},{"url":"/paper/learning-private-neural-language-modeling","slug":"learning-private-neural-language-modeling","title":"Learning Private Neural Language Modeling with Attentive Aggregation","date":"2018-12-17","arxiv_id":"1812.07108","repositories_listed":4,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":2,"phrase":"7 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/learning-private-neural-language-modeling#ran","syntology_url":"https://syntology.ai/paper/1812.07108","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.07108"}},"official":{"repos":["shaoxiongji/fed-att"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/neural-abstractive-text-summarization-with","slug":"neural-abstractive-text-summarization-with","title":"Neural Abstractive Text Summarization with Sequence-to-Sequence Models","date":"2018-12-05","arxiv_id":"1812.02303","repositories_listed":5,"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/neural-abstractive-text-summarization-with#ran","syntology_url":"https://syntology.ai/paper/1812.02303","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.02303"}},"official":{"repos":["tshi04/NATS"],"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/espnetv2-a-light-weight-power-efficient-and","slug":"espnetv2-a-light-weight-power-efficient-and","title":"ESPNetv2: A Light-weight, Power Efficient, and General Purpose Convolutional Neural Network","date":"2018-11-28","arxiv_id":"1811.11431","repositories_listed":10,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"4 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/espnetv2-a-light-weight-power-efficient-and#ran","syntology_url":"https://syntology.ai/paper/1811.11431","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.11431"}},"official":{"repos":["sacmehta/EdgeNets"],"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/ordered-neurons-integrating-tree-structures","slug":"ordered-neurons-integrating-tree-structures","title":"Ordered Neurons: Integrating Tree Structures into Recurrent Neural Networks","date":"2018-10-22","arxiv_id":"1810.09536","repositories_listed":7,"syntology":{"n":12,"n_ran":11,"n_constructed":0,"n_ran_checked":9,"n_instrument":2,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":8,"n_pointer_only":2,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 0 violated, 8 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/ordered-neurons-integrating-tree-structures#ran","syntology_url":"https://syntology.ai/paper/1810.09536","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.09536"}},"official":{"repos":["yikangshen/Ordered-Neurons"],"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/continual-learning-of-recurrent-neural","slug":"continual-learning-of-recurrent-neural","title":"Continual Learning of Recurrent Neural Networks by Locally Aligning Distributed Representations","date":"2018-10-17","arxiv_id":"1810.07411","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":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) · 0 unverified","sample_list":"/paper/continual-learning-of-recurrent-neural#ran","syntology_url":"https://syntology.ai/paper/1810.07411","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.07411"}},"official":{"repos":["AnkurMali/ContinualPTNCN"],"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/structured-content-preservation-for","slug":"structured-content-preservation-for","title":"Structured Content Preservation for Unsupervised Text Style Transfer","date":"2018-10-15","arxiv_id":"1810.06526","repositories_listed":2,"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/structured-content-preservation-for#ran","syntology_url":"https://syntology.ai/paper/1810.06526","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.06526"}},"official":{"repos":["YouzhiTian/Structured-Content-Preservation-for-Unsupervised-Text-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/trellis-networks-for-sequence-modeling","slug":"trellis-networks-for-sequence-modeling","title":"Trellis Networks for Sequence Modeling","date":"2018-10-15","arxiv_id":"1810.06682","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":5,"n_pointer_only":2,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 2 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/trellis-networks-for-sequence-modeling#ran","syntology_url":"https://syntology.ai/paper/1810.06682","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.06682"}},"official":{"repos":["locuslab/trellisnet"],"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/texttovec-deep-contextualized-neural","slug":"texttovec-deep-contextualized-neural","title":"textTOvec: Deep Contextualized Neural Autoregressive Topic Models of Language with Distributed Compositional Prior","date":"2018-10-09","arxiv_id":"1810.03947","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":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/texttovec-deep-contextualized-neural#ran","syntology_url":"https://syntology.ai/paper/1810.03947","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.03947"}},"official":{"repos":["pgcool/textTOvec"],"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-compressed-transforms-with-low","slug":"learning-compressed-transforms-with-low","title":"Learning Compressed Transforms with Low Displacement Rank","date":"2018-10-04","arxiv_id":"1810.02309","repositories_listed":1,"syntology":{"n":21,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":11,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 11 unverified","sample_list":"/paper/learning-compressed-transforms-with-low#ran","syntology_url":"https://syntology.ai/paper/1810.02309","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.02309"}},"official":{"repos":["HazyResearch/structured-nets"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":11,"ran_from_kinds":["official"]}}},{"url":"/paper/simple-fusion-return-of-the-language-model","slug":"simple-fusion-return-of-the-language-model","title":"Simple Fusion: Return of the Language Model","date":"2018-09-01","arxiv_id":"1809.00125","repositories_listed":1,"syntology":{"n":10,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/simple-fusion-return-of-the-language-model#ran","syntology_url":"https://syntology.ai/paper/1809.00125","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.00125"}},"official":null}},{"url":"/paper/spherical-latent-spaces-for-stable","slug":"spherical-latent-spaces-for-stable","title":"Spherical Latent Spaces for Stable Variational Autoencoders","date":"2018-08-31","arxiv_id":"1808.10805","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/spherical-latent-spaces-for-stable#ran","syntology_url":"https://syntology.ai/paper/1808.10805","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.10805"}},"official":{"repos":["jiacheng-xu/vmf_vae_nlp"],"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/rational-recurrences","slug":"rational-recurrences","title":"Rational Recurrences","date":"2018-08-28","arxiv_id":"1808.09357","repositories_listed":1,"syntology":{"n":13,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":5,"n_honours":1,"n_violates":1,"n_no_contract":6,"n_pointer_only":1,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 1 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/rational-recurrences#ran","syntology_url":"https://syntology.ai/paper/1808.09357","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.09357"}},"official":{"repos":["Noahs-ARK/rational-recurrences"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/pyramidal-recurrent-unit-for-language","slug":"pyramidal-recurrent-unit-for-language","title":"Pyramidal Recurrent Unit for Language Modeling","date":"2018-08-27","arxiv_id":"1808.09029","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/pyramidal-recurrent-unit-for-language#ran","syntology_url":"https://syntology.ai/paper/1808.09029","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.09029"}},"official":{"repos":["sacmehta/PRU"],"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/targeted-syntactic-evaluation-of-language","slug":"targeted-syntactic-evaluation-of-language","title":"Targeted Syntactic Evaluation of Language Models","date":"2018-08-27","arxiv_id":"1808.09031","repositories_listed":5,"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/targeted-syntactic-evaluation-of-language#ran","syntology_url":"https://syntology.ai/paper/1808.09031","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.09031"}},"official":{"repos":["BeckyMarvin/LM_syneval"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed"]}}},{"url":"/paper/large-scale-language-modeling-converging-on","slug":"large-scale-language-modeling-converging-on","title":"Large Scale Language Modeling: Converging on 40GB of Text in Four Hours","date":"2018-08-03","arxiv_id":"1808.01371","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/large-scale-language-modeling-converging-on#ran","syntology_url":"https://syntology.ai/paper/1808.01371","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.01371"}},"official":{"repos":["NVIDIA/sentiment-discovery"],"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/universal-transformers","slug":"universal-transformers","title":"Universal Transformers","date":"2018-07-10","arxiv_id":"1807.03819","repositories_listed":8,"syntology":{"n":25,"n_ran":17,"n_constructed":8,"n_ran_checked":17,"n_instrument":0,"n_unverified":8,"n_honours":1,"n_violates":0,"n_no_contract":16,"n_pointer_only":24,"phrase":"17 ran (of which 8 constructed an object rather than computing a result; 17 with no instrument failure: 1 honoured, 0 violated, 16 with no contract checked; 0 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/universal-transformers#ran","syntology_url":"https://syntology.ai/paper/1807.03819","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1807.03819"}},"official":{"repos":["tensorflow/tensor2tensor"],"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/darts-differentiable-architecture-search","slug":"darts-differentiable-architecture-search","title":"DARTS: Differentiable Architecture Search","date":"2018-06-24","arxiv_id":"1806.09055","repositories_listed":59,"syntology":{"n":156,"n_ran":74,"n_constructed":30,"n_ran_checked":60,"n_instrument":14,"n_unverified":82,"n_honours":9,"n_violates":1,"n_no_contract":50,"n_pointer_only":54,"phrase":"74 ran (of which 30 constructed an object rather than computing a result; 60 with no instrument failure: 9 honoured, 1 violated, 50 with no contract checked; 14 where Syntology's instrument failed) · 82 unverified","sample_list":"/paper/darts-differentiable-architecture-search#ran","syntology_url":"https://syntology.ai/paper/1806.09055","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.09055"}},"official":{"repos":["quark0/darts"],"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/relational-recurrent-neural-networks","slug":"relational-recurrent-neural-networks","title":"Relational recurrent neural networks","date":"2018-06-05","arxiv_id":"1806.01822","repositories_listed":2,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/relational-recurrent-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1806.01822","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.01822"}},"official":null}},{"url":"/paper/polite-dialogue-generation-without-parallel","slug":"polite-dialogue-generation-without-parallel","title":"Polite Dialogue Generation Without Parallel Data","date":"2018-05-08","arxiv_id":"1805.03162","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":1,"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: 1 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/polite-dialogue-generation-without-parallel#ran","syntology_url":"https://syntology.ai/paper/1805.03162","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.03162"}},"official":null}},{"url":"/paper/improved-training-of-end-to-end-attention","slug":"improved-training-of-end-to-end-attention","title":"Improved training of end-to-end attention models for speech recognition","date":"2018-05-08","arxiv_id":"1805.03294","repositories_listed":14,"syntology":{"n":12,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/improved-training-of-end-to-end-attention#ran","syntology_url":"https://syntology.ai/paper/1805.03294","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.03294"}},"official":null}},{"url":"/paper/personalized-language-model-for-query-auto","slug":"personalized-language-model-for-query-auto","title":"Personalized Language Model for Query Auto-Completion","date":"2018-04-25","arxiv_id":"1804.09661","repositories_listed":4,"syntology":{"n":7,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/personalized-language-model-for-query-auto#ran","syntology_url":"https://syntology.ai/paper/1804.09661","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.09661"}},"official":{"repos":["ajaech/query_completion"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/spell-once-summon-anywhere-a-two-level-open","slug":"spell-once-summon-anywhere-a-two-level-open","title":"Spell Once, Summon Anywhere: A Two-Level Open-Vocabulary Language Model","date":"2018-04-23","arxiv_id":"1804.08205","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/spell-once-summon-anywhere-a-two-level-open#ran","syntology_url":"https://syntology.ai/paper/1804.08205","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.08205"}},"official":{"repos":["sjmielke/spell-once"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/colorless-green-recurrent-networks-dream","slug":"colorless-green-recurrent-networks-dream","title":"Colorless green recurrent networks dream hierarchically","date":"2018-03-29","arxiv_id":"1803.11138","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/colorless-green-recurrent-networks-dream#ran","syntology_url":"https://syntology.ai/paper/1803.11138","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.11138"}},"official":{"repos":["facebookresearch/colorlessgreenRNNs"],"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/an-analysis-of-neural-language-modeling-at","slug":"an-analysis-of-neural-language-modeling-at","title":"An Analysis of Neural Language Modeling at Multiple Scales","date":"2018-03-22","arxiv_id":"1803.08240","repositories_listed":12,"syntology":{"n":18,"n_ran":14,"n_constructed":0,"n_ran_checked":13,"n_instrument":1,"n_unverified":4,"n_honours":2,"n_violates":0,"n_no_contract":11,"n_pointer_only":4,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 2 honoured, 0 violated, 11 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/an-analysis-of-neural-language-modeling-at#ran","syntology_url":"https://syntology.ai/paper/1803.08240","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.08240"}},"official":{"repos":["salesforce/awd-lstm-lm"],"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/independently-recurrent-neural-network-indrnn","slug":"independently-recurrent-neural-network-indrnn","title":"Independently Recurrent Neural Network (IndRNN): Building A Longer and Deeper RNN","date":"2018-03-13","arxiv_id":"1803.04831","repositories_listed":11,"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":1,"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/independently-recurrent-neural-network-indrnn#ran","syntology_url":"https://syntology.ai/paper/1803.04831","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.04831"}},"official":{"repos":["Sunnydreamrain/IndRNN_Theano_Lasagne"],"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/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/an-empirical-evaluation-of-generic","slug":"an-empirical-evaluation-of-generic","title":"An Empirical Evaluation of Generic Convolutional and Recurrent Networks for Sequence Modeling","date":"2018-03-04","arxiv_id":"1803.01271","repositories_listed":35,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":7,"n_pointer_only":1,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 1 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/an-empirical-evaluation-of-generic#ran","syntology_url":"https://syntology.ai/paper/1803.01271","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.01271"}},"official":{"repos":["locuslab/TCN"],"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/variational-autoencoders-for-collaborative","slug":"variational-autoencoders-for-collaborative","title":"Variational Autoencoders for Collaborative Filtering","date":"2018-02-16","arxiv_id":"1802.05814","repositories_listed":18,"syntology":{"n":21,"n_ran":14,"n_constructed":0,"n_ran_checked":12,"n_instrument":2,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":1,"phrase":"14 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; 2 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/variational-autoencoders-for-collaborative#ran","syntology_url":"https://syntology.ai/paper/1802.05814","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.05814"}},"official":{"repos":["dawenl/vae_cf"],"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-contextualized-word-representations","slug":"deep-contextualized-word-representations","title":"Deep contextualized word representations","date":"2018-02-15","arxiv_id":"1802.05365","repositories_listed":46,"syntology":{"n":58,"n_ran":30,"n_constructed":12,"n_ran_checked":24,"n_instrument":6,"n_unverified":28,"n_honours":2,"n_violates":0,"n_no_contract":22,"n_pointer_only":25,"phrase":"30 ran (of which 12 constructed an object rather than computing a result; 24 with no instrument failure: 2 honoured, 0 violated, 22 with no contract checked; 6 where Syntology's instrument failed) · 28 unverified","sample_list":"/paper/deep-contextualized-word-representations#ran","syntology_url":"https://syntology.ai/paper/1802.05365","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.05365"}},"official":null}},{"url":"/paper/efficient-neural-architecture-search-via-1","slug":"efficient-neural-architecture-search-via-1","title":"Efficient Neural Architecture Search via Parameter Sharing","date":"2018-02-09","arxiv_id":"1802.03268","repositories_listed":28,"syntology":{"n":38,"n_ran":18,"n_constructed":10,"n_ran_checked":12,"n_instrument":6,"n_unverified":20,"n_honours":1,"n_violates":0,"n_no_contract":11,"n_pointer_only":25,"phrase":"18 ran (of which 10 constructed an object rather than computing a result; 12 with no instrument failure: 1 honoured, 0 violated, 11 with no contract checked; 6 where Syntology's instrument failed) · 20 unverified","sample_list":"/paper/efficient-neural-architecture-search-via-1#ran","syntology_url":"https://syntology.ai/paper/1802.03268","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.03268"}},"official":null}},{"url":"/paper/dp-gan-diversity-promoting-generative","slug":"dp-gan-diversity-promoting-generative","title":"DP-GAN: Diversity-Promoting Generative Adversarial Network for Generating Informative and Diversified Text","date":"2018-02-05","arxiv_id":"1802.01345","repositories_listed":3,"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/dp-gan-diversity-promoting-generative#ran","syntology_url":"https://syntology.ai/paper/1802.01345","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.01345"}},"official":{"repos":["lancopku/DPGAN"],"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/universal-language-model-fine-tuning-for-text","slug":"universal-language-model-fine-tuning-for-text","title":"Universal Language Model Fine-tuning for Text Classification","date":"2018-01-18","arxiv_id":"1801.06146","repositories_listed":66,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/universal-language-model-fine-tuning-for-text#ran","syntology_url":"https://syntology.ai/paper/1801.06146","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1801.06146"}},"official":{"repos":["fastai/fastai"],"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/z-forcing-training-stochastic-recurrent","slug":"z-forcing-training-stochastic-recurrent","title":"Z-Forcing: Training Stochastic Recurrent Networks","date":"2017-11-15","arxiv_id":"1711.05411","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"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) · 3 unverified","sample_list":"/paper/z-forcing-training-stochastic-recurrent#ran","syntology_url":"https://syntology.ai/paper/1711.05411","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.05411"}},"official":{"repos":["anirudh9119/zforcing_nips17"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/breaking-the-softmax-bottleneck-a-high-rank","slug":"breaking-the-softmax-bottleneck-a-high-rank","title":"Breaking the Softmax Bottleneck: A High-Rank RNN Language Model","date":"2017-11-10","arxiv_id":"1711.03953","repositories_listed":9,"syntology":{"n":23,"n_ran":12,"n_constructed":0,"n_ran_checked":11,"n_instrument":1,"n_unverified":11,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":1,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 1 where Syntology's instrument failed) · 11 unverified","sample_list":"/paper/breaking-the-softmax-bottleneck-a-high-rank#ran","syntology_url":"https://syntology.ai/paper/1711.03953","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.03953"}},"official":{"repos":["zihangdai/mos"],"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":["listed","official"]}}},{"url":"/paper/neural-language-modeling-by-jointly-learning","slug":"neural-language-modeling-by-jointly-learning","title":"Neural Language Modeling by Jointly Learning Syntax and Lexicon","date":"2017-11-02","arxiv_id":"1711.02013","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/neural-language-modeling-by-jointly-learning#ran","syntology_url":"https://syntology.ai/paper/1711.02013","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.02013"}},"official":null}},{"url":"/paper/regularizing-and-optimizing-lstm-language","slug":"regularizing-and-optimizing-lstm-language","title":"Regularizing and Optimizing LSTM Language Models","date":"2017-08-07","arxiv_id":"1708.02182","repositories_listed":45,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":2,"n_instrument":4,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":7,"phrase":"6 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; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/regularizing-and-optimizing-lstm-language#ran","syntology_url":"https://syntology.ai/paper/1708.02182","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1708.02182"}},"official":{"repos":["salesforce/awd-lstm-lm"],"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/dynamic-word-embeddings","slug":"dynamic-word-embeddings","title":"Dynamic Word Embeddings","date":"2017-02-27","arxiv_id":"1702.08359","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/dynamic-word-embeddings#ran","syntology_url":"https://syntology.ai/paper/1702.08359","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1702.08359"}},"official":null}},{"url":"/paper/a-hybrid-convolutional-variational","slug":"a-hybrid-convolutional-variational","title":"A Hybrid Convolutional Variational Autoencoder for Text Generation","date":"2017-02-08","arxiv_id":"1702.02390","repositories_listed":3,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-hybrid-convolutional-variational#ran","syntology_url":"https://syntology.ai/paper/1702.02390","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1702.02390"}},"official":{"repos":["stas-semeniuta/textvae"],"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/outrageously-large-neural-networks-the","slug":"outrageously-large-neural-networks-the","title":"Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer","date":"2017-01-23","arxiv_id":"1701.06538","repositories_listed":4,"syntology":{"n":6,"n_ran":4,"n_constructed":4,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":6,"phrase":"4 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/outrageously-large-neural-networks-the#ran","syntology_url":"https://syntology.ai/paper/1701.06538","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1701.06538"}},"official":null}},{"url":"/paper/structured-sequence-modeling-with-graph","slug":"structured-sequence-modeling-with-graph","title":"Structured Sequence Modeling with Graph Convolutional Recurrent Networks","date":"2016-12-22","arxiv_id":"1612.07659","repositories_listed":5,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":6,"n_pointer_only":1,"phrase":"8 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/structured-sequence-modeling-with-graph#ran","syntology_url":"https://syntology.ai/paper/1612.07659","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1612.07659"}},"official":{"repos":["youngjoo-epfl/gconvRNN"],"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":["listed","official"]}}},{"url":"/paper/knowing-when-to-look-adaptive-attention-via-a","slug":"knowing-when-to-look-adaptive-attention-via-a","title":"Knowing When to Look: Adaptive Attention via A Visual Sentinel for Image Captioning","date":"2016-12-06","arxiv_id":"1612.01887","repositories_listed":17,"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/knowing-when-to-look-adaptive-attention-via-a#ran","syntology_url":"https://syntology.ai/paper/1612.01887","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1612.01887"}},"official":{"repos":["jiasenlu/AdaptiveAttention"],"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/learning-python-code-suggestion-with-a-sparse","slug":"learning-python-code-suggestion-with-a-sparse","title":"Learning Python Code Suggestion with a Sparse Pointer Network","date":"2016-11-24","arxiv_id":"1611.08307","repositories_listed":5,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":3,"n_instrument":4,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"7 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; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/learning-python-code-suggestion-with-a-sparse#ran","syntology_url":"https://syntology.ai/paper/1611.08307","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.08307"}},"official":{"repos":["uclmr/pycodesuggest"],"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/a-dataset-and-exploration-of-models-for","slug":"a-dataset-and-exploration-of-models-for","title":"A dataset and exploration of models for understanding video data through fill-in-the-blank question-answering","date":"2016-11-23","arxiv_id":"1611.07810","repositories_listed":2,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/a-dataset-and-exploration-of-models-for#ran","syntology_url":"https://syntology.ai/paper/1611.07810","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.07810"}},"official":null}}],"record_sha256":"3d76a5d8f1814d1edd5f53ea3218ae2f051ee1a8a1a24cfe5dd1f21378ff0153","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}