Mixture of Efficient Diffusion Experts Through Automatic Interval and Sub-Network Selection

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Ganjdanesh, Alireza, Kang, Yan, Liu, Yuchen, Zhang, Richard, Lin, Zhe, Huang, Heng
Natura: Preprint
Pubblicazione: 2024
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866913514013065216
author Ganjdanesh, Alireza
Kang, Yan
Liu, Yuchen
Zhang, Richard
Lin, Zhe
Huang, Heng
author_facet Ganjdanesh, Alireza
Kang, Yan
Liu, Yuchen
Zhang, Richard
Lin, Zhe
Huang, Heng
contents Diffusion probabilistic models can generate high-quality samples. Yet, their sampling process requires numerous denoising steps, making it slow and computationally intensive. We propose to reduce the sampling cost by pruning a pretrained diffusion model into a mixture of efficient experts. First, we study the similarities between pairs of denoising timesteps, observing a natural clustering, even across different datasets. This suggests that rather than having a single model for all time steps, separate models can serve as ``experts'' for their respective time intervals. As such, we separately fine-tune the pretrained model on each interval, with elastic dimensions in depth and width, to obtain experts specialized in their corresponding denoising interval. To optimize the resource usage between experts, we introduce our Expert Routing Agent, which learns to select a set of proper network configurations. By doing so, our method can allocate the computing budget between the experts in an end-to-end manner without requiring manual heuristics. Finally, with a selected configuration, we fine-tune our pruned experts to obtain our mixture of efficient experts. We demonstrate the effectiveness of our method, DiffPruning, across several datasets, LSUN-Church, LSUN-Beds, FFHQ, and ImageNet, on the Latent Diffusion Model architecture.
format Preprint
id arxiv_https___arxiv_org_abs_2409_15557
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Mixture of Efficient Diffusion Experts Through Automatic Interval and Sub-Network Selection
Ganjdanesh, Alireza
Kang, Yan
Liu, Yuchen
Zhang, Richard
Lin, Zhe
Huang, Heng
Computer Vision and Pattern Recognition
Diffusion probabilistic models can generate high-quality samples. Yet, their sampling process requires numerous denoising steps, making it slow and computationally intensive. We propose to reduce the sampling cost by pruning a pretrained diffusion model into a mixture of efficient experts. First, we study the similarities between pairs of denoising timesteps, observing a natural clustering, even across different datasets. This suggests that rather than having a single model for all time steps, separate models can serve as ``experts'' for their respective time intervals. As such, we separately fine-tune the pretrained model on each interval, with elastic dimensions in depth and width, to obtain experts specialized in their corresponding denoising interval. To optimize the resource usage between experts, we introduce our Expert Routing Agent, which learns to select a set of proper network configurations. By doing so, our method can allocate the computing budget between the experts in an end-to-end manner without requiring manual heuristics. Finally, with a selected configuration, we fine-tune our pruned experts to obtain our mixture of efficient experts. We demonstrate the effectiveness of our method, DiffPruning, across several datasets, LSUN-Church, LSUN-Beds, FFHQ, and ImageNet, on the Latent Diffusion Model architecture.
title Mixture of Efficient Diffusion Experts Through Automatic Interval and Sub-Network Selection
topic Computer Vision and Pattern Recognition
url https://arxiv.org/abs/2409.15557