On Accelerating Diffusion-Based Sampling Processes via Improved Integration Approximation
Zhang, G; Niwa, K; Kleijn, WB
Date: 8 May 2024
Conference paper
Publisher
International Conference on Learning Representations (ICLR)
Abstract
A popular approach to sample a diffusion-based generative model is to solve an
ordinary differential equation (ODE). In existing samplers, the coefficients of the
ODE solvers are pre-determined by the ODE formulation, the reverse discrete
timesteps, and the employed ODE methods. In this paper, we consider accelerating
several popular ...
A popular approach to sample a diffusion-based generative model is to solve an
ordinary differential equation (ODE). In existing samplers, the coefficients of the
ODE solvers are pre-determined by the ODE formulation, the reverse discrete
timesteps, and the employed ODE methods. In this paper, we consider accelerating
several popular ODE-based sampling processes (including DDIM, DPM-Solver++,
and EDM) by optimizing certain coefficients via improved integration approxi mation (IIA). We propose to minimize, for each time step, a mean squared error
(MSE) function with respect to the selected coefficients. The MSE is constructed
by applying the original ODE solver for a set of fine-grained timesteps, which
in principle provides a more accurate integration approximation in predicting the
next diffusion state. The proposed IIA technique does not require any change of
a pre-trained model, and only introduces a very small computational overhead
for solving a number of quadratic optimization problems. Extensive experiments
show that considerably better FID scores can be achieved by using IIA-DDIM,
IIA-DPM-Solver++, and IIA-EDM than the original counterparts when the neural
function evaluation (NFE) is small (i.e., less than 25).
Computer Science
Faculty of Environment, Science and Economy
Item views 0
Full item downloads 0