arXiv:2410.06567cs.LG2024-10被引 1

用凸优化压缩大模型,无需微调就能保持性能。

Convex Distillation: Efficient Compression of Deep Networks via Convex Optimization

  • 通过凸优化替代非凸激活,实现高效模型压缩。
  • 无需标签数据,压缩后无需微调,性能接近原模型。
  • 适合资源受限的边缘设备部署,尤其数据稀缺场景下更优。

在资源受限的边缘设备上部署大型复杂深度神经网络面临巨大挑战,因其计算需求高且传统压缩方法(如蒸馏和剪枝)常保留非凸性,导致实时微调困难。这些方法通常需要压缩后进行大量端到端微调以维持性能,既耗时又需完整标注数据集,可能抵消压缩优势。本文提出一种新型蒸馏技术,通过凸优化实现高效压缩:消除中间非凸激活函数,仅使用原始模型的中间激活值。该方法可在无标签数据环境下完成蒸馏,且压缩后无需任何后处理微调即可达到与原模型相当的性能。我们在多个标准图像分类数据集上验证了该方法的有效性,并进一步证明在数据有限情况下,其表现优于传统非凸蒸馏方法。该方法为在边缘设备上部署高效率、低开销模型提供了实用方案,当提供来自大型预训练非凸模型的丰富特征表示时,凸神经网络可达到与非凸模型相当的性能,为凸优化与深度学习的交叉研究开辟新路径。

原文摘要 · Abstract (English)

Deploying large and complex deep neural networks on resource-constrained edge devices poses significant challenges due to their computational demands and the complexities of non-convex optimization. Traditional compression methods such as distillation and pruning often retain non-convexity that complicates fine-tuning in real-time on such devices. Moreover, these methods often necessitate extensive end-to-end network fine-tuning after compression to preserve model performance, which is not only time-consuming but also requires fully annotated datasets, thus potentially negating the benefits of efficient network compression. In this paper, we introduce a novel distillation technique that efficiently compresses the model via convex optimization -- eliminating intermediate non-convex activation functions and using only intermediate activations from the original model. Our approach enables distillation in a label-free data setting and achieves performance comparable to the original model without requiring any post-compression fine-tuning. We demonstrate the effectiveness of our method for image classification models on multiple standard datasets, and further show that in the data limited regime, our method can outperform standard non-convex distillation approaches. Our method promises significant advantages for deploying high-efficiency, low-footprint models on edge devices, making it a practical choice for real-world applications. We show that convex neural networks, when provided with rich feature representations from a large pre-trained non-convex model, can achieve performance comparable to their non-convex counterparts, opening up avenues for future research at the intersection of convex optimization and deep learning.

模型压缩凸优化边缘部署无监督蒸馏

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。