{"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/text-classification-1/papers/ran/2","list_of":"/task/text-classification-1","task":"text-classification","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":2,"pages_in_order":3,"rows_per_page":100,"rows":[101,200],"of":204,"counts":{"archive_papers_tagged":3054,"with_a_code_link":1083,"where_syntology_ran_a_sample":204,"not_listed_spam_title":0,"listed":3054,"listed_where_code_ran":204,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":161,"every_run_a_failure_of_syntologys_instrument":43,"listed_with_a_run_with_no_instrument_failure":161,"listed_every_run_a_failure_of_syntologys_instrument":43,"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/text-classification-1/papers/ran/1","prev":"/task/text-classification-1/papers/ran/1","next":"/task/text-classification-1/papers/ran/3","papers":[{"url":"/paper/distributionally-robust-models-with-1","slug":"distributionally-robust-models-with-1","title":"Distributionally Robust Models with Parametric Likelihood Ratios","date":"2022-04-13","arxiv_id":"2204.06340","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/distributionally-robust-models-with-1#ran","syntology_url":"https://syntology.ai/paper/2204.06340","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.06340"}},"official":{"repos":["pmichel31415/P-DRO"],"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/few-shot-learning-with-siamese-networks-and-1","slug":"few-shot-learning-with-siamese-networks-and-1","title":"Few-Shot Learning with Siamese Networks and Label Tuning","date":"2022-03-28","arxiv_id":"2203.14655","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/few-shot-learning-with-siamese-networks-and-1#ran","syntology_url":"https://syntology.ai/paper/2203.14655","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.14655"}},"official":{"repos":["symanto-research/few-shot-learning-label-tuning"],"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/adversarial-training-for-improving-model","slug":"adversarial-training-for-improving-model","title":"Adversarial Training for Improving Model Robustness? Look at Both Prediction and Interpretation","date":"2022-03-23","arxiv_id":"2203.12709","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adversarial-training-for-improving-model#ran","syntology_url":"https://syntology.ai/paper/2203.12709","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.12709"}},"official":{"repos":["uva-nlp/flat"],"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/qdrop-randomly-dropping-quantization-for-1","slug":"qdrop-randomly-dropping-quantization-for-1","title":"QDrop: Randomly Dropping Quantization for Extremely Low-bit Post-Training Quantization","date":"2022-03-11","arxiv_id":"2203.05740","repositories_listed":2,"syntology":{"n":19,"n_ran":14,"n_constructed":5,"n_ran_checked":6,"n_instrument":8,"n_unverified":5,"n_honours":0,"n_violates":1,"n_no_contract":5,"n_pointer_only":0,"phrase":"14 ran (of which 5 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 1 violated, 5 with no contract checked; 8 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/qdrop-randomly-dropping-quantization-for-1#ran","syntology_url":"https://syntology.ai/paper/2203.05740","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.05740"}},"official":{"repos":["modeltc/mqbench","wimh966/QDrop"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":5,"n_ran_no_instrument_failure":6,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/incorporating-hierarchy-into-text-encoder-a","slug":"incorporating-hierarchy-into-text-encoder-a","title":"Incorporating Hierarchy into Text Encoder: a Contrastive Learning Approach for Hierarchical Text Classification","date":"2022-03-08","arxiv_id":"2203.03825","repositories_listed":1,"syntology":{"n":11,"n_ran":5,"n_constructed":2,"n_ran_checked":5,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 2 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) · 6 unverified","sample_list":"/paper/incorporating-hierarchy-into-text-encoder-a#ran","syntology_url":"https://syntology.ai/paper/2203.03825","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.03825"}},"official":{"repos":["wzh9969/contrastive-htc"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":2,"n_ran_no_instrument_failure":5,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/interpreting-language-models-with-contrastive","slug":"interpreting-language-models-with-contrastive","title":"Interpreting Language Models with Contrastive Explanations","date":"2022-02-21","arxiv_id":"2202.10419","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":0,"n_instrument":6,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":6,"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) · 0 unverified","sample_list":"/paper/interpreting-language-models-with-contrastive#ran","syntology_url":"https://syntology.ai/paper/2202.10419","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.10419"}},"official":{"repos":["kayoyin/interpret-lm"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/hierarchical-interpretation-of-neural-text","slug":"hierarchical-interpretation-of-neural-text","title":"Hierarchical Interpretation of Neural Text Classification","date":"2022-02-20","arxiv_id":"2202.09792","repositories_listed":1,"syntology":{"n":10,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/hierarchical-interpretation-of-neural-text#ran","syntology_url":"https://syntology.ai/paper/2202.09792","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.09792"}},"official":{"repos":["hanqi-qi/sine"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/zerogen-efficient-zero-shot-learning-via","slug":"zerogen-efficient-zero-shot-learning-via","title":"ZeroGen: Efficient Zero-shot Learning via Dataset Generation","date":"2022-02-16","arxiv_id":"2202.07922","repositories_listed":3,"syntology":{"n":7,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":7,"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) · 4 unverified","sample_list":"/paper/zerogen-efficient-zero-shot-learning-via#ran","syntology_url":"https://syntology.ai/paper/2202.07922","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.07922"}},"official":{"repos":["HKUNLP/zerogen"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/hyla-hyperbolic-laplacian-features-for-graph","slug":"hyla-hyperbolic-laplacian-features-for-graph","title":"Random Laplacian Features for Learning with Hyperbolic Space","date":"2022-02-14","arxiv_id":"2202.06854","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":1,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/hyla-hyperbolic-laplacian-features-for-graph#ran","syntology_url":"https://syntology.ai/paper/2202.06854","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.06854"}},"official":{"repos":["ydtydr/hyla"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/beyond-images-label-noise-transition-matrix","slug":"beyond-images-label-noise-transition-matrix","title":"Beyond Images: Label Noise Transition Matrix Estimation for Tasks with Lower-Quality Features","date":"2022-02-02","arxiv_id":"2202.01273","repositories_listed":2,"syntology":{"n":25,"n_ran":14,"n_constructed":0,"n_ran_checked":12,"n_instrument":2,"n_unverified":11,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":4,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 2 where Syntology's instrument failed) · 11 unverified","sample_list":"/paper/beyond-images-label-noise-transition-matrix#ran","syntology_url":"https://syntology.ai/paper/2202.01273","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.01273"}},"official":{"repos":["ucsc-real/beyondimages","ucsc-real/est-t-mi"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":11,"ran_from_kinds":["official"]}}},{"url":"/paper/black-box-prompt-learning-for-pre-trained","slug":"black-box-prompt-learning-for-pre-trained","title":"Black-box Prompt Learning for Pre-trained Language Models","date":"2022-01-21","arxiv_id":"2201.08531","repositories_listed":1,"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/black-box-prompt-learning-for-pre-trained#ran","syntology_url":"https://syntology.ai/paper/2201.08531","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.08531"}},"official":{"repos":["shizhediao/black-box-prompt-learning"],"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/transformer-uncertainty-estimation-with","slug":"transformer-uncertainty-estimation-with","title":"Transformer Uncertainty Estimation with Hierarchical Stochastic Attention","date":"2021-12-27","arxiv_id":"2112.13776","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/transformer-uncertainty-estimation-with#ran","syntology_url":"https://syntology.ai/paper/2112.13776","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.13776"}},"official":{"repos":["amzn/sto-transformer"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/unirex-a-unified-learning-framework-for","slug":"unirex-a-unified-learning-framework-for","title":"UNIREX: A Unified Learning Framework for Language Model Rationale Extraction","date":"2021-12-16","arxiv_id":"2112.08802","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":0,"n_instrument":5,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/unirex-a-unified-learning-framework-for#ran","syntology_url":"https://syntology.ai/paper/2112.08802","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.08802"}},"official":{"repos":["facebookresearch/unirex"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/knas-green-neural-architecture-search","slug":"knas-green-neural-architecture-search","title":"KNAS: Green Neural Architecture Search","date":"2021-11-26","arxiv_id":"2111.13293","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":6,"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 6 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; every one of the 6 samples that ran constructed an object rather than computing a result","sample_list":"/paper/knas-green-neural-architecture-search#ran","syntology_url":"https://syntology.ai/paper/2111.13293","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.13293"}},"official":{"repos":["jingjing-nlp/knas"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":6,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/personalized-benchmarking-with-the-ludwig","slug":"personalized-benchmarking-with-the-ludwig","title":"Personalized Benchmarking with the Ludwig Benchmarking Toolkit","date":"2021-11-08","arxiv_id":"2111.04260","repositories_listed":2,"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/personalized-benchmarking-with-the-ludwig#ran","syntology_url":"https://syntology.ai/paper/2111.04260","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.04260"}},"official":{"repos":["ludwig-ai/ludwig"],"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/diversity-enhanced-active-learning-with","slug":"diversity-enhanced-active-learning-with","title":"Diversity Enhanced Active Learning with Strictly Proper Scoring Rules","date":"2021-10-27","arxiv_id":"2110.14171","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/diversity-enhanced-active-learning-with#ran","syntology_url":"https://syntology.ai/paper/2110.14171","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.14171"}},"official":{"repos":["davidtw999/bemps"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-a-unified-view-of-parameter-efficient-1","slug":"towards-a-unified-view-of-parameter-efficient-1","title":"Towards a Unified View of Parameter-Efficient Transfer Learning","date":"2021-10-08","arxiv_id":"2110.04366","repositories_listed":1,"syntology":{"n":11,"n_ran":11,"n_constructed":0,"n_ran_checked":10,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":11,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/towards-a-unified-view-of-parameter-efficient-1#ran","syntology_url":"https://syntology.ai/paper/2110.04366","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.04366"}},"official":{"repos":["jxhe/unify-parameter-efficient-tuning"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/tent-text-classification-based-on-encoding","slug":"tent-text-classification-based-on-encoding","title":"Hierarchical information matters: Text classification via tree based graph neural network","date":"2021-10-05","arxiv_id":"2110.02047","repositories_listed":2,"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/tent-text-classification-based-on-encoding#ran","syntology_url":"https://syntology.ai/paper/2110.02047","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.02047"}},"official":{"repos":["daisean/hint","daisean/tent"],"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/adversarial-mixing-policy-for-relaxing","slug":"adversarial-mixing-policy-for-relaxing","title":"Adversarial Mixing Policy for Relaxing Locally Linear Constraints in Mixup","date":"2021-09-15","arxiv_id":"2109.07177","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":1,"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/adversarial-mixing-policy-for-relaxing#ran","syntology_url":"https://syntology.ai/paper/2109.07177","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.07177"}},"official":{"repos":["pai-smallisallyourneed/mixup-amp"],"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/cartography-active-learning","slug":"cartography-active-learning","title":"Cartography Active Learning","date":"2021-09-09","arxiv_id":"2109.04282","repositories_listed":2,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/cartography-active-learning#ran","syntology_url":"https://syntology.ai/paper/2109.04282","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.04282"}},"official":{"repos":["Kaleidophon/deep-significance","jjzha/cal"],"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/crypten-secure-multi-party-computation-meets","slug":"crypten-secure-multi-party-computation-meets","title":"CrypTen: Secure Multi-Party Computation Meets Machine Learning","date":"2021-09-02","arxiv_id":"2109.00984","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":7,"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) · 3 unverified","sample_list":"/paper/crypten-secure-multi-party-computation-meets#ran","syntology_url":"https://syntology.ai/paper/2109.00984","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.00984"}},"official":null}},{"url":"/paper/aeda-an-easier-data-augmentation-technique","slug":"aeda-an-easier-data-augmentation-technique","title":"AEDA: An Easier Data Augmentation Technique for Text Classification","date":"2021-08-30","arxiv_id":"2108.13230","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":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/aeda-an-easier-data-augmentation-technique#ran","syntology_url":"https://syntology.ai/paper/2108.13230","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.13230"}},"official":{"repos":["akkarimi/aeda_nlp"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/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/spear-semi-supervised-data-programming-in","slug":"spear-semi-supervised-data-programming-in","title":"SPEAR : Semi-supervised Data Programming in Python","date":"2021-08-01","arxiv_id":"2108.00373","repositories_listed":1,"syntology":{"n":15,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":9,"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) · 9 unverified","sample_list":"/paper/spear-semi-supervised-data-programming-in#ran","syntology_url":"https://syntology.ai/paper/2108.00373","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.00373"}},"official":{"repos":["decile-team/spear"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":9,"ran_from_kinds":["official"]}}},{"url":"/paper/meta-learning-adversarial-domain-adaptation","slug":"meta-learning-adversarial-domain-adaptation","title":"Meta-Learning Adversarial Domain Adaptation Network for Few-Shot Text Classification","date":"2021-07-26","arxiv_id":"2107.12262","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"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 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) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/meta-learning-adversarial-domain-adaptation#ran","syntology_url":"https://syntology.ai/paper/2107.12262","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.12262"}},"official":{"repos":["hccngu/MLADA"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/uncertainty-based-query-strategies-for-active","slug":"uncertainty-based-query-strategies-for-active","title":"Revisiting Uncertainty-based Query Strategies for Active Learning with Transformers","date":"2021-07-12","arxiv_id":"2107.05687","repositories_listed":2,"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/uncertainty-based-query-strategies-for-active#ran","syntology_url":"https://syntology.ai/paper/2107.05687","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.05687"}},"official":{"repos":["webis-de/acl22-revisiting-uncertainty-based-query-strategies-for-active-learning-with-transformers"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/quantifying-explainability-in-nlp-and","slug":"quantifying-explainability-in-nlp-and","title":"Quantifying Explainability in NLP and Analyzing Algorithms for Performance-Explainability Tradeoff","date":"2021-07-12","arxiv_id":"2107.05693","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"4 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; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/quantifying-explainability-in-nlp-and#ran","syntology_url":"https://syntology.ai/paper/2107.05693","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.05693"}},"official":{"repos":["mnaylor5/quantifying-explainability"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-from-multiple-noisy-partial-labelers","slug":"learning-from-multiple-noisy-partial-labelers","title":"Learning from Multiple Noisy Partial Labelers","date":"2021-06-08","arxiv_id":"2106.04530","repositories_listed":2,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":1,"n_instrument":6,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 6 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-from-multiple-noisy-partial-labelers#ran","syntology_url":"https://syntology.ai/paper/2106.04530","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.04530"}},"official":{"repos":["batsresearch/nplm"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/more-identifiable-yet-equally-performant","slug":"more-identifiable-yet-equally-performant","title":"More Identifiable yet Equally Performant Transformers for Text Classification","date":"2021-06-02","arxiv_id":"2106.01269","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/more-identifiable-yet-equally-performant#ran","syntology_url":"https://syntology.ai/paper/2106.01269","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.01269"}},"official":{"repos":["declare-lab/identifiable-transformers"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/distribution-matching-for-rationalization","slug":"distribution-matching-for-rationalization","title":"Distribution Matching for Rationalization","date":"2021-06-01","arxiv_id":"2106.00320","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":1,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 ran (of which 1 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) · 2 unverified","sample_list":"/paper/distribution-matching-for-rationalization#ran","syntology_url":"https://syntology.ai/paper/2106.00320","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.00320"}},"official":{"repos":["kochsnow/distribution-matching-rationality"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/search-methods-for-sufficient-socially","slug":"search-methods-for-sufficient-socially","title":"The Out-of-Distribution Problem in Explainability and Search Methods for Feature Importance Explanations","date":"2021-06-01","arxiv_id":"2106.00786","repositories_listed":1,"syntology":{"n":4,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/search-methods-for-sufficient-socially#ran","syntology_url":"https://syntology.ai/paper/2106.00786","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.00786"}},"official":{"repos":["peterbhase/ExplanationSearch"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/predict-then-interpolate-a-simple-algorithm","slug":"predict-then-interpolate-a-simple-algorithm","title":"Predict then Interpolate: A Simple Algorithm to Learn Stable Classifiers","date":"2021-05-26","arxiv_id":"2105.12628","repositories_listed":1,"syntology":{"n":14,"n_ran":7,"n_constructed":0,"n_ran_checked":4,"n_instrument":3,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 3 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/predict-then-interpolate-a-simple-algorithm#ran","syntology_url":"https://syntology.ai/paper/2105.12628","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.12628"}},"official":{"repos":["YujiaBao/Predict-then-Interpolate"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/ptr-prompt-tuning-with-rules-for-text","slug":"ptr-prompt-tuning-with-rules-for-text","title":"PTR: Prompt Tuning with Rules for Text Classification","date":"2021-05-24","arxiv_id":"2105.11259","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/ptr-prompt-tuning-with-rules-for-text#ran","syntology_url":"https://syntology.ai/paper/2105.11259","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.11259"}},"official":{"repos":["thunlp/PTR"],"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/drill-dynamic-representations-for-imbalanced","slug":"drill-dynamic-representations-for-imbalanced","title":"DRILL: Dynamic Representations for Imbalanced Lifelong Learning","date":"2021-05-18","arxiv_id":"2105.08445","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/drill-dynamic-representations-for-imbalanced#ran","syntology_url":"https://syntology.ai/paper/2105.08445","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.08445"}},"official":{"repos":["knowledgetechnologyuhh/drill"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/improving-the-faithfulness-of-attention-based","slug":"improving-the-faithfulness-of-attention-based","title":"Improving the Faithfulness of Attention-based Explanations with Task-specific Information for Text Classification","date":"2021-05-06","arxiv_id":"2105.02657","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/improving-the-faithfulness-of-attention-based#ran","syntology_url":"https://syntology.ai/paper/2105.02657","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.02657"}},"official":null}},{"url":"/paper/fantastically-ordered-prompts-and-where-to","slug":"fantastically-ordered-prompts-and-where-to","title":"Fantastically Ordered Prompts and Where to Find Them: Overcoming Few-Shot Prompt Order Sensitivity","date":"2021-04-18","arxiv_id":"2104.08786","repositories_listed":2,"syntology":{"n":10,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":7,"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) · 7 unverified","sample_list":"/paper/fantastically-ordered-prompts-and-where-to#ran","syntology_url":"https://syntology.ai/paper/2104.08786","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.08786"}},"official":null}},{"url":"/paper/data-distillation-for-text-classification","slug":"data-distillation-for-text-classification","title":"Data Distillation for Text Classification","date":"2021-04-17","arxiv_id":"2104.08448","repositories_listed":2,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/data-distillation-for-text-classification#ran","syntology_url":"https://syntology.ai/paper/2104.08448","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.08448"}},"official":{"repos":["liyongqi67/Data-Distillation-for-Text-Classification"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/attacking-text-classifiers-via-sentence","slug":"attacking-text-classifiers-via-sentence","title":"R&R: Metric-guided Adversarial Sentence Generation","date":"2021-04-17","arxiv_id":"2104.08453","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/attacking-text-classifiers-via-sentence#ran","syntology_url":"https://syntology.ai/paper/2104.08453","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.08453"}},"official":{"repos":["DAI-Lab/fibber"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/continual-learning-for-text-classification","slug":"continual-learning-for-text-classification","title":"Continual Learning for Text Classification with Information Disentanglement Based Regularization","date":"2021-04-12","arxiv_id":"2104.05489","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/continual-learning-for-text-classification#ran","syntology_url":"https://syntology.ai/paper/2104.05489","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.05489"}},"official":{"repos":["GT-SALT/IDBR"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/self-training-with-weak-supervision","slug":"self-training-with-weak-supervision","title":"Self-Training with Weak Supervision","date":"2021-04-12","arxiv_id":"2104.05514","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":1,"n_ran_checked":1,"n_instrument":4,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"5 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 4 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/self-training-with-weak-supervision#ran","syntology_url":"https://syntology.ai/paper/2104.05514","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.05514"}},"official":{"repos":["microsoft/ASTRA"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/refining-neural-networks-with-compositional","slug":"refining-neural-networks-with-compositional","title":"Refining Language Models with Compositional Explanations","date":"2021-03-18","arxiv_id":"2103.10415","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":1,"n_ran_checked":1,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/refining-neural-networks-with-compositional#ran","syntology_url":"https://syntology.ai/paper/2103.10415","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.10415"}},"official":{"repos":["INK-USC/expl-refinement"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/few-shot-text-classification-with-triplet","slug":"few-shot-text-classification-with-triplet","title":"Few-Shot Text Classification with Triplet Networks, Data Augmentation, and Curriculum Learning","date":"2021-03-12","arxiv_id":"2103.07552","repositories_listed":1,"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/few-shot-text-classification-with-triplet#ran","syntology_url":"https://syntology.ai/paper/2103.07552","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.07552"}},"official":{"repos":["jasonwei20/triplet-loss"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/privacy-preserving-graph-convolutional","slug":"privacy-preserving-graph-convolutional","title":"Privacy-Preserving Graph Convolutional Networks for Text Classification","date":"2021-02-10","arxiv_id":"2102.09604","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":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/privacy-preserving-graph-convolutional#ran","syntology_url":"https://syntology.ai/paper/2102.09604","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.09604"}},"official":{"repos":["trusthlt/privacy-preserving-gcn"],"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/challenges-in-automated-debiasing-for-toxic","slug":"challenges-in-automated-debiasing-for-toxic","title":"Challenges in Automated Debiasing for Toxic Language Detection","date":"2021-01-29","arxiv_id":"2102.00086","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":1,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/challenges-in-automated-debiasing-for-toxic#ran","syntology_url":"https://syntology.ai/paper/2102.00086","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.00086"}},"official":{"repos":["XuhuiZhou/Toxic_Debias"],"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/towards-robustness-to-label-noise-in-text","slug":"towards-robustness-to-label-noise-in-text","title":"Towards Robustness to Label Noise in Text Classification via Noise Modeling","date":"2021-01-27","arxiv_id":"2101.11214","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":2,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 2 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/towards-robustness-to-label-noise-in-text#ran","syntology_url":"https://syntology.ai/paper/2101.11214","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2101.11214"}},"official":{"repos":["thumbe3/label-noise-nlp"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/does-head-label-help-for-long-tailed-multi","slug":"does-head-label-help-for-long-tailed-multi","title":"Does Head Label Help for Long-Tailed Multi-Label Text Classification","date":"2021-01-24","arxiv_id":"2101.09704","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":4,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":4,"phrase":"4 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/does-head-label-help-for-long-tailed-multi#ran","syntology_url":"https://syntology.ai/paper/2101.09704","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2101.09704"}},"official":{"repos":["xiaolin1207/HTTN-master"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/generating-natural-language-attacks-in-a-hard","slug":"generating-natural-language-attacks-in-a-hard","title":"Generating Natural Language Attacks in a Hard Label Black Box Setting","date":"2020-12-29","arxiv_id":"2012.14956","repositories_listed":3,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":1,"n_instrument":5,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":6,"phrase":"6 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; 5 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/generating-natural-language-attacks-in-a-hard#ran","syntology_url":"https://syntology.ai/paper/2012.14956","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.14956"}},"official":{"repos":["RishabhMaheshwary/hard-label-attack"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/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/be-more-with-less-hypergraph-attention","slug":"be-more-with-less-hypergraph-attention","title":"Be More with Less: Hypergraph Attention Networks for Inductive Text Classification","date":"2020-11-01","arxiv_id":"2011.00387","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/be-more-with-less-hypergraph-attention#ran","syntology_url":"https://syntology.ai/paper/2011.00387","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.00387"}},"official":{"repos":["kaize0409/HyperGAT"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/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/transfer2attack-text-adversarial-attack-with","slug":"transfer2attack-text-adversarial-attack-with","title":"Explain2Attack: Text Adversarial Attacks via Cross-Domain Interpretability","date":"2020-10-14","arxiv_id":"2010.06812","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/transfer2attack-text-adversarial-attack-with#ran","syntology_url":"https://syntology.ai/paper/2010.06812","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.06812"}},"official":{"repos":["mahossam/Explain2Attack"],"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/length-adaptive-transformer-train-once-with-1","slug":"length-adaptive-transformer-train-once-with-1","title":"Length-Adaptive Transformer: Train Once with Length Drop, Use Anytime with Search","date":"2020-10-14","arxiv_id":"2010.07003","repositories_listed":1,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":2,"phrase":"9 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/length-adaptive-transformer-train-once-with-1#ran","syntology_url":"https://syntology.ai/paper/2010.07003","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.07003"}},"official":{"repos":["clovaai/length-adaptive-transformer"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/poison-attacks-against-text-datasets-with","slug":"poison-attacks-against-text-datasets-with","title":"Poison Attacks against Text Datasets with Conditional Adversarially Regularized Autoencoder","date":"2020-10-06","arxiv_id":"2010.02684","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/poison-attacks-against-text-datasets-with#ran","syntology_url":"https://syntology.ai/paper/2010.02684","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.02684"}},"official":{"repos":["alvinchangw/CARA_EMNLP2020"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/lifelong-language-knowledge-distillation","slug":"lifelong-language-knowledge-distillation","title":"Lifelong Language Knowledge Distillation","date":"2020-10-05","arxiv_id":"2010.02123","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/lifelong-language-knowledge-distillation#ran","syntology_url":"https://syntology.ai/paper/2010.02123","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.02123"}},"official":{"repos":["voidism/L2KD"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/an-empirical-study-on-large-scale-multi-label","slug":"an-empirical-study-on-large-scale-multi-label","title":"An Empirical Study on Large-Scale Multi-Label Text Classification Including Few and Zero-Shot Labels","date":"2020-10-04","arxiv_id":"2010.01653","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":1,"n_honours":0,"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; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/an-empirical-study-on-large-scale-multi-label#ran","syntology_url":"https://syntology.ai/paper/2010.01653","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.01653"}},"official":{"repos":["iliaschalkidis/lmtc-eurlex57k"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-variational-word-masks-to-improve","slug":"learning-variational-word-masks-to-improve","title":"Learning Variational Word Masks to Improve the Interpretability of Neural Text Classifiers","date":"2020-10-01","arxiv_id":"2010.00667","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/learning-variational-word-masks-to-improve#ran","syntology_url":"https://syntology.ai/paper/2010.00667","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.00667"}},"official":{"repos":["UVa-NLP/VMASK"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/inltk-natural-language-toolkit-for-indic","slug":"inltk-natural-language-toolkit-for-indic","title":"iNLTK: Natural Language Toolkit for Indic Languages","date":"2020-09-26","arxiv_id":"2009.12534","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/inltk-natural-language-toolkit-for-indic#ran","syntology_url":"https://syntology.ai/paper/2009.12534","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.12534"}},"official":{"repos":["goru001/inltk"],"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/rank-over-class-the-untapped-potential-of","slug":"rank-over-class-the-untapped-potential-of","title":"Rank over Class: The Untapped Potential of Ranking in Natural Language Processing","date":"2020-09-10","arxiv_id":"2009.05160","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/rank-over-class-the-untapped-potential-of#ran","syntology_url":"https://syntology.ai/paper/2009.05160","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.05160"}},"official":{"repos":["atapour/rank-over-class"],"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/data-programming-using-semi-supervision-and","slug":"data-programming-using-semi-supervision-and","title":"Semi-Supervised Data Programming with Subset Selection","date":"2020-08-22","arxiv_id":"2008.09887","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/data-programming-using-semi-supervision-and#ran","syntology_url":"https://syntology.ai/paper/2008.09887","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.09887"}},"official":{"repos":["ayushbits/Semi-Supervised-LFs-Subset-Selection"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/blacklight-defending-black-box-adversarial","slug":"blacklight-defending-black-box-adversarial","title":"Blacklight: Scalable Defense for Neural Networks against Query-Based Black-Box Attacks","date":"2020-06-24","arxiv_id":"2006.14042","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/blacklight-defending-black-box-adversarial#ran","syntology_url":"https://syntology.ai/paper/2006.14042","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.14042"}},"official":{"repos":["huiying-li/blacklight"],"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/aradic-arabic-document-classification-using-1","slug":"aradic-arabic-document-classification-using-1","title":"AraDIC: Arabic Document Classification using Image-Based Character Embeddings and Class-Balanced Loss","date":"2020-06-20","arxiv_id":"2006.11586","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/aradic-arabic-document-classification-using-1#ran","syntology_url":"https://syntology.ai/paper/2006.11586","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.11586"}},"official":{"repos":["mahmouddaif/AraDIC"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/sparse-and-continuous-attention-mechanisms","slug":"sparse-and-continuous-attention-mechanisms","title":"Sparse and Continuous Attention Mechanisms","date":"2020-06-12","arxiv_id":"2006.07214","repositories_listed":2,"syntology":{"n":15,"n_ran":12,"n_constructed":9,"n_ran_checked":9,"n_instrument":3,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":2,"phrase":"12 ran (of which 9 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/sparse-and-continuous-attention-mechanisms#ran","syntology_url":"https://syntology.ai/paper/2006.07214","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.07214"}},"official":{"repos":["deep-spin/mcan-vqa-continuous-attention"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["listed"]}}},{"url":"/paper/safer-a-structure-free-approach-for-certified","slug":"safer-a-structure-free-approach-for-certified","title":"SAFER: A Structure-free Approach for Certified Robustness to Adversarial Word Substitutions","date":"2020-05-29","arxiv_id":"2005.14424","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/safer-a-structure-free-approach-for-certified#ran","syntology_url":"https://syntology.ai/paper/2005.14424","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.14424"}},"official":{"repos":["lushleaf/Structure-free-certified-NLP"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/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/on-the-generalization-effects-of-linear","slug":"on-the-generalization-effects-of-linear","title":"On the Generalization Effects of Linear Transformations in Data Augmentation","date":"2020-05-02","arxiv_id":"2005.00695","repositories_listed":2,"syntology":{"n":9,"n_ran":6,"n_constructed":1,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"6 ran (of which 1 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/on-the-generalization-effects-of-linear#ran","syntology_url":"https://syntology.ai/paper/2005.00695","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.00695"}},"official":{"repos":["SenWu/dauphin"],"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":["listed","official"]}}},{"url":"/paper/exploring-and-predicting-transferability","slug":"exploring-and-predicting-transferability","title":"Exploring and Predicting Transferability across NLP Tasks","date":"2020-05-02","arxiv_id":"2005.00770","repositories_listed":1,"syntology":{"n":10,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":4,"n_honours":2,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 2 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/exploring-and-predicting-transferability#ran","syntology_url":"https://syntology.ai/paper/2005.00770","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.00770"}},"official":{"repos":["tuvuumass/task-transferability"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/universal-adversarial-attacks-with-natural","slug":"universal-adversarial-attacks-with-natural","title":"Universal Adversarial Attacks with Natural Triggers for Text Classification","date":"2020-05-01","arxiv_id":"2005.00174","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/universal-adversarial-attacks-with-natural#ran","syntology_url":"https://syntology.ai/paper/2005.00174","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.00174"}},"official":{"repos":["Hsuan-Tung/universal_attack_natural_trigger"],"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/learning-to-faithfully-rationalize-by","slug":"learning-to-faithfully-rationalize-by","title":"Learning to Faithfully Rationalize by Construction","date":"2020-04-30","arxiv_id":"2005.00115","repositories_listed":2,"syntology":{"n":14,"n_ran":12,"n_constructed":0,"n_ran_checked":8,"n_instrument":4,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":1,"phrase":"12 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; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/learning-to-faithfully-rationalize-by#ran","syntology_url":"https://syntology.ai/paper/2005.00115","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.00115"}},"official":{"repos":["successar/FRESH"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-prediction-explainability-through","slug":"towards-prediction-explainability-through","title":"The Explanation Game: Towards Prediction Explainability through Sparse Communication","date":"2020-04-28","arxiv_id":"2004.13876","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/towards-prediction-explainability-through#ran","syntology_url":"https://syntology.ai/paper/2004.13876","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.13876"}},"official":{"repos":["deep-spin/spec"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/a-batch-normalized-inference-network-keeps","slug":"a-batch-normalized-inference-network-keeps","title":"A Batch Normalized Inference Network Keeps the KL Vanishing Away","date":"2020-04-27","arxiv_id":"2004.12585","repositories_listed":1,"syntology":{"n":11,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":6,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":2,"phrase":"5 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; 1 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/a-batch-normalized-inference-network-keeps#ran","syntology_url":"https://syntology.ai/paper/2004.12585","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.12585"}},"official":{"repos":["valdersoul/bn-vae"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/every-document-owns-its-structure-inductive","slug":"every-document-owns-its-structure-inductive","title":"Every Document Owns Its Structure: Inductive Text Classification via Graph Neural Networks","date":"2020-04-22","arxiv_id":"2004.13826","repositories_listed":1,"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":3,"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/every-document-owns-its-structure-inductive#ran","syntology_url":"https://syntology.ai/paper/2004.13826","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.13826"}},"official":null}},{"url":"/paper/the-right-tool-for-the-job-matching-model-and","slug":"the-right-tool-for-the-job-matching-model-and","title":"The Right Tool for the Job: Matching Model and Instance Complexities","date":"2020-04-16","arxiv_id":"2004.07453","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":2,"n_instrument":3,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/the-right-tool-for-the-job-matching-model-and#ran","syntology_url":"https://syntology.ai/paper/2004.07453","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.07453"}},"official":{"repos":["allenai/sledgehammer"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/vgcn-bert-augmenting-bert-with-graph","slug":"vgcn-bert-augmenting-bert-with-graph","title":"VGCN-BERT: Augmenting BERT with Graph Embedding for Text Classification","date":"2020-04-12","arxiv_id":"2004.05707","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":2,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/vgcn-bert-augmenting-bert-with-graph#ran","syntology_url":"https://syntology.ai/paper/2004.05707","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.05707"}},"official":{"repos":["Louis-udm/VGCN-BERT"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/improving-bert-fine-tuning-via-self-ensemble","slug":"improving-bert-fine-tuning-via-self-ensemble","title":"Improving BERT Fine-Tuning via Self-Ensemble and Self-Distillation","date":"2020-02-24","arxiv_id":"2002.10345","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/improving-bert-fine-tuning-via-self-ensemble#ran","syntology_url":"https://syntology.ai/paper/2002.10345","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.10345"}},"official":null}},{"url":"/paper/active-bayesian-assessment-for-black-box","slug":"active-bayesian-assessment-for-black-box","title":"Active Bayesian Assessment for Black-Box Classifiers","date":"2020-02-16","arxiv_id":"2002.06532","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/active-bayesian-assessment-for-black-box#ran","syntology_url":"https://syntology.ai/paper/2002.06532","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.06532"}},"official":{"repos":["disiji/bayesian-blackbox"],"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/tensor-graph-convolutional-networks-for-text","slug":"tensor-graph-convolutional-networks-for-text","title":"Tensor Graph Convolutional Networks for Text Classification","date":"2020-01-12","arxiv_id":"2001.05313","repositories_listed":2,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/tensor-graph-convolutional-networks-for-text#ran","syntology_url":"https://syntology.ai/paper/2001.05313","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.05313"}},"official":{"repos":["xienliu/tensor-gcn-text-classification-tensorflow"],"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/stacked-debert-all-attention-in-incomplete","slug":"stacked-debert-all-attention-in-incomplete","title":"Stacked DeBERT: All Attention in Incomplete Data for Text Classification","date":"2020-01-01","arxiv_id":"2001.00137","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":1,"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/stacked-debert-all-attention-in-incomplete#ran","syntology_url":"https://syntology.ai/paper/2001.00137","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.00137"}},"official":{"repos":["gcunhase/StackedDeBERT"],"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","unlocated"]}}},{"url":"/paper/less-is-better-unweighted-data-subsampling","slug":"less-is-better-unweighted-data-subsampling","title":"Less Is Better: Unweighted Data Subsampling via Influence Function","date":"2019-12-03","arxiv_id":"1912.01321","repositories_listed":1,"syntology":{"n":14,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/less-is-better-unweighted-data-subsampling#ran","syntology_url":"https://syntology.ai/paper/1912.01321","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.01321"}},"official":{"repos":["RyanWangZf/Influence_Subsampling"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/bp-transformer-modelling-long-range-context","slug":"bp-transformer-modelling-long-range-context","title":"BP-Transformer: Modelling Long-Range Context via Binary Partitioning","date":"2019-11-11","arxiv_id":"1911.04070","repositories_listed":2,"syntology":{"n":7,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/bp-transformer-modelling-long-range-context#ran","syntology_url":"https://syntology.ai/paper/1911.04070","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.04070"}},"official":{"repos":["yzh119/BPT"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/meta-label-correction-for-learning-with-weak-1","slug":"meta-label-correction-for-learning-with-weak-1","title":"Meta Label Correction for Noisy Label Learning","date":"2019-11-10","arxiv_id":"1911.03809","repositories_listed":1,"syntology":{"n":11,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/meta-label-correction-for-learning-with-weak-1#ran","syntology_url":"https://syntology.ai/paper/1911.03809","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.03809"}},"official":{"repos":["microsoft/mlc"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/text-level-graph-neural-network-for-text","slug":"text-level-graph-neural-network-for-text","title":"Text Level Graph Neural Network for Text Classification","date":"2019-10-06","arxiv_id":"1910.02356","repositories_listed":2,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/text-level-graph-neural-network-for-text#ran","syntology_url":"https://syntology.ai/paper/1910.02356","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.02356"}},"official":{"repos":["mojave-pku/TextLevelGCN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/sampling-bias-in-deep-active-classification","slug":"sampling-bias-in-deep-active-classification","title":"Sampling Bias in Deep Active Classification: An Empirical Study","date":"2019-09-20","arxiv_id":"1909.09389","repositories_listed":2,"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/sampling-bias-in-deep-active-classification#ran","syntology_url":"https://syntology.ai/paper/1909.09389","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.09389"}},"official":{"repos":["drimpossible/Sampling-Bias-Active-Learning","Xtra-Computing/thundersvm"],"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/achieving-verified-robustness-to-symbol","slug":"achieving-verified-robustness-to-symbol","title":"Achieving Verified Robustness to Symbol Substitutions via Interval Bound Propagation","date":"2019-09-03","arxiv_id":"1909.01492","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/achieving-verified-robustness-to-symbol#ran","syntology_url":"https://syntology.ai/paper/1909.01492","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.01492"}},"official":{"repos":["deepmind/interval-bound-propagation"],"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/out-of-domain-detection-for-low-resource-text","slug":"out-of-domain-detection-for-low-resource-text","title":"Out-of-Domain Detection for Low-Resource Text Classification Tasks","date":"2019-08-31","arxiv_id":"1909.05357","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/out-of-domain-detection-for-low-resource-text#ran","syntology_url":"https://syntology.ai/paper/1909.05357","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.05357"}},"official":{"repos":["SLAD-ml/few-shot-ood"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/human-grounded-evaluations-of-explanation","slug":"human-grounded-evaluations-of-explanation","title":"Human-grounded Evaluations of Explanation Methods for Text Classification","date":"2019-08-29","arxiv_id":"1908.11355","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/human-grounded-evaluations-of-explanation#ran","syntology_url":"https://syntology.ai/paper/1908.11355","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.11355"}},"official":{"repos":["plkumjorn/CNNAnalysis"],"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/few-shot-text-classification-with","slug":"few-shot-text-classification-with","title":"Few-shot Text Classification with Distributional Signatures","date":"2019-08-16","arxiv_id":"1908.06039","repositories_listed":2,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/few-shot-text-classification-with#ran","syntology_url":"https://syntology.ai/paper/1908.06039","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.06039"}},"official":{"repos":["YujiaBao/Distributional-Signatures"],"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/graph-star-net-for-generalized-multi-task-1","slug":"graph-star-net-for-generalized-multi-task-1","title":"Graph Star Net for Generalized Multi-Task Learning","date":"2019-06-21","arxiv_id":"1906.12330","repositories_listed":1,"syntology":{"n":6,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/graph-star-net-for-generalized-multi-task-1#ran","syntology_url":"https://syntology.ai/paper/1906.12330","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.12330"}},"official":null}},{"url":"/paper/is-attention-interpretable","slug":"is-attention-interpretable","title":"Is Attention Interpretable?","date":"2019-06-09","arxiv_id":"1906.03731","repositories_listed":1,"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":4,"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/is-attention-interpretable#ran","syntology_url":"https://syntology.ai/paper/1906.03731","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.03731"}},"official":{"repos":["serrano-s/attn-tests"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/episodic-memory-in-lifelong-language-learning","slug":"episodic-memory-in-lifelong-language-learning","title":"Episodic Memory in Lifelong Language Learning","date":"2019-06-03","arxiv_id":"1906.01076","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":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/episodic-memory-in-lifelong-language-learning#ran","syntology_url":"https://syntology.ai/paper/1906.01076","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.01076"}},"official":null}},{"url":"/paper/text-classification-algorithms-a-survey","slug":"text-classification-algorithms-a-survey","title":"Text Classification Algorithms: A Survey","date":"2019-04-17","arxiv_id":"1904.08067","repositories_listed":2,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/text-classification-algorithms-a-survey#ran","syntology_url":"https://syntology.ai/paper/1904.08067","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.08067"}},"official":{"repos":["kk7nc/Text_Classification"],"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/integrating-semantic-knowledge-to-tackle-zero","slug":"integrating-semantic-knowledge-to-tackle-zero","title":"Integrating Semantic Knowledge to Tackle Zero-shot Text Classification","date":"2019-03-29","arxiv_id":"1903.12626","repositories_listed":2,"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/integrating-semantic-knowledge-to-tackle-zero#ran","syntology_url":"https://syntology.ai/paper/1903.12626","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.12626"}},"official":{"repos":["JingqingZ/KG4ZeroShotText"],"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/how-large-a-vocabulary-does-text","slug":"how-large-a-vocabulary-does-text","title":"How Large a Vocabulary Does Text Classification Need? A Variational Approach to Vocabulary Selection","date":"2019-02-27","arxiv_id":"1902.10339","repositories_listed":1,"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/how-large-a-vocabulary-does-text#ran","syntology_url":"https://syntology.ai/paper/1902.10339","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.10339"}},"official":{"repos":["wenhuchen/Variational-Vocabulary-Selection"],"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/glyce-glyph-vectors-for-chinese-character","slug":"glyce-glyph-vectors-for-chinese-character","title":"Glyce: Glyph-vectors for Chinese Character Representations","date":"2019-01-29","arxiv_id":"1901.10125","repositories_listed":2,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 2 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/glyce-glyph-vectors-for-chinese-character#ran","syntology_url":"https://syntology.ai/paper/1901.10125","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.10125"}},"official":{"repos":["ShannonAI/glyce"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/weakly-supervised-hierarchical-text","slug":"weakly-supervised-hierarchical-text","title":"Weakly-Supervised Hierarchical Text Classification","date":"2018-12-29","arxiv_id":"1812.11270","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/weakly-supervised-hierarchical-text#ran","syntology_url":"https://syntology.ai/paper/1812.11270","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.11270"}},"official":{"repos":["yumeng5/WeSHClass"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/discrete-attacks-and-submodular-optimization","slug":"discrete-attacks-and-submodular-optimization","title":"Discrete Adversarial Attacks and Submodular Optimization with Applications to Text Classification","date":"2018-12-01","arxiv_id":"1812.00151","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/discrete-attacks-and-submodular-optimization#ran","syntology_url":"https://syntology.ai/paper/1812.00151","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.00151"}},"official":{"repos":["cecilialeiqi/adversarial_text"],"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/explicit-interaction-model-towards-text","slug":"explicit-interaction-model-towards-text","title":"Explicit Interaction Model towards Text Classification","date":"2018-11-23","arxiv_id":"1811.09386","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/explicit-interaction-model-towards-text#ran","syntology_url":"https://syntology.ai/paper/1811.09386","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.09386"}},"official":{"repos":["NonvolatileMemory/AAAI_2019_EXAM"],"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/evolutionary-data-measures-understanding-the","slug":"evolutionary-data-measures-understanding-the","title":"Evolutionary Data Measures: Understanding the Difficulty of Text Classification Tasks","date":"2018-11-05","arxiv_id":"1811.01910","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":3,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/evolutionary-data-measures-understanding-the#ran","syntology_url":"https://syntology.ai/paper/1811.01910","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.01910"}},"official":{"repos":["Wluper/edm"],"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/unsupervised-cross-lingual-transfer-of-word","slug":"unsupervised-cross-lingual-transfer-of-word","title":"Unsupervised Cross-lingual Transfer of Word Embedding Spaces","date":"2018-09-10","arxiv_id":"1809.03633","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/unsupervised-cross-lingual-transfer-of-word#ran","syntology_url":"https://syntology.ai/paper/1809.03633","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.03633"}},"official":{"repos":["xrc10/unsup-cross-lingual-embedding-transfer"],"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/rational-recurrences","slug":"rational-recurrences","title":"Rational Recurrences","date":"2018-08-28","arxiv_id":"1808.09357","repositories_listed":1,"syntology":{"n":13,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":5,"n_honours":1,"n_violates":1,"n_no_contract":6,"n_pointer_only":1,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 1 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/rational-recurrences#ran","syntology_url":"https://syntology.ai/paper/1808.09357","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.09357"}},"official":{"repos":["Noahs-ARK/rational-recurrences"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/diverse-few-shot-text-classification-with","slug":"diverse-few-shot-text-classification-with","title":"Diverse Few-Shot Text Classification with Multiple Metrics","date":"2018-05-19","arxiv_id":"1805.07513","repositories_listed":2,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":1,"n_instrument":4,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"5 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; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/diverse-few-shot-text-classification-with#ran","syntology_url":"https://syntology.ai/paper/1805.07513","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.07513"}},"official":{"repos":["Gorov/DiverseFewShot_Amazon"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}}],"record_sha256":"3d10a5590da438309786ae7043314628a4855b0fdc91e53bb79f05623d5b2694","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}