Critical windows: non-asymptotic theory for feature emergence in diffusion models
We develop theory to understand an intriguing property of diffusion models for image generation that we term critical windows. Empirically, it has been observed that there are narrow time intervals in sampling during which particular features of the final image emerge, e.g. the image class or background color (Ho et al., 2020b; Meng et al., 2022; Choi et al., 2022; Raya & Ambrogioni, 2023; Georgiev et al., 2023; Sclocchi et al., 2024; Biroli et al., 2024). While this is advantageous for interpretability as it implies one can localize properties of the generation to a small segment of the trajectory, it seems at odds with the continuous nature of the diffusion. We propose a formal framework for studying these windows and show that for data coming from a mixture of strongly log-concave densities, these windows can be provably bounded in terms of certain measures of inter- and intra-group separation. We also instantiate these bounds for concrete examples like well-conditioned Gaussian mixtures. Finally, we use our bounds to give a rigorous interpretation of diffusion models as hierarchical samplers that progressively "decide" output features over a discrete sequence of times. We validate our bounds with synthetic experiments. Additionally, preliminary experiments on Stable Diffusion suggest critical windows may serve as a useful tool for diagnosing fairness and privacy violations in real-world diffusion models.
Code (0)
등록된 구현이 없습니다.
Tasks
FairnessImage GenerationMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Blink of an eye: a simple theory for feature localization in generative models
Large language models can exhibit unexpected behavior in the blink of an eye. In a recent computer use demo, a language model switched from coding to Googling pictures of Yellowstone, and these sudden shifts in behavior …
MathTowards Understanding Neural Collapse: The Effects of Batch Normalization and Weight Decay
Neural Collapse (NC) is a geometric structure recently observed at the terminal phase of training deep neural networks, which states that last-layer feature vectors for the same class would "collapse" to a single point, …
Structural Balance via Gradient Flows over Signed Graphs
Structural balance is a classic property of signed graphs satisfying Heider's seminal axioms. Mathematical sociologists have studied balance theory since its inception in the 1040s. Recent research has focused on the dev…
Over-Alignment vs Over-Fitting: The Role of Feature Learning Strength in Generalization
Feature learning strength (FLS), i.e., the inverse of the effective output scaling of a model, plays a critical role in shaping the optimization dynamics of neural nets. While its impact has been extensively studied unde…
Zipf's law emerges asymptotically during phase transitions in communicative systems
Zipf's law predicts a power-law relationship between word rank and frequency in language communication systems, and is widely reported in texts yet remains enigmatic as to its origins. Computer simulations have shown tha…