{"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-parameter-efficient-fine-tuning-is","title":"Few-Shot Parameter-Efficient Fine-Tuning is Better and Cheaper than In-Context Learning","arxiv_id":"2205.05638","date":"2022-05-11","proceeding":null,"authors":["Haokun Liu","Derek Tam","Mohammed Muqeeth","Jay Mohta","Tenghao Huang","Mohit Bansal","Colin Raffel"],"abstract":"Few-shot in-context learning (ICL) enables pre-trained language models to perform a previously-unseen task without any gradient-based training by feeding a small number of training examples as part of the input. ICL incurs substantial computational, memory, and storage costs because it involves processing all of the training examples every time a prediction is made. Parameter-efficient fine-tuning (PEFT) (e.g. adapter modules, prompt tuning, sparse update methods, etc.) offers an alternative paradigm where a small set of parameters are trained to enable a model to perform the new task. In this paper, we rigorously compare few-shot ICL and PEFT and demonstrate that the latter offers better accuracy as well as dramatically lower computational costs. Along the way, we introduce a new PEFT method called (IA)$^3$ that scales activations by learned vectors, attaining stronger performance while only introducing a relatively tiny amount of new parameters. We also propose a simple recipe based on the T0 model called T-Few that can be applied to new tasks without task-specific tuning or modifications. We validate the effectiveness of T-Few on completely unseen tasks by applying it to the RAFT benchmark, attaining super-human performance for the first time and outperforming the state-of-the-art by 6% absolute. All of the code used in our experiments is publicly available.","url_abs":"https://arxiv.org/abs/2205.05638v2","url_pdf":"https://arxiv.org/pdf/2205.05638v2.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-parameter-efficient-fine-tuning-is","repo_url":"https://github.com/r-three/t-few","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"few-shot-parameter-efficient-fine-tuning-is","repo_url":"https://github.com/kohakublueleaf/lycoris","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"few-shot-text-classification","task_name":"Few-Shot Text Classification"},{"task_slug":"in-context-learning","task_name":"In-Context Learning"},{"task_slug":"parameter-efficient-fine-tuning","task_name":"parameter-efficient fine-tuning"}],"methods":[{"method_slug":"adapter","method_name":"Adapter"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/few-shot-text-classification-on-raft","task":"Few-Shot Text Classification","dataset":"RAFT","model":"T-Few","rank_in_archive_order":1,"of":9,"metrics":{" Over":"0.95","ADE":"0.804","Avg":"0.758","B77":"0.695","NIS":"0.833","OSE":"0.676","SOT":"0.915","SRI":"0.508","TAI":"0.736","TC":"0.879","TEH":"0.586","ToS":"0.75"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2205.05638","atlas_url":"https://app.syntology.ai/?focus=2205.05638","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":"2205.05638"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2205.05638\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2205.05638"},"call":"get_concepts_for_paper(arxiv_id=\"2205.05638\")"}],"by_repo":[{"repo":"r-three/t-few","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2310.14198"],"harvested_for_calls":[{"arxiv_id":"2310.14198","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2310.14198"},"call":"get_harvested_code_for_paper(arxiv_id=\"2310.14198\")"}]},{"repo":"kohakublueleaf/lycoris","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":2,"harvested_for":["2108.06098","2210.07558"],"harvested_for_calls":[{"arxiv_id":"2108.06098","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2108.06098"},"call":"get_harvested_code_for_paper(arxiv_id=\"2108.06098\")"},{"arxiv_id":"2210.07558","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2210.07558"},"call":"get_harvested_code_for_paper(arxiv_id=\"2210.07558\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"4063cb33e3b391b371e2d291c8cfe9d5441acdc8ccd2bd0bb060fe9c7a0d5d46","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}