MoRe Fine-Tuning with 10x Fewer Parameters
원문 초록
Parameter-efficient fine-tuning (PEFT) techniques have unlocked the potential to cheaply and easily specialize large pretrained models. However, the most prominent approaches, like low-rank adapters (LoRA), depend on heuristics or rules-of-thumb for their architectural choices -- potentially limiting their performance for new models and architectures. This limitation suggests that techniques from neural architecture search could be used to obtain optimal adapter architectures, but these are often expensive and difficult to implement. We address this challenge with Monarch Rectangular Fine-tuning (MoRe), a simple framework to search over adapter architectures that relies on the Monarch matrix class. Theoretically, we show that MoRe is more expressive than LoRA. Empirically, our approach is more parameter-efficient and performant than state-of-the-art PEFTs on a range of tasks and models, with as few as 5\% of LoRA's parameters.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
LoSiA: Efficient High-Rank Fine-Tuning via Subnet Localization and Optimization
Detecting Referring Expressions in Visually Grounded Dialogue with Autoregressive Language Models
AnalogNAS-Bench: A NAS Benchmark for Analog In-Memory Computing
From Tiny Machine Learning to Tiny Deep Learning: A Survey
GuiLoMo: Allocating Expert Number and Rank for LoRA-MoE via Bilevel Optimization with GuidedSelection Vectors
AR-RAG: Autoregressive Retrieval Augmentation for Image Generation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.