{"url":"/sota/natural-language-inference-on-multinli","task":{"name":"Natural Language Inference","url":"/task/natural-language-inference","note":null},"dataset":{"name":"MultiNLI","url":"/dataset/multinli"},"category":"Natural Language Processing","categories":["Natural Language Processing","Reasoning"],"category_note":null,"description":"**Natural language inference (NLI)** is the task of determining whether a \"hypothesis\" is \r\ntrue (entailment), false (contradiction), or undetermined (neutral) given a \"premise\".\r\n\r\nExample:\r\n\r\n| Premise | Label | Hypothesis |\r\n| --- | ---| --- |\r\n| A man inspects the uniform of a figure in some East Asian country. | contradiction | The man is sleeping. |\r\n| An older and younger man smiling. | neutral  | Two men are smiling and laughing at the cats playing on the floor. |\r\n| A soccer game with multiple males playing. | entailment | Some men are playing a sport. |\r\n\r\nApproaches used for NLI include earlier symbolic and statistical approaches to more recent deep learning approaches. Benchmark datasets used for NLI include [SNLI](/dataset/snli), [MultiNLI](/dataset/multinli), [SciTail](/dataset/scitail), among others. You can get hands-on practice on the SNLI task by following this [d2l.ai chapter](https://d2l.ai/chapter_natural-language-processing-applications/natural-language-inference-and-dataset.html).\r\n\r\nFurther readings:\r\n\r\n- [Recent Advances in Natural Language Inference: A Survey of Benchmarks, Resources, and Approaches](https://arxiv.org/abs/1904.01172)","description_from":"task","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","rank":"the archive's row order at snapshot; not re-ranked","rows_end_at":"2025-07-28","rows_withheld_as_spam":0,"metric_values":"the archive's strings, untouched"},"metrics":["Matched","Mismatched","Accuracy","Dev Matched","Dev Mismatched"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"Matched":null,"Mismatched":null,"Accuracy":"higher","Dev Matched":null,"Dev Mismatched":null}},"counts":{"rows":67,"rows_with_code":56,"rows_with_paper_page":65,"rows_dated":65,"rows_using_additional_data":2},"rows":[{"rank_in_archive_order":1,"model":"Turing NLR v5 XXL 5.4B (fine-tuned)","metrics":{"Matched":"92.6","Mismatched":"92.4"},"uses_additional_data":false,"paper_date":null,"paper":null,"paper_url":null,"paper_title":"","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":2,"model":"UnitedSynT5 (3B)","metrics":{"Matched":"92.6"},"uses_additional_data":true,"paper_date":"2024-12-12","paper":"/paper/first-train-to-generate-then-generate-to","paper_url":"https://arxiv.org/abs/2412.09263v2","paper_title":"First Train to Generate, then Generate to Train: UnitedSynT5 for Few-Shot NLI","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":3,"model":"T5","metrics":{"Matched":"92.0","Mismatched":"91.7"},"uses_additional_data":false,"paper_date":"2019-11-08","paper":"/paper/smart-robust-and-efficient-fine-tuning-for","paper_url":"https://arxiv.org/abs/1911.03437v5","paper_title":"SMART: Robust and Efficient Fine-Tuning for Pre-trained Natural Language Models through Principled Regularized Optimization","code":"https://github.com/namisan/mt-dnn","n_code_links":6,"syntology":{"n_ran":8,"n_unverified":0,"n_samples":8,"n_pointer_only_licence":1}},{"rank_in_archive_order":4,"model":"T5-XXL 11B (fine-tuned)","metrics":{"Matched":"92.0"},"uses_additional_data":false,"paper_date":"2019-10-23","paper":"/paper/exploring-the-limits-of-transfer-learning","paper_url":"https://arxiv.org/abs/1910.10683v4","paper_title":"Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer","code":"https://github.com/huggingface/transformers","n_code_links":57,"syntology":{"n_ran":21,"n_unverified":10,"n_samples":31,"n_pointer_only_licence":0}},{"rank_in_archive_order":5,"model":"T5-3B","metrics":{"Matched":"91.4","Mismatched":"91.2"},"uses_additional_data":false,"paper_date":"2019-10-23","paper":"/paper/exploring-the-limits-of-transfer-learning","paper_url":"https://arxiv.org/abs/1910.10683v4","paper_title":"Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer","code":"https://github.com/huggingface/transformers","n_code_links":57,"syntology":{"n_ran":21,"n_unverified":10,"n_samples":31,"n_pointer_only_licence":0}},{"rank_in_archive_order":6,"model":"ALBERT","metrics":{"Matched":"91.3"},"uses_additional_data":false,"paper_date":"2019-09-26","paper":"/paper/albert-a-lite-bert-for-self-supervised","paper_url":"https://arxiv.org/abs/1909.11942v6","paper_title":"ALBERT: A Lite BERT for Self-supervised Learning of Language Representations","code":"https://github.com/huggingface/transformers","n_code_links":48,"syntology":{"n_ran":68,"n_unverified":58,"n_samples":126,"n_pointer_only_licence":22}},{"rank_in_archive_order":7,"model":"DeBERTa (large)","metrics":{"Matched":"91.1","Mismatched":"91.1"},"uses_additional_data":false,"paper_date":"2020-06-05","paper":"/paper/deberta-decoding-enhanced-bert-with","paper_url":"https://arxiv.org/abs/2006.03654v6","paper_title":"DeBERTa: Decoding-enhanced BERT with Disentangled Attention","code":"https://github.com/huggingface/transformers","n_code_links":14,"syntology":{"n_ran":4,"n_unverified":9,"n_samples":13,"n_pointer_only_licence":3}},{"rank_in_archive_order":8,"model":"Adv-RoBERTa ensemble","metrics":{"Matched":"91.1","Mismatched":"90.7"},"uses_additional_data":false,"paper_date":"2019-08-13","paper":"/paper/structbert-incorporating-language-structures","paper_url":"https://arxiv.org/abs/1908.04577v3","paper_title":"StructBERT: Incorporating Language Structures into Pre-training for Deep Language Understanding","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":9,"model":"RoBERTa","metrics":{"Matched":"90.8"},"uses_additional_data":false,"paper_date":"2019-07-26","paper":"/paper/roberta-a-robustly-optimized-bert-pretraining","paper_url":"https://arxiv.org/abs/1907.11692v1","paper_title":"RoBERTa: A Robustly Optimized BERT Pretraining Approach","code":"https://github.com/huggingface/transformers","n_code_links":67,"syntology":{"n_ran":37,"n_unverified":11,"n_samples":48,"n_pointer_only_licence":23}},{"rank_in_archive_order":10,"model":"XLNet (single model)","metrics":{"Matched":"90.8"},"uses_additional_data":false,"paper_date":"2019-06-19","paper":"/paper/xlnet-generalized-autoregressive-pretraining","paper_url":"https://arxiv.org/abs/1906.08237v2","paper_title":"XLNet: Generalized Autoregressive Pretraining for Language Understanding","code":"https://github.com/huggingface/transformers","n_code_links":27,"syntology":{"n_ran":10,"n_unverified":14,"n_samples":24,"n_pointer_only_licence":3}},{"rank_in_archive_order":11,"model":"RoBERTa-large 355M (MLP quantized vector-wise, fine-tuned)","metrics":{"Matched":"90.2"},"uses_additional_data":false,"paper_date":"2022-08-15","paper":"/paper/llm-int8-8-bit-matrix-multiplication-for","paper_url":"https://arxiv.org/abs/2208.07339v2","paper_title":"LLM.int8(): 8-bit Matrix Multiplication for Transformers at Scale","code":"https://github.com/timdettmers/bitsandbytes","n_code_links":4,"syntology":{"n_ran":4,"n_unverified":1,"n_samples":5,"n_pointer_only_licence":0}},{"rank_in_archive_order":12,"model":"T5-Large","metrics":{"Matched":"89.9"},"uses_additional_data":false,"paper_date":"2019-10-23","paper":"/paper/exploring-the-limits-of-transfer-learning","paper_url":"https://arxiv.org/abs/1910.10683v4","paper_title":"Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer","code":"https://github.com/huggingface/transformers","n_code_links":57,"syntology":{"n_ran":21,"n_unverified":10,"n_samples":31,"n_pointer_only_licence":0}},{"rank_in_archive_order":13,"model":"PSQ (Chen et al., 2020)","metrics":{"Matched":"89.9"},"uses_additional_data":false,"paper_date":"2020-10-27","paper":"/paper/a-statistical-framework-for-low-bitwidth","paper_url":"https://arxiv.org/abs/2010.14298v1","paper_title":"A Statistical Framework for Low-bitwidth Training of Deep Neural Networks","code":"https://github.com/cjf00000/StatQuant","n_code_links":2,"syntology":{"n_ran":1,"n_unverified":3,"n_samples":4,"n_pointer_only_licence":1}},{"rank_in_archive_order":14,"model":"UnitedSynT5 (335M)","metrics":{"Matched":"89.8"},"uses_additional_data":true,"paper_date":"2024-12-12","paper":"/paper/first-train-to-generate-then-generate-to","paper_url":"https://arxiv.org/abs/2412.09263v2","paper_title":"First Train to Generate, then Generate to Train: UnitedSynT5 for Few-Shot NLI","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":15,"model":"ERNIE 2.0 Large","metrics":{"Matched":"88.7","Mismatched":"88.8"},"uses_additional_data":false,"paper_date":"2019-07-29","paper":"/paper/ernie-20-a-continual-pre-training-framework","paper_url":"https://arxiv.org/abs/1907.12412v2","paper_title":"ERNIE 2.0: A Continual Pre-training Framework for Language Understanding","code":"https://github.com/PaddlePaddle/PaddleNLP/tree/develop/model_zoo/ernie-1.0","n_code_links":3,"syntology":{"n_ran":0,"n_unverified":1,"n_samples":1,"n_pointer_only_licence":1}},{"rank_in_archive_order":16,"model":"SpanBERT","metrics":{"Matched":"88.1"},"uses_additional_data":false,"paper_date":"2019-07-24","paper":"/paper/spanbert-improving-pre-training-by","paper_url":"https://arxiv.org/abs/1907.10529v3","paper_title":"SpanBERT: Improving Pre-training by Representing and Predicting Spans","code":"https://github.com/facebookresearch/SpanBERT","n_code_links":6,"syntology":{"n_ran":6,"n_unverified":9,"n_samples":15,"n_pointer_only_licence":4}},{"rank_in_archive_order":17,"model":"BERT-Large","metrics":{"Matched":"88","Mismatched":"88"},"uses_additional_data":false,"paper_date":"2021-05-09","paper":"/paper/fnet-mixing-tokens-with-fourier-transforms","paper_url":"https://arxiv.org/abs/2105.03824v4","paper_title":"FNet: Mixing Tokens with Fourier Transforms","code":"https://github.com/labmlai/annotated_deep_learning_paper_implementations","n_code_links":12,"syntology":{"n_ran":2,"n_unverified":0,"n_samples":2,"n_pointer_only_licence":1}},{"rank_in_archive_order":18,"model":"ASA + RoBERTa","metrics":{"Matched":"88"},"uses_additional_data":false,"paper_date":"2022-06-25","paper":"/paper/adversarial-self-attention-for-language","paper_url":"https://arxiv.org/abs/2206.12608v3","paper_title":"Adversarial Self-Attention for Language Understanding","code":"https://github.com/gingasan/adversarialsa","n_code_links":1,"syntology":null},{"rank_in_archive_order":19,"model":"MT-DNN-ensemble","metrics":{"Matched":"87.9","Mismatched":"87.4"},"uses_additional_data":false,"paper_date":"2019-04-20","paper":"/paper/improving-multi-task-deep-neural-networks-via","paper_url":"http://arxiv.org/abs/1904.09482v1","paper_title":"Improving Multi-Task Deep Neural Networks via Knowledge Distillation for Natural Language Understanding","code":"https://github.com/namisan/mt-dnn","n_code_links":3,"syntology":null},{"rank_in_archive_order":20,"model":"Q-BERT (Shen et al., 2020)","metrics":{"Matched":"87.8"},"uses_additional_data":false,"paper_date":"2019-09-12","paper":"/paper/q-bert-hessian-based-ultra-low-precision","paper_url":"https://arxiv.org/abs/1909.05840v2","paper_title":"Q-BERT: Hessian Based Ultra Low Precision Quantization of BERT","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":21,"model":"Snorkel MeTaL (ensemble)","metrics":{"Matched":"87.6","Mismatched":"87.2"},"uses_additional_data":false,"paper_date":"2018-10-05","paper":"/paper/training-complex-models-with-multi-task-weak","paper_url":"http://arxiv.org/abs/1810.02840v2","paper_title":"Training Complex Models with Multi-Task Weak Supervision","code":"https://github.com/HazyResearch/metal","n_code_links":1,"syntology":null},{"rank_in_archive_order":22,"model":"BigBird","metrics":{"Matched":"87.5"},"uses_additional_data":false,"paper_date":"2020-07-28","paper":"/paper/big-bird-transformers-for-longer-sequences","paper_url":"https://arxiv.org/abs/2007.14062v2","paper_title":"Big Bird: Transformers for Longer Sequences","code":"https://github.com/huggingface/transformers","n_code_links":14,"syntology":{"n_ran":10,"n_unverified":5,"n_samples":15,"n_pointer_only_licence":11}},{"rank_in_archive_order":23,"model":"T5-Base","metrics":{"Matched":"87.1","Mismatched":"86.2"},"uses_additional_data":false,"paper_date":"2019-10-23","paper":"/paper/exploring-the-limits-of-transfer-learning","paper_url":"https://arxiv.org/abs/1910.10683v4","paper_title":"Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer","code":"https://github.com/huggingface/transformers","n_code_links":57,"syntology":{"n_ran":21,"n_unverified":10,"n_samples":31,"n_pointer_only_licence":0}},{"rank_in_archive_order":24,"model":"MT-DNN","metrics":{"Matched":"86.7","Mismatched":"86.0"},"uses_additional_data":false,"paper_date":"2019-01-31","paper":"/paper/multi-task-deep-neural-networks-for-natural","paper_url":"https://arxiv.org/abs/1901.11504v2","paper_title":"Multi-Task Deep Neural Networks for Natural Language Understanding","code":"https://github.com/namisan/mt-dnn","n_code_links":7,"syntology":{"n_ran":7,"n_unverified":6,"n_samples":13,"n_pointer_only_licence":2}},{"rank_in_archive_order":25,"model":"BERT-LARGE","metrics":{"Matched":"86.7","Mismatched":"85.9"},"uses_additional_data":false,"paper_date":"2018-10-11","paper":"/paper/bert-pre-training-of-deep-bidirectional","paper_url":"https://arxiv.org/abs/1810.04805v2","paper_title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","code":"https://github.com/huggingface/transformers","n_code_links":534,"syntology":{"n_ran":208,"n_unverified":451,"n_samples":659,"n_pointer_only_licence":149}},{"rank_in_archive_order":26,"model":"RealFormer","metrics":{"Matched":"86.28","Mismatched":"86.34"},"uses_additional_data":false,"paper_date":"2020-12-21","paper":"/paper/informer-transformer-likes-informed-attention","paper_url":"https://arxiv.org/abs/2012.11747v3","paper_title":"RealFormer: Transformer Likes Residual Attention","code":"https://github.com/google-research/google-research","n_code_links":5,"syntology":null},{"rank_in_archive_order":27,"model":"gMLP-large","metrics":{"Matched":"86.2","Mismatched":"86.5"},"uses_additional_data":false,"paper_date":"2021-05-17","paper":"/paper/pay-attention-to-mlps","paper_url":"https://arxiv.org/abs/2105.08050v2","paper_title":"Pay Attention to MLPs","code":"https://github.com/labmlai/annotated_deep_learning_paper_implementations","n_code_links":20,"syntology":{"n_ran":34,"n_unverified":10,"n_samples":44,"n_pointer_only_licence":11}},{"rank_in_archive_order":28,"model":"ERNIE 2.0 Base","metrics":{"Matched":"86.1","Mismatched":"85.5"},"uses_additional_data":false,"paper_date":"2019-07-29","paper":"/paper/ernie-20-a-continual-pre-training-framework","paper_url":"https://arxiv.org/abs/1907.12412v2","paper_title":"ERNIE 2.0: A Continual Pre-training Framework for Language Understanding","code":"https://github.com/PaddlePaddle/PaddleNLP/tree/develop/model_zoo/ernie-1.0","n_code_links":3,"syntology":{"n_ran":0,"n_unverified":1,"n_samples":1,"n_pointer_only_licence":1}},{"rank_in_archive_order":29,"model":"Q8BERT (Zafrir et al., 2019)","metrics":{"Matched":"85.6"},"uses_additional_data":false,"paper_date":"2019-10-14","paper":"/paper/q8bert-quantized-8bit-bert","paper_url":"https://arxiv.org/abs/1910.06188v2","paper_title":"Q8BERT: Quantized 8Bit BERT","code":"https://github.com/NervanaSystems/nlp-architect/blob/master/nlp_architect/models/transformers/quantized_bert.py","n_code_links":5,"syntology":{"n_ran":5,"n_unverified":6,"n_samples":11,"n_pointer_only_licence":3}},{"rank_in_archive_order":30,"model":"ASA + BERT-base","metrics":{"Matched":"85"},"uses_additional_data":false,"paper_date":"2022-06-25","paper":"/paper/adversarial-self-attention-for-language","paper_url":"https://arxiv.org/abs/2206.12608v3","paper_title":"Adversarial Self-Attention for Language Understanding","code":"https://github.com/gingasan/adversarialsa","n_code_links":1,"syntology":null},{"rank_in_archive_order":31,"model":"TinyBERT-6 67M","metrics":{"Matched":"84.6","Mismatched":"83.2"},"uses_additional_data":false,"paper_date":"2019-09-23","paper":"/paper/190910351","paper_url":"https://arxiv.org/abs/1909.10351v5","paper_title":"TinyBERT: Distilling BERT for Natural Language Understanding","code":"https://github.com/PaddlePaddle/PaddleNLP/tree/develop/paddlenlp/transformers/tinybert","n_code_links":10,"syntology":{"n_ran":0,"n_unverified":4,"n_samples":4,"n_pointer_only_licence":4}},{"rank_in_archive_order":32,"model":"ELC-BERT-base 98M (zero init)","metrics":{"Matched":"84.4","Mismatched":"84.5"},"uses_additional_data":false,"paper_date":"2023-11-03","paper":"/paper/not-all-layers-are-equally-as-important-every","paper_url":"https://arxiv.org/abs/2311.02265v2","paper_title":"Not all layers are equally as important: Every Layer Counts BERT","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":33,"model":"24hBERT","metrics":{"Matched":"84.4","Mismatched":"83.8"},"uses_additional_data":false,"paper_date":"2021-04-15","paper":"/paper/how-to-train-bert-with-an-academic-budget","paper_url":"https://arxiv.org/abs/2104.07705v2","paper_title":"How to Train BERT with an Academic Budget","code":"https://github.com/peteriz/academic-budget-bert","n_code_links":4,"syntology":null},{"rank_in_archive_order":34,"model":"ERNIE","metrics":{"Matched":"84.0","Mismatched":"83.2"},"uses_additional_data":false,"paper_date":"2019-05-17","paper":"/paper/ernie-enhanced-language-representation-with","paper_url":"https://arxiv.org/abs/1905.07129v3","paper_title":"ERNIE: Enhanced Language Representation with Informative Entities","code":"https://github.com/thunlp/ERNIE","n_code_links":2,"syntology":{"n_ran":3,"n_unverified":0,"n_samples":3,"n_pointer_only_licence":1}},{"rank_in_archive_order":35,"model":"Charformer-Tall","metrics":{"Matched":"83.7","Mismatched":"84.4"},"uses_additional_data":false,"paper_date":"2021-06-23","paper":"/paper/charformer-fast-character-transformers-via","paper_url":"https://arxiv.org/abs/2106.12672v3","paper_title":"Charformer: Fast Character Transformers via Gradient-based Subword Tokenization","code":"https://github.com/google-research/google-research","n_code_links":2,"syntology":{"n_ran":7,"n_unverified":3,"n_samples":10,"n_pointer_only_licence":0}},{"rank_in_archive_order":36,"model":"LTG-BERT-base 98M","metrics":{"Matched":"83","Mismatched":"83.4"},"uses_additional_data":false,"paper_date":"2023-11-03","paper":"/paper/not-all-layers-are-equally-as-important-every","paper_url":"https://arxiv.org/abs/2311.02265v2","paper_title":"Not all layers are equally as important: Every Layer Counts BERT","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":37,"model":"TinyBERT-4 14.5M","metrics":{"Matched":"82.5","Mismatched":"81.8"},"uses_additional_data":false,"paper_date":"2019-09-23","paper":"/paper/190910351","paper_url":"https://arxiv.org/abs/1909.10351v5","paper_title":"TinyBERT: Distilling BERT for Natural Language Understanding","code":"https://github.com/PaddlePaddle/PaddleNLP/tree/develop/paddlenlp/transformers/tinybert","n_code_links":10,"syntology":{"n_ran":0,"n_unverified":4,"n_samples":4,"n_pointer_only_licence":4}},{"rank_in_archive_order":38,"model":"T5-Small","metrics":{"Matched":"82.4","Mismatched":"82.3"},"uses_additional_data":false,"paper_date":"2019-10-23","paper":"/paper/exploring-the-limits-of-transfer-learning","paper_url":"https://arxiv.org/abs/1910.10683v4","paper_title":"Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer","code":"https://github.com/huggingface/transformers","n_code_links":57,"syntology":{"n_ran":21,"n_unverified":10,"n_samples":31,"n_pointer_only_licence":0}},{"rank_in_archive_order":39,"model":"MFAE","metrics":{"Matched":"82.31","Mismatched":"81.43"},"uses_additional_data":false,"paper_date":"2020-05-07","paper":"/paper/what-do-questions-exactly-ask-mfae-duplicate","paper_url":"https://epubs.siam.org/doi/10.1137/1.9781611976236.26","paper_title":"What Do Questions Exactly Ask? MFAE: Duplicate Question Identification with Multi-Fusion Asking Emphasis","code":"https://github.com/rzhangpku/MFAE","n_code_links":1,"syntology":null},{"rank_in_archive_order":40,"model":"Finetuned Transformer LM","metrics":{"Matched":"82.1","Mismatched":"81.4"},"uses_additional_data":false,"paper_date":null,"paper":null,"paper_url":null,"paper_title":"","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":41,"model":"Finetuned Transformer LM","metrics":{"Matched":"82.1","Mismatched":"81.4"},"uses_additional_data":false,"paper_date":"2018-06-11","paper":"/paper/improving-language-understanding-by","paper_url":"https://s3-us-west-2.amazonaws.com/openai-assets/research-covers/language-unsupervised/language_understanding_paper.pdf","paper_title":"Improving Language Understanding by Generative Pre-Training","code":"https://github.com/huggingface/transformers","n_code_links":13,"syntology":null},{"rank_in_archive_order":42,"model":"SqueezeBERT","metrics":{"Matched":"82.0","Mismatched":"81.1"},"uses_additional_data":false,"paper_date":"2020-06-19","paper":"/paper/squeezebert-what-can-computer-vision-teach","paper_url":"https://arxiv.org/abs/2006.11316v1","paper_title":"SqueezeBERT: What can computer vision teach NLP about efficient neural networks?","code":"https://github.com/huggingface/transformers/blob/main/src/transformers/models/squeezebert/modeling_squeezebert.py","n_code_links":6,"syntology":{"n_ran":1,"n_unverified":0,"n_samples":1,"n_pointer_only_licence":0}},{"rank_in_archive_order":43,"model":"GPST(unsupervised generative syntactic LM)","metrics":{"Matched":"81.8","Mismatched":"82.0"},"uses_additional_data":false,"paper_date":"2024-03-13","paper":"/paper/generative-pretrained-structured-transformers","paper_url":"https://arxiv.org/abs/2403.08293v3","paper_title":"Generative Pretrained Structured Transformers: Unsupervised Syntactic Language Models at Scale","code":"https://github.com/ant-research/structuredlm_rtdt","n_code_links":2,"syntology":{"n_ran":4,"n_unverified":3,"n_samples":7,"n_pointer_only_licence":0}},{"rank_in_archive_order":44,"model":"ELC-BERT-small 24M","metrics":{"Matched":"79.2","Mismatched":"79.9"},"uses_additional_data":false,"paper_date":"2023-11-03","paper":"/paper/not-all-layers-are-equally-as-important-every","paper_url":"https://arxiv.org/abs/2311.02265v2","paper_title":"Not all layers are equally as important: Every Layer Counts BERT","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":45,"model":"LTG-BERT-small 24M","metrics":{"Matched":"78","Mismatched":"78.8"},"uses_additional_data":false,"paper_date":"2023-11-03","paper":"/paper/not-all-layers-are-equally-as-important-every","paper_url":"https://arxiv.org/abs/2311.02265v2","paper_title":"Not all layers are equally as important: Every Layer Counts BERT","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":46,"model":"FNet-Large","metrics":{"Matched":"78","Mismatched":"76"},"uses_additional_data":false,"paper_date":"2021-05-09","paper":"/paper/fnet-mixing-tokens-with-fourier-transforms","paper_url":"https://arxiv.org/abs/2105.03824v4","paper_title":"FNet: Mixing Tokens with Fourier Transforms","code":"https://github.com/labmlai/annotated_deep_learning_paper_implementations","n_code_links":12,"syntology":{"n_ran":2,"n_unverified":0,"n_samples":2,"n_pointer_only_licence":1}},{"rank_in_archive_order":47,"model":"aESIM","metrics":{"Matched":"73.9 ","Mismatched":"73.9"},"uses_additional_data":false,"paper_date":"2018-12-05","paper":"/paper/attention-boosted-sequential-inference-model","paper_url":"http://arxiv.org/abs/1812.01840v2","paper_title":"Attention Boosted Sequential Inference Model","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":48,"model":"T5-Large 738M","metrics":{"Matched":"72.4","Mismatched":"72"},"uses_additional_data":false,"paper_date":"2023-04-27","paper":"/paper/lamini-lm-a-diverse-herd-of-distilled-models","paper_url":"https://arxiv.org/abs/2304.14402v3","paper_title":"LaMini-LM: A Diverse Herd of Distilled Models from Large-Scale Instructions","code":"https://github.com/mbzuai-nlp/lamini-lm","n_code_links":1,"syntology":null},{"rank_in_archive_order":49,"model":"Multi-task BiLSTM + Attn","metrics":{"Matched":"72.2","Mismatched":"72.1"},"uses_additional_data":false,"paper_date":"2018-04-20","paper":"/paper/glue-a-multi-task-benchmark-and-analysis","paper_url":"http://arxiv.org/abs/1804.07461v3","paper_title":"GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understanding","code":"https://github.com/ofa-sys/ofa","n_code_links":11,"syntology":{"n_ran":5,"n_unverified":9,"n_samples":14,"n_pointer_only_licence":1}},{"rank_in_archive_order":50,"model":"Stacked Bi-LSTMs (shortcut connections, max-pooling)","metrics":{"Matched":"71.4","Mismatched":"72.2"},"uses_additional_data":false,"paper_date":"2018-11-02","paper":"/paper/combining-similarity-features-and-deep","paper_url":"http://arxiv.org/abs/1811.00706v1","paper_title":"Combining Similarity Features and Deep Representation Learning for Stance Detection in the Context of Checking Fake News","code":"https://github.com/imran3180/pytorch-nli","n_code_links":3,"syntology":null},{"rank_in_archive_order":51,"model":"GenSen","metrics":{"Matched":"71.4","Mismatched":"71.3"},"uses_additional_data":false,"paper_date":"2018-03-30","paper":"/paper/learning-general-purpose-distributed-sentence","paper_url":"http://arxiv.org/abs/1804.00079v1","paper_title":"Learning General Purpose Distributed Sentence Representations via Large Scale Multi-task Learning","code":"https://github.com/facebookresearch/InferSent","n_code_links":4,"syntology":{"n_ran":3,"n_unverified":0,"n_samples":3,"n_pointer_only_licence":3}},{"rank_in_archive_order":52,"model":"Bi-LSTM sentence encoder (max-pooling)","metrics":{"Matched":"70.7","Mismatched":"71.1"},"uses_additional_data":false,"paper_date":"2018-11-02","paper":"/paper/combining-similarity-features-and-deep","paper_url":"http://arxiv.org/abs/1811.00706v1","paper_title":"Combining Similarity Features and Deep Representation Learning for Stance Detection in the Context of Checking Fake News","code":"https://github.com/imran3180/pytorch-nli","n_code_links":3,"syntology":null},{"rank_in_archive_order":53,"model":"Stacked Bi-LSTMs (shortcut connections, max-pooling, attention)","metrics":{"Matched":"70.7","Mismatched":"70.5"},"uses_additional_data":false,"paper_date":"2018-11-02","paper":"/paper/combining-similarity-features-and-deep","paper_url":"http://arxiv.org/abs/1811.00706v1","paper_title":"Combining Similarity Features and Deep Representation Learning for Stance Detection in the Context of Checking Fake News","code":"https://github.com/imran3180/pytorch-nli","n_code_links":3,"syntology":null},{"rank_in_archive_order":54,"model":"SWEM-max","metrics":{"Matched":"68.2","Mismatched":"67.7"},"uses_additional_data":false,"paper_date":"2018-05-24","paper":"/paper/baseline-needs-more-love-on-simple-word","paper_url":"http://arxiv.org/abs/1805.09843v1","paper_title":"Baseline Needs More Love: On Simple Word-Embedding-Based Models and Associated Pooling Mechanisms","code":"https://github.com/dinghanshen/SWEM","n_code_links":2,"syntology":null},{"rank_in_archive_order":55,"model":"LaMini-GPT 1.5B","metrics":{"Matched":"67.5","Mismatched":"69.3"},"uses_additional_data":false,"paper_date":"2023-04-27","paper":"/paper/lamini-lm-a-diverse-herd-of-distilled-models","paper_url":"https://arxiv.org/abs/2304.14402v3","paper_title":"LaMini-LM: A Diverse Herd of Distilled Models from Large-Scale Instructions","code":"https://github.com/mbzuai-nlp/lamini-lm","n_code_links":1,"syntology":null},{"rank_in_archive_order":56,"model":"LaMini-F-T5 783M","metrics":{"Matched":"61.4","Mismatched":"61"},"uses_additional_data":false,"paper_date":"2023-04-27","paper":"/paper/lamini-lm-a-diverse-herd-of-distilled-models","paper_url":"https://arxiv.org/abs/2304.14402v3","paper_title":"LaMini-LM: A Diverse Herd of Distilled Models from Large-Scale Instructions","code":"https://github.com/mbzuai-nlp/lamini-lm","n_code_links":1,"syntology":null},{"rank_in_archive_order":57,"model":"LaMini-T5 738M","metrics":{"Matched":"54.7","Mismatched":"55.8"},"uses_additional_data":false,"paper_date":"2023-04-27","paper":"/paper/lamini-lm-a-diverse-herd-of-distilled-models","paper_url":"https://arxiv.org/abs/2304.14402v3","paper_title":"LaMini-LM: A Diverse Herd of Distilled Models from Large-Scale Instructions","code":"https://github.com/mbzuai-nlp/lamini-lm","n_code_links":1,"syntology":null},{"rank_in_archive_order":58,"model":"GPT-2-XL 1.5B","metrics":{"Matched":"36.5","Mismatched":"37"},"uses_additional_data":false,"paper_date":"2023-04-27","paper":"/paper/lamini-lm-a-diverse-herd-of-distilled-models","paper_url":"https://arxiv.org/abs/2304.14402v3","paper_title":"LaMini-LM: A Diverse Herd of Distilled Models from Large-Scale Instructions","code":"https://github.com/mbzuai-nlp/lamini-lm","n_code_links":1,"syntology":null},{"rank_in_archive_order":59,"model":"T5-11B","metrics":{"Mismatched":"91.7"},"uses_additional_data":false,"paper_date":"2019-10-23","paper":"/paper/exploring-the-limits-of-transfer-learning","paper_url":"https://arxiv.org/abs/1910.10683v4","paper_title":"Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer","code":"https://github.com/huggingface/transformers","n_code_links":57,"syntology":{"n_ran":21,"n_unverified":10,"n_samples":31,"n_pointer_only_licence":0}},{"rank_in_archive_order":60,"model":"RoBERTa (ensemble)","metrics":{"Mismatched":"90.2"},"uses_additional_data":false,"paper_date":"2019-07-26","paper":"/paper/roberta-a-robustly-optimized-bert-pretraining","paper_url":"https://arxiv.org/abs/1907.11692v1","paper_title":"RoBERTa: A Robustly Optimized BERT Pretraining Approach","code":"https://github.com/huggingface/transformers","n_code_links":67,"syntology":{"n_ran":37,"n_unverified":11,"n_samples":48,"n_pointer_only_licence":23}},{"rank_in_archive_order":61,"model":"T5-Large 770M","metrics":{"Mismatched":"89.6"},"uses_additional_data":false,"paper_date":"2019-10-23","paper":"/paper/exploring-the-limits-of-transfer-learning","paper_url":"https://arxiv.org/abs/1910.10683v4","paper_title":"Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer","code":"https://github.com/huggingface/transformers","n_code_links":57,"syntology":{"n_ran":21,"n_unverified":10,"n_samples":31,"n_pointer_only_licence":0}},{"rank_in_archive_order":62,"model":"MT-DNN-SMARTv0","metrics":{"Accuracy":"85.7"},"uses_additional_data":false,"paper_date":"2019-11-08","paper":"/paper/smart-robust-and-efficient-fine-tuning-for","paper_url":"https://arxiv.org/abs/1911.03437v5","paper_title":"SMART: Robust and Efficient Fine-Tuning for Pre-trained Natural Language Models through Principled Regularized Optimization","code":"https://github.com/namisan/mt-dnn","n_code_links":6,"syntology":{"n_ran":8,"n_unverified":0,"n_samples":8,"n_pointer_only_licence":1}},{"rank_in_archive_order":63,"model":"MT-DNN-SMART","metrics":{"Accuracy":"85.7"},"uses_additional_data":false,"paper_date":"2019-11-08","paper":"/paper/smart-robust-and-efficient-fine-tuning-for","paper_url":"https://arxiv.org/abs/1911.03437v5","paper_title":"SMART: Robust and Efficient Fine-Tuning for Pre-trained Natural Language Models through Principled Regularized Optimization","code":"https://github.com/namisan/mt-dnn","n_code_links":6,"syntology":{"n_ran":8,"n_unverified":0,"n_samples":8,"n_pointer_only_licence":1}},{"rank_in_archive_order":64,"model":"SMART+BERT-BASE","metrics":{"Accuracy":"85.6"},"uses_additional_data":false,"paper_date":"2019-11-08","paper":"/paper/smart-robust-and-efficient-fine-tuning-for","paper_url":"https://arxiv.org/abs/1911.03437v5","paper_title":"SMART: Robust and Efficient Fine-Tuning for Pre-trained Natural Language Models through Principled Regularized Optimization","code":"https://github.com/namisan/mt-dnn","n_code_links":6,"syntology":{"n_ran":8,"n_unverified":0,"n_samples":8,"n_pointer_only_licence":1}},{"rank_in_archive_order":65,"model":"LM-CPPF RoBERTa-base","metrics":{"Accuracy":"68.4"},"uses_additional_data":false,"paper_date":"2023-05-29","paper":"/paper/lm-cppf-paraphrasing-guided-data-augmentation","paper_url":"https://arxiv.org/abs/2305.18169v3","paper_title":"LM-CPPF: Paraphrasing-Guided Data Augmentation for Contrastive Prompt-Based Few-Shot Fine-Tuning","code":"https://github.com/amirabaskohi/lm-cppf","n_code_links":1,"syntology":null},{"rank_in_archive_order":66,"model":"SMARTRoBERTa","metrics":{"Dev Matched":"91.1","Dev Mismatched":"91.3"},"uses_additional_data":false,"paper_date":"2019-11-08","paper":"/paper/smart-robust-and-efficient-fine-tuning-for","paper_url":"https://arxiv.org/abs/1911.03437v5","paper_title":"SMART: Robust and Efficient Fine-Tuning for Pre-trained Natural Language Models through Principled Regularized Optimization","code":"https://github.com/namisan/mt-dnn","n_code_links":6,"syntology":{"n_ran":8,"n_unverified":0,"n_samples":8,"n_pointer_only_licence":1}},{"rank_in_archive_order":67,"model":"SMART-BERT","metrics":{"Dev Matched":"85.6","Dev Mismatched":"86.0"},"uses_additional_data":false,"paper_date":"2019-11-08","paper":"/paper/smart-robust-and-efficient-fine-tuning-for","paper_url":"https://arxiv.org/abs/1911.03437v5","paper_title":"SMART: Robust and Efficient Fine-Tuning for Pre-trained Natural Language Models through Principled Regularized Optimization","code":"https://github.com/namisan/mt-dnn","n_code_links":6,"syntology":{"n_ran":8,"n_unverified":0,"n_samples":8,"n_pointer_only_licence":1}}],"since_archive":{"claim":"Results that newer papers report for their own method, placed here by Syntology. A model pointed at the cell in the paper's own table; the number was read from that cell and checked against this leaderboard's metric, dataset, split and scale; an independent check that saw this leaderboard's other rows and every other leaderboard on the same dataset accepted it. Not reviewed by the paper's authors or by the archive's editors, and not ranked against the archive rows.","extraction_file_present":true,"measurement":{"test_papers":883,"papers_with_output":881,"judged_true":108,"judged":110,"wilson95_lower":0.9361,"measured_on":"2026-09-24","frozen_commit":"0e3de0df94"},"measurement_note":"blind adjudication of accepted entries on a held-out split of archive papers, rules frozen before the test","coverage":{"sentence":"Syntology has checked 6,885 of the 9,623 papers on this site that are newer than the archive; results from the others appear after they are checked.","complete":false,"papers_newer_than_archive":9623,"papers_checked":6885,"papers_extracted_not_yet_verified":0,"boards_without_verdict":2,"papers_not_yet_extracted":2737},"order":"newest first by month (arXiv date, else the arXiv-id month), then arXiv id descending","columns":[],"entries":[]},"syntology":{"read_at":"2026-09-25T09:33:49+00:00","claim":"Per row: N of M harvested code samples from that row's paper executed on a synthesized fixture; the other M-N are unverified. Not a reproduction of the row's number; not a correctness claim. n_pointer_only_licence counts samples the site points at rather than redistributes (a licence axis, independent of ran/unverified).","rows_with_graph_line":38,"rows_with_any_sample_ran":34,"distinct_papers_with_graph_line":23,"distinct_papers_with_any_sample_ran":21,"samples_over_distinct_papers":{"n_ran":448,"n_unverified":613,"n_samples":1061,"n_pointer_only_licence":244,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":653,"n_unverified":689,"n_samples":1342,"n_pointer_only_licence":278,"note":"row-weighted: a paper behind several rows is counted once per row; inflated relative to samples_over_distinct_papers by design, kept for readers summing the per-row syntology blocks"}}}