{"url":"/sota/sentiment-analysis-on-imdb","task":{"name":"Sentiment Analysis","url":"/task/sentiment-analysis","note":null},"dataset":{"name":"IMDb","url":"/dataset/imdb-movie-reviews"},"category":"Computer Vision","categories":["Computer Vision","Natural Language Processing"],"category_note":null,"description":"**Sentiment Analysis** is the task of classifying the polarity of a given text. For instance, a text-based tweet can be categorized into either \"positive\", \"negative\", or \"neutral\". Given the text and accompanying labels, a model can be trained to predict the correct sentiment. \r\n\r\n**Sentiment Analysis** techniques can be categorized into machine learning approaches, lexicon-based approaches, and even hybrid methods. Some subcategories of research in sentiment analysis include: multimodal sentiment analysis, aspect-based sentiment analysis, fine-grained opinion analysis, language specific sentiment analysis.\r\n\r\nMore recently, deep learning techniques, such as RoBERTa and T5, are used to train high-performing sentiment classifiers that are evaluated using metrics like F1, recall, and precision. To evaluate sentiment analysis systems, benchmark datasets like SST, GLUE, and IMDB movie reviews are used.\r\n\r\nFurther readings:\r\n\r\n- [Sentiment Analysis Based on Deep Learning: A Comparative Study](https://paperswithcode.com/paper/sentiment-analysis-based-on-deep-learning-a)","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"],"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"}},"counts":{"rows":49,"rows_with_code":47,"rows_with_paper_page":48,"rows_dated":48,"rows_using_additional_data":10},"rows":[{"rank_in_archive_order":1,"model":"RoBERTa-large with LlamBERT","metrics":{"Accuracy":"96.68"},"uses_additional_data":false,"paper_date":"2024-03-23","paper":"/paper/llambert-large-scale-low-cost-data-annotation","paper_url":"https://arxiv.org/abs/2403.15938v1","paper_title":"LlamBERT: Large-scale low-cost data annotation in NLP","code":"https://github.com/aielte-research/llambert","n_code_links":1,"syntology":null},{"rank_in_archive_order":2,"model":"RoBERTa-large","metrics":{"Accuracy":"96.54"},"uses_additional_data":false,"paper_date":"2024-03-23","paper":"/paper/llambert-large-scale-low-cost-data-annotation","paper_url":"https://arxiv.org/abs/2403.15938v1","paper_title":"LlamBERT: Large-scale low-cost data annotation in NLP","code":"https://github.com/aielte-research/llambert","n_code_links":1,"syntology":null},{"rank_in_archive_order":3,"model":"XLNet","metrics":{"Accuracy":"96.21"},"uses_additional_data":true,"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":4,"model":"Heinsen Routing + RoBERTa Large","metrics":{"Accuracy":"96.2"},"uses_additional_data":false,"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},{"rank_in_archive_order":5,"model":"RoBERTa-large 355M + Entailment as Few-shot Learner","metrics":{"Accuracy":"96.1"},"uses_additional_data":false,"paper_date":"2021-04-29","paper":"/paper/entailment-as-few-shot-learner","paper_url":"https://arxiv.org/abs/2104.14690v1","paper_title":"Entailment as Few-Shot Learner","code":"https://github.com/PaddlePaddle/PaddleNLP/tree/develop/examples/few_shot/efl","n_code_links":3,"syntology":{"n_ran":1,"n_unverified":2,"n_samples":3,"n_pointer_only_licence":0}},{"rank_in_archive_order":6,"model":"GraphStar","metrics":{"Accuracy":"96.0"},"uses_additional_data":false,"paper_date":"2019-06-21","paper":"/paper/graph-star-net-for-generalized-multi-task-1","paper_url":"https://arxiv.org/abs/1906.12330v1","paper_title":"Graph Star Net for Generalized Multi-Task Learning","code":"https://github.com/graph-star-team/graph_star","n_code_links":1,"syntology":{"n_ran":1,"n_unverified":5,"n_samples":6,"n_pointer_only_licence":0}},{"rank_in_archive_order":7,"model":"DV-ngrams-cosine with NB sub-sampling + RoBERTa.base","metrics":{"Accuracy":"95.94"},"uses_additional_data":false,"paper_date":"2022-05-26","paper":"/paper/the-document-vectors-using-cosine-similarity-1","paper_url":"https://arxiv.org/abs/2205.13357v1","paper_title":"The Document Vectors Using Cosine Similarity Revisited","code":"https://github.com/bgzh/dv_cosine_revisited","n_code_links":1,"syntology":null},{"rank_in_archive_order":8,"model":"DV-ngrams-cosine + RoBERTa.base","metrics":{"Accuracy":"95.92"},"uses_additional_data":false,"paper_date":"2022-05-26","paper":"/paper/the-document-vectors-using-cosine-similarity-1","paper_url":"https://arxiv.org/abs/2205.13357v1","paper_title":"The Document Vectors Using Cosine Similarity Revisited","code":"https://github.com/bgzh/dv_cosine_revisited","n_code_links":1,"syntology":null},{"rank_in_archive_order":9,"model":"Roberta_Large ST + Cosine Similarity Loss","metrics":{"Accuracy":"95.9"},"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":10,"model":"BERT large finetune UDA","metrics":{"Accuracy":"95.8"},"uses_additional_data":true,"paper_date":"2019-04-29","paper":"/paper/unsupervised-data-augmentation-1","paper_url":"https://arxiv.org/abs/1904.12848v6","paper_title":"Unsupervised Data Augmentation for Consistency Training","code":"https://github.com/google-research/uda","n_code_links":20,"syntology":{"n_ran":15,"n_unverified":37,"n_samples":52,"n_pointer_only_licence":9}},{"rank_in_archive_order":11,"model":"BERT_large+ITPT","metrics":{"Accuracy":"95.79"},"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":12,"model":"RoBERTa.base","metrics":{"Accuracy":"95.79"},"uses_additional_data":true,"paper_date":"2022-05-26","paper":"/paper/the-document-vectors-using-cosine-similarity-1","paper_url":"https://arxiv.org/abs/2205.13357v1","paper_title":"The Document Vectors Using Cosine Similarity Revisited","code":"https://github.com/bgzh/dv_cosine_revisited","n_code_links":1,"syntology":null},{"rank_in_archive_order":13,"model":"L MIXED","metrics":{"Accuracy":"95.68"},"uses_additional_data":false,"paper_date":"2020-09-08","paper":"/paper/revisiting-lstm-networks-for-semi-supervised-1","paper_url":"https://arxiv.org/abs/2009.04007v1","paper_title":"Revisiting LSTM Networks for Semi-Supervised Text Classification via Mixed Objective Function","code":"https://github.com/DevSinghSachan/ssl_text_classification","n_code_links":1,"syntology":{"n_ran":2,"n_unverified":1,"n_samples":3,"n_pointer_only_licence":3}},{"rank_in_archive_order":14,"model":"BERT_base+ITPT","metrics":{"Accuracy":"95.63"},"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":15,"model":"BERT large","metrics":{"Accuracy":"95.49"},"uses_additional_data":false,"paper_date":"2019-04-29","paper":"/paper/unsupervised-data-augmentation-1","paper_url":"https://arxiv.org/abs/1904.12848v6","paper_title":"Unsupervised Data Augmentation for Consistency Training","code":"https://github.com/google-research/uda","n_code_links":20,"syntology":{"n_ran":15,"n_unverified":37,"n_samples":52,"n_pointer_only_licence":9}},{"rank_in_archive_order":16,"model":"ULMFiT","metrics":{"Accuracy":"95.4"},"uses_additional_data":false,"paper_date":"2018-01-18","paper":"/paper/universal-language-model-fine-tuning-for-text","paper_url":"http://arxiv.org/abs/1801.06146v5","paper_title":"Universal Language Model Fine-tuning for Text Classification","code":"https://github.com/fastai/fastai","n_code_links":66,"syntology":{"n_ran":2,"n_unverified":3,"n_samples":5,"n_pointer_only_licence":3}},{"rank_in_archive_order":17,"model":"Llama-2-70b-chat (0-shot)","metrics":{"Accuracy":"95.39"},"uses_additional_data":true,"paper_date":"2024-03-23","paper":"/paper/llambert-large-scale-low-cost-data-annotation","paper_url":"https://arxiv.org/abs/2403.15938v1","paper_title":"LlamBERT: Large-scale low-cost data annotation in NLP","code":"https://github.com/aielte-research/llambert","n_code_links":1,"syntology":null},{"rank_in_archive_order":18,"model":"FLAN 137B (few-shot, k=2)","metrics":{"Accuracy":"95"},"uses_additional_data":true,"paper_date":"2021-09-03","paper":"/paper/finetuned-language-models-are-zero-shot","paper_url":"https://arxiv.org/abs/2109.01652v5","paper_title":"Finetuned Language Models Are Zero-Shot Learners","code":"https://github.com/hiyouga/llama-efficient-tuning","n_code_links":8,"syntology":{"n_ran":0,"n_unverified":1,"n_samples":1,"n_pointer_only_licence":0}},{"rank_in_archive_order":19,"model":"Block-sparse LSTM","metrics":{"Accuracy":"94.99"},"uses_additional_data":false,"paper_date":"2017-12-01","paper":"/paper/gpu-kernels-for-block-sparse-weights","paper_url":"https://blog.openai.com/block-sparse-gpu-kernels/","paper_title":"GPU Kernels for Block-Sparse Weights","code":"https://github.com/openai/blocksparse","n_code_links":1,"syntology":null},{"rank_in_archive_order":20,"model":"Space-XLNet","metrics":{"Accuracy":"94.88"},"uses_additional_data":false,"paper_date":"2024-01-30","paper":"/paper/breaking-free-transformer-models-task","paper_url":"https://arxiv.org/abs/2401.16638v1","paper_title":"Breaking Free Transformer Models: Task-specific Context Attribution Promises Improved Generalizability Without Fine-tuning Pre-trained LLMs","code":"https://github.com/stepantita/space-model","n_code_links":1,"syntology":null},{"rank_in_archive_order":21,"model":"CEN-tpc","metrics":{"Accuracy":"94.52"},"uses_additional_data":false,"paper_date":"2017-05-29","paper":"/paper/contextual-explanation-networks","paper_url":"https://arxiv.org/abs/1705.10301v4","paper_title":"Contextual Explanation Networks","code":"https://github.com/alshedivat/cen","n_code_links":1,"syntology":null},{"rank_in_archive_order":22,"model":"FLAN 137B (zero-shot)","metrics":{"Accuracy":"94.3"},"uses_additional_data":true,"paper_date":"2021-09-03","paper":"/paper/finetuned-language-models-are-zero-shot","paper_url":"https://arxiv.org/abs/2109.01652v5","paper_title":"Finetuned Language Models Are Zero-Shot Learners","code":"https://github.com/hiyouga/llama-efficient-tuning","n_code_links":8,"syntology":{"n_ran":0,"n_unverified":1,"n_samples":1,"n_pointer_only_licence":0}},{"rank_in_archive_order":23,"model":"oh-LSTM","metrics":{"Accuracy":"94.1"},"uses_additional_data":true,"paper_date":"2016-02-07","paper":"/paper/supervised-and-semi-supervised-text","paper_url":"http://arxiv.org/abs/1602.02373v2","paper_title":"Supervised and Semi-Supervised Text Categorization using LSTM for Region Embeddings","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":24,"model":"Virtual adversarial training","metrics":{"Accuracy":"94.1"},"uses_additional_data":false,"paper_date":"2016-05-25","paper":"/paper/adversarial-training-methods-for-semi","paper_url":"https://arxiv.org/abs/1605.07725v4","paper_title":"Adversarial Training Methods for Semi-Supervised Text Classification","code":"https://github.com/tensorflow/models/tree/master/research/adversarial_text","n_code_links":4,"syntology":null},{"rank_in_archive_order":25,"model":"DV-ngrams-cosine + NB-weighted BON (re-evaluated)","metrics":{"Accuracy":"93.68"},"uses_additional_data":false,"paper_date":"2022-05-26","paper":"/paper/the-document-vectors-using-cosine-similarity-1","paper_url":"https://arxiv.org/abs/2205.13357v1","paper_title":"The Document Vectors Using Cosine Similarity Revisited","code":"https://github.com/bgzh/dv_cosine_revisited","n_code_links":1,"syntology":null},{"rank_in_archive_order":26,"model":"Nyströmformer","metrics":{"Accuracy":"93.2"},"uses_additional_data":false,"paper_date":"2021-02-07","paper":"/paper/nystromformer-a-nystrom-based-algorithm-for","paper_url":"https://arxiv.org/abs/2102.03902v3","paper_title":"Nyströmformer: A Nyström-Based Algorithm for Approximating Self-Attention","code":"https://github.com/facebookresearch/xformers","n_code_links":10,"syntology":{"n_ran":1,"n_unverified":1,"n_samples":2,"n_pointer_only_licence":1}},{"rank_in_archive_order":27,"model":"Modified LMU (34M)","metrics":{"Accuracy":"93.20"},"uses_additional_data":false,"paper_date":"2021-02-22","paper":"/paper/parallelizing-legendre-memory-unit-training","paper_url":"https://arxiv.org/abs/2102.11417v2","paper_title":"Parallelizing Legendre Memory Unit Training","code":"https://github.com/hrshtv/pytorch-lmu","n_code_links":2,"syntology":null},{"rank_in_archive_order":28,"model":"DV-ngrams-cosine","metrics":{"Accuracy":"93.13"},"uses_additional_data":false,"paper_date":"2019-07-01","paper":"/paper/sentiment-classification-using-document","paper_url":"https://aclanthology.org/P19-2057","paper_title":"Sentiment Classification Using Document Embeddings Trained with Cosine Similarity","code":"https://github.com/tanthongtan/dv-cosine","n_code_links":2,"syntology":null},{"rank_in_archive_order":29,"model":"OCaTS (kNN & GPT-3.5-turbo","metrics":{"Accuracy":"93.06"},"uses_additional_data":false,"paper_date":"2023-10-20","paper":"/paper/cache-me-if-you-can-an-online-cost-aware","paper_url":"https://arxiv.org/abs/2310.13395v1","paper_title":"Cache me if you Can: an Online Cost-aware Teacher-Student framework to Reduce the Calls to Large Language Models","code":"https://github.com/stoyian/OCaTS","n_code_links":1,"syntology":{"n_ran":1,"n_unverified":0,"n_samples":1,"n_pointer_only_licence":0}},{"rank_in_archive_order":30,"model":"DistilBERT 66M","metrics":{"Accuracy":"92.82"},"uses_additional_data":false,"paper_date":"2019-10-02","paper":"/paper/distilbert-a-distilled-version-of-bert","paper_url":"https://arxiv.org/abs/1910.01108v4","paper_title":"DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lighter","code":"https://github.com/huggingface/transformers","n_code_links":37,"syntology":{"n_ran":19,"n_unverified":8,"n_samples":27,"n_pointer_only_licence":0}},{"rank_in_archive_order":31,"model":"GPT-2 Finetuned","metrics":{"Accuracy":"92.36"},"uses_additional_data":false,"paper_date":"2019-02-14","paper":"/paper/language-models-are-unsupervised-multitask","paper_url":"https://d4mucfpksywv.cloudfront.net/better-language-models/language-models.pdf","paper_title":"Language Models are Unsupervised Multitask Learners","code":"https://github.com/huggingface/transformers","n_code_links":21,"syntology":null},{"rank_in_archive_order":32,"model":"seq2-bown-CNN","metrics":{"Accuracy":"92.33"},"uses_additional_data":false,"paper_date":"2014-12-01","paper":"/paper/effective-use-of-word-order-for-text-1","paper_url":"http://arxiv.org/abs/1412.1058v2","paper_title":"Effective Use of Word Order for Text Categorization with Convolutional Neural Networks","code":"https://github.com/tensorflow/models","n_code_links":4,"syntology":null},{"rank_in_archive_order":33,"model":"BP-Transformer + GloVe","metrics":{"Accuracy":"92.12"},"uses_additional_data":false,"paper_date":"2019-11-11","paper":"/paper/bp-transformer-modelling-long-range-context","paper_url":"https://arxiv.org/abs/1911.04070v1","paper_title":"BP-Transformer: Modelling Long-Range Context via Binary Partitioning","code":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/transformer","n_code_links":2,"syntology":{"n_ran":0,"n_unverified":7,"n_samples":7,"n_pointer_only_licence":0}},{"rank_in_archive_order":34,"model":"BCN+Char+CoVe","metrics":{"Accuracy":"91.8"},"uses_additional_data":false,"paper_date":"2017-08-01","paper":"/paper/learned-in-translation-contextualized-word","paper_url":"http://arxiv.org/abs/1708.00107v2","paper_title":"Learned in Translation: Contextualized Word Vectors","code":"https://github.com/salesforce/cove","n_code_links":5,"syntology":{"n_ran":3,"n_unverified":0,"n_samples":3,"n_pointer_only_licence":2}},{"rank_in_archive_order":35,"model":"ToWE-SG","metrics":{"Accuracy":"90.8"},"uses_additional_data":false,"paper_date":"2018-08-01","paper":"/paper/task-oriented-word-embedding-for-text","paper_url":"https://aclanthology.org/C18-1172","paper_title":"Task-oriented Word Embedding for Text Classification","code":"https://github.com/qianliu0708/ToWE","n_code_links":1,"syntology":null},{"rank_in_archive_order":36,"model":"COSINE","metrics":{"Accuracy":"90.54"},"uses_additional_data":false,"paper_date":"2020-10-15","paper":"/paper/fine-tuning-pre-trained-language-model-with","paper_url":"https://arxiv.org/abs/2010.07835v3","paper_title":"Fine-Tuning Pre-trained Language Model with Weak Supervision: A Contrastive-Regularized Self-Training Approach","code":"https://github.com/yueyu1030/COSINE","n_code_links":1,"syntology":{"n_ran":0,"n_unverified":5,"n_samples":5,"n_pointer_only_licence":0}},{"rank_in_archive_order":37,"model":"LSTM with dynamic skip","metrics":{"Accuracy":"90.1"},"uses_additional_data":false,"paper_date":"2018-11-09","paper":"/paper/long-short-term-memory-with-dynamic-skip","paper_url":"http://arxiv.org/abs/1811.03873v1","paper_title":"Long Short-Term Memory with Dynamic Skip Connections","code":"https://github.com/lecholin/DynamicLSTM","n_code_links":1,"syntology":null},{"rank_in_archive_order":38,"model":"CNN+LSTM","metrics":{"Accuracy":"88.9"},"uses_additional_data":true,"paper_date":"2017-07-06","paper":"/paper/on-the-role-of-text-preprocessing-in-neural","paper_url":"http://arxiv.org/abs/1707.01780v3","paper_title":"On the Role of Text Preprocessing in Neural Network Architectures: An Evaluation Study on Text Categorization and Sentiment Analysis","code":"https://github.com/pedrada88/preproc-textclassification","n_code_links":3,"syntology":null},{"rank_in_archive_order":39,"model":"UnICORNN","metrics":{"Accuracy":"88.4"},"uses_additional_data":false,"paper_date":"2021-03-09","paper":"/paper/unicornn-a-recurrent-model-for-learning-very","paper_url":"https://arxiv.org/abs/2103.05487v2","paper_title":"UnICORNN: A recurrent model for learning very long time dependencies","code":"https://github.com/tk-rusch/unicornn","n_code_links":1,"syntology":{"n_ran":1,"n_unverified":0,"n_samples":1,"n_pointer_only_licence":1}},{"rank_in_archive_order":40,"model":"CfC","metrics":{"Accuracy":"88.4"},"uses_additional_data":false,"paper_date":"2021-06-25","paper":"/paper/closed-form-continuous-depth-models","paper_url":"https://arxiv.org/abs/2106.13898v2","paper_title":"Closed-form Continuous-time Neural Models","code":"https://github.com/raminmh/CfC","n_code_links":1,"syntology":{"n_ran":2,"n_unverified":8,"n_samples":10,"n_pointer_only_licence":0}},{"rank_in_archive_order":41,"model":"Doc2VecC","metrics":{"Accuracy":"88.3"},"uses_additional_data":false,"paper_date":"2017-07-08","paper":"/paper/efficient-vector-representation-for-documents","paper_url":"http://arxiv.org/abs/1707.02377v1","paper_title":"Efficient Vector Representation for Documents through Corruption","code":"https://github.com/mchen24/iclr2017","n_code_links":1,"syntology":null},{"rank_in_archive_order":42,"model":"Bert+ Wilson-Cowan model RNN","metrics":{"Accuracy":"87.46"},"uses_additional_data":false,"paper_date":"2024-06-24","paper":"/paper/learning-in-wilson-cowan-model-for","paper_url":"https://arxiv.org/abs/2406.16453v2","paper_title":"Learning in Wilson-Cowan model for metapopulation","code":"https://github.com/raffaelemarino/learning_in_wilsoncowan","n_code_links":1,"syntology":null},{"rank_in_archive_order":43,"model":"coRNN","metrics":{"Accuracy":"87.4%"},"uses_additional_data":false,"paper_date":"2020-10-02","paper":"/paper/coupled-oscillatory-recurrent-neural-network","paper_url":"https://arxiv.org/abs/2010.00951v2","paper_title":"Coupled Oscillatory Recurrent Neural Network (coRNN): An accurate and (gradient) stable architecture for learning long time dependencies","code":"https://github.com/tk-rusch/coRNN","n_code_links":1,"syntology":{"n_ran":1,"n_unverified":2,"n_samples":3,"n_pointer_only_licence":0}},{"rank_in_archive_order":44,"model":"S-LSTM","metrics":{"Accuracy":"87.15"},"uses_additional_data":true,"paper_date":"2018-05-07","paper":"/paper/sentence-state-lstm-for-text-representation","paper_url":"http://arxiv.org/abs/1805.02474v1","paper_title":"Sentence-State LSTM for Text Representation","code":"https://github.com/leuchine/S-LSTM","n_code_links":2,"syntology":{"n_ran":1,"n_unverified":0,"n_samples":1,"n_pointer_only_licence":1}},{"rank_in_archive_order":45,"model":"AlexNet [alexnet]","metrics":{"Accuracy":"87"},"uses_additional_data":false,"paper_date":"2021-06-23","paper":"/paper/classifying-textual-data-with-pre-trained","paper_url":"https://arxiv.org/abs/2106.12479v4","paper_title":"Classifying Textual Data with Pre-trained Vision Models through Transfer Learning and Data Transformations","code":"https://github.com/EddCBen/Classifying-Textual-Data-with-pretrained-Vision-Models-through-Transfer-Learning-and-Data-Transforms","n_code_links":1,"syntology":null},{"rank_in_archive_order":46,"model":"VGG16 [vgg16]","metrics":{"Accuracy":"86"},"uses_additional_data":false,"paper_date":"2021-06-23","paper":"/paper/classifying-textual-data-with-pre-trained","paper_url":"https://arxiv.org/abs/2106.12479v4","paper_title":"Classifying Textual Data with Pre-trained Vision Models through Transfer Learning and Data Transformations","code":"https://github.com/EddCBen/Classifying-Textual-Data-with-pretrained-Vision-Models-through-Transfer-Learning-and-Data-Transforms","n_code_links":1,"syntology":null},{"rank_in_archive_order":47,"model":"ResNext[resnext]","metrics":{"Accuracy":"85"},"uses_additional_data":false,"paper_date":"2021-06-23","paper":"/paper/classifying-textual-data-with-pre-trained","paper_url":"https://arxiv.org/abs/2106.12479v4","paper_title":"Classifying Textual Data with Pre-trained Vision Models through Transfer Learning and Data Transformations","code":"https://github.com/EddCBen/Classifying-Textual-Data-with-pretrained-Vision-Models-through-Transfer-Learning-and-Data-Transforms","n_code_links":1,"syntology":null},{"rank_in_archive_order":48,"model":"Standard DR-AGG","metrics":{"Accuracy":"45.1"},"uses_additional_data":true,"paper_date":"2018-06-05","paper":"/paper/information-aggregation-via-dynamic-routing","paper_url":"http://arxiv.org/abs/1806.01501v1","paper_title":"Information Aggregation via Dynamic Routing for Sequence Encoding","code":"https://github.com/FudanNLP/Capsule4TextClassification","n_code_links":2,"syntology":null},{"rank_in_archive_order":49,"model":"Reverse DR-AGG","metrics":{"Accuracy":"44.5"},"uses_additional_data":false,"paper_date":"2018-06-05","paper":"/paper/information-aggregation-via-dynamic-routing","paper_url":"http://arxiv.org/abs/1806.01501v1","paper_title":"Information Aggregation via Dynamic Routing for Sequence Encoding","code":"https://github.com/FudanNLP/Capsule4TextClassification","n_code_links":2,"syntology":null}],"since_archive":{"present":false,"note":"No Syntology-extracted rows are published in this build."},"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":21,"rows_with_any_sample_ran":17,"distinct_papers_with_graph_line":18,"distinct_papers_with_any_sample_ran":15,"samples_over_distinct_papers":{"n_ran":66,"n_unverified":106,"n_samples":172,"n_pointer_only_licence":28,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":87,"n_unverified":156,"n_samples":243,"n_pointer_only_licence":42,"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"}}}