Title: Principled Out-of-Distribution Generalization via Simplicity
Primary area: learning theory
Keywords: out-of-distribution generalization, regularized maximum likelihood estimator, compositional generalization, diffusion models

Abstract: Modern foundation models exhibit remarkable out-of-distribution (OOD) generalization, solving tasks far beyond the support of their training data. However, the theoretical principles underpinning this phenomenon remain elusive. This paper investigates this problem by examining the compositional generalization abilities of diffusion models in image generation. Our analysis reveals that while neural network architectures are expressive enough to represent a wide range of models---including many with undesirable behavior on OOD inputs---the true, generalizable model that aligns with human expectations typically corresponds to the simplest among those consistent with the training data.

Motivated by this observation, we develop a theoretical framework for OOD generalization via simplicity, quantified using a predefined simplicity metric. We analyze two key regimes: (1) the *constant-gap* setting, where the true model is strictly simpler than all spurious alternatives by a fixed gap, and (2) the *vanishing-gap* setting, where the fixed gap is replaced by a smoothness condition ensuring that models close in simplicity to the true model yield similar predictions. For both regimes, we study the regularized maximum likelihood estimator and establish the first sharp sample complexity guarantees for learning the true, generalizable, simple model.