paperbot · PL 论文追踪

全部论文 待读 收藏

P2 ADMM-NN

ADMM-NN:深度神经网络算法-硬件协同优化框架
ASPLOS Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems2019匹配度 1/10 · 该论文研究 DNN 剪枝与量化的 ADMM 算法-硬件协同优化,属于模型压缩与体系结构方向;与用户关注的静态分析、Agentic/LLM 程序分析、浮点程序分析及贝叶斯程序分析均无直接交集。引用 165 inbox
Ao Ren, Tianyun Zhang, Shaokai Ye, Jiayu Li, Wenyao Xu, Xuehai Qian, Xue Lin, Yanzhi Wang
crossref: 2026-09-12

AI 速览

一句话:提出 ADMM-NN,首个用 ADMM 联合剪枝与量化并做硬件感知优化的 DNN 算法-硬件协同压缩框架。

深度神经网络部署需压缩模型以降低存储并加速计算。权重剪枝和量化分别利用权重数量与位表示的冗余,但缺乏系统联合框架,且剪枝的不规则稀疏会带来硬件开销。本文提出 ADMM-NN,首个基于交替方向乘子法(ADMM)的 DNN 算法-硬件协同优化框架:将剪枝与量化建模为带组合约束的非凸优化,ADMM 迭代动态更新正则化目标;并进行硬件感知优化,权衡计算/能耗收益与不规则稀疏开销,引入 break-even 剪枝比。评估显示,在 LeNet-5 和 AlexNet 上无精度损失达到 85× 和 24× 剪枝;联合量化后模型尺寸压缩 1,910× 和 231×,VGGNet、ResNet-50 上也有良好结果,并开源代码与模型。

问题
DNN 模型压缩中,权重剪枝与量化两种冗余来源缺乏系统性联合框架,且剪枝引入的不规则稀疏及其硬件性能开销常被忽略。
方法
提出基于 ADMM 的算法-硬件协同优化框架,将权重剪枝与量化联合建模,并通过硬件感知优化权衡计算/能耗收益与不规则稀疏开销,引入 break-even 剪枝比。
评估
在 LeNet-5/AlexNet 上无精度损失实现 85×/24× 剪枝和 1,910×/231× 联合模型尺寸压缩,并在 VGGNet/ResNet-50 上验证,代码模型开源。
原文摘要(Abstract)

Model compression is an important technique to facilitate efficient embedded and hardware implementations of deep neural networks (DNNs), a number of prior works are dedicated to model compression techniques. The target is to simultaneously reduce the model storage size and accelerate the computation, with minor effect on accuracy. Two important categories of DNN model compression techniques are weight pruning and weight quantization. The former leverages the redundancy in the number of weights, whereas the latter leverages the redundancy in bit representation of weights. These two sources of redundancy can be combined, thereby leading to a higher degree of DNN model compression. However, a systematic framework of joint weight pruning and quantization of DNNs is lacking, thereby limiting the available model compression ratio. Moreover, the computation reduction, energy efficiency improvement, and hardware performance overhead need to be accounted besides simply model size reduction, and the hardware performance overhead resulted from weight pruning method needs to be taken into consideration. To address these limitations, we present ADMM-NN, the first algorithm-hardware co-optimization framework of DNNs using Alternating Direction Method of Multipliers (ADMM), a powerful technique to solve non-convex optimization problems with possibly combinatorial constraints. The first part of ADMM-NN is a systematic, joint framework of DNN weight pruning and quantization using ADMM. It can be understood as a smart regularization technique with regularization target dynamically updated in each ADMM iteration, thereby resulting in higher performance in model compression than the state-of-the-art. The second part is hardware-aware DNN optimizations to facilitate hardware-level implementations. We perform ADMM-based weight pruning and quantization considering (i) the computation reduction and energy efficiency improvement, and (ii) the hardware performance overhead due to irregular sparsity. The first requirement prioritizes the convolutional layer compression over fully-connected layers, while the latter requires a concept of the break-even pruning ratio, defined as the minimum pruning ratio of a specific layer that results in no hardware performance degradation. Without accuracy loss, ADMM-NN achieves 85× and 24× pruning on LeNet-5 and AlexNet models, respectively, --- significantly higher than the state-of-the-art. The improvements become more significant when focusing on computation reduction. Combining weight pruning and quantization, we achieve 1,910× and 231× reductions in overall model size on these two benchmarks, when focusing on data storage. Highly promising results are also observed on other representative DNNs such as VGGNet and ResNet-50. We release codes and models at https://github.com/yeshaokai/admm-nn.

链接与引用

DOI 原文 · PDF(开放获取) ·

BibTeX
@inproceedings{paperbot4873,
  title = {ADMM-NN},
  author = {Ao Ren and Tianyun Zhang and Shaokai Ye and Jiayu Li and Wenyao Xu and Xuehai Qian and Xue Lin and Yanzhi Wang},
  booktitle = {ASPLOS},
  year = {2019},
  doi = {10.1145/3297858.3304076}
}