about
Parameter-Efficient Sparsity Crafting from Dense to Moe for Instruction Tuning (arxiv.org)
2 points by doodlesdev on Feb 6, 2024 | hide | past | pdf | discuss on HN

In plain words: A dense language model is split into several specialized sub-networks that share the work, with extra modules added to each instead of retraining its weights. This saves computing and memory, and the model beat regular and other sparse models, including GPT-3.5, at following instructions.

Abstract · Parameter-Efficient Sparsity Crafting from Dense to Mixture-of-Experts for Instruction Tuning on General Tasks

Large language models (LLMs) have demonstrated considerable proficiency in general natural language processing (NLP) tasks. Instruction tuning, a successful paradigm, enhances the ability of LLMs to follow natural language instructions and exhibit robust generalization across general tasks. However, these models often encounter performance limitations across multiple tasks due to constrained model capacity. Expanding this capacity during the instruction tuning phase poses significant challenges. To address this issue, we introduce parameter-efficient sparsity crafting (PESC), which crafts dense models into sparse models using the mixture-of-experts (MoE) architecture. PESC integrates adapters into the MoE layers of sparse models, differentiating experts without altering the individual weights within these layers. This method significantly reduces computational costs and GPU memory requirements, facilitating model capacity expansion through a minimal parameter increase when guaranteeing the quality of approximation in function space compared to original sparse upcycling. Our empirical evaluation demonstrates the effectiveness of the PESC method. Using PESC during instruction tuning, our best sparse model outperforms other sparse and dense models and exhibits superior general capabilities compared to GPT-3.5. Our code is available at https://github.com/wuhy68/Parameter-Efficient-MoE.

Haoyuan Wu, Haisheng Zheng, Zhuolun He, Bei Yu
arXiv:2401.02731 · cs.AI · submitted Jan 5, 2024 · updated Sep 24, 2024
abstract · pdf · html

add comment on HN