paper-with-me

홈 › Papers

SwitchLoRA: Switched Low-Rank Adaptation Can Learn Full-Rank Information

2024-06-03 · Kaiye Zhou, Shucheng Wang, Jun Xu

In the training of large language models, parameter-efficient techniques such as LoRA optimize memory usage and reduce communication overhead and memory usage during the fine-tuning phase. However, applying such techniques directly during the pre-training phase results in poor performance, primarily because the premature implementation of low-rank training significantly reduces model accuracy. Existing methods like ReLoRA and GaLore have attempted to address this challenge by updating the low-rank subspace. However, they still fall short of achieving the accuracy of full-rank training. Specifically, ReLoRA restricts the frequency of updates to preserve optimizer states consistency, hindering its ability to closely approximate full-rank training behavior. Meanwhile, GaLore relies on Singular Value Decomposition (SVD) to approximate the full-rank space, which introduces accuracy loss during the approximation process. In this paper, we introduce SwitchLoRA, a parameter-efficient training technique that frequently and smoothly replaces the trainable parameters of LoRA adapters with alternative parameters. SwitchLoRA updates the low-rank subspace incrementally, targeting only a few dimensions at a time to minimize the impact on optimizer states. This allows a higher update frequency, thereby enhancing accuracy by enabling the updated parameters to more closely mimic full-rank behavior during the pre-training phase. Our results demonstrate that SwitchLoRA actually surpasses full-rank training, reducing perplexity from 15.23 to 15.01 on the LLaMA 1.3B model, while also cutting communication overhead by 54\% and memory usage by 13\%. Furthermore, after full fine-tuning the SwitchLoRA pre-trained model and the full-rank pre-trained model on the GLUE benchmark, the SwitchLoRA pre-trained model showed an average accuracy gain of about 1\% over the full-rank pre-trained model.

📄 PDF Abstract BibTeX arXiv:2406.06564

Code (0)

등록된 구현이 없습니다.

Tasks

Language ModellingLarge Language Modelparameter-efficient fine-tuning

Methods 이 논문이 사용한 방법론

LLaMA LLaMA is a collection of foundation language models ranging from 7B to 65B parameters. It is based on the transformer architecture with various improvements that were…

Similar Papers 제목 키워드 기반

AsyncSwitch: Asynchronous Text-Speech Adaptation for Code-Switched ASR

2025-06-17 · Tuan Nguyen, Huy-Dat Tran

Developing code-switched ASR systems is challenging due to language ambiguity and limited exposure to multilingual, code-switched data, while collecting such speech is costly. Prior work generates synthetic audio from te…

Decoder

Reinforcement Learning for Data-Efficient Code-Switched ASR

2026-07-02 · Ziwei Ye, Peter Vickers arxiv

Audio-language models can be prompted for code-switched speech, but their decoding is not optimized for code-switching and often fails at language boundaries. We propose a practical reinforcement learning with verifiable…

Reinforcement Learning

Code-Switched Named Entity Recognition with Embedding Attention

2018-07-01 · WS 2018 7 · Changhan Wang, Kyunghyun Cho, Douwe Kiela

We describe our work for the CALCS 2018 shared task on named entity recognition on code-switched data. Our system ranked first place for MS Arabic-Egyptian named entity recognition and third place for English-Spanish.

Language Identificationnamed-entity-recognitionNamed Entity RecognitionNamed Entity Recognition (NER)+1

Boosting Zero-shot Cross-lingual Retrieval by Training on Artificially Code-Switched Data

2023-05-09 · Robert Litschko, Ekaterina Artemova, Barbara Plank

Transferring information retrieval (IR) models from a high-resource language (typically English) to other languages in a zero-shot fashion has become a widely adopted approach. In this work, we show that the effectivenes…

Cross-Lingual Word EmbeddingsInformation RetrievalRerankingRetrieval+1

Interval reduced-order switched positive observers for uncertain switched positive linear systems

2025-05-09 · Naohisa Otsuka, Daiki Kakehi, Przemysław Ignaciuk

In this paper, existence conditions and a design procedure of reduced-order switched positive observers for continuous- and discrete-time switched positive linear systems with uncertainty are established. In the analyzed…