提出双阶段剪枝方法,让多模态大模型在保护隐私的同时高效微调。
Dual-Priv Pruning : Efficient Differential Private Fine-Tuning in Multimodal Large Language Models
- 通过视觉令牌和梯度更新双重剪枝,降低隐私噪声影响。
- 在保持高模型性能前提下,内存使用比标准DP-SGD更低。
- 适合需要隐私保护的多模态大模型部署场景。
差分隐私(DP)是保护特定任务数据隐私的常用技术,对大语言模型至关重要。然而其在多模态大语言模型(MLLMs)中的有效性仍不明确。应用DP会带来显著计算开销,尤其对处理大量文本和视觉数据的MLLMs而言尤为突出。此外,注入的噪声随参数量增大而增加,导致模型性能明显下降,隐私与效用之间的权衡使DP在复杂架构如MLLMs中难以应用。为此,我们提出Dual-Priv Pruning框架,采用两种互补剪枝机制实现MLLMs的高效差分隐私微调:(i) 视觉令牌剪枝,通过去除冗余视觉信息降低输入维度;(ii) DP优化过程中的梯度更新剪枝,根据噪声梯度大小选择性剔除参数更新,以缓解噪声影响并提升模型效用。实验表明,该方法在保持竞争力表现的同时,性能损失极小。计算效率方面,本方法始终比标准DP-SGD更节省内存;相比零阶方法(在A100 GPU上表现严重下降),仅多用1.74%内存,且在H20 GPU上展现出领先的内存效率。据我们所知,这是首个探索MLLMs差分隐私微调的工作。代码即将发布。
原文摘要 · Abstract (English)
Differential Privacy (DP) is a widely adopted technique, valued for its effectiveness in protecting the privacy of task-specific datasets, making it a critical tool for large language models. However, its effectiveness in Multimodal Large Language Models (MLLMs) remains uncertain. Applying Differential Privacy (DP) inherently introduces substantial computation overhead, a concern particularly relevant for MLLMs which process extensive textual and visual data. Furthermore, a critical challenge of DP is that the injected noise, necessary for privacy, scales with parameter dimensionality, leading to pronounced model degradation; This trade-off between privacy and utility complicates the application of Differential Privacy (DP) to complex architectures like MLLMs. To address these, we propose Dual-Priv Pruning, a framework that employs two complementary pruning mechanisms for DP fine-tuning in MLLMs: (i) visual token pruning to reduce input dimensionality by removing redundant visual information, and (ii) gradient-update pruning during the DP optimization process. This second mechanism selectively prunes parameter updates based on the magnitude of noisy gradients, aiming to mitigate noise impact and improve utility. Experiments demonstrate that our approach achieves competitive results with minimal performance degradation. In terms of computational efficiency, our approach consistently utilizes less memory than standard DP-SGD. While requiring only 1.74% more memory than zeroth-order methods which suffer from severe performance issues on A100 GPUs, our method demonstrates leading memory efficiency on H20 GPUs. To the best of our knowledge, we are the first to explore DP fine-tuning in MLLMs. Our code is coming soon.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。