arXiv · 2506.19559
Regularity of the score function in generative models
Abstract
We study the regularity of the score function in score-based generative models and show that it naturally adapts to the smoothness of the data distribution. Under minimal assumptions, we establish Lipschitz estimates that directly support convergence and stability analyses in both diffusion and ODE-based generative models. In addition, we derive higher-order regularity bounds, which simplify existing arguments for optimally approximating the score function using neural networks.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Arthur Stéphanovitch. 2025-06-24. Regularity of the score function in generative models. https://arxiv.org/abs/2506.19559
Cite the original work for its findings. Save a collection to share your selection of sources.