{"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-modeling/papers/ran/17","list_of":"/task/language-modeling","task":"Language Modeling","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":17,"pages_in_order":19,"rows_per_page":100,"rows":[1601,1700],"of":1894,"counts":{"archive_papers_tagged":14182,"with_a_code_link":5620,"where_syntology_ran_a_sample":1894,"not_listed_spam_title":0,"listed":14182,"listed_where_code_ran":1894,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":1580,"every_run_a_failure_of_syntologys_instrument":314,"listed_with_a_run_with_no_instrument_failure":1580,"listed_every_run_a_failure_of_syntologys_instrument":314,"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-modeling/papers/ran/1","prev":"/task/language-modeling/papers/ran/16","next":"/task/language-modeling/papers/ran/18","papers":[{"url":"/paper/demix-layers-disentangling-domains-for","slug":"demix-layers-disentangling-domains-for","title":"DEMix Layers: Disentangling Domains for Modular Language Modeling","date":"2021-08-11","arxiv_id":"2108.05036","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/demix-layers-disentangling-domains-for#ran","syntology_url":"https://syntology.ai/paper/2108.05036","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.05036"}},"official":{"repos":["kernelmachine/demix","kernelmachine/demix-data"],"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/bros-a-layout-aware-pre-trained-language","slug":"bros-a-layout-aware-pre-trained-language","title":"BROS: A Pre-trained Language Model Focusing on Text and Layout for Better Key Information Extraction from Documents","date":"2021-08-10","arxiv_id":"2108.04539","repositories_listed":2,"syntology":{"n":13,"n_ran":13,"n_constructed":0,"n_ran_checked":11,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"13 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/bros-a-layout-aware-pre-trained-language#ran","syntology_url":"https://syntology.ai/paper/2108.04539","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.04539"}},"official":{"repos":["clovaai/bros"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/noisy-channel-language-model-prompting-for","slug":"noisy-channel-language-model-prompting-for","title":"Noisy Channel Language Model Prompting for Few-Shot Text Classification","date":"2021-08-09","arxiv_id":"2108.04106","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/noisy-channel-language-model-prompting-for#ran","syntology_url":"https://syntology.ai/paper/2108.04106","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.04106"}},"official":{"repos":["shmsw25/Channel-LM-Prompting"],"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/controlled-text-generation-as-continuous","slug":"controlled-text-generation-as-continuous","title":"Controlled Text Generation as Continuous Optimization with Multiple Constraints","date":"2021-08-04","arxiv_id":"2108.01850","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/controlled-text-generation-as-continuous#ran","syntology_url":"https://syntology.ai/paper/2108.01850","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.01850"}},"official":null}},{"url":"/paper/curriculum-learning-for-language-modeling","slug":"curriculum-learning-for-language-modeling","title":"Curriculum learning for language modeling","date":"2021-08-04","arxiv_id":"2108.02170","repositories_listed":1,"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/curriculum-learning-for-language-modeling#ran","syntology_url":"https://syntology.ai/paper/2108.02170","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.02170"}},"official":{"repos":["spacemanidol/CurriculumLearningForLanguageModels"],"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/analyzing-speaker-information-in-self","slug":"analyzing-speaker-information-in-self","title":"Analyzing Speaker Information in Self-Supervised Models to Improve Zero-Resource Speech Processing","date":"2021-08-02","arxiv_id":"2108.00917","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/analyzing-speaker-information-in-self#ran","syntology_url":"https://syntology.ai/paper/2108.00917","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.00917"}},"official":null}},{"url":"/paper/structural-guidance-for-transformer-language","slug":"structural-guidance-for-transformer-language","title":"Structural Guidance for Transformer Language Models","date":"2021-07-30","arxiv_id":"2108.00104","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":1,"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/structural-guidance-for-transformer-language#ran","syntology_url":"https://syntology.ai/paper/2108.00104","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.00104"}},"official":{"repos":["IBM/transformers-struct-guidance"],"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/mwp-bert-a-strong-baseline-for-math-word","slug":"mwp-bert-a-strong-baseline-for-math-word","title":"MWP-BERT: Numeracy-Augmented Pre-training for Math Word Problem Solving","date":"2021-07-28","arxiv_id":"2107.13435","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/mwp-bert-a-strong-baseline-for-math-word#ran","syntology_url":"https://syntology.ai/paper/2107.13435","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.13435"}},"official":{"repos":["lzhenwen/mwp-bert"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/flex-unifying-evaluation-for-few-shot-nlp","slug":"flex-unifying-evaluation-for-few-shot-nlp","title":"FLEX: Unifying Evaluation for Few-Shot NLP","date":"2021-07-15","arxiv_id":"2107.07170","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":1,"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; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/flex-unifying-evaluation-for-few-shot-nlp#ran","syntology_url":"https://syntology.ai/paper/2107.07170","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.07170"}},"official":{"repos":["allenai/flex","allenai/unifew"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/deduplicating-training-data-makes-language","slug":"deduplicating-training-data-makes-language","title":"Deduplicating Training Data Makes Language Models Better","date":"2021-07-14","arxiv_id":"2107.06499","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/deduplicating-training-data-makes-language#ran","syntology_url":"https://syntology.ai/paper/2107.06499","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.06499"}},"official":{"repos":["google-research/deduplicate-text-datasets"],"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/codified-audio-language-modeling-learns","slug":"codified-audio-language-modeling-learns","title":"Codified audio language modeling learns useful representations for music information retrieval","date":"2021-07-12","arxiv_id":"2107.05677","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/codified-audio-language-modeling-learns#ran","syntology_url":"https://syntology.ai/paper/2107.05677","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.05677"}},"official":{"repos":["p-lambda/jukemir"],"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/evaluating-large-language-models-trained-on","slug":"evaluating-large-language-models-trained-on","title":"Evaluating Large Language Models Trained on Code","date":"2021-07-07","arxiv_id":"2107.03374","repositories_listed":13,"syntology":{"n":39,"n_ran":26,"n_constructed":0,"n_ran_checked":24,"n_instrument":2,"n_unverified":13,"n_honours":1,"n_violates":0,"n_no_contract":23,"n_pointer_only":4,"phrase":"26 ran (of which 0 constructed an object rather than computing a result; 24 with no instrument failure: 1 honoured, 0 violated, 23 with no contract checked; 2 where Syntology's instrument failed) · 13 unverified","sample_list":"/paper/evaluating-large-language-models-trained-on#ran","syntology_url":"https://syntology.ai/paper/2107.03374","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.03374"}},"official":{"repos":["openai/human-eval"],"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":["found_in_text","listed","official"]}}},{"url":"/paper/long-short-transformer-efficient-transformers","slug":"long-short-transformer-efficient-transformers","title":"Long-Short Transformer: Efficient Transformers for Language and Vision","date":"2021-07-05","arxiv_id":"2107.02192","repositories_listed":3,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":2,"n_no_contract":1,"n_pointer_only":2,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 2 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/long-short-transformer-efficient-transformers#ran","syntology_url":"https://syntology.ai/paper/2107.02192","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.02192"}},"official":{"repos":["NVIDIA/transformer-ls"],"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","unlocated"]}}},{"url":"/paper/r-drop-regularized-dropout-for-neural","slug":"r-drop-regularized-dropout-for-neural","title":"R-Drop: Regularized Dropout for Neural Networks","date":"2021-06-28","arxiv_id":"2106.14448","repositories_listed":8,"syntology":{"n":6,"n_ran":4,"n_constructed":2,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 2 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/r-drop-regularized-dropout-for-neural#ran","syntology_url":"https://syntology.ai/paper/2106.14448","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.14448"}},"official":{"repos":["dropreg/R-Drop"],"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/symbolicgpt-a-generative-transformer-model","slug":"symbolicgpt-a-generative-transformer-model","title":"SymbolicGPT: A Generative Transformer Model for Symbolic Regression","date":"2021-06-27","arxiv_id":"2106.14131","repositories_listed":2,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/symbolicgpt-a-generative-transformer-model#ran","syntology_url":"https://syntology.ai/paper/2106.14131","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.14131"}},"official":{"repos":["git.uwaterloo.ca/data-analytics-lab/symbolicgpt2"],"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/golos-russian-dataset-for-speech-research","slug":"golos-russian-dataset-for-speech-research","title":"Golos: Russian Dataset for Speech Research","date":"2021-06-18","arxiv_id":"2106.10161","repositories_listed":2,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":1,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":5,"phrase":"4 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/golos-russian-dataset-for-speech-research#ran","syntology_url":"https://syntology.ai/paper/2106.10161","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.10161"}},"official":{"repos":["sberdevices/golos"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/bitfit-simple-parameter-efficient-fine-tuning","slug":"bitfit-simple-parameter-efficient-fine-tuning","title":"BitFit: Simple Parameter-efficient Fine-tuning for Transformer-based Masked Language-models","date":"2021-06-18","arxiv_id":"2106.10199","repositories_listed":6,"syntology":{"n":13,"n_ran":4,"n_constructed":1,"n_ran_checked":3,"n_instrument":1,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"4 ran (of which 1 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/bitfit-simple-parameter-efficient-fine-tuning#ran","syntology_url":"https://syntology.ai/paper/2106.10199","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.10199"}},"official":{"repos":["benzakenelad/BitFit"],"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/on-anytime-learning-at-macroscale","slug":"on-anytime-learning-at-macroscale","title":"On Anytime Learning at Macroscale","date":"2021-06-17","arxiv_id":"2106.09563","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":5,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/on-anytime-learning-at-macroscale#ran","syntology_url":"https://syntology.ai/paper/2106.09563","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.09563"}},"official":{"repos":["facebookresearch/alma"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/direction-is-what-you-need-improving-word","slug":"direction-is-what-you-need-improving-word","title":"Direction is what you need: Improving Word Embedding Compression in Large Language Models","date":"2021-06-15","arxiv_id":"2106.08181","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"7 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/direction-is-what-you-need-improving-word#ran","syntology_url":"https://syntology.ai/paper/2106.08181","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.08181"}},"official":{"repos":["MohammadrezaBanaei/orientation_based_embedding_compression"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/scene-transformer-a-unified-multi-task-model","slug":"scene-transformer-a-unified-multi-task-model","title":"Scene Transformer: A unified architecture for predicting multiple agent trajectories","date":"2021-06-15","arxiv_id":"2106.08417","repositories_listed":4,"syntology":{"n":6,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":6,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/scene-transformer-a-unified-multi-task-model#ran","syntology_url":"https://syntology.ai/paper/2106.08417","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.08417"}},"official":null}},{"url":"/paper/improving-pretrained-cross-lingual-language","slug":"improving-pretrained-cross-lingual-language","title":"Improving Pretrained Cross-Lingual Language Models via Self-Labeled Word Alignment","date":"2021-06-11","arxiv_id":"2106.06381","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/improving-pretrained-cross-lingual-language#ran","syntology_url":"https://syntology.ai/paper/2106.06381","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.06381"}},"official":{"repos":["CZWin32768/XLM-Align"],"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/parameter-efficient-multi-task-fine-tuning","slug":"parameter-efficient-multi-task-fine-tuning","title":"Parameter-efficient Multi-task Fine-tuning for Transformers via Shared Hypernetworks","date":"2021-06-08","arxiv_id":"2106.04489","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":3,"n_ran_checked":3,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"4 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/parameter-efficient-multi-task-fine-tuning#ran","syntology_url":"https://syntology.ai/paper/2106.04489","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.04489"}},"official":{"repos":["rabeehk/hyperformer"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/luna-linear-unified-nested-attention","slug":"luna-linear-unified-nested-attention","title":"Luna: Linear Unified Nested Attention","date":"2021-06-03","arxiv_id":"2106.01540","repositories_listed":2,"syntology":{"n":10,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":7,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/luna-linear-unified-nested-attention#ran","syntology_url":"https://syntology.ai/paper/2106.01540","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.01540"}},"official":{"repos":["XuezheMax/fairseq-apollo"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/provably-secure-generative-linguistic","slug":"provably-secure-generative-linguistic","title":"Provably Secure Generative Linguistic Steganography","date":"2021-06-03","arxiv_id":"2106.02011","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":2,"n_ran_checked":3,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":2,"n_pointer_only":5,"phrase":"4 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/provably-secure-generative-linguistic#ran","syntology_url":"https://syntology.ai/paper/2106.02011","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.02011"}},"official":{"repos":["Mhzzzzz/ADG-steganography"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":2,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/a-generalizable-approach-to-learning","slug":"a-generalizable-approach-to-learning","title":"A Generalizable Approach to Learning Optimizers","date":"2021-06-02","arxiv_id":"2106.00958","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-generalizable-approach-to-learning#ran","syntology_url":"https://syntology.ai/paper/2106.00958","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.00958"}},"official":{"repos":["openai/LHOPT"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/differential-privacy-for-text-analytics-via","slug":"differential-privacy-for-text-analytics-via","title":"Differential Privacy for Text Analytics via Natural Text Sanitization","date":"2021-06-02","arxiv_id":"2106.01221","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/differential-privacy-for-text-analytics-via#ran","syntology_url":"https://syntology.ai/paper/2106.01221","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.01221"}},"official":{"repos":["xiangyue9607/SanText"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/decision-transformer-reinforcement-learning","slug":"decision-transformer-reinforcement-learning","title":"Decision Transformer: Reinforcement Learning via Sequence Modeling","date":"2021-06-02","arxiv_id":"2106.01345","repositories_listed":20,"syntology":{"n":26,"n_ran":17,"n_constructed":10,"n_ran_checked":13,"n_instrument":4,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":8,"phrase":"17 ran (of which 10 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 4 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/decision-transformer-reinforcement-learning#ran","syntology_url":"https://syntology.ai/paper/2106.01345","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.01345"}},"official":{"repos":["kzl/decision-transformer"],"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/attention-based-contextual-language-model","slug":"attention-based-contextual-language-model","title":"Attention-based Contextual Language Model Adaptation for Speech Recognition","date":"2021-06-02","arxiv_id":"2106.01451","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/attention-based-contextual-language-model#ran","syntology_url":"https://syntology.ai/paper/2106.01451","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.01451"}},"official":{"repos":["amazon-research/contextual-attention-nlm"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/mathbert-a-pre-trained-language-model-for","slug":"mathbert-a-pre-trained-language-model-for","title":"MathBERT: A Pre-trained Language Model for General NLP Tasks in Mathematics Education","date":"2021-06-02","arxiv_id":"2106.07340","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":9,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/mathbert-a-pre-trained-language-model-for#ran","syntology_url":"https://syntology.ai/paper/2106.07340","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.07340"}},"official":{"repos":["tbs17/MathBERT"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/dialogue-oriented-pre-training","slug":"dialogue-oriented-pre-training","title":"Dialogue-oriented Pre-training","date":"2021-06-01","arxiv_id":"2106.00420","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":4,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/dialogue-oriented-pre-training#ran","syntology_url":"https://syntology.ai/paper/2106.00420","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.00420"}},"official":{"repos":["xyease/Dialog-PrLM"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/incorporating-visual-layout-structures-for","slug":"incorporating-visual-layout-structures-for","title":"VILA: Improving Structured Content Extraction from Scientific PDFs Using Visual Layout Groups","date":"2021-06-01","arxiv_id":"2106.00676","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/incorporating-visual-layout-structures-for#ran","syntology_url":"https://syntology.ai/paper/2106.00676","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.00676"}},"official":{"repos":["allenai/VILA"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/cascaded-head-colliding-attention","slug":"cascaded-head-colliding-attention","title":"Cascaded Head-colliding Attention","date":"2021-05-31","arxiv_id":"2105.14850","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":4,"n_ran_checked":5,"n_instrument":4,"n_unverified":1,"n_honours":1,"n_violates":1,"n_no_contract":3,"n_pointer_only":5,"phrase":"9 ran (of which 4 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 1 violated, 3 with no contract checked; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/cascaded-head-colliding-attention#ran","syntology_url":"https://syntology.ai/paper/2105.14850","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.14850"}},"official":{"repos":["LZhengisme/CODA"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":2,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["found_in_text","official","unlocated"]}}},{"url":"/paper/neurallog-natural-language-inference-with","slug":"neurallog-natural-language-inference-with","title":"NeuralLog: Natural Language Inference with Joint Neural and Logical Reasoning","date":"2021-05-29","arxiv_id":"2105.14167","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/neurallog-natural-language-inference-with#ran","syntology_url":"https://syntology.ai/paper/2105.14167","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.14167"}},"official":{"repos":["eric11eca/NeuralLog"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/protaugment-unsupervised-diverse-short-texts","slug":"protaugment-unsupervised-diverse-short-texts","title":"ProtAugment: Unsupervised diverse short-texts paraphrasing for intent detection meta-learning","date":"2021-05-27","arxiv_id":"2105.12995","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/protaugment-unsupervised-diverse-short-texts#ran","syntology_url":"https://syntology.ai/paper/2105.12995","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.12995"}},"official":{"repos":["tdopierre/ProtAugment"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/personalized-transformer-for-explainable","slug":"personalized-transformer-for-explainable","title":"Personalized Transformer for Explainable Recommendation","date":"2021-05-25","arxiv_id":"2105.11601","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":4,"n_ran_checked":5,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":4,"n_pointer_only":8,"phrase":"6 ran (of which 4 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 1 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/personalized-transformer-for-explainable#ran","syntology_url":"https://syntology.ai/paper/2105.11601","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.11601"}},"official":{"repos":["lileipisces/PETER"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":4,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/fedscale-benchmarking-model-and-system","slug":"fedscale-benchmarking-model-and-system","title":"FedScale: Benchmarking Model and System Performance of Federated Learning at Scale","date":"2021-05-24","arxiv_id":"2105.11367","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"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; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fedscale-benchmarking-model-and-system#ran","syntology_url":"https://syntology.ai/paper/2105.11367","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.11367"}},"official":{"repos":["SymbioticLab/FedScale"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/on-the-fly-controlled-text-generation-with","slug":"on-the-fly-controlled-text-generation-with","title":"DExperts: Decoding-Time Controlled Text Generation with Experts and Anti-Experts","date":"2021-05-07","arxiv_id":"2105.03023","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/on-the-fly-controlled-text-generation-with#ran","syntology_url":"https://syntology.ai/paper/2105.03023","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.03023"}},"official":{"repos":["alisawuffles/DExperts"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/handwritten-mathematical-expression","slug":"handwritten-mathematical-expression","title":"Handwritten Mathematical Expression Recognition with Bidirectionally Trained Transformer","date":"2021-05-06","arxiv_id":"2105.02412","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/handwritten-mathematical-expression#ran","syntology_url":"https://syntology.ai/paper/2105.02412","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.02412"}},"official":{"repos":["Green-Wood/BTTR"],"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":["official"]}}},{"url":"/paper/learning-passage-impacts-for-inverted-indexes","slug":"learning-passage-impacts-for-inverted-indexes","title":"Learning Passage Impacts for Inverted Indexes","date":"2021-04-24","arxiv_id":"2104.12016","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/learning-passage-impacts-for-inverted-indexes#ran","syntology_url":"https://syntology.ai/paper/2104.12016","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.12016"}},"official":{"repos":["DI4IR/SIGIR2021"],"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/b-prop-bootstrapped-pre-training-with","slug":"b-prop-bootstrapped-pre-training-with","title":"B-PROP: Bootstrapped Pre-training with Representative Words Prediction for Ad-hoc Retrieval","date":"2021-04-20","arxiv_id":"2104.09791","repositories_listed":1,"syntology":{"n":16,"n_ran":10,"n_constructed":0,"n_ran_checked":7,"n_instrument":3,"n_unverified":6,"n_honours":2,"n_violates":0,"n_no_contract":5,"n_pointer_only":3,"phrase":"10 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; 3 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/b-prop-bootstrapped-pre-training-with#ran","syntology_url":"https://syntology.ai/paper/2104.09791","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.09791"}},"official":{"repos":["Albert-Ma/PROP"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/probing-across-time-what-does-roberta-know","slug":"probing-across-time-what-does-roberta-know","title":"Probing Across Time: What Does RoBERTa Know and When?","date":"2021-04-16","arxiv_id":"2104.07885","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/probing-across-time-what-does-roberta-know#ran","syntology_url":"https://syntology.ai/paper/2104.07885","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.07885"}},"official":{"repos":["leo-liuzy/probe-across-time"],"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/effect-of-vision-and-language-extensions-on","slug":"effect-of-vision-and-language-extensions-on","title":"Effect of Visual Extensions on Natural Language Understanding in Vision-and-Language Models","date":"2021-04-16","arxiv_id":"2104.08066","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":4,"phrase":"8 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/effect-of-vision-and-language-extensions-on#ran","syntology_url":"https://syntology.ai/paper/2104.08066","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.08066"}},"official":{"repos":["alab-nii/eval_vl_glue"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/tsdae-using-transformer-based-sequential","slug":"tsdae-using-transformer-based-sequential","title":"TSDAE: Using Transformer-based Sequential Denoising Auto-Encoder for Unsupervised Sentence Embedding Learning","date":"2021-04-14","arxiv_id":"2104.06979","repositories_listed":6,"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/tsdae-using-transformer-based-sequential#ran","syntology_url":"https://syntology.ai/paper/2104.06979","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.06979"}},"official":{"repos":["kwang2049/pytorch-bertflow","kwang2049/useb","ukplab/pytorch-bertflow"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/udalm-unsupervised-domain-adaptation-through","slug":"udalm-unsupervised-domain-adaptation-through","title":"UDALM: Unsupervised Domain Adaptation through Language Modeling","date":"2021-04-14","arxiv_id":"2104.07078","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/udalm-unsupervised-domain-adaptation-through#ran","syntology_url":"https://syntology.ai/paper/2104.07078","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.07078"}},"official":{"repos":["ckarouzos/slp_daptmlm"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/on-the-inductive-bias-of-masked-language","slug":"on-the-inductive-bias-of-masked-language","title":"On the Inductive Bias of Masked Language Modeling: From Statistical to Syntactic Dependencies","date":"2021-04-12","arxiv_id":"2104.05694","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/on-the-inductive-bias-of-masked-language#ran","syntology_url":"https://syntology.ai/paper/2104.05694","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.05694"}},"official":{"repos":["tatsu-lab/mlm_inductive_bias"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/revisiting-simple-neural-probabilistic","slug":"revisiting-simple-neural-probabilistic","title":"Revisiting Simple Neural Probabilistic Language Models","date":"2021-04-08","arxiv_id":"2104.03474","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/revisiting-simple-neural-probabilistic#ran","syntology_url":"https://syntology.ai/paper/2104.03474","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.03474"}},"official":{"repos":["SimengSun/revisit-nplm"],"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/alephbert-a-hebrew-large-pre-trained-language","slug":"alephbert-a-hebrew-large-pre-trained-language","title":"AlephBERT:A Hebrew Large Pre-Trained Language Model to Start-off your Hebrew NLP Application With","date":"2021-04-08","arxiv_id":"2104.04052","repositories_listed":2,"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":2,"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/alephbert-a-hebrew-large-pre-trained-language#ran","syntology_url":"https://syntology.ai/paper/2104.04052","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.04052"}},"official":{"repos":["OnlpLab/Hebrew-Sentiment-Data"],"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/fastmoe-a-fast-mixture-of-expert-training","slug":"fastmoe-a-fast-mixture-of-expert-training","title":"FastMoE: A Fast Mixture-of-Expert Training System","date":"2021-03-24","arxiv_id":"2103.13262","repositories_listed":3,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/fastmoe-a-fast-mixture-of-expert-training#ran","syntology_url":"https://syntology.ai/paper/2103.13262","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.13262"}},"official":{"repos":["davidmrau/mixture-of-experts","laekov/fastmoe"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/attribute-alignment-controlling-text","slug":"attribute-alignment-controlling-text","title":"Attribute Alignment: Controlling Text Generation from Pre-trained Language Models","date":"2021-03-20","arxiv_id":"2103.11070","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/attribute-alignment-controlling-text#ran","syntology_url":"https://syntology.ai/paper/2103.11070","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.11070"}},"official":{"repos":["diandyu/attribute_alignment"],"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/all-nlp-tasks-are-generation-tasks-a-general","slug":"all-nlp-tasks-are-generation-tasks-a-general","title":"GLM: General Language Model Pretraining with Autoregressive Blank Infilling","date":"2021-03-18","arxiv_id":"2103.10360","repositories_listed":8,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/all-nlp-tasks-are-generation-tasks-a-general#ran","syntology_url":"https://syntology.ai/paper/2103.10360","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.10360"}},"official":{"repos":["THUDM/GLM"],"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/gpt-understands-too","slug":"gpt-understands-too","title":"GPT Understands, Too","date":"2021-03-18","arxiv_id":"2103.10385","repositories_listed":10,"syntology":{"n":3,"n_ran":3,"n_constructed":1,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"3 ran (of which 1 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/gpt-understands-too#ran","syntology_url":"https://syntology.ai/paper/2103.10385","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.10385"}},"official":{"repos":["THUDM/P-tuning"],"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/read-like-humans-autonomous-bidirectional-and","slug":"read-like-humans-autonomous-bidirectional-and","title":"Read Like Humans: Autonomous, Bidirectional and Iterative Language Modeling for Scene Text Recognition","date":"2021-03-11","arxiv_id":"2103.06495","repositories_listed":4,"syntology":{"n":28,"n_ran":18,"n_constructed":11,"n_ran_checked":13,"n_instrument":5,"n_unverified":10,"n_honours":0,"n_violates":1,"n_no_contract":12,"n_pointer_only":18,"phrase":"18 ran (of which 11 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 1 violated, 12 with no contract checked; 5 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/read-like-humans-autonomous-bidirectional-and#ran","syntology_url":"https://syntology.ai/paper/2103.06495","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.06495"}},"official":{"repos":["FangShancheng/ABINet"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":6,"n_ran_no_instrument_failure":7,"n_unverified":8,"ran_from_kinds":["listed","official","unlocated"]}}},{"url":"/paper/self-diagnosis-and-self-debiasing-a-proposal","slug":"self-diagnosis-and-self-debiasing-a-proposal","title":"Self-Diagnosis and Self-Debiasing: A Proposal for Reducing Corpus-Based Bias in NLP","date":"2021-02-28","arxiv_id":"2103.00453","repositories_listed":3,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/self-diagnosis-and-self-debiasing-a-proposal#ran","syntology_url":"https://syntology.ai/paper/2103.00453","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.00453"}},"official":{"repos":["timoschick/self-debiasing"],"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/gradinit-learning-to-initialize-neural","slug":"gradinit-learning-to-initialize-neural","title":"GradInit: Learning to Initialize Neural Networks for Stable and Efficient Training","date":"2021-02-16","arxiv_id":"2102.08098","repositories_listed":2,"syntology":{"n":13,"n_ran":7,"n_constructed":4,"n_ran_checked":4,"n_instrument":3,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":12,"phrase":"7 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; 3 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/gradinit-learning-to-initialize-neural#ran","syntology_url":"https://syntology.ai/paper/2102.08098","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.08098"}},"official":{"repos":["zhuchen03/gradinit"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":6,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/coco-lm-correcting-and-contrasting-text","slug":"coco-lm-correcting-and-contrasting-text","title":"COCO-LM: Correcting and Contrasting Text Sequences for Language Model Pretraining","date":"2021-02-16","arxiv_id":"2102.08473","repositories_listed":2,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":1,"n_instrument":4,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"5 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; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/coco-lm-correcting-and-contrasting-text#ran","syntology_url":"https://syntology.ai/paper/2102.08473","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.08473"}},"official":{"repos":["microsoft/coco-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/proof-artifact-co-training-for-theorem","slug":"proof-artifact-co-training-for-theorem","title":"Proof Artifact Co-training for Theorem Proving with Language Models","date":"2021-02-11","arxiv_id":"2102.06203","repositories_listed":4,"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":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) · 1 unverified","sample_list":"/paper/proof-artifact-co-training-for-theorem#ran","syntology_url":"https://syntology.ai/paper/2102.06203","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.06203"}},"official":{"repos":["jasonrute/lean-proof-recording-public","jasonrute/lean_proof_recording","jesse-michael-han/lean-step-public"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/unifying-vision-and-language-tasks-via-text","slug":"unifying-vision-and-language-tasks-via-text","title":"Unifying Vision-and-Language Tasks via Text Generation","date":"2021-02-04","arxiv_id":"2102.02779","repositories_listed":2,"syntology":{"n":12,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":10,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 10 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/unifying-vision-and-language-tasks-via-text#ran","syntology_url":"https://syntology.ai/paper/2102.02779","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.02779"}},"official":{"repos":["j-min/VL-T5"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":10,"ran_from_kinds":["official"]}}},{"url":"/paper/tokens-to-token-vit-training-vision","slug":"tokens-to-token-vit-training-vision","title":"Tokens-to-Token ViT: Training Vision Transformers from Scratch on ImageNet","date":"2021-01-28","arxiv_id":"2101.11986","repositories_listed":13,"syntology":{"n":26,"n_ran":21,"n_constructed":16,"n_ran_checked":21,"n_instrument":0,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":20,"n_pointer_only":8,"phrase":"21 ran (of which 16 constructed an object rather than computing a result; 21 with no instrument failure: 1 honoured, 0 violated, 20 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/tokens-to-token-vit-training-vision#ran","syntology_url":"https://syntology.ai/paper/2101.11986","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2101.11986"}},"official":{"repos":["yitu-opensource/T2T-ViT"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/cpt-efficient-deep-neural-network-training-1","slug":"cpt-efficient-deep-neural-network-training-1","title":"CPT: Efficient Deep Neural Network Training via Cyclic Precision","date":"2021-01-25","arxiv_id":"2101.09868","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/cpt-efficient-deep-neural-network-training-1#ran","syntology_url":"https://syntology.ai/paper/2101.09868","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2101.09868"}},"official":{"repos":["RICE-EIC/CPT"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/prefix-tuning-optimizing-continuous-prompts","slug":"prefix-tuning-optimizing-continuous-prompts","title":"Prefix-Tuning: Optimizing Continuous Prompts for Generation","date":"2021-01-01","arxiv_id":"2101.00190","repositories_listed":13,"syntology":{"n":6,"n_ran":4,"n_constructed":2,"n_ran_checked":2,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"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) · 2 unverified","sample_list":"/paper/prefix-tuning-optimizing-continuous-prompts#ran","syntology_url":"https://syntology.ai/paper/2101.00190","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2101.00190"}},"official":{"repos":["XiangLi1999/PrefixTuning"],"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/directed-beam-search-plug-and-play-lexically","slug":"directed-beam-search-plug-and-play-lexically","title":"Directed Beam Search: Plug-and-Play Lexically Constrained Language Generation","date":"2020-12-31","arxiv_id":"2012.15416","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/directed-beam-search-plug-and-play-lexically#ran","syntology_url":"https://syntology.ai/paper/2012.15416","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.15416"}},"official":{"repos":["dapascual/DirectedBeamSearch"],"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/the-pile-an-800gb-dataset-of-diverse-text-for","slug":"the-pile-an-800gb-dataset-of-diverse-text-for","title":"The Pile: An 800GB Dataset of Diverse Text for Language Modeling","date":"2020-12-31","arxiv_id":"2101.00027","repositories_listed":22,"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/the-pile-an-800gb-dataset-of-diverse-text-for#ran","syntology_url":"https://syntology.ai/paper/2101.00027","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2101.00027"}},"official":{"repos":["EleutherAI/The-Pile"],"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/intrinsic-dimensionality-explains-the","slug":"intrinsic-dimensionality-explains-the","title":"Intrinsic Dimensionality Explains the Effectiveness of Language Model Fine-Tuning","date":"2020-12-22","arxiv_id":"2012.13255","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/intrinsic-dimensionality-explains-the#ran","syntology_url":"https://syntology.ai/paper/2012.13255","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.13255"}},"official":{"repos":["rabeehk/compacter"],"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/extracting-training-data-from-large-language","slug":"extracting-training-data-from-large-language","title":"Extracting Training Data from Large Language Models","date":"2020-12-14","arxiv_id":"2012.07805","repositories_listed":3,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/extracting-training-data-from-large-language#ran","syntology_url":"https://syntology.ai/paper/2012.07805","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.07805"}},"official":{"repos":["ftramer/LM_Memorization"],"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/the-zero-resource-speech-benchmark-2021","slug":"the-zero-resource-speech-benchmark-2021","title":"The Zero Resource Speech Benchmark 2021: Metrics and baselines for unsupervised spoken language modeling","date":"2020-11-23","arxiv_id":"2011.11588","repositories_listed":2,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/the-zero-resource-speech-benchmark-2021#ran","syntology_url":"https://syntology.ai/paper/2011.11588","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.11588"}},"official":{"repos":["bootphon/zerospeech2021_baseline"],"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/incorporating-a-local-translation-mechanism","slug":"incorporating-a-local-translation-mechanism","title":"Incorporating a Local Translation Mechanism into Non-autoregressive Translation","date":"2020-11-12","arxiv_id":"2011.06132","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":2,"n_ran_checked":2,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 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; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/incorporating-a-local-translation-mechanism#ran","syntology_url":"https://syntology.ai/paper/2011.06132","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.06132"}},"official":{"repos":["shawnkx/NAT-with-Local-AT"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/adapting-a-language-model-for-controlled","slug":"adapting-a-language-model-for-controlled","title":"Adapting a Language Model for Controlled Affective Text Generation","date":"2020-11-08","arxiv_id":"2011.04000","repositories_listed":1,"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":3,"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/adapting-a-language-model-for-controlled#ran","syntology_url":"https://syntology.ai/paper/2011.04000","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.04000"}},"official":{"repos":["ishikasingh/Affective-text-gen"],"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","unlocated"]}}},{"url":"/paper/charbert-character-aware-pre-trained-language","slug":"charbert-character-aware-pre-trained-language","title":"CharBERT: Character-aware Pre-trained Language Model","date":"2020-11-03","arxiv_id":"2011.01513","repositories_listed":1,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":8,"n_instrument":2,"n_unverified":3,"n_honours":2,"n_violates":0,"n_no_contract":6,"n_pointer_only":3,"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) · 3 unverified","sample_list":"/paper/charbert-character-aware-pre-trained-language#ran","syntology_url":"https://syntology.ai/paper/2011.01513","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.01513"}},"official":{"repos":["wtma/CharBERT"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/improving-variational-autoencoder-for-text","slug":"improving-variational-autoencoder-for-text","title":"Improving Variational Autoencoder for Text Modelling with Timestep-Wise Regularisation","date":"2020-11-02","arxiv_id":"2011.01136","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/improving-variational-autoencoder-for-text#ran","syntology_url":"https://syntology.ai/paper/2011.01136","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.01136"}},"official":{"repos":["ruizheliUOA/TWR-VAE"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/on-the-sentence-embeddings-from-pre-trained","slug":"on-the-sentence-embeddings-from-pre-trained","title":"On the Sentence Embeddings from Pre-trained Language Models","date":"2020-11-02","arxiv_id":"2011.05864","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":2,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/on-the-sentence-embeddings-from-pre-trained#ran","syntology_url":"https://syntology.ai/paper/2011.05864","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.05864"}},"official":{"repos":["bohanli/BERT-flow"],"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":["official"]}}},{"url":"/paper/turngpt-a-transformer-based-language-model","slug":"turngpt-a-transformer-based-language-model","title":"TurnGPT: a Transformer-based Language Model for Predicting Turn-taking in Spoken Dialog","date":"2020-10-21","arxiv_id":"2010.10874","repositories_listed":1,"syntology":{"n":6,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/turngpt-a-transformer-based-language-model#ran","syntology_url":"https://syntology.ai/paper/2010.10874","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.10874"}},"official":{"repos":["ErikEkstedt/TurnGPT"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/cold-start-active-learning-through-self","slug":"cold-start-active-learning-through-self","title":"Cold-start Active Learning through Self-supervised Language Modeling","date":"2020-10-19","arxiv_id":"2010.09535","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/cold-start-active-learning-through-self#ran","syntology_url":"https://syntology.ai/paper/2010.09535","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.09535"}},"official":{"repos":["forest-snow/alps"],"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/knowledge-grounded-dialogue-generation-with","slug":"knowledge-grounded-dialogue-generation-with","title":"Knowledge-Grounded Dialogue Generation with Pre-trained Language Models","date":"2020-10-17","arxiv_id":"2010.08824","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":2,"n_ran_checked":3,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":6,"phrase":"5 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/knowledge-grounded-dialogue-generation-with#ran","syntology_url":"https://syntology.ai/paper/2010.08824","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.08824"}},"official":{"repos":["zhaoxlpku/KnowledGPT"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":2,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/substance-over-style-document-level-targeted","slug":"substance-over-style-document-level-targeted","title":"Substance over Style: Document-Level Targeted Content Transfer","date":"2020-10-16","arxiv_id":"2010.08618","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/substance-over-style-document-level-targeted#ran","syntology_url":"https://syntology.ai/paper/2010.08618","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.08618"}},"official":{"repos":["microsoft/document-level-targeted-content-transfer"],"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":["found_in_text"]}}},{"url":"/paper/adabelief-optimizer-adapting-stepsizes-by-the","slug":"adabelief-optimizer-adapting-stepsizes-by-the","title":"AdaBelief Optimizer: Adapting Stepsizes by the Belief in Observed Gradients","date":"2020-10-15","arxiv_id":"2010.07468","repositories_listed":8,"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/adabelief-optimizer-adapting-stepsizes-by-the#ran","syntology_url":"https://syntology.ai/paper/2010.07468","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.07468"}},"official":{"repos":["juntang-zhuang/Adabelief-Optimizer"],"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/fine-tuning-pre-trained-language-model-with","slug":"fine-tuning-pre-trained-language-model-with","title":"Fine-Tuning Pre-trained Language Model with Weak Supervision: A Contrastive-Regularized Self-Training Approach","date":"2020-10-15","arxiv_id":"2010.07835","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fine-tuning-pre-trained-language-model-with#ran","syntology_url":"https://syntology.ai/paper/2010.07835","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.07835"}},"official":{"repos":["yueyu1030/COSINE"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/vokenization-improving-language-understanding","slug":"vokenization-improving-language-understanding","title":"Vokenization: Improving Language Understanding with Contextualized, Visual-Grounded Supervision","date":"2020-10-14","arxiv_id":"2010.06775","repositories_listed":1,"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/vokenization-improving-language-understanding#ran","syntology_url":"https://syntology.ai/paper/2010.06775","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.06775"}},"official":{"repos":["airsplay/vokenization"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/what-do-position-embeddings-learn-an","slug":"what-do-position-embeddings-learn-an","title":"What Do Position Embeddings Learn? An Empirical Study of Pre-Trained Language Model Positional Encoding","date":"2020-10-10","arxiv_id":"2010.04903","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/what-do-position-embeddings-learn-an#ran","syntology_url":"https://syntology.ai/paper/2010.04903","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.04903"}},"official":{"repos":["MiuLab/PE-Study"],"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/q-learning-with-language-model-for-edit-based","slug":"q-learning-with-language-model-for-edit-based","title":"Q-learning with Language Model for Edit-based Unsupervised Summarization","date":"2020-10-09","arxiv_id":"2010.04379","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/q-learning-with-language-model-for-edit-based#ran","syntology_url":"https://syntology.ai/paper/2010.04379","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.04379"}},"official":{"repos":["kohilin/ealm"],"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":["found_in_text"]}}},{"url":"/paper/guiding-attention-for-self-supervised","slug":"guiding-attention-for-self-supervised","title":"Guiding Attention for Self-Supervised Learning with Transformers","date":"2020-10-06","arxiv_id":"2010.02399","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/guiding-attention-for-self-supervised#ran","syntology_url":"https://syntology.ai/paper/2010.02399","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.02399"}},"official":{"repos":["ameet-1997/AttentionGuidance"],"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/compositional-demographic-word-embeddings","slug":"compositional-demographic-word-embeddings","title":"Compositional Demographic Word Embeddings","date":"2020-10-06","arxiv_id":"2010.02986","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/compositional-demographic-word-embeddings#ran","syntology_url":"https://syntology.ai/paper/2010.02986","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.02986"}},"official":{"repos":["dbamman/geoSGLM"],"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":["found_in_text"]}}},{"url":"/paper/xda-accurate-robust-disassembly-with-transfer","slug":"xda-accurate-robust-disassembly-with-transfer","title":"XDA: Accurate, Robust Disassembly with Transfer Learning","date":"2020-10-02","arxiv_id":"2010.00770","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/xda-accurate-robust-disassembly-with-transfer#ran","syntology_url":"https://syntology.ai/paper/2010.00770","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.00770"}},"official":{"repos":["CUMLSec/XDA"],"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/luke-deep-contextualized-entity","slug":"luke-deep-contextualized-entity","title":"LUKE: Deep Contextualized Entity Representations with Entity-aware Self-attention","date":"2020-10-02","arxiv_id":"2010.01057","repositories_listed":9,"syntology":{"n":10,"n_ran":3,"n_constructed":2,"n_ran_checked":3,"n_instrument":0,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/luke-deep-contextualized-entity#ran","syntology_url":"https://syntology.ai/paper/2010.01057","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.01057"}},"official":{"repos":["studio-ousia/luke"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":2,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/grappa-grammar-augmented-pre-training-for","slug":"grappa-grammar-augmented-pre-training-for","title":"GraPPa: Grammar-Augmented Pre-Training for Table Semantic Parsing","date":"2020-09-29","arxiv_id":"2009.13845","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":0,"n_instrument":6,"n_unverified":1,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 6 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/grappa-grammar-augmented-pre-training-for#ran","syntology_url":"https://syntology.ai/paper/2009.13845","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.13845"}},"official":null}},{"url":"/paper/contrastive-distillation-on-intermediate","slug":"contrastive-distillation-on-intermediate","title":"Contrastive Distillation on Intermediate Representations for Language Model Compression","date":"2020-09-29","arxiv_id":"2009.14167","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/contrastive-distillation-on-intermediate#ran","syntology_url":"https://syntology.ai/paper/2009.14167","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.14167"}},"official":{"repos":["intersun/CoDIR"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/revisiting-lstm-networks-for-semi-supervised-1","slug":"revisiting-lstm-networks-for-semi-supervised-1","title":"Revisiting LSTM Networks for Semi-Supervised Text Classification via Mixed Objective Function","date":"2020-09-08","arxiv_id":"2009.04007","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/revisiting-lstm-networks-for-semi-supervised-1#ran","syntology_url":"https://syntology.ai/paper/2009.04007","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.04007"}},"official":null}},{"url":"/paper/greek-bert-the-greeks-visiting-sesame-street","slug":"greek-bert-the-greeks-visiting-sesame-street","title":"GREEK-BERT: The Greeks visiting Sesame Street","date":"2020-08-27","arxiv_id":"2008.12014","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"3 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/greek-bert-the-greeks-visiting-sesame-street#ran","syntology_url":"https://syntology.ai/paper/2008.12014","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.12014"}},"official":{"repos":["nlpaueb/greek-bert"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/delight-very-deep-and-light-weight","slug":"delight-very-deep-and-light-weight","title":"DeLighT: Deep and Light-weight Transformer","date":"2020-08-03","arxiv_id":"2008.00623","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/delight-very-deep-and-light-weight#ran","syntology_url":"https://syntology.ai/paper/2008.00623","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.00623"}},"official":{"repos":["sacmehta/delight"],"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":["official"]}}},{"url":"/paper/mirostat-a-perplexity-controlled-neural-text","slug":"mirostat-a-perplexity-controlled-neural-text","title":"Mirostat: A Neural Text Decoding Algorithm that Directly Controls Perplexity","date":"2020-07-29","arxiv_id":"2007.14966","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":0,"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/mirostat-a-perplexity-controlled-neural-text#ran","syntology_url":"https://syntology.ai/paper/2007.14966","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.14966"}},"official":{"repos":["basusourya/mirostat"],"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/the-lottery-ticket-hypothesis-for-pre-trained","slug":"the-lottery-ticket-hypothesis-for-pre-trained","title":"The Lottery Ticket Hypothesis for Pre-trained BERT Networks","date":"2020-07-23","arxiv_id":"2007.12223","repositories_listed":2,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":4,"n_instrument":5,"n_unverified":2,"n_honours":3,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 3 honoured, 0 violated, 1 with no contract checked; 5 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/the-lottery-ticket-hypothesis-for-pre-trained#ran","syntology_url":"https://syntology.ai/paper/2007.12223","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.12223"}},"official":{"repos":["TAMU-VITA/BERT-Tickets","VITA-Group/BERT-Tickets"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-to-combine-top-down-and-bottom-up","slug":"learning-to-combine-top-down-and-bottom-up","title":"Learning to Combine Top-Down and Bottom-Up Signals in Recurrent Neural Networks with Attention over Modules","date":"2020-06-30","arxiv_id":"2006.16981","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/learning-to-combine-top-down-and-bottom-up#ran","syntology_url":"https://syntology.ai/paper/2006.16981","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.16981"}},"official":{"repos":["sarthmit/BRIMs"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-sparse-prototypes-for-text","slug":"learning-sparse-prototypes-for-text","title":"Learning Sparse Prototypes for Text Generation","date":"2020-06-29","arxiv_id":"2006.16336","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":3,"n_ran_checked":8,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":1,"phrase":"8 ran (of which 3 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/learning-sparse-prototypes-for-text#ran","syntology_url":"https://syntology.ai/paper/2006.16336","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.16336"}},"official":{"repos":["jxhe/sparse-text-prototype"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":3,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/bond-bert-assisted-open-domain-named-entity","slug":"bond-bert-assisted-open-domain-named-entity","title":"BOND: BERT-Assisted Open-Domain Named Entity Recognition with Distant Supervision","date":"2020-06-28","arxiv_id":"2006.15509","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/bond-bert-assisted-open-domain-named-entity#ran","syntology_url":"https://syntology.ai/paper/2006.15509","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.15509"}},"official":{"repos":["cliang1453/BOND"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/pre-training-via-paraphrasing","slug":"pre-training-via-paraphrasing","title":"Pre-training via Paraphrasing","date":"2020-06-26","arxiv_id":"2006.15020","repositories_listed":2,"syntology":{"n":18,"n_ran":15,"n_constructed":0,"n_ran_checked":12,"n_instrument":3,"n_unverified":3,"n_honours":3,"n_violates":2,"n_no_contract":7,"n_pointer_only":3,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 3 honoured, 2 violated, 7 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/pre-training-via-paraphrasing#ran","syntology_url":"https://syntology.ai/paper/2006.15020","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.15020"}},"official":null}},{"url":"/paper/finbert-a-pretrained-language-model-for","slug":"finbert-a-pretrained-language-model-for","title":"FinBERT: A Pretrained Language Model for Financial Communications","date":"2020-06-15","arxiv_id":"2006.08097","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/finbert-a-pretrained-language-model-for#ran","syntology_url":"https://syntology.ai/paper/2006.08097","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.08097"}},"official":{"repos":["yya518/FinBERT"],"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/mc-bert-efficient-language-pre-training-via-a","slug":"mc-bert-efficient-language-pre-training-via-a","title":"MC-BERT: Efficient Language Pre-Training via a Meta Controller","date":"2020-06-10","arxiv_id":"2006.05744","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/mc-bert-efficient-language-pre-training-via-a#ran","syntology_url":"https://syntology.ai/paper/2006.05744","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.05744"}},"official":{"repos":["MC-BERT/MC-BERT"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/massive-choice-ample-tasks-machamp-a-toolkit","slug":"massive-choice-ample-tasks-machamp-a-toolkit","title":"Massive Choice, Ample Tasks (MaChAmp): A Toolkit for Multi-task Learning in NLP","date":"2020-05-29","arxiv_id":"2005.14672","repositories_listed":2,"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/massive-choice-ample-tasks-machamp-a-toolkit#ran","syntology_url":"https://syntology.ai/paper/2005.14672","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.14672"}},"official":{"repos":["machamp-nlp/machamp"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/language-models-are-few-shot-learners","slug":"language-models-are-few-shot-learners","title":"Language Models are Few-Shot Learners","date":"2020-05-28","arxiv_id":"2005.14165","repositories_listed":67,"syntology":{"n":65,"n_ran":45,"n_constructed":0,"n_ran_checked":40,"n_instrument":5,"n_unverified":20,"n_honours":2,"n_violates":1,"n_no_contract":37,"n_pointer_only":7,"phrase":"45 ran (of which 0 constructed an object rather than computing a result; 40 with no instrument failure: 2 honoured, 1 violated, 37 with no contract checked; 5 where Syntology's instrument failed) · 20 unverified","sample_list":"/paper/language-models-are-few-shot-learners#ran","syntology_url":"https://syntology.ai/paper/2005.14165","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.14165"}},"official":{"repos":["openai/gpt-3"],"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/gpt-too-a-language-model-first-approach-for","slug":"gpt-too-a-language-model-first-approach-for","title":"GPT-too: A language-model-first approach for AMR-to-text generation","date":"2020-05-18","arxiv_id":"2005.09123","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":2,"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) · 0 unverified","sample_list":"/paper/gpt-too-a-language-model-first-approach-for#ran","syntology_url":"https://syntology.ai/paper/2005.09123","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.09123"}},"official":{"repos":["IBM/GPT-too-AMR2text"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/micronet-for-efficient-language-modeling","slug":"micronet-for-efficient-language-modeling","title":"MicroNet for Efficient Language Modeling","date":"2020-05-16","arxiv_id":"2005.07877","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/micronet-for-efficient-language-modeling#ran","syntology_url":"https://syntology.ai/paper/2005.07877","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.07877"}},"official":{"repos":["mit-han-lab/neurips-micronet"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}}],"record_sha256":"c718beb474dac9d99e15b04f935a3f3c66309d2f396362dc0244371eae44ad05","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}