{"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":"/paper/few-shot-text-classification-with-pre-trained","title":"Few-Shot Text Classification with Pre-Trained Word Embeddings and a Human in the Loop","arxiv_id":"1804.02063","date":"2018-04-05","proceeding":null,"authors":["Katherine Bailey","Sunny Chopra"],"abstract":"Most of the literature around text classification treats it as a supervised\nlearning problem: given a corpus of labeled documents, train a classifier such\nthat it can accurately predict the classes of unseen documents. In industry,\nhowever, it is not uncommon for a business to have entire corpora of documents\nwhere few or none have been classified, or where existing classifications have\nbecome meaningless. With web content, for example, poor taxonomy management can\nresult in labels being applied indiscriminately, making filtering by these\nlabels unhelpful. Our work aims to make it possible to classify an entire\ncorpus of unlabeled documents using a human-in-the-loop approach, where the\ncontent owner manually classifies just one or two documents per category and\nthe rest can be automatically classified. This \"few-shot\" learning approach\nrequires rich representations of the documents such that those that have been\nmanually labeled can be treated as prototypes, and automatic classification of\nthe rest is a simple case of measuring the distance to prototypes. This\napproach uses pre-trained word embeddings, where documents are represented\nusing a simple weighted average of constituent word embeddings. We have tested\nthe accuracy of the approach on existing labeled datasets and provide the\nresults here. We have also made code available for reproducing the results we\ngot on the 20 Newsgroups dataset.","url_abs":"http://arxiv.org/abs/1804.02063v1","url_pdf":"http://arxiv.org/pdf/1804.02063v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"few-shot-text-classification-with-pre-trained","repo_url":"https://github.com/katbailey/few-shot-text-classification","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"few-shot-learning","task_name":"Few-Shot Learning"},{"task_slug":"few-shot-text-classification","task_name":"Few-Shot Text Classification"},{"task_slug":"classification","task_name":"General Classification"},{"task_slug":"management","task_name":"Management"},{"task_slug":"text-classification","task_name":"Text Classification"},{"task_slug":"word-embeddings","task_name":"Word Embeddings"},{"task_slug":"text-classification-1","task_name":"text-classification"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1804.02063","atlas_url":"https://app.syntology.ai/?focus=1804.02063","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1804.02063"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1804.02063\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1804.02063"},"call":"get_concepts_for_paper(arxiv_id=\"1804.02063\")"}],"by_repo":[{"repo":"katbailey/few-shot-text-classification","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"61750e053af31a074563801c7134b7552ae913050708288b0ff42026fdbd3808","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}