{"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/specialized-language-models-with-cheap","title":"Need a Small Specialized Language Model? Plan Early!","arxiv_id":"2402.01093","date":"2024-02-02","proceeding":null,"authors":["David Grangier","Angelos Katharopoulos","Pierre Ablin","Awni Hannun"],"abstract":"Large language models are versatile tools but are not suitable for small inference budgets. Small models have more efficient inference, but their lower capacity means that their performance can be good only if one limits their scope to a specialized domain. This paper explores how to get good specialized small language models using a large, generic, pretraining set and a limited amount of specialized data. We consider two scenarios, depending on whether (i) one can afford pretraining a model for each specialization task, or (ii) one wants to cheaply adapt a single pretrained model for each task. In the first scenario, we propose an effective solution based on importance sampling: we resample the pretraining set to imitate the specialization data and train a small model on it. In the second scenario, we propose a novel architecture, projected networks (PN). PN is a large network whose parameters can be linearly projected into a small network for specialization. For both scenarios, we demonstrate the empirical effectiveness of our solutions across various domains, training set sizes, and training budgets.","url_abs":"https://arxiv.org/abs/2402.01093v2","url_pdf":"https://arxiv.org/pdf/2402.01093v2.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":[],"tasks":[{"task_slug":"language-modeling","task_name":"Language Modeling"},{"task_slug":"language-modelling","task_name":"Language Modelling"},{"task_slug":"model","task_name":"model"}],"methods":[{"method_slug":"set","method_name":"SET"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/language-modelling-on-the-pile","task":"Language Modelling","dataset":"The Pile","model":"Larger Transformer 771M (fine-tuned)","rank_in_archive_order":28,"of":39,"metrics":{"Test perplexity":"10"},"uses_additional_data":false},{"leaderboard":"/sota/language-modelling-on-the-pile","task":"Language Modelling","dataset":"The Pile","model":"Smaller Transformer 126M (fine-tuned)","rank_in_archive_order":33,"of":39,"metrics":{"Test perplexity":"12"},"uses_additional_data":false},{"leaderboard":"/sota/language-modelling-on-the-pile","task":"Language Modelling","dataset":"The Pile","model":"Larger Transformer 771M (pre-trained)","rank_in_archive_order":37,"of":39,"metrics":{"Test perplexity":"28.1"},"uses_additional_data":false},{"leaderboard":"/sota/language-modelling-on-the-pile","task":"Language Modelling","dataset":"The Pile","model":"Smaller Transformer 126M (pre-trained)","rank_in_archive_order":39,"of":39,"metrics":{"Test perplexity":"33"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2402.01093","atlas_url":"https://app.syntology.ai/?focus=2402.01093","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":"2402.01093"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2402.01093\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2402.01093"},"call":"get_concepts_for_paper(arxiv_id=\"2402.01093\")"}],"by_repo":[],"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":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"f9cfe8b196cc0359c5c5fb9415bd0790a931fa5a10ed4e322dbfe3420d3cd595","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}