{"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/better-fine-tuning-by-reducing","title":"Better Fine-Tuning by Reducing Representational Collapse","arxiv_id":"2008.03156","date":"2020-08-06","proceeding":"ICLR 2021 1","authors":["Armen Aghajanyan","Akshat Shrivastava","Anchit Gupta","Naman Goyal","Luke Zettlemoyer","Sonal Gupta"],"abstract":"Although widely adopted, existing approaches for fine-tuning pre-trained language models have been shown to be unstable across hyper-parameter settings, motivating recent work on trust region methods. In this paper, we present a simplified and efficient method rooted in trust region theory that replaces previously used adversarial objectives with parametric noise (sampling from either a normal or uniform distribution), thereby discouraging representation change during fine-tuning when possible without hurting performance. We also introduce a new analysis to motivate the use of trust region methods more generally, by studying representational collapse; the degradation of generalizable representations from pre-trained models as they are fine-tuned for a specific end task. Extensive experiments show that our fine-tuning method matches or exceeds the performance of previous trust region methods on a range of understanding and generation tasks (including DailyMail/CNN, Gigaword, Reddit TIFU, and the GLUE benchmark), while also being much faster. We also show that it is less prone to representation collapse; the pre-trained models maintain more generalizable representations every time they are fine-tuned.","url_abs":"https://arxiv.org/abs/2008.03156v1","url_pdf":"https://arxiv.org/pdf/2008.03156v1.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":"better-fine-tuning-by-reducing","repo_url":"https://github.com/pytorch/fairseq/tree/master/examples/rxf","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null},{"paper_slug":"better-fine-tuning-by-reducing","repo_url":"https://github.com/cliang1453/camero","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"better-fine-tuning-by-reducing","repo_url":"https://github.com/cosmoquester/2021-dialogue-summary-competition","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"abstractive-text-summarization","task_name":"Abstractive Text Summarization"},{"task_slug":"cross-lingual-natural-language-inference","task_name":"Cross-Lingual Natural Language Inference"},{"task_slug":"text-summarization","task_name":"Text Summarization"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/abstractive-text-summarization-on-cnn-daily","task":"Abstractive Text Summarization","dataset":"CNN / Daily Mail","model":"BART+R3F","rank_in_archive_order":14,"of":53,"metrics":{"ROUGE-1":"44.38","ROUGE-2":"21.53","ROUGE-L":"41.17"},"uses_additional_data":false},{"leaderboard":"/sota/cross-lingual-natural-language-inference-on","task":"Cross-Lingual Natural Language Inference","dataset":"XNLI Zero-Shot English-to-French","model":"XLM-R R4F","rank_in_archive_order":1,"of":3,"metrics":{"Accuracy":"84.7%"},"uses_additional_data":false},{"leaderboard":"/sota/cross-lingual-natural-language-inference-on-3","task":"Cross-Lingual Natural Language Inference","dataset":"XNLI Zero-Shot English-to-German","model":"XLM-R R4F","rank_in_archive_order":1,"of":4,"metrics":{"Accuracy":"84.2%"},"uses_additional_data":false},{"leaderboard":"/sota/cross-lingual-natural-language-inference-on-1","task":"Cross-Lingual Natural Language Inference","dataset":"XNLI Zero-Shot English-to-Spanish","model":"XLM-R R4F","rank_in_archive_order":1,"of":4,"metrics":{"Accuracy":"85.2%"},"uses_additional_data":false},{"leaderboard":"/sota/text-summarization-on-gigaword","task":"Text Summarization","dataset":"GigaWord","model":"BART-RXF","rank_in_archive_order":4,"of":41,"metrics":{"ROUGE-1":"40.45","ROUGE-2":"20.69","ROUGE-L":"36.56"},"uses_additional_data":false},{"leaderboard":"/sota/text-summarization-on-reddit-tifu","task":"Text Summarization","dataset":"Reddit TIFU","model":"BART+R3F","rank_in_archive_order":2,"of":5,"metrics":{"ROUGE-1":"30.31","ROUGE-2":"10.98","ROUGE-L":"24.74"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2008.03156","atlas_url":"https://app.syntology.ai/?focus=2008.03156","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":"2008.03156"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2008.03156\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2008.03156"},"call":"get_concepts_for_paper(arxiv_id=\"2008.03156\")"}],"by_repo":[{"repo":"pytorch/fairseq","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":3,"harvested_for":["2105.08206","2105.14850","2203.09163"],"harvested_for_calls":[{"arxiv_id":"2105.08206","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2105.08206"},"call":"get_harvested_code_for_paper(arxiv_id=\"2105.08206\")"},{"arxiv_id":"2105.14850","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2105.14850"},"call":"get_harvested_code_for_paper(arxiv_id=\"2105.14850\")"},{"arxiv_id":"2203.09163","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2203.09163"},"call":"get_harvested_code_for_paper(arxiv_id=\"2203.09163\")"}]},{"repo":"cliang1453/camero","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2204.06625"],"harvested_for_calls":[{"arxiv_id":"2204.06625","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2204.06625"},"call":"get_harvested_code_for_paper(arxiv_id=\"2204.06625\")"}]},{"repo":"cosmoquester/2021-dialogue-summary-competition","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":2,"harvested_for":["1910.13461","2106.14448"],"harvested_for_calls":[{"arxiv_id":"1910.13461","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1910.13461"},"call":"get_harvested_code_for_paper(arxiv_id=\"1910.13461\")"},{"arxiv_id":"2106.14448","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2106.14448"},"call":"get_harvested_code_for_paper(arxiv_id=\"2106.14448\")"}]}],"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":"b64be6868dfd2465faaaf7b0fa274ab248b970bf165016064954d2cd56a1290c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}