Optimal Stopping in Latent Diffusion Models
We identify and analyze a surprising phenomenon of Latent Diffusion Models (LDMs) where the final steps of the diffusion can degrade sample quality. In contrast to conventional arguments that justify early stopping for numerical stability, this phenomenon is intrinsic to the dimensionality reduction in LDMs. We provide a principled explanation by analyzing the interaction between latent dimension and stopping time. Under a Gaussian framework with linear autoencoders, we characterize the conditions under which early stopping is needed to minimize the distance between generated and target distributions. More precisely, we show that lower-dimensional representations benefit from earlier termination, whereas higher-dimensional latent spaces require later stopping time. We further establish that the latent dimension interplays with other hyperparameters of the problem such as constraints in the parameters of score matching. Experiments on synthetic and real datasets illustrate these properties, underlining that early stopping can improve generative quality. Together, our results offer a theoretical foundation for understanding how the latent dimension influences the sample quality, and highlight stopping time as a key hyperparameter in LDMs.
Code (0)
등록된 구현이 없습니다.
Tasks
Dimensionality ReductionSimilar Papers 제목 키워드 기반
On variable annuities with surrender charges
In this paper we provide a theoretical analysis of Variable Annuities with a focus on the holder's right to an early termination of the contract. We obtain a rigorous pricing formula and the optimal exercise boundary for…
Deep neural network expressivity for optimal stopping problems
This article studies deep neural network expression rates for optimal stopping problems of discrete-time Markov processes on high-dimensional state spaces. A general framework is established in which the value function a…
Data-driven optimal stopping: A pure exploration analysis
The standard theory of optimal stopping is based on the idealised assumption that the underlying process is essentially known. In this paper, we drop this restriction and study data-driven optimal stopping for a general …
Binary ClassificationOptimal Stopping under Model Ambiguity: a Time-Consistent Equilibrium Approach
An unconventional approach for optimal stopping under model ambiguity is introduced. Besides ambiguity itself, we take into account how ambiguity-averse an agent is. This inclusion of ambiguity attitude, via an $\alpha$-…
Decision MakingOn time-consistent equilibrium stopping under aggregation of diverse discount rates
This paper studies the central planner's decision making on behalf of a group of members with diverse discount rates. In the context of optimal stopping, we work with a smooth aggregation preference to incorporate all he…
Decision MakingDiversity