TY - GEN
T1 - When Size Matters
T2 - 2025 China Automation Congress, CAC 2025
AU - Li, Fangyuan
AU - Kuang, Jiyuan
AU - Yao, Bowei
AU - Luo, Yiang
AU - Liu, Jianxing
N1 - Publisher Copyright:
© 2025 IEEE.
PY - 2025
Y1 - 2025
N2 - With the growing scale and application of large language models (LLMs), continual learning (CL) has become increasingly important for adapting to new tasks without forgetting previously acquired knowledge. However, conventional CL approaches often suffer from inefficiencies issues when applied to large models. Parameter-Efficient Fine-Tuning (PEFT), particularly methods like LoRA, offers a promising alternative by isolating task-specific knowledge through lightweight modules. Despite their advantages, PEFT-based CL methods face challenges in storage and computational efficiency as the number of tasks grows, especially when high-capacity modules are required for large datasets. To address these issues, we propose Binary Parameter-Efficient Fine-Tuning for Continual Learning (BP-CL), a novel method that combines the advantages of LoRA and binarized compression. BP-CL binarizes fine-tuned LoRA modules to significantly reduce storage costs while maintaining or even improving task performance. Additionally, a lightweight task allocation module enables accurate task routing with only a few exemplar samples, supporting dynamic task expansion without retraining other existing modules. We evaluate BP-CL on two widely-used benchmarks: SuperNI and Long Sequence Benchmark. Experimental results demonstrate that BP-CL not only achieves state-of-the-art performance but also offers a highly efficient solution for scalable and storage-friendly PEFT-based CL.
AB - With the growing scale and application of large language models (LLMs), continual learning (CL) has become increasingly important for adapting to new tasks without forgetting previously acquired knowledge. However, conventional CL approaches often suffer from inefficiencies issues when applied to large models. Parameter-Efficient Fine-Tuning (PEFT), particularly methods like LoRA, offers a promising alternative by isolating task-specific knowledge through lightweight modules. Despite their advantages, PEFT-based CL methods face challenges in storage and computational efficiency as the number of tasks grows, especially when high-capacity modules are required for large datasets. To address these issues, we propose Binary Parameter-Efficient Fine-Tuning for Continual Learning (BP-CL), a novel method that combines the advantages of LoRA and binarized compression. BP-CL binarizes fine-tuned LoRA modules to significantly reduce storage costs while maintaining or even improving task performance. Additionally, a lightweight task allocation module enables accurate task routing with only a few exemplar samples, supporting dynamic task expansion without retraining other existing modules. We evaluate BP-CL on two widely-used benchmarks: SuperNI and Long Sequence Benchmark. Experimental results demonstrate that BP-CL not only achieves state-of-the-art performance but also offers a highly efficient solution for scalable and storage-friendly PEFT-based CL.
KW - Binarized Compression
KW - Commodity Classification
KW - Continual Learning
KW - LLMs
KW - PEFT
UR - https://www.scopus.com/pages/publications/105041154275
U2 - 10.1109/CAC67268.2025.11487911
DO - 10.1109/CAC67268.2025.11487911
M3 - 会议稿件
AN - SCOPUS:105041154275
T3 - Proceedings - 2025 China Automation Congress, CAC 2025
SP - 848
EP - 853
BT - Proceedings - 2025 China Automation Congress, CAC 2025
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 26 September 2025 through 28 September 2025
ER -