{"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/reslora-identity-residual-mapping-in-low-rank","title":"ResLoRA: Identity Residual Mapping in Low-Rank Adaption","arxiv_id":"2402.18039","date":"2024-02-28","proceeding":null,"authors":["Shuhua Shi","Shaohan Huang","Minghui Song","Zhoujun Li","Zihan Zhang","Haizhen Huang","Furu Wei","Weiwei Deng","Feng Sun","Qi Zhang"],"abstract":"As one of the most popular parameter-efficient fine-tuning (PEFT) methods, low-rank adaptation (LoRA) is commonly applied to fine-tune large language models (LLMs). However, updating the weights of LoRA blocks effectively and expeditiously is challenging due to the long calculation path in the original model. To address this, we propose ResLoRA, an improved framework of LoRA. By adding residual paths during training and using merging approaches to eliminate these extra paths during inference, our method can achieve better results in fewer training steps without any extra trainable parameters or inference cost compared to LoRA. The experiments on NLG, NLU, and text-to-image tasks demonstrate the effectiveness of our method. To the best of our knowledge, ResLoRA is the first work that combines the residual path with LoRA. The code of our method is available at https://github.com/microsoft/LMOps/tree/main/reslora .","url_abs":"https://arxiv.org/abs/2402.18039v1","url_pdf":"https://arxiv.org/pdf/2402.18039v1.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":"reslora-identity-residual-mapping-in-low-rank","repo_url":"https://github.com/microsoft/lmops","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"jax","reach":null}],"tasks":[{"task_slug":"parameter-efficient-fine-tuning","task_name":"parameter-efficient fine-tuning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2402.18039","atlas_url":"https://app.syntology.ai/?focus=2402.18039","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.18039"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2402.18039\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2402.18039"},"call":"get_concepts_for_paper(arxiv_id=\"2402.18039\")"}],"by_repo":[{"repo":"microsoft/lmops","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":5,"harvested_for":["2212.09611","2305.03495","2309.09530","2402.03898","2406.14491"],"harvested_for_calls":[{"arxiv_id":"2212.09611","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2212.09611"},"call":"get_harvested_code_for_paper(arxiv_id=\"2212.09611\")"},{"arxiv_id":"2305.03495","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2305.03495"},"call":"get_harvested_code_for_paper(arxiv_id=\"2305.03495\")"},{"arxiv_id":"2309.09530","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2309.09530"},"call":"get_harvested_code_for_paper(arxiv_id=\"2309.09530\")"},{"arxiv_id":"2402.03898","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2402.03898"},"call":"get_harvested_code_for_paper(arxiv_id=\"2402.03898\")"},{"arxiv_id":"2406.14491","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2406.14491"},"call":"get_harvested_code_for_paper(arxiv_id=\"2406.14491\")"}]}],"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":"0f4e880ab82312c6505bfe9ea4ca7d0e8082c15acec7ca2e35384d8c24fad297","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}