{"url":"/sota/text-classification-on-imdb","task":{"name":"Text Classification","url":"/task/text-classification","note":null},"dataset":{"name":"IMDb","url":"/dataset/imdb-movie-reviews"},"category":"Natural Language Processing","categories":["Natural Language Processing"],"category_note":null,"description":"**Text Classification** is the task of assigning a sentence or document an appropriate category. The categories depend on the chosen dataset and can range from topics. \r\n\r\nText Classification problems include emotion classification, news classification, citation intent classification, among others. Benchmark datasets for evaluating text classification capabilities include GLUE, AGNews,  among others. \r\n\r\nIn recent years, deep learning techniques like XLNet and RoBERTa have attained some of the biggest performance jumps for text classification problems. \r\n\r\n<span style=\"color:grey; opacity: 0.6\">( Image credit: [Text Classification Algorithms: A Survey](https://arxiv.org/pdf/1904.08067v4.pdf) )</span>","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":["Accuracy","F1","Precision","Recall"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"Accuracy":"higher","F1":"higher","Precision":"higher","Recall":"higher"}},"counts":{"rows":13,"rows_with_code":11,"rows_with_paper_page":13,"rows_dated":13,"rows_using_additional_data":1},"rows":[{"rank_in_archive_order":1,"model":"BERT-ITPT-FiT","metrics":{},"uses_additional_data":false,"paper_date":"2019-05-14","paper":"/paper/how-to-fine-tune-bert-for-text-classification","paper_url":"https://arxiv.org/abs/1905.05583v3","paper_title":"How to Fine-Tune BERT for Text Classification?","code":"https://github.com/xuyige/BERT4doc-Classification","n_code_links":15,"syntology":{"n_ran":6,"n_unverified":12,"n_samples":18,"n_pointer_only_licence":5}},{"rank_in_archive_order":2,"model":"HAHNN (CNN)","metrics":{},"uses_additional_data":false,"paper_date":"2019-01-20","paper":"/paper/hierarchical-attentional-hybrid-neural","paper_url":"https://arxiv.org/abs/1901.06610v2","paper_title":"Hierarchical Attentional Hybrid Neural Networks for Document Classification","code":"https://github.com/luisfredgs/cnn-hierarchical-network-for-document-classification","n_code_links":2,"syntology":null},{"rank_in_archive_order":3,"model":"Paragraph Vectors Le & Mikolov (2014)","metrics":{},"uses_additional_data":false,"paper_date":"2014-05-16","paper":"/paper/distributed-representations-of-sentences-and","paper_url":"http://arxiv.org/abs/1405.4053v2","paper_title":"Distributed Representations of Sentences and Documents","code":"https://github.com/inejc/paragraph-vectors","n_code_links":27,"syntology":{"n_ran":0,"n_unverified":4,"n_samples":4,"n_pointer_only_licence":0}},{"rank_in_archive_order":4,"model":"byte mLSTM7","metrics":{},"uses_additional_data":false,"paper_date":"2018-05-14","paper":"/paper/a-la-carte-embedding-cheap-but-effective","paper_url":"http://arxiv.org/abs/1805.05388v1","paper_title":"A La Carte Embedding: Cheap but Effective Induction of Semantic Feature Vectors","code":"https://github.com/NLPrinceton/ALaCarte","n_code_links":1,"syntology":{"n_ran":2,"n_unverified":1,"n_samples":3,"n_pointer_only_licence":0}},{"rank_in_archive_order":5,"model":"MPAD-path","metrics":{},"uses_additional_data":false,"paper_date":"2019-08-17","paper":"/paper/message-passing-attention-networks-for","paper_url":"https://arxiv.org/abs/1908.06267v2","paper_title":"Message Passing Attention Networks for Document Understanding","code":"https://github.com/giannisnik/mpad","n_code_links":2,"syntology":null},{"rank_in_archive_order":6,"model":"Transductive SVM Johnson & Zhang ([2015b])","metrics":{},"uses_additional_data":false,"paper_date":"2015-04-06","paper":"/paper/semi-supervised-convolutional-neural-networks-1","paper_url":"http://arxiv.org/abs/1504.01255v3","paper_title":"Semi-supervised Convolutional Neural Networks for Text Categorization via Region Embedding","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":7,"model":"KD-LSTMreg","metrics":{},"uses_additional_data":false,"paper_date":"2019-04-17","paper":"/paper/docbert-bert-for-document-classification","paper_url":"https://arxiv.org/abs/1904.08398v3","paper_title":"DocBERT: BERT for Document Classification","code":"https://github.com/castorini/hedwig","n_code_links":3,"syntology":{"n_ran":0,"n_unverified":14,"n_samples":14,"n_pointer_only_licence":0}},{"rank_in_archive_order":8,"model":"In-domain Pretraining+Semi-supervised","metrics":{},"uses_additional_data":false,"paper_date":"2020-11-17","paper":"/paper/neural-semi-supervised-learning-for-text","paper_url":"https://arxiv.org/abs/2011.08626v2","paper_title":"Neural Semi-supervised Learning for Text Classification Under Large-Scale Pretraining","code":"https://github.com/ShannonAI/Neural-Semi-Supervised-Learning-for-Text-Classification","n_code_links":1,"syntology":null},{"rank_in_archive_order":9,"model":"Document Classification Using Importance of Sentences","metrics":{},"uses_additional_data":false,"paper_date":"2021-03-09","paper":"/paper/improving-document-level-sentiment","paper_url":"https://arxiv.org/abs/2103.05167v1","paper_title":"Improving Document-Level Sentiment Classification Using Importance of Sentences","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":10,"model":"ERNIE-Doc","metrics":{},"uses_additional_data":false,"paper_date":"2020-12-31","paper":"/paper/ernie-doc-the-retrospective-long-document","paper_url":"https://arxiv.org/abs/2012.15688v2","paper_title":"ERNIE-Doc: A Retrospective Long-Document Modeling Transformer","code":"https://github.com/PaddlePaddle/PaddleNLP/tree/develop/paddlenlp/transformers/ernie_doc","n_code_links":2,"syntology":null},{"rank_in_archive_order":11,"model":"ERNIE-Doc-Large","metrics":{},"uses_additional_data":false,"paper_date":"2020-12-31","paper":"/paper/ernie-doc-the-retrospective-long-document","paper_url":"https://arxiv.org/abs/2012.15688v2","paper_title":"ERNIE-Doc: A Retrospective Long-Document Modeling Transformer","code":"https://github.com/PaddlePaddle/PaddleNLP/tree/develop/paddlenlp/transformers/ernie_doc","n_code_links":2,"syntology":null},{"rank_in_archive_order":12,"model":"Context-Aware Pipeline","metrics":{},"uses_additional_data":false,"paper_date":"2021-12-30","paper":"/paper/context-aware-compilation-of-dnn-training","paper_url":"https://dl.acm.org/doi/abs/10.1145/3494981","paper_title":"Context-Aware Compilation of DNN Training Pipelines across Edge and Cloud","code":"https://github.com/dixiyao/Context-Aware-Compilation-of-DNN-Training-Pipelines-across-Edge-and-Cloud","n_code_links":1,"syntology":null},{"rank_in_archive_order":13,"model":"Heinsen Routing + RoBERTa-large","metrics":{},"uses_additional_data":true,"paper_date":"2022-11-20","paper":"/paper/an-algorithm-for-routing-vectors-in-sequences","paper_url":"https://arxiv.org/abs/2211.11754v3","paper_title":"An Algorithm for Routing Vectors in Sequences","code":"https://github.com/glassroom/heinsen_routing","n_code_links":1,"syntology":null}],"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,264 of the 9,581 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":9581,"papers_checked":6264,"papers_extracted_not_yet_verified":0,"boards_without_verdict":2,"papers_not_yet_extracted":3316},"order":"newest first by month (arXiv date, else the arXiv-id month), then arXiv id descending","columns":[],"entries":[]},"syntology":{"read_at":"2026-09-24T18:15:14+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":4,"rows_with_any_sample_ran":2,"distinct_papers_with_graph_line":4,"distinct_papers_with_any_sample_ran":2,"samples_over_distinct_papers":{"n_ran":8,"n_unverified":31,"n_samples":39,"n_pointer_only_licence":5,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":8,"n_unverified":31,"n_samples":39,"n_pointer_only_licence":5,"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"}}}