{"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":"/dataset/ag-news","name":"AG News","full_name":"AG’s News Corpus","description_markdown":"**AG News** (**AG’s News Corpus**) is a subdataset of AG's corpus of news articles constructed by assembling titles and description fields of articles from the 4 largest classes (“World”, “Sports”, “Business”, “Sci/Tech”) of AG’s Corpus. The AG News contains 30,000 training and 1,900 test samples per class.\r\n\r\nSource: [https://arxiv.org/pdf/1509.01626.pdf](https://arxiv.org/pdf/1509.01626.pdf)","description_withheld":null,"homepage":"http://groups.di.unipi.it/~gulli/AG_corpus_of_news_articles.html","introduced_date":"2015-01-01","introduced_date_note":null,"introduced_by":{"paper":"/paper/character-level-convolutional-networks-for","title":"Character-level Convolutional Networks for Text Classification","first_author":"Xiang Zhang","url":null},"license":{"name":"Custom (non-commercial)","url":"http://groups.di.unipi.it/~gulli/AG_corpus_of_news_articles.html"},"modalities":[{"name":"Texts","url":"/datasets/modality/texts"}],"tasks":[{"name":"Text Classification","url":"/task/text-classification","datasets_with_task":"/datasets/task/text-classification"},{"name":"Anomaly Detection","url":"/task/anomaly-detection","datasets_with_task":"/datasets/task/anomaly-detection"},{"name":"Stochastic Optimization","url":"/task/stochastic-optimization","datasets_with_task":"/datasets/task/stochastic-optimization"},{"name":"Topic Models","url":"/task/topic-models","datasets_with_task":"/datasets/task/topic-models"},{"name":"Short Text Clustering","url":"/task/short-text-clustering","datasets_with_task":"/datasets/task/short-text-clustering"},{"name":"Unsupervised Text Classification","url":"/task/unsupervised-text-classification","datasets_with_task":"/datasets/task/unsupervised-text-classification"},{"name":"Continual Pretraining","url":"/task/continual-pretraining","datasets_with_task":"/datasets/task/continual-pretraining"},{"name":"Zero-Shot Text Classification","url":"/task/zero-shot-text-classification","datasets_with_task":"/datasets/task/zero-shot-text-classification"},{"name":"Semi-Supervised Text Classification","url":"/task/semi-supervised-text-classification-1","datasets_with_task":"/datasets/task/semi-supervised-text-classification-1"}],"languages":[{"name":"English","url":"/datasets/language/english"}],"variants":["AG News","AG News (200 Labels)","ag_news"],"data_loaders":[{"repo":"https://github.com/huggingface/datasets","url":"https://huggingface.co/datasets/wangrongsheng/ag_news","frameworks":["tf","pytorch","jax"]},{"repo":"https://github.com/huggingface/datasets","url":"https://huggingface.co/datasets/KETI-AIR/kor_ag_news","frameworks":["tf","pytorch","jax"]},{"repo":"https://github.com/huggingface/datasets","url":"https://huggingface.co/datasets/fancyzhx/ag_news","frameworks":["tf","pytorch","jax"]},{"repo":"https://github.com/huggingface/datasets","url":"https://huggingface.co/datasets/ag_news","frameworks":["tf","pytorch","jax"]},{"repo":"https://github.com/huggingface/datasets","url":"https://huggingface.co/datasets/pietrolesci/ag_news","frameworks":["tf","pytorch","jax"]},{"repo":"https://github.com/huggingface/datasets","url":"https://huggingface.co/datasets/KETI-AIR/ag_news","frameworks":["tf","pytorch","jax"]},{"repo":"https://github.com/tensorflow/datasets","url":"https://www.tensorflow.org/datasets/catalog/ag_news_subset","frameworks":["tf","jax"]},{"repo":"https://github.com/pytorch/text","url":"https://pytorch.org/text/stable/datasets.html#torchtext.datasets.AG_NEWS","frameworks":["pytorch"]}],"num_papers_in_archive":969,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/text-classification-on-ag-news","task":"Text Classification","dataset_variant":"AG News","rows":24,"metrics":["Error"],"first_row_in_archive_order":{"model":"XLNet","paper":"/paper/xlnet-generalized-autoregressive-pretraining","metrics":{"Error":"4.45"},"code_links":[{"title":"huggingface/transformers","url":"https://github.com/huggingface/transformers"},{"title":"PaddlePaddle/PaddleNLP","url":"https://github.com/PaddlePaddle/PaddleNLP/tree/develop/examples/language_model/xlnet"},{"title":"zihangdai/xlnet","url":"https://github.com/zihangdai/xlnet"},{"title":"kaushaltrivedi/fast-bert","url":"https://github.com/kaushaltrivedi/fast-bert"},{"title":"utterworks/fast-bert","url":"https://github.com/utterworks/fast-bert"},{"title":"graykode/xlnet-Pytorch","url":"https://github.com/graykode/xlnet-Pytorch"},{"title":"facebookresearch/anli","url":"https://github.com/facebookresearch/anli"},{"title":"lvyufeng/bert4ms","url":"https://github.com/lvyufeng/bert4ms/blob/master/bert4ms/models/xlnet.py"},{"title":"huggingface/xlnet","url":"https://github.com/huggingface/xlnet"},{"title":"cuhksz-nlp/SAPar","url":"https://github.com/cuhksz-nlp/SAPar"},{"title":"joshuaWang-bit/Textclassification-pytorch","url":"https://github.com/joshuaWang-bit/Textclassification-pytorch"},{"title":"fanchenyou/transformer-study","url":"https://github.com/fanchenyou/transformer-study"},{"title":"https-seyhan/BugAI","url":"https://github.com/https-seyhan/BugAI"},{"title":"NathanDuran/Sentence-Encoding-for-DA-Classification","url":"https://github.com/NathanDuran/Sentence-Encoding-for-DA-Classification"},{"title":"2miatran/Natural-Language-Processing","url":"https://github.com/2miatran/Natural-Language-Processing"},{"title":"chesterdu/contrastive_summary","url":"https://github.com/chesterdu/contrastive_summary"},{"title":"pauldevos/python-notes","url":"https://github.com/pauldevos/python-notes"},{"title":"pwc-1/Paper-9","url":"https://github.com/pwc-1/Paper-9/tree/main/5/xlnet"},{"title":"MindCode-4/code-5","url":"https://github.com/MindCode-4/code-5/tree/main/xlnet"},{"title":"pwc-1/Paper-9","url":"https://github.com/pwc-1/Paper-9/tree/main/1/xlnet"},{"title":"samwisegamjeee/pytorch-transformers","url":"https://github.com/samwisegamjeee/pytorch-transformers"},{"title":"SambhawDrag/XLNet.jl","url":"https://github.com/SambhawDrag/XLNet.jl"},{"title":"tomgoter/nlp_finalproject","url":"https://github.com/tomgoter/nlp_finalproject"},{"title":"MS-P3/code7","url":"https://github.com/MS-P3/code7/tree/main/xlnet"},{"title":"zaradana/Fast_BERT","url":"https://github.com/zaradana/Fast_BERT"},{"title":"jonahwinninghoff/Text-Summarization","url":"https://github.com/jonahwinninghoff/Text-Summarization"},{"title":"listenviolet/XLNet","url":"https://github.com/listenviolet/XLNet"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/topic-models-on-ag-news","task":"Topic Models","dataset_variant":"AG News","rows":6,"metrics":["C_v","NPMI"],"first_row_in_archive_order":{"model":"vONTSS","paper":"/paper/vontss-vmf-based-semi-supervised-neural-topic","metrics":{"C_v":"0.49","NPMI":"0.054"},"code_links":[]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/semi-supervised-text-classification-on-ag-1","task":"Semi-Supervised Text Classification","dataset_variant":"AG News (200 Labels)","rows":3,"metrics":["Accuracy (%)"],"first_row_in_archive_order":{"model":"FlowGMM","paper":"/paper/semi-supervised-learning-with-normalizing-1","metrics":{"Accuracy (%)":"82.1"},"code_links":[{"title":"izmailovpavel/flowgmm","url":"https://github.com/izmailovpavel/flowgmm"},{"title":"sadrasafa/FlowGMM-Julia","url":"https://github.com/sadrasafa/FlowGMM-Julia"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/unsupervised-text-classification-on-ag-news","task":"Unsupervised Text Classification","dataset_variant":"AG News","rows":2,"metrics":["F1 score","F1-score"],"first_row_in_archive_order":{"model":"Lbl2Vec","paper":"/paper/lbl2vec-an-embedding-based-approach-for","metrics":{"F1 score":"82.7"},"code_links":[{"title":"sebischair/lbl2vec","url":"https://github.com/sebischair/lbl2vec"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/anomaly-detection-on-ag-news","task":"Anomaly Detection","dataset_variant":"AG News","rows":1,"metrics":["AUROC"],"first_row_in_archive_order":{"model":"DATE","paper":"/paper/date-detecting-anomalies-in-text-via-self","metrics":{"AUROC":"90"},"code_links":[{"title":"bit-ml/date","url":"https://github.com/bit-ml/date"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/continual-pretraining-on-ag-news","task":"Continual Pretraining","dataset_variant":"AG News","rows":1,"metrics":["F1 - macro"],"first_row_in_archive_order":{"model":"CPT","paper":"/paper/continual-training-of-language-models-for-few","metrics":{"F1 - macro":"63.77"},"code_links":[{"title":"zixuanke/pycontinual","url":"https://github.com/zixuanke/pycontinual"},{"title":"UIC-Liu-Lab/ContinualLM","url":"https://github.com/UIC-Liu-Lab/ContinualLM"},{"title":"uic-liu-lab/cpt","url":"https://github.com/uic-liu-lab/cpt"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/short-text-clustering-on-ag-news","task":"Short Text Clustering","dataset_variant":"AG News","rows":1,"metrics":["Acc"],"first_row_in_archive_order":{"model":"SCCL","paper":"/paper/supporting-clustering-with-contrastive","metrics":{"Acc":"88.2"},"code_links":[{"title":"makcedward/nlpaug","url":"https://github.com/makcedward/nlpaug"},{"title":"amazon-research/sccl","url":"https://github.com/amazon-research/sccl"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/stochastic-optimization-on-ag-news","task":"Stochastic Optimization","dataset_variant":"AG News","rows":1,"metrics":["Accuracy (max)","Accuracy (mean)"],"first_row_in_archive_order":{"model":"Bert","paper":"/paper/mixing-adam-and-sgd-a-combined-optimization","metrics":{"Accuracy (max)":"93.99","Accuracy (mean)":"93.86"},"code_links":[{"title":"nicolalandro/multi_optimizer","url":"https://gitlab.com/nicolalandro/multi_optimizer"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/text-classification-on-ag-news-1","task":"Text Classification","dataset_variant":"ag_news","rows":0,"metrics":["Accuracy"],"first_row_in_archive_order":null,"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"}],"papers":{"order":"date (newest first), then slug","population":"every paper with a leaderboard row on this dataset's benchmarks (the benchmark-backed subset): the archive's own papers-using-this-dataset list was never published, so this is not that list; num_papers_in_archive is the archive's own count","page":1,"pages_in_order":1,"rows_per_page":100,"shown":35,"of":35,"counts":{"papers_with_a_benchmark_row":35,"with_a_code_link":32,"where_syntology_ran_a_sample":17,"not_listed_spam_title":0,"listed":35,"listed_where_code_ran":17,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":13,"every_run_a_failure_of_syntologys_instrument":4,"listed_with_a_run_with_no_instrument_failure":13,"listed_every_run_a_failure_of_syntologys_instrument":4,"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 with at least one leaderboard row on this dataset's benchmarks; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"paper":"/paper/capo-cost-aware-prompt-optimization","slug":"capo-cost-aware-prompt-optimization","title":"CAPO: Cost-Aware Prompt Optimization","date":"2025-04-22","arxiv_id":"2504.16005","rows_on_this_dataset":3,"code_links":2,"syntology":null},{"paper":"/paper/vontss-vmf-based-semi-supervised-neural-topic","slug":"vontss-vmf-based-semi-supervised-neural-topic","title":"vONTSS: vMF based semi-supervised neural topic modeling with optimal transport","date":"2023-07-03","arxiv_id":"2307.01226","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/evaluating-unsupervised-text-classification","slug":"evaluating-unsupervised-text-classification","title":"Evaluating Unsupervised Text Classification: Zero-shot and Similarity-based Approaches","date":"2022-11-29","arxiv_id":"2211.16285","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/lbl2vec-an-embedding-based-approach-for","slug":"lbl2vec-an-embedding-based-approach-for","title":"Lbl2Vec: An Embedding-Based Approach for Unsupervised Document Retrieval on Predefined Topics","date":"2022-10-12","arxiv_id":"2210.06023","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/continual-training-of-language-models-for-few","slug":"continual-training-of-language-models-for-few","title":"Continual Training of Language Models for Few-Shot Learning","date":"2022-10-11","arxiv_id":"2210.05549","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/date-detecting-anomalies-in-text-via-self","slug":"date-detecting-anomalies-in-text-via-self","title":"DATE: Detecting Anomalies in Text via Self-Supervision of Transformers","date":"2021-04-12","arxiv_id":"2104.05591","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/supporting-clustering-with-contrastive","slug":"supporting-clustering-with-contrastive","title":"Supporting Clustering with Contrastive Learning","date":"2021-03-24","arxiv_id":"2103.12953","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":1,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["amazon-research/sccl"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/supporting-clustering-with-contrastive#ran","syntology_url":"https://syntology.ai/paper/2103.12953","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.12953"}}}},{"paper":"/paper/mixing-adam-and-sgd-a-combined-optimization","slug":"mixing-adam-and-sgd-a-combined-optimization","title":"Mixing ADAM and SGD: a Combined Optimization Method","date":"2020-11-16","arxiv_id":"2011.08042","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/revisiting-lstm-networks-for-semi-supervised-1","slug":"revisiting-lstm-networks-for-semi-supervised-1","title":"Revisiting LSTM Networks for Semi-Supervised Text Classification via Mixed Objective Function","date":"2020-09-08","arxiv_id":"2009.04007","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":1,"pointer_only_for_licence":3,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/revisiting-lstm-networks-for-semi-supervised-1#ran","syntology_url":"https://syntology.ai/paper/2009.04007","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.04007"}}}},{"paper":"/paper/neural-sinkhorn-topic-model","slug":"neural-sinkhorn-topic-model","title":"Neural Topic Model via Optimal Transport","date":"2020-08-12","arxiv_id":"2008.13537","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["ethanhezhao/NeuralSinkhornTopicModel"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/neural-sinkhorn-topic-model#ran","syntology_url":"https://syntology.ai/paper/2008.13537","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.13537"}}}},{"paper":"/paper/semi-supervised-learning-with-normalizing-1","slug":"semi-supervised-learning-with-normalizing-1","title":"Semi-Supervised Learning with Normalizing Flows","date":"2019-12-30","arxiv_id":"1912.13025","rows_on_this_dataset":3,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["izmailovpavel/flowgmm"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/semi-supervised-learning-with-normalizing-1#ran","syntology_url":"https://syntology.ai/paper/1912.13025","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.13025"}}}},{"paper":"/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","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/topic-modeling-in-embedding-spaces","slug":"topic-modeling-in-embedding-spaces","title":"Topic Modeling in Embedding Spaces","date":"2019-07-08","arxiv_id":"1907.04907","rows_on_this_dataset":1,"code_links":12,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":13,"samples_ran":10,"samples_constructed":0,"samples_ran_checked":9,"samples_ran_instrument_failed":1,"samples_unverified":3,"pointer_only_for_licence":0,"official":{"repos":["adjidieng/ETM"],"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":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/topic-modeling-in-embedding-spaces#ran","syntology_url":"https://syntology.ai/paper/1907.04907","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.04907"}}}},{"paper":"/paper/xlnet-generalized-autoregressive-pretraining","slug":"xlnet-generalized-autoregressive-pretraining","title":"XLNet: Generalized Autoregressive Pretraining for Language Understanding","date":"2019-06-19","arxiv_id":"1906.08237","rows_on_this_dataset":1,"code_links":27,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":24,"samples_ran":15,"samples_constructed":2,"samples_ran_checked":10,"samples_ran_instrument_failed":5,"samples_unverified":9,"pointer_only_for_licence":4,"official":{"repos":["zihangdai/xlnet"],"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":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/xlnet-generalized-autoregressive-pretraining#ran","syntology_url":"https://syntology.ai/paper/1906.08237","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.08237"}}}},{"paper":"/paper/how-to-fine-tune-bert-for-text-classification","slug":"how-to-fine-tune-bert-for-text-classification","title":"How to Fine-Tune BERT for Text Classification?","date":"2019-05-14","arxiv_id":"1905.05583","rows_on_this_dataset":1,"code_links":15,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":18,"samples_ran":12,"samples_constructed":0,"samples_ran_checked":7,"samples_ran_instrument_failed":5,"samples_unverified":6,"pointer_only_for_licence":5,"official":{"repos":["xuyige/BERT4doc-Classification"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/how-to-fine-tune-bert-for-text-classification#ran","syntology_url":"https://syntology.ai/paper/1905.05583","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.05583"}}}},{"paper":"/paper/squeezed-very-deep-convolutional-neural","slug":"squeezed-very-deep-convolutional-neural","title":"Squeezed Very Deep Convolutional Neural Networks for Text Classification","date":"2019-01-28","arxiv_id":"1901.09821","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/learning-to-remember-more-with-less","slug":"learning-to-remember-more-with-less","title":"Learning to Remember More with Less Memorization","date":"2019-01-05","arxiv_id":"1901.01347","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/learning-to-remember-more-with-less#ran","syntology_url":"https://syntology.ai/paper/1901.01347","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.01347"}}}},{"paper":"/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","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":1,"pointer_only_for_licence":3,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/compositional-coding-capsule-network-with-k","slug":"compositional-coding-capsule-network-with-k","title":"Compositional Coding Capsule Network with K-Means Routing for Text Classification","date":"2018-10-22","arxiv_id":"1810.09177","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/spherical-latent-spaces-for-stable","slug":"spherical-latent-spaces-for-stable","title":"Spherical Latent Spaces for Stable Variational Autoencoders","date":"2018-08-31","arxiv_id":"1808.10805","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["jiacheng-xu/vmf_vae_nlp"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/spherical-latent-spaces-for-stable#ran","syntology_url":"https://syntology.ai/paper/1808.10805","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.10805"}}}},{"paper":"/paper/on-tree-based-neural-sentence-modeling","slug":"on-tree-based-neural-sentence-modeling","title":"On Tree-Based Neural Sentence Modeling","date":"2018-08-29","arxiv_id":"1808.09644","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["ExplorerFreda/TreeEnc"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/on-tree-based-neural-sentence-modeling#ran","syntology_url":"https://syntology.ai/paper/1808.09644","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.09644"}}}},{"paper":"/paper/task-oriented-word-embedding-for-text","slug":"task-oriented-word-embedding-for-text","title":"Task-oriented Word Embedding for Text Classification","date":"2018-08-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/disconnected-recurrent-neural-networks-for","slug":"disconnected-recurrent-neural-networks-for","title":"Disconnected Recurrent Neural Networks for Text Categorization","date":"2018-07-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/baseline-needs-more-love-on-simple-word","slug":"baseline-needs-more-love-on-simple-word","title":"Baseline Needs More Love: On Simple Word-Embedding-Based Models and Associated Pooling Mechanisms","date":"2018-05-24","arxiv_id":"1805.09843","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/abstractive-text-classification-using","slug":"abstractive-text-classification-using","title":"Abstractive Text Classification Using Sequence-to-convolution Neural Networks","date":"2018-05-20","arxiv_id":"1805.07745","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/joint-embedding-of-words-and-labels-for-text","slug":"joint-embedding-of-words-and-labels-for-text","title":"Joint Embedding of Words and Labels for Text Classification","date":"2018-05-10","arxiv_id":"1805.04174","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/investigating-capsule-networks-with-dynamic","slug":"investigating-capsule-networks-with-dynamic","title":"Investigating Capsule Networks with Dynamic Routing for Text Classification","date":"2018-03-29","arxiv_id":"1804.00538","rows_on_this_dataset":1,"code_links":4,"syntology":null},{"paper":"/paper/universal-language-model-fine-tuning-for-text","slug":"universal-language-model-fine-tuning-for-text","title":"Universal Language Model Fine-tuning for Text Classification","date":"2018-01-18","arxiv_id":"1801.06146","rows_on_this_dataset":1,"code_links":66,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":3,"pointer_only_for_licence":3,"official":{"repos":["fastai/fastai"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/universal-language-model-fine-tuning-for-text#ran","syntology_url":"https://syntology.ai/paper/1801.06146","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1801.06146"}}}},{"paper":"/paper/deep-pyramid-convolutional-neural-networks","slug":"deep-pyramid-convolutional-neural-networks","title":"Deep Pyramid Convolutional Neural Networks for Text Categorization","date":"2017-07-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/discovering-discrete-latent-topics-with","slug":"discovering-discrete-latent-topics-with","title":"Discovering Discrete Latent Topics with Neural Variational Inference","date":"2017-06-01","arxiv_id":"1706.00359","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/autoencoding-variational-inference-for-topic","slug":"autoencoding-variational-inference-for-topic","title":"Autoencoding Variational Inference For Topic Models","date":"2017-03-04","arxiv_id":"1703.01488","rows_on_this_dataset":1,"code_links":6,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":8,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":1,"samples_unverified":3,"pointer_only_for_licence":1,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/autoencoding-variational-inference-for-topic#ran","syntology_url":"https://syntology.ai/paper/1703.01488","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.01488"}}}},{"paper":"/paper/bag-of-tricks-for-efficient-text","slug":"bag-of-tricks-for-efficient-text","title":"Bag of Tricks for Efficient Text Classification","date":"2016-07-06","arxiv_id":"1607.01759","rows_on_this_dataset":1,"code_links":65,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":9,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":2,"samples_unverified":6,"pointer_only_for_licence":2,"official":{"repos":["facebookresearch/fastText"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/bag-of-tricks-for-efficient-text#ran","syntology_url":"https://syntology.ai/paper/1607.01759","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1607.01759"}}}},{"paper":"/paper/very-deep-convolutional-networks-for-text","slug":"very-deep-convolutional-networks-for-text","title":"Very Deep Convolutional Networks for Text Classification","date":"2016-06-06","arxiv_id":"1606.01781","rows_on_this_dataset":1,"code_links":24,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":2,"samples_unverified":2,"pointer_only_for_licence":5,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/very-deep-convolutional-networks-for-text#ran","syntology_url":"https://syntology.ai/paper/1606.01781","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.01781"}}}},{"paper":"/paper/supervised-and-semi-supervised-text","slug":"supervised-and-semi-supervised-text","title":"Supervised and Semi-Supervised Text Categorization using LSTM for Region Embeddings","date":"2016-02-07","arxiv_id":"1602.02373","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/character-level-convolutional-networks-for","slug":"character-level-convolutional-networks-for","title":"Character-level Convolutional Networks for Text Classification","date":"2015-09-04","arxiv_id":"1509.01626","rows_on_this_dataset":1,"code_links":30,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":20,"samples_ran":17,"samples_constructed":0,"samples_ran_checked":13,"samples_ran_instrument_failed":4,"samples_unverified":3,"pointer_only_for_licence":5,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/character-level-convolutional-networks-for#ran","syntology_url":"https://syntology.ai/paper/1509.01626","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1509.01626"}}}}],"full_list":"papers_with_a_benchmark_row: every listed paper, in this order"},"papers_with_a_benchmark_row":[{"paper":"/paper/capo-cost-aware-prompt-optimization","slug":"capo-cost-aware-prompt-optimization","title":"CAPO: Cost-Aware Prompt Optimization","date":"2025-04-22","arxiv_id":"2504.16005","rows_on_this_dataset":3,"code_links":2,"syntology":null},{"paper":"/paper/vontss-vmf-based-semi-supervised-neural-topic","slug":"vontss-vmf-based-semi-supervised-neural-topic","title":"vONTSS: vMF based semi-supervised neural topic modeling with optimal transport","date":"2023-07-03","arxiv_id":"2307.01226","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/evaluating-unsupervised-text-classification","slug":"evaluating-unsupervised-text-classification","title":"Evaluating Unsupervised Text Classification: Zero-shot and Similarity-based Approaches","date":"2022-11-29","arxiv_id":"2211.16285","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/lbl2vec-an-embedding-based-approach-for","slug":"lbl2vec-an-embedding-based-approach-for","title":"Lbl2Vec: An Embedding-Based Approach for Unsupervised Document Retrieval on Predefined Topics","date":"2022-10-12","arxiv_id":"2210.06023","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/continual-training-of-language-models-for-few","slug":"continual-training-of-language-models-for-few","title":"Continual Training of Language Models for Few-Shot Learning","date":"2022-10-11","arxiv_id":"2210.05549","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/date-detecting-anomalies-in-text-via-self","slug":"date-detecting-anomalies-in-text-via-self","title":"DATE: Detecting Anomalies in Text via Self-Supervision of Transformers","date":"2021-04-12","arxiv_id":"2104.05591","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/supporting-clustering-with-contrastive","slug":"supporting-clustering-with-contrastive","title":"Supporting Clustering with Contrastive Learning","date":"2021-03-24","arxiv_id":"2103.12953","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":1,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["amazon-research/sccl"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/supporting-clustering-with-contrastive#ran","syntology_url":"https://syntology.ai/paper/2103.12953","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.12953"}}}},{"paper":"/paper/mixing-adam-and-sgd-a-combined-optimization","slug":"mixing-adam-and-sgd-a-combined-optimization","title":"Mixing ADAM and SGD: a Combined Optimization Method","date":"2020-11-16","arxiv_id":"2011.08042","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/revisiting-lstm-networks-for-semi-supervised-1","slug":"revisiting-lstm-networks-for-semi-supervised-1","title":"Revisiting LSTM Networks for Semi-Supervised Text Classification via Mixed Objective Function","date":"2020-09-08","arxiv_id":"2009.04007","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":1,"pointer_only_for_licence":3,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/revisiting-lstm-networks-for-semi-supervised-1#ran","syntology_url":"https://syntology.ai/paper/2009.04007","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.04007"}}}},{"paper":"/paper/neural-sinkhorn-topic-model","slug":"neural-sinkhorn-topic-model","title":"Neural Topic Model via Optimal Transport","date":"2020-08-12","arxiv_id":"2008.13537","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["ethanhezhao/NeuralSinkhornTopicModel"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/neural-sinkhorn-topic-model#ran","syntology_url":"https://syntology.ai/paper/2008.13537","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.13537"}}}},{"paper":"/paper/semi-supervised-learning-with-normalizing-1","slug":"semi-supervised-learning-with-normalizing-1","title":"Semi-Supervised Learning with Normalizing Flows","date":"2019-12-30","arxiv_id":"1912.13025","rows_on_this_dataset":3,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["izmailovpavel/flowgmm"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/semi-supervised-learning-with-normalizing-1#ran","syntology_url":"https://syntology.ai/paper/1912.13025","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.13025"}}}},{"paper":"/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","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/topic-modeling-in-embedding-spaces","slug":"topic-modeling-in-embedding-spaces","title":"Topic Modeling in Embedding Spaces","date":"2019-07-08","arxiv_id":"1907.04907","rows_on_this_dataset":1,"code_links":12,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":13,"samples_ran":10,"samples_constructed":0,"samples_ran_checked":9,"samples_ran_instrument_failed":1,"samples_unverified":3,"pointer_only_for_licence":0,"official":{"repos":["adjidieng/ETM"],"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":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/topic-modeling-in-embedding-spaces#ran","syntology_url":"https://syntology.ai/paper/1907.04907","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.04907"}}}},{"paper":"/paper/xlnet-generalized-autoregressive-pretraining","slug":"xlnet-generalized-autoregressive-pretraining","title":"XLNet: Generalized Autoregressive Pretraining for Language Understanding","date":"2019-06-19","arxiv_id":"1906.08237","rows_on_this_dataset":1,"code_links":27,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":24,"samples_ran":15,"samples_constructed":2,"samples_ran_checked":10,"samples_ran_instrument_failed":5,"samples_unverified":9,"pointer_only_for_licence":4,"official":{"repos":["zihangdai/xlnet"],"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":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/xlnet-generalized-autoregressive-pretraining#ran","syntology_url":"https://syntology.ai/paper/1906.08237","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.08237"}}}},{"paper":"/paper/how-to-fine-tune-bert-for-text-classification","slug":"how-to-fine-tune-bert-for-text-classification","title":"How to Fine-Tune BERT for Text Classification?","date":"2019-05-14","arxiv_id":"1905.05583","rows_on_this_dataset":1,"code_links":15,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":18,"samples_ran":12,"samples_constructed":0,"samples_ran_checked":7,"samples_ran_instrument_failed":5,"samples_unverified":6,"pointer_only_for_licence":5,"official":{"repos":["xuyige/BERT4doc-Classification"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/how-to-fine-tune-bert-for-text-classification#ran","syntology_url":"https://syntology.ai/paper/1905.05583","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.05583"}}}},{"paper":"/paper/squeezed-very-deep-convolutional-neural","slug":"squeezed-very-deep-convolutional-neural","title":"Squeezed Very Deep Convolutional Neural Networks for Text Classification","date":"2019-01-28","arxiv_id":"1901.09821","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/learning-to-remember-more-with-less","slug":"learning-to-remember-more-with-less","title":"Learning to Remember More with Less Memorization","date":"2019-01-05","arxiv_id":"1901.01347","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/learning-to-remember-more-with-less#ran","syntology_url":"https://syntology.ai/paper/1901.01347","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.01347"}}}},{"paper":"/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","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":1,"pointer_only_for_licence":3,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/compositional-coding-capsule-network-with-k","slug":"compositional-coding-capsule-network-with-k","title":"Compositional Coding Capsule Network with K-Means Routing for Text Classification","date":"2018-10-22","arxiv_id":"1810.09177","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/spherical-latent-spaces-for-stable","slug":"spherical-latent-spaces-for-stable","title":"Spherical Latent Spaces for Stable Variational Autoencoders","date":"2018-08-31","arxiv_id":"1808.10805","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["jiacheng-xu/vmf_vae_nlp"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/spherical-latent-spaces-for-stable#ran","syntology_url":"https://syntology.ai/paper/1808.10805","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.10805"}}}},{"paper":"/paper/on-tree-based-neural-sentence-modeling","slug":"on-tree-based-neural-sentence-modeling","title":"On Tree-Based Neural Sentence Modeling","date":"2018-08-29","arxiv_id":"1808.09644","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["ExplorerFreda/TreeEnc"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/on-tree-based-neural-sentence-modeling#ran","syntology_url":"https://syntology.ai/paper/1808.09644","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.09644"}}}},{"paper":"/paper/task-oriented-word-embedding-for-text","slug":"task-oriented-word-embedding-for-text","title":"Task-oriented Word Embedding for Text Classification","date":"2018-08-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/disconnected-recurrent-neural-networks-for","slug":"disconnected-recurrent-neural-networks-for","title":"Disconnected Recurrent Neural Networks for Text Categorization","date":"2018-07-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/baseline-needs-more-love-on-simple-word","slug":"baseline-needs-more-love-on-simple-word","title":"Baseline Needs More Love: On Simple Word-Embedding-Based Models and Associated Pooling Mechanisms","date":"2018-05-24","arxiv_id":"1805.09843","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/abstractive-text-classification-using","slug":"abstractive-text-classification-using","title":"Abstractive Text Classification Using Sequence-to-convolution Neural Networks","date":"2018-05-20","arxiv_id":"1805.07745","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/joint-embedding-of-words-and-labels-for-text","slug":"joint-embedding-of-words-and-labels-for-text","title":"Joint Embedding of Words and Labels for Text Classification","date":"2018-05-10","arxiv_id":"1805.04174","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/investigating-capsule-networks-with-dynamic","slug":"investigating-capsule-networks-with-dynamic","title":"Investigating Capsule Networks with Dynamic Routing for Text Classification","date":"2018-03-29","arxiv_id":"1804.00538","rows_on_this_dataset":1,"code_links":4,"syntology":null},{"paper":"/paper/universal-language-model-fine-tuning-for-text","slug":"universal-language-model-fine-tuning-for-text","title":"Universal Language Model Fine-tuning for Text Classification","date":"2018-01-18","arxiv_id":"1801.06146","rows_on_this_dataset":1,"code_links":66,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":3,"pointer_only_for_licence":3,"official":{"repos":["fastai/fastai"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/universal-language-model-fine-tuning-for-text#ran","syntology_url":"https://syntology.ai/paper/1801.06146","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1801.06146"}}}},{"paper":"/paper/deep-pyramid-convolutional-neural-networks","slug":"deep-pyramid-convolutional-neural-networks","title":"Deep Pyramid Convolutional Neural Networks for Text Categorization","date":"2017-07-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/discovering-discrete-latent-topics-with","slug":"discovering-discrete-latent-topics-with","title":"Discovering Discrete Latent Topics with Neural Variational Inference","date":"2017-06-01","arxiv_id":"1706.00359","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/autoencoding-variational-inference-for-topic","slug":"autoencoding-variational-inference-for-topic","title":"Autoencoding Variational Inference For Topic Models","date":"2017-03-04","arxiv_id":"1703.01488","rows_on_this_dataset":1,"code_links":6,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":8,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":1,"samples_unverified":3,"pointer_only_for_licence":1,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/autoencoding-variational-inference-for-topic#ran","syntology_url":"https://syntology.ai/paper/1703.01488","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.01488"}}}},{"paper":"/paper/bag-of-tricks-for-efficient-text","slug":"bag-of-tricks-for-efficient-text","title":"Bag of Tricks for Efficient Text Classification","date":"2016-07-06","arxiv_id":"1607.01759","rows_on_this_dataset":1,"code_links":65,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":9,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":2,"samples_unverified":6,"pointer_only_for_licence":2,"official":{"repos":["facebookresearch/fastText"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/bag-of-tricks-for-efficient-text#ran","syntology_url":"https://syntology.ai/paper/1607.01759","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1607.01759"}}}},{"paper":"/paper/very-deep-convolutional-networks-for-text","slug":"very-deep-convolutional-networks-for-text","title":"Very Deep Convolutional Networks for Text Classification","date":"2016-06-06","arxiv_id":"1606.01781","rows_on_this_dataset":1,"code_links":24,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":2,"samples_unverified":2,"pointer_only_for_licence":5,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/very-deep-convolutional-networks-for-text#ran","syntology_url":"https://syntology.ai/paper/1606.01781","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.01781"}}}},{"paper":"/paper/supervised-and-semi-supervised-text","slug":"supervised-and-semi-supervised-text","title":"Supervised and Semi-Supervised Text Categorization using LSTM for Region Embeddings","date":"2016-02-07","arxiv_id":"1602.02373","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/character-level-convolutional-networks-for","slug":"character-level-convolutional-networks-for","title":"Character-level Convolutional Networks for Text Classification","date":"2015-09-04","arxiv_id":"1509.01626","rows_on_this_dataset":1,"code_links":30,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":20,"samples_ran":17,"samples_constructed":0,"samples_ran_checked":13,"samples_ran_instrument_failed":4,"samples_unverified":3,"pointer_only_for_licence":5,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/character-level-convolutional-networks-for#ran","syntology_url":"https://syntology.ai/paper/1509.01626","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1509.01626"}}}}],"papers_where_code_ran":17,"papers_where_code_ran_first_page":"/dataset/ag-news/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this dataset or check it against this dataset's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/dataset/ag-news/papers/ran/1","json":"/dataset/ag-news/papers/ran/1.json","rows":17}],"row_route":"each paper's syntology object carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers","syntology_totals":{"read_at":"2026-10-05T00:36:11+00:00","papers_with_samples":17,"samples_harvested":127,"samples_ran":89,"samples_constructed":3,"samples_ran_checked":60,"samples_ran_instrument_failed":29,"samples_unverified":38,"pointer_only_for_licence":32,"papers_with_no_sample_that_ran":0,"papers_with_a_sample_that_ran":17,"papers_with_a_run_with_no_instrument_failure":13,"papers_where_every_run_was_an_instrument_failure":4,"note":"the per-paper counts of every listed paper (all pages), summed; not a rate"},"key_notes":{"samples_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'","samples_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)"},"since_archive_judged":{"papers":2,"papers_placed":0,"judged_by":{"model":"Claude Sonnet 4.5","models_as_recorded":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[{"leaderboard":"/sota/text-classification-on-ag-news","since_archive":"/sota/text-classification-on-ag-news#since-judged","papers_judged":2,"placed":0}]},"papers_note":"The archive never published its papers-using-dataset list; these are papers with a leaderboard row on this dataset's benchmarks.","record_sha256":"cff6e7576c4044c238e569a1e5cfeffacb07cd84644705e6a7426fec14263747","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}