{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/few-shot-text-classification","name":"Few-Shot Text Classification","slug":"few-shot-text-classification","description_markdown":"Few-shot Text Classification predicts the semantic label of a given text with a handful of supporting instances [1](https://aclanthology.org/2022.emnlp-main.87)","categories":[{"name":"Natural Language Processing","url":"/area/natural-language-processing"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":100,"papers_with_code":46,"benchmarks":8,"benchmark_tables_in_archive":8,"benchmark_tables_shown":8,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":4,"subtasks":1,"parent_tasks":1},"benchmarks":[{"leaderboard":"/sota/few-shot-text-classification-on-raft","slug":"few-shot-text-classification-on-raft","dataset":"RAFT","dataset_url":"/dataset/raft","rows_in_archive":9,"metrics":["Avg","ADE","B77","NIS","OSE"," Over","SOT","SRI","TAI","ToS","TEH","TC"],"first_row_in_archive_order":{"model":"T-Few","paper_title":"Few-Shot Parameter-Efficient Fine-Tuning is Better and Cheaper than In-Context Learning","paper_url":"/paper/few-shot-parameter-efficient-fine-tuning-is","paper_date":"2022-05-11","arxiv_id":"2205.05638","code_links":[{"title":"kohakublueleaf/lycoris","url":"https://github.com/kohakublueleaf/lycoris"},{"title":"r-three/t-few","url":"https://github.com/r-three/t-few"}],"syntology":null}},{"leaderboard":"/sota/few-shot-text-classification-on-average-on","slug":"few-shot-text-classification-on-average-on","dataset":"Average on NLP datasets","dataset_url":null,"rows_in_archive":4,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"SetFit + OCD(5)","paper_title":"OCD: Learning to Overfit with Conditional Diffusion Models","paper_url":"/paper/ocd-learning-to-overfit-with-conditional","paper_date":"2022-10-02","arxiv_id":"2210.00471","code_links":[{"title":"shaharlutatipersonal/ocd","url":"https://github.com/shaharlutatipersonal/ocd"}],"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 2 unverified","sample_list":"/paper/ocd-learning-to-overfit-with-conditional#ran","syntology_url":"https://syntology.ai/paper/2210.00471","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.00471"}},"official":{"repos":["shaharlutatipersonal/ocd"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}}},{"leaderboard":"/sota/few-shot-text-classification-on-amazon","slug":"few-shot-text-classification-on-amazon","dataset":"Amazon Counterfeit","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"SetFit + OCD","paper_title":"OCD: Learning to Overfit with Conditional Diffusion Models","paper_url":"/paper/ocd-learning-to-overfit-with-conditional","paper_date":"2022-10-02","arxiv_id":"2210.00471","code_links":[{"title":"shaharlutatipersonal/ocd","url":"https://github.com/shaharlutatipersonal/ocd"}],"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 2 unverified","sample_list":"/paper/ocd-learning-to-overfit-with-conditional#ran","syntology_url":"https://syntology.ai/paper/2210.00471","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.00471"}},"official":{"repos":["shaharlutatipersonal/ocd"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}}},{"leaderboard":"/sota/few-shot-text-classification-on-odic-10-way","slug":"few-shot-text-classification-on-odic-10-way","dataset":"ODIC 10-way (10-shot)","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"Induction Networks","paper_title":"Induction Networks for Few-Shot Text Classification","paper_url":"/paper/few-shot-text-classification-with-induction","paper_date":"2019-02-27","arxiv_id":"1902.10482","code_links":[{"title":"zhongyuchen/few-shot-text-classification","url":"https://github.com/zhongyuchen/few-shot-text-classification"},{"title":"laohur/RelationNet","url":"https://github.com/laohur/RelationNet"},{"title":"laohur/LearnToCompareText","url":"https://github.com/laohur/LearnToCompareText"},{"title":"hongshengxin/Induction_network","url":"https://github.com/hongshengxin/Induction_network"},{"title":"mhw32/prototransformer-public","url":"https://github.com/mhw32/prototransformer-public"}],"syntology":null}},{"leaderboard":"/sota/few-shot-text-classification-on-odic-10-way-5","slug":"few-shot-text-classification-on-odic-10-way-5","dataset":"ODIC 10-way (5-shot)","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"Induction Networks","paper_title":"Induction Networks for Few-Shot Text Classification","paper_url":"/paper/few-shot-text-classification-with-induction","paper_date":"2019-02-27","arxiv_id":"1902.10482","code_links":[{"title":"zhongyuchen/few-shot-text-classification","url":"https://github.com/zhongyuchen/few-shot-text-classification"},{"title":"laohur/RelationNet","url":"https://github.com/laohur/RelationNet"},{"title":"laohur/LearnToCompareText","url":"https://github.com/laohur/LearnToCompareText"},{"title":"hongshengxin/Induction_network","url":"https://github.com/hongshengxin/Induction_network"},{"title":"mhw32/prototransformer-public","url":"https://github.com/mhw32/prototransformer-public"}],"syntology":null}},{"leaderboard":"/sota/few-shot-text-classification-on-odic-5-way-10","slug":"few-shot-text-classification-on-odic-5-way-10","dataset":"ODIC 5-way (10-shot)","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"Induction Networks","paper_title":"Induction Networks for Few-Shot Text Classification","paper_url":"/paper/few-shot-text-classification-with-induction","paper_date":"2019-02-27","arxiv_id":"1902.10482","code_links":[{"title":"zhongyuchen/few-shot-text-classification","url":"https://github.com/zhongyuchen/few-shot-text-classification"},{"title":"laohur/RelationNet","url":"https://github.com/laohur/RelationNet"},{"title":"laohur/LearnToCompareText","url":"https://github.com/laohur/LearnToCompareText"},{"title":"hongshengxin/Induction_network","url":"https://github.com/hongshengxin/Induction_network"},{"title":"mhw32/prototransformer-public","url":"https://github.com/mhw32/prototransformer-public"}],"syntology":null}},{"leaderboard":"/sota/few-shot-text-classification-on-odic-5-way-5","slug":"few-shot-text-classification-on-odic-5-way-5","dataset":"ODIC 5-way (5-shot)","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"Induction Networks","paper_title":"Induction Networks for Few-Shot Text Classification","paper_url":"/paper/few-shot-text-classification-with-induction","paper_date":"2019-02-27","arxiv_id":"1902.10482","code_links":[{"title":"zhongyuchen/few-shot-text-classification","url":"https://github.com/zhongyuchen/few-shot-text-classification"},{"title":"laohur/RelationNet","url":"https://github.com/laohur/RelationNet"},{"title":"laohur/LearnToCompareText","url":"https://github.com/laohur/LearnToCompareText"},{"title":"hongshengxin/Induction_network","url":"https://github.com/hongshengxin/Induction_network"},{"title":"mhw32/prototransformer-public","url":"https://github.com/mhw32/prototransformer-public"}],"syntology":null}},{"leaderboard":"/sota/few-shot-text-classification-on-sst-5","slug":"few-shot-text-classification-on-sst-5","dataset":"SST-5","dataset_url":"/dataset/sst-5","rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"SetFit + OCD","paper_title":"OCD: Learning to Overfit with Conditional Diffusion Models","paper_url":"/paper/ocd-learning-to-overfit-with-conditional","paper_date":"2022-10-02","arxiv_id":"2210.00471","code_links":[{"title":"shaharlutatipersonal/ocd","url":"https://github.com/shaharlutatipersonal/ocd"}],"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 2 unverified","sample_list":"/paper/ocd-learning-to-overfit-with-conditional#ran","syntology_url":"https://syntology.ai/paper/2210.00471","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.00471"}},"official":{"repos":["shaharlutatipersonal/ocd"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}}}],"datasets":[{"url":"/dataset/sst","name":"SST","full_name":"Stanford Sentiment Treebank","num_papers_in_archive":2354},{"url":"/dataset/sst-5","name":"SST-5","full_name":"","num_papers_in_archive":338},{"url":"/dataset/raft","name":"RAFT","full_name":"Realworld Annotated Few-shot Tasks","num_papers_in_archive":18},{"url":"/dataset/events-classification-biotech","name":"Events classification - Biotech news","full_name":"","num_papers_in_archive":0}],"subtasks":[{"url":"/task/zero-shot-out-of-domain-detection","name":"Zero-Shot Out-of-Domain Detection"}],"parent_tasks":[{"url":"/task/text-classification","name":"Text Classification"}],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":1,"rows_per_page":100,"shown":100,"of":100,"of_with_code":46,"tagged_in_all":100,"counts":{"archive_papers_tagged":100,"with_a_code_link":46,"where_syntology_ran_a_sample":11,"not_listed_spam_title":0,"listed":100,"listed_where_code_ran":11,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":4,"every_run_a_failure_of_syntologys_instrument":7,"listed_with_a_run_with_no_instrument_failure":4,"listed_every_run_a_failure_of_syntologys_instrument":7,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/exploiting-cloze-questions-for-few-shot-text","slug":"exploiting-cloze-questions-for-few-shot-text","title":"Exploiting Cloze Questions for Few Shot Text Classification and Natural Language Inference","date":"2020-01-21","arxiv_id":"2001.07676","repositories_listed":6,"syntology":null},{"url":"/paper/few-shot-text-classification-with-induction","slug":"few-shot-text-classification-with-induction","title":"Induction Networks for Few-Shot Text Classification","date":"2019-02-27","arxiv_id":"1902.10482","repositories_listed":5,"syntology":null},{"url":"/paper/decoupling-knowledge-from-memorization","slug":"decoupling-knowledge-from-memorization","title":"Decoupling Knowledge from Memorization: Retrieval-augmented Prompt Learning","date":"2022-05-29","arxiv_id":"2205.14704","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/decoupling-knowledge-from-memorization#ran","syntology_url":"https://syntology.ai/paper/2205.14704","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.14704"}},"official":{"repos":["zjunlp/promptkg"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/few-shot-parameter-efficient-fine-tuning-is","slug":"few-shot-parameter-efficient-fine-tuning-is","title":"Few-Shot Parameter-Efficient Fine-Tuning is Better and Cheaper than In-Context Learning","date":"2022-05-11","arxiv_id":"2205.05638","repositories_listed":2,"syntology":null},{"url":"/paper/transprompt-towards-an-automatic-transferable","slug":"transprompt-towards-an-automatic-transferable","title":"TransPrompt: Towards an Automatic Transferable Prompting Framework for Few-shot Text Classification","date":"2021-11-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/knowledgeable-prompt-tuning-incorporating","slug":"knowledgeable-prompt-tuning-incorporating","title":"Knowledgeable Prompt-tuning: Incorporating Knowledge into Prompt Verbalizer for Text Classification","date":"2021-08-04","arxiv_id":"2108.02035","repositories_listed":2,"syntology":null},{"url":"/paper/automatically-identifying-words-that-can","slug":"automatically-identifying-words-that-can","title":"Automatically Identifying Words That Can Serve as Labels for Few-Shot Text Classification","date":"2020-10-26","arxiv_id":"2010.13641","repositories_listed":2,"syntology":null},{"url":"/paper/few-shot-text-classification-with","slug":"few-shot-text-classification-with","title":"Few-shot Text Classification with Distributional Signatures","date":"2019-08-16","arxiv_id":"1908.06039","repositories_listed":2,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/few-shot-text-classification-with#ran","syntology_url":"https://syntology.ai/paper/1908.06039","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.06039"}},"official":{"repos":["YujiaBao/Distributional-Signatures"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/diverse-few-shot-text-classification-with","slug":"diverse-few-shot-text-classification-with","title":"Diverse Few-Shot Text Classification with Multiple Metrics","date":"2018-05-19","arxiv_id":"1805.07513","repositories_listed":2,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":1,"n_instrument":4,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/diverse-few-shot-text-classification-with#ran","syntology_url":"https://syntology.ai/paper/1805.07513","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.07513"}},"official":{"repos":["Gorov/DiverseFewShot_Amazon"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/improve-meta-learning-for-few-shot-text","slug":"improve-meta-learning-for-few-shot-text","title":"Improve Meta-learning for Few-Shot Text Classification with All You Can Acquire from the Tasks","date":"2024-10-14","arxiv_id":"2410.10454","repositories_listed":1,"syntology":null},{"url":"/paper/evaluating-the-fairness-of-task-adaptive","slug":"evaluating-the-fairness-of-task-adaptive","title":"Evaluating the fairness of task-adaptive pretraining on unlabeled test data before few-shot text classification","date":"2024-09-30","arxiv_id":"2410.00179","repositories_listed":1,"syntology":null},{"url":"/paper/hard-prompts-made-interpretable-sparse","slug":"hard-prompts-made-interpretable-sparse","title":"Hard Prompts Made Interpretable: Sparse Entropy Regularization for Prompt Tuning with RL","date":"2024-07-20","arxiv_id":"2407.14733","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/hard-prompts-made-interpretable-sparse#ran","syntology_url":"https://syntology.ai/paper/2407.14733","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.14733"}},"official":{"repos":["youseob/pin"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/fpt-feature-prompt-tuning-for-few-shot","slug":"fpt-feature-prompt-tuning-for-few-shot","title":"FPT: Feature Prompt Tuning for Few-shot Readability Assessment","date":"2024-04-03","arxiv_id":"2404.02772","repositories_listed":1,"syntology":null},{"url":"/paper/riff-learning-to-rephrase-inputs-for-few-shot","slug":"riff-learning-to-rephrase-inputs-for-few-shot","title":"RIFF: Learning to Rephrase Inputs for Few-shot Fine-tuning of Language Models","date":"2024-03-04","arxiv_id":"2403.02271","repositories_listed":1,"syntology":null},{"url":"/paper/boosting-prompt-based-self-training-with","slug":"boosting-prompt-based-self-training-with","title":"Boosting Prompt-Based Self-Training With Mapping-Free Automatic Verbalizer for Multi-Class Classification","date":"2023-12-08","arxiv_id":"2312.04982","repositories_listed":1,"syntology":null},{"url":"/paper/evolutionary-verbalizer-search-for-prompt","slug":"evolutionary-verbalizer-search-for-prompt","title":"Evolutionary Verbalizer Search for Prompt-based Few Shot Text Classification","date":"2023-06-18","arxiv_id":"2306.10514","repositories_listed":1,"syntology":null},{"url":"/paper/metricprompt-prompting-model-as-a-relevance","slug":"metricprompt-prompting-model-as-a-relevance","title":"MetricPrompt: Prompting Model as a Relevance Metric for Few-shot Text Classification","date":"2023-06-15","arxiv_id":"2306.08892","repositories_listed":1,"syntology":null},{"url":"/paper/tart-improved-few-shot-text-classification","slug":"tart-improved-few-shot-text-classification","title":"TART: Improved Few-shot Text Classification Using Task-Adaptive Reference Transformation","date":"2023-06-03","arxiv_id":"2306.02175","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/tart-improved-few-shot-text-classification#ran","syntology_url":"https://syntology.ai/paper/2306.02175","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.02175"}},"official":{"repos":["slei109/tart"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/contrastnet-a-contrastive-learning-framework","slug":"contrastnet-a-contrastive-learning-framework","title":"ContrastNet: A Contrastive Learning Framework for Few-Shot Text Classification","date":"2023-05-16","arxiv_id":"2305.09269","repositories_listed":1,"syntology":null},{"url":"/paper/metatroll-few-shot-detection-of-state","slug":"metatroll-few-shot-detection-of-state","title":"MetaTroll: Few-shot Detection of State-Sponsored Trolls with Transformer Adapters","date":"2023-03-13","arxiv_id":"2303.07354","repositories_listed":1,"syntology":null},{"url":"/paper/like-a-good-nearest-neighbor-practical","slug":"like-a-good-nearest-neighbor-practical","title":"Like a Good Nearest Neighbor: Practical Content Moderation and Text Classification","date":"2023-02-17","arxiv_id":"2302.08957","repositories_listed":1,"syntology":null},{"url":"/paper/meta-learning-siamese-network-for-few-shot","slug":"meta-learning-siamese-network-for-few-shot","title":"Meta-Learning Siamese Network for Few-Shot Text Classification","date":"2023-02-05","arxiv_id":"2302.03507","repositories_listed":1,"syntology":null},{"url":"/paper/protsi-prototypical-siamese-network-with-data","slug":"protsi-prototypical-siamese-network-with-data","title":"ProtSi: Prototypical Siamese Network with Data Augmentation for Few-Shot Subjective Answer Evaluation","date":"2022-11-17","arxiv_id":"2211.09855","repositories_listed":1,"syntology":null},{"url":"/paper/ocd-learning-to-overfit-with-conditional","slug":"ocd-learning-to-overfit-with-conditional","title":"OCD: Learning to Overfit with Conditional Diffusion Models","date":"2022-10-02","arxiv_id":"2210.00471","repositories_listed":1,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 2 unverified","sample_list":"/paper/ocd-learning-to-overfit-with-conditional#ran","syntology_url":"https://syntology.ai/paper/2210.00471","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.00471"}},"official":{"repos":["shaharlutatipersonal/ocd"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"url":"/paper/efficient-few-shot-learning-without-prompts","slug":"efficient-few-shot-learning-without-prompts","title":"Efficient Few-Shot Learning Without Prompts","date":"2022-09-22","arxiv_id":"2209.11055","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/efficient-few-shot-learning-without-prompts#ran","syntology_url":"https://syntology.ai/paper/2209.11055","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.11055"}},"official":{"repos":["huggingface/setfit"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/adaptive-meta-learner-via-gradient-similarity","slug":"adaptive-meta-learner-via-gradient-similarity","title":"Adaptive Meta-learner via Gradient Similarity for Few-shot Text Classification","date":"2022-09-10","arxiv_id":"2209.04702","repositories_listed":1,"syntology":null},{"url":"/paper/pcc-paraphrasing-with-bottom-k-sampling-and","slug":"pcc-paraphrasing-with-bottom-k-sampling-and","title":"PCC: Paraphrasing with Bottom-k Sampling and Cyclic Learning for Curriculum Data Augmentation","date":"2022-08-17","arxiv_id":"2208.08110","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/pcc-paraphrasing-with-bottom-k-sampling-and#ran","syntology_url":"https://syntology.ai/paper/2208.08110","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.08110"}},"official":{"repos":["hongyuanluke/pcc"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/promptda-label-guided-data-augmentation-for","slug":"promptda-label-guided-data-augmentation-for","title":"PromptDA: Label-guided Data Augmentation for Prompt-based Few-shot Learners","date":"2022-05-18","arxiv_id":"2205.09229","repositories_listed":1,"syntology":null},{"url":"/paper/towards-unified-prompt-tuning-for-few-shot-1","slug":"towards-unified-prompt-tuning-for-few-shot-1","title":"Towards Unified Prompt Tuning for Few-shot Text Classification","date":"2022-05-11","arxiv_id":"2205.05313","repositories_listed":1,"syntology":null},{"url":"/paper/ascm-an-answer-space-clustered-prompting","slug":"ascm-an-answer-space-clustered-prompting","title":"ASCM: An Answer Space Clustered Prompting Method without Answer Engineering","date":"2022-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/label-semantic-aware-pre-training-for-few","slug":"label-semantic-aware-pre-training-for-few","title":"Label Semantic Aware Pre-training for Few-shot Text Classification","date":"2022-04-14","arxiv_id":"2204.07128","repositories_listed":1,"syntology":null},{"url":"/paper/automatic-multi-label-prompting-simple-and-1","slug":"automatic-multi-label-prompting-simple-and-1","title":"Automatic Multi-Label Prompting: Simple and Interpretable Few-Shot Classification","date":"2022-04-13","arxiv_id":"2204.06305","repositories_listed":1,"syntology":null},{"url":"/paper/few-shot-learning-with-siamese-networks-and-1","slug":"few-shot-learning-with-siamese-networks-and-1","title":"Few-Shot Learning with Siamese Networks and Label Tuning","date":"2022-03-28","arxiv_id":"2203.14655","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/few-shot-learning-with-siamese-networks-and-1#ran","syntology_url":"https://syntology.ai/paper/2203.14655","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.14655"}},"official":{"repos":["symanto-research/few-shot-learning-label-tuning"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/grad2task-improved-few-shot-text-1","slug":"grad2task-improved-few-shot-text-1","title":"Grad2Task: Improved Few-shot Text Classification Using Gradients for Task Representation","date":"2022-01-27","arxiv_id":"2201.11576","repositories_listed":1,"syntology":null},{"url":"/paper/good-examples-make-a-faster-learner-simple","slug":"good-examples-make-a-faster-learner-simple","title":"Good Examples Make A Faster Learner: Simple Demonstration-based Learning for Low-resource NER","date":"2021-10-16","arxiv_id":"2110.08454","repositories_listed":1,"syntology":null},{"url":"/paper/raft-a-real-world-few-shot-text","slug":"raft-a-real-world-few-shot-text","title":"RAFT: A Real-World Few-Shot Text Classification Benchmark","date":"2021-09-28","arxiv_id":"2109.14076","repositories_listed":1,"syntology":null},{"url":"/paper/protoinfomax-prototypical-networks-with","slug":"protoinfomax-prototypical-networks-with","title":"ProtoInfoMax: Prototypical Networks with Mutual Information Maximization for Out-of-Domain Detection","date":"2021-08-27","arxiv_id":"2108.12229","repositories_listed":1,"syntology":null},{"url":"/paper/noisy-channel-language-model-prompting-for","slug":"noisy-channel-language-model-prompting-for","title":"Noisy Channel Language Model Prompting for Few-Shot Text Classification","date":"2021-08-09","arxiv_id":"2108.04106","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/noisy-channel-language-model-prompting-for#ran","syntology_url":"https://syntology.ai/paper/2108.04106","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.04106"}},"official":{"repos":["shmsw25/Channel-LM-Prompting"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/distinct-label-representations-for-few-shot","slug":"distinct-label-representations-for-few-shot","title":"Distinct Label Representations for Few-Shot Text Classification","date":"2021-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/dont-miss-the-labels-label-semantic-augmented","slug":"dont-miss-the-labels-label-semantic-augmented","title":"Don’t Miss the Labels: Label-semantic Augmented Meta-Learner for Few-Shot Text Classification","date":"2021-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/meta-learning-adversarial-domain-adaptation","slug":"meta-learning-adversarial-domain-adaptation","title":"Meta-Learning Adversarial Domain Adaptation Network for Few-Shot Text Classification","date":"2021-07-26","arxiv_id":"2107.12262","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/meta-learning-adversarial-domain-adaptation#ran","syntology_url":"https://syntology.ai/paper/2107.12262","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.12262"}},"official":{"repos":["hccngu/MLADA"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/incremental-few-shot-text-classification-with","slug":"incremental-few-shot-text-classification-with","title":"Incremental Few-shot Text Classification with Multi-round New Classes: Formulation, Dataset and System","date":"2021-04-24","arxiv_id":"2104.11882","repositories_listed":1,"syntology":null},{"url":"/paper/exploiting-cloze-questions-for-few-shot-text-1","slug":"exploiting-cloze-questions-for-few-shot-text-1","title":"Exploiting Cloze-Questions for Few-Shot Text Classification and Natural Language Inference","date":"2021-04-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/few-shot-text-classification-with-triplet","slug":"few-shot-text-classification-with-triplet","title":"Few-Shot Text Classification with Triplet Networks, Data Augmentation, and Curriculum Learning","date":"2021-03-12","arxiv_id":"2103.07552","repositories_listed":1,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/few-shot-text-classification-with-triplet#ran","syntology_url":"https://syntology.ai/paper/2103.07552","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.07552"}},"official":{"repos":["jasonwei20/triplet-loss"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/a-neural-few-shot-text-classification-reality","slug":"a-neural-few-shot-text-classification-reality","title":"A Neural Few-Shot Text Classification Reality Check","date":"2021-01-28","arxiv_id":"2101.12073","repositories_listed":1,"syntology":null},{"url":"/paper/few-shot-text-classification-with-pre-trained","slug":"few-shot-text-classification-with-pre-trained","title":"Few-Shot Text Classification with Pre-Trained Word Embeddings and a Human in the Loop","date":"2018-04-05","arxiv_id":"1804.02063","repositories_listed":1,"syntology":null},{"url":null,"slug":"towards-robust-few-shot-text-classification","title":"Towards Robust Few-Shot Text Classification Using Transformer Architectures and Dual Loss Strategies","date":"2025-05-09","arxiv_id":"2505.06145","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-hybrid-model-for-few-shot-text","title":"A Hybrid Model for Few-Shot Text Classification Using Transfer and Meta-Learning","date":"2025-02-13","arxiv_id":"2502.09086","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-based-retrieval-augmented-generation","title":"Graph-based Retrieval Augmented Generation for Dynamic Few-shot Text Classification","date":"2025-01-06","arxiv_id":"2501.02844","repositories_listed":0,"syntology":null},{"url":null,"slug":"tardis-text-augmentation-for-refining","title":"TARDiS : Text Augmentation for Refining Diversity and Separability","date":"2025-01-06","arxiv_id":"2501.02739","repositories_listed":0,"syntology":null},{"url":null,"slug":"label-template-based-few-shot-text","title":"Label-template based Few-Shot Text Classification with Contrastive Learning","date":"2024-12-13","arxiv_id":"2412.10110","repositories_listed":0,"syntology":null},{"url":null,"slug":"empirical-study-of-mutual-reinforcement","title":"Empirical Study of Mutual Reinforcement Effect and Application in Few-shot Text Classification Tasks via Prompt","date":"2024-10-13","arxiv_id":"2410.09745","repositories_listed":0,"syntology":null},{"url":null,"slug":"manual-verbalizer-enrichment-for-few-shot","title":"Manual Verbalizer Enrichment for Few-Shot Text Classification","date":"2024-10-08","arxiv_id":"2410.06173","repositories_listed":0,"syntology":null},{"url":null,"slug":"llm-generated-natural-language-meets-scaling","title":"LLM-Generated Natural Language Meets Scaling Laws: New Explorations and Data Augmentation Methods","date":"2024-06-29","arxiv_id":"2407.00322","repositories_listed":0,"syntology":null},{"url":null,"slug":"shortcuts-arising-from-contrast-effective-and","title":"Shortcuts Arising from Contrast: Effective and Covert Clean-Label Attacks in Prompt-Based Learning","date":"2024-03-30","arxiv_id":"2404.00461","repositories_listed":0,"syntology":null},{"url":null,"slug":"crosstune-black-box-few-shot-classification","title":"CrossTune: Black-Box Few-Shot Classification with Label Enhancement","date":"2024-03-19","arxiv_id":"2403.12468","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-soft-contrastive-learning-based-prompt","title":"A Soft Contrastive Learning-based Prompt Model for Few-shot Sentiment Analysis","date":"2023-12-16","arxiv_id":"2312.10479","repositories_listed":0,"syntology":null},{"url":null,"slug":"label-aware-automatic-verbalizer-for-few-shot","title":"Label-Aware Automatic Verbalizer for Few-Shot Text Classification","date":"2023-10-19","arxiv_id":"2310.12778","repositories_listed":0,"syntology":null},{"url":null,"slug":"byoc-personalized-few-shot-classification","title":"BYOC: Personalized Few-Shot Classification with Co-Authored Class Descriptions","date":"2023-10-09","arxiv_id":"2310.06111","repositories_listed":0,"syntology":null},{"url":null,"slug":"transprompt-v2-a-transferable-prompting","title":"TransPrompt v2: A Transferable Prompting Framework for Cross-task Text Classification","date":"2023-08-29","arxiv_id":"2308.15010","repositories_listed":0,"syntology":null},{"url":null,"slug":"breaking-the-bank-with-chatgpt-few-shot-text","title":"Breaking the Bank with ChatGPT: Few-Shot Text Classification for Finance","date":"2023-08-28","arxiv_id":"2308.14634","repositories_listed":0,"syntology":null},{"url":null,"slug":"emotion-conditioned-text-generation-through","title":"Emotion-Conditioned Text Generation through Automatic Prompt Optimization","date":"2023-08-09","arxiv_id":"2308.04857","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-black-box-few-shot-text","title":"Enhancing Black-Box Few-Shot Text Classification with Prompt-Based Data Augmentation","date":"2023-05-23","arxiv_id":"2305.13785","repositories_listed":0,"syntology":null},{"url":null,"slug":"self-evolution-learning-for-mixup-enhance","title":"Self-Evolution Learning for Mixup: Enhance Data Augmentation on Few-Shot Text Classification Tasks","date":"2023-05-22","arxiv_id":"2305.13547","repositories_listed":0,"syntology":null},{"url":null,"slug":"prompt-as-triggers-for-backdoor-attack","title":"Prompt as Triggers for Backdoor Attack: Examining the Vulnerability in Language Models","date":"2023-05-02","arxiv_id":"2305.01219","repositories_listed":0,"syntology":null},{"url":null,"slug":"boosting-few-shot-text-classification-via","title":"Boosting Few-Shot Text Classification via Distribution Estimation","date":"2023-03-26","arxiv_id":"2303.16764","repositories_listed":0,"syntology":null},{"url":null,"slug":"mask-guided-bert-for-few-shot-text","title":"Mask-guided BERT for Few Shot Text Classification","date":"2023-02-21","arxiv_id":"2302.10447","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-few-shot-performance-of-language","title":"Improving Few-Shot Performance of Language Models via Nearest Neighbor Calibration","date":"2022-12-05","arxiv_id":"2212.02216","repositories_listed":0,"syntology":null},{"url":null,"slug":"understanding-bloom-an-empirical-study-on","title":"Understanding BLOOM: An empirical study on diverse NLP tasks","date":"2022-11-27","arxiv_id":"2211.14865","repositories_listed":0,"syntology":null},{"url":null,"slug":"disentangling-task-relations-for-few-shot","title":"Disentangling Task Relations for Few-shot Text Classification via Self-Supervised Hierarchical Task Clustering","date":"2022-11-16","arxiv_id":"2211.08588","repositories_listed":0,"syntology":null},{"url":null,"slug":"stprompt-semantic-guided-and-task-driven","title":"STPrompt: Semantic-guided and Task-driven prompts for Effective Few-shot Classification","date":"2022-10-29","arxiv_id":"2210.16489","repositories_listed":0,"syntology":null},{"url":null,"slug":"discriminative-language-model-as-semantic","title":"Discriminative Language Model as Semantic Consistency Scorer for Prompt-based Few-Shot Text Classification","date":"2022-10-23","arxiv_id":"2210.12763","repositories_listed":0,"syntology":null},{"url":null,"slug":"meta-learning-pathologies-from-radiology","title":"Meta-learning Pathologies from Radiology Reports using Variance Aware Prototypical Networks","date":"2022-10-22","arxiv_id":"2210.13979","repositories_listed":0,"syntology":null},{"url":null,"slug":"metaslrcl-a-self-adaptive-learning-rate-and","title":"MetaSLRCL: A Self-Adaptive Learning Rate and Curriculum Learning Based Framework for Few-Shot Text Classification","date":"2022-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"sentence-aware-adversarial-meta-learning-for","title":"Sentence-aware Adversarial Meta-Learning for Few-Shot Text Classification","date":"2022-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"visual-prompt-tuning-for-few-shot-text","title":"Visual Prompt Tuning for Few-Shot Text Classification","date":"2022-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"few-shot-text-classification-with-dual","title":"Few-shot Text Classification with Dual Contrastive Consistency","date":"2022-09-29","arxiv_id":"2209.15069","repositories_listed":0,"syntology":null},{"url":null,"slug":"lea-meta-knowledge-driven-self-attentive","title":"LEA: Meta Knowledge-Driven Self-Attentive Document Embedding for Few-Shot Text Classification","date":"2022-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"eico-improving-few-shot-text-classification","title":"EICO: Improving Few-Shot Text Classification via Explicit and Implicit Consistency Regularization","date":"2022-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"mgimn-multi-grained-interactive-matching","title":"MGIMN: Multi-Grained Interactive Matching Network for Few-shot Text Classification","date":"2022-04-11","arxiv_id":"2204.04952","repositories_listed":0,"syntology":null},{"url":null,"slug":"lst-lexicon-guided-self-training-for-few-shot","title":"LST: Lexicon-Guided Self-Training for Few-Shot Text Classification","date":"2022-02-05","arxiv_id":"2202.02566","repositories_listed":0,"syntology":null},{"url":null,"slug":"label-guided-data-augmentation-for-prompt","title":"Label-guided Data Augmentation for Prompt-based Few Shot Learners","date":"2022-01-16","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"alp-data-augmentation-using-lexicalized-pcfgs","title":"ALP: Data Augmentation using Lexicalized PCFGs for Few-Shot Text Classification","date":"2021-12-16","arxiv_id":"2112.11916","repositories_listed":0,"syntology":null},{"url":null,"slug":"guiding-generative-language-models-for-data","title":"Guiding Generative Language Models for Data Augmentation in Few-Shot Text Classification","date":"2021-11-17","arxiv_id":"2111.09064","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-self-adaptive-learning-rate-and-curriculum","title":"A Self-Adaptive Learning Rate and Curriculum Learning Based Framework for Few-Shot Text Classification","date":"2021-11-16","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"good-examples-make-a-faster-learner-simple-1","title":"Good Examples Make A Faster Learner: Simple Demonstration-based Learning for Low-resource NER","date":"2021-11-16","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"knowledgeable-prompt-tuning-incorporating-1","title":"Knowledgeable Prompt-tuning: Incorporating Knowledge into Prompt Verbalizer for Text Classification","date":"2021-11-16","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"few-shot-learning-with-siamese-networks-and","title":"Few-Shot Learning with Siamese Networks and Label Tuning","date":"2021-10-16","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"automatic-multi-label-prompting-simple-and","title":"Automatic Multi-Label Prompting: Simple and Interpretable Few-Shot Classification","date":"2021-08-17","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"variance-reduced-first-order-meta-learning","title":"Variance-reduced First-order Meta-learning for Natural Language Processing Tasks","date":"2021-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"effective-few-shot-classification-with","title":"Effective Few-Shot Classification with Transfer Learning","date":"2020-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"few-shot-text-classification-with-edge","title":"Few-Shot Text Classification with Edge-Labeling Graph Neural Network-Based Prototypical Network","date":"2020-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"uncertainty-aware-self-training-for-few-shot","title":"Uncertainty-aware Self-training for Few-shot Text Classification","date":"2020-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"when-does-maml-work-the-best-an-empirical","title":"When does MAML Work the Best? An Empirical Study on Model-Agnostic Meta-Learning in NLP Applications","date":"2020-05-24","arxiv_id":"2005.11700","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-memory-induction-networks-for-few","title":"Dynamic Memory Induction Networks for Few-Shot Text Classification","date":"2020-05-12","arxiv_id":"2005.05727","repositories_listed":0,"syntology":null},{"url":null,"slug":"knowledge-guided-metric-learning-for-few-shot","title":"Knowledge Guided Metric Learning for Few-Shot Text Classification","date":"2020-04-04","arxiv_id":"2004.01907","repositories_listed":0,"syntology":null},{"url":null,"slug":"hierarchical-attention-prototypical-networks","title":"Hierarchical Attention Prototypical Networks for Few-Shot Text Classification","date":"2019-11-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-few-shot-text-classification-via","title":"When Low Resource NLP Meets Unsupervised Language Model: Meta-pretraining Then Meta-learning for Few-shot Text Classification","date":"2019-08-22","arxiv_id":"1908.08788","repositories_listed":0,"syntology":null},{"url":null,"slug":"attentive-task-agnostic-meta-learning-for-few","title":"Attentive Task-Agnostic Meta-Learning for Few-Shot Text Classification","date":"2019-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-importance-of-attention-in-meta","title":"On the Importance of Attention in Meta-Learning for Few-Shot Text Classification","date":"2018-06-03","arxiv_id":"1806.00852","repositories_listed":0,"syntology":null}],"syntology_records":12,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":1,"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/few-shot-text-classification-on-raft","since_archive":"/sota/few-shot-text-classification-on-raft#since-judged","papers_judged":1,"placed":0}]},"papers_where_code_ran":11,"papers_where_code_ran_first_page":"/task/few-shot-text-classification/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/task/few-shot-text-classification/papers/ran/1","json":"/task/few-shot-text-classification/papers/ran/1.json","rows":11}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper 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"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"17b41205079e498c3a43b6e52720b05a16068828fe761d5a1fe8d9703fac9403","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}