Saved in:
| Main Authors: | , , , , , , , , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2410.16942 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910660739203072 |
|---|---|
| author | Zhu, Haowei Tang, Dehua Liu, Ji Lu, Mingjie Zheng, Jintu Peng, Jinzhang Li, Dong Wang, Yu Jiang, Fan Tian, Lu Tiwari, Spandan Sirasao, Ashish Yong, Jun-Hai Wang, Bin Barsoum, Emad |
| author_facet | Zhu, Haowei Tang, Dehua Liu, Ji Lu, Mingjie Zheng, Jintu Peng, Jinzhang Li, Dong Wang, Yu Jiang, Fan Tian, Lu Tiwari, Spandan Sirasao, Ashish Yong, Jun-Hai Wang, Bin Barsoum, Emad |
| contents | Diffusion models have achieved remarkable progress in the field of image generation due to their outstanding capabilities. However, these models require substantial computing resources because of the multi-step denoising process during inference. While traditional pruning methods have been employed to optimize these models, the retraining process necessitates large-scale training datasets and extensive computational costs to maintain generalization ability, making it neither convenient nor efficient. Recent studies attempt to utilize the similarity of features across adjacent denoising stages to reduce computational costs through simple and static strategies. However, these strategies cannot fully harness the potential of the similar feature patterns across adjacent timesteps. In this work, we propose a novel pruning method that derives an efficient diffusion model via a more intelligent and differentiable pruner. At the core of our approach is casting the model pruning process into a SubNet search process. Specifically, we first introduce a SuperNet based on standard diffusion via adding some backup connections built upon the similar features. We then construct a plugin pruner network and design optimization losses to identify redundant computation. Finally, our method can identify an optimal SubNet through few-step gradient optimization and a simple post-processing procedure. We conduct extensive experiments on various diffusion models including Stable Diffusion series and DiTs. Our DiP-GO approach achieves 4.4 x speedup for SD-1.5 without any loss of accuracy, significantly outperforming the previous state-of-the-art methods. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_16942 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | DiP-GO: A Diffusion Pruner via Few-step Gradient Optimization Zhu, Haowei Tang, Dehua Liu, Ji Lu, Mingjie Zheng, Jintu Peng, Jinzhang Li, Dong Wang, Yu Jiang, Fan Tian, Lu Tiwari, Spandan Sirasao, Ashish Yong, Jun-Hai Wang, Bin Barsoum, Emad Computer Vision and Pattern Recognition Diffusion models have achieved remarkable progress in the field of image generation due to their outstanding capabilities. However, these models require substantial computing resources because of the multi-step denoising process during inference. While traditional pruning methods have been employed to optimize these models, the retraining process necessitates large-scale training datasets and extensive computational costs to maintain generalization ability, making it neither convenient nor efficient. Recent studies attempt to utilize the similarity of features across adjacent denoising stages to reduce computational costs through simple and static strategies. However, these strategies cannot fully harness the potential of the similar feature patterns across adjacent timesteps. In this work, we propose a novel pruning method that derives an efficient diffusion model via a more intelligent and differentiable pruner. At the core of our approach is casting the model pruning process into a SubNet search process. Specifically, we first introduce a SuperNet based on standard diffusion via adding some backup connections built upon the similar features. We then construct a plugin pruner network and design optimization losses to identify redundant computation. Finally, our method can identify an optimal SubNet through few-step gradient optimization and a simple post-processing procedure. We conduct extensive experiments on various diffusion models including Stable Diffusion series and DiTs. Our DiP-GO approach achieves 4.4 x speedup for SD-1.5 without any loss of accuracy, significantly outperforming the previous state-of-the-art methods. |
| title | DiP-GO: A Diffusion Pruner via Few-step Gradient Optimization |
| topic | Computer Vision and Pattern Recognition |
| url | https://arxiv.org/abs/2410.16942 |