Parameter-Efficient Fine-Tuning via Circular Convolution

Low-Rank Adaptation (LoRA) has gained popularity for fine-tuning large foundation models, leveraging low-rank matrices A and B to represent weight changes (i.e., W = BA).This method reduces trainable parameters and mitigates heavy memory consumption associated with full delta matrices by sequentially multiplying A and B with the activation.Despite its success, the intrinsic low-rank characteristic may limit its performance.Although several variants have been proposed to address this issue, they often overlook the crucial computational and memory efficiency brought by LoRA.In this paper, we propose Circular Convolution Adaptation (C 3 A), which not only achieves high-rank adaptation with enhanced performance but also excels in both computational power and memory utilization.Extensive experiments demonstrate that C 3 A consistently outperforms LoRA and its variants across various fine-tuning tasks.

Authors

Institutions

Publication Details

Published
2025-01-01
DOI
https://doi.org/10.18653/v1/2025.findings-acl.102
Primary Topic
Matrix Theory and Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Parameter-Efficient Fine-Tuning via Circular Convolution

Jia Li, Fugee Tsung, Yu Li, Zijing Liu et al.
Matrix Theory and Algorithms
article

Parameter-Efficient Fine-Tuning via Circular Convolution

Jia Li, Fugee Tsung, Yu Li, Zijing Liu, Jiashun Cheng, Aochuan Chen, Ziqi Gao
article en

Abstract

Low-Rank Adaptation (LoRA) has gained popularity for fine-tuning large foundation models, leveraging low-rank matrices A and B to represent weight changes (i.e., W = BA).This method reduces trainable parameters and mitigates heavy memory consumption associated with full delta matrices by sequentially multiplying A and B with the activation.Despite its success, the intrinsic low-rank characteristic may limit its performance.Although several variants have been proposed to address this issue, they often overlook the crucial computational and memory efficiency brought by LoRA.In this paper, we propose Circular Convolution Adaptation (C 3 A), which not only achieves high-rank adaptation with enhanced performance but also excels in both computational power and memory utilization.Extensive experiments demonstrate that C 3 A consistently outperforms LoRA and its variants across various fine-tuning tasks.

Hong Kong University of Science and Technology (HK), University of Hong Kong (HK)
Openalex Percentile: Top 79%
Matrix Theory and Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.