This paper develops a hyperfinite formulation of score-based generative modeling within the framework of Nonstandard Analysis, and shows that minimization of an internal score-matching objective recovers the score function required by the reverse-time dynamics, thereby connecting score estimation with generative sampling directly at the hyperfinite level.
Abstract
Score-based diffusion models are typically formulated using continuous-time stochastic differential equations and measure-theoretic stochastic calculus. In this paper, we develop a hyperfinite formulation of score-based generative modeling within the framework of Nonstandard Analysis. Starting from an internal diffusion process on a hyperfinite grid, we derive the associated infinitesimal generator and establish its correspondence with the classical Fokker--Planck equation. We then obtain a hyperfinite backward-mean identity that yields the reverse-time drift and provides a constructive derivation of the reverse-time SDE. Building on these results, we show that minimization of an internal score-matching objective recovers the score function required by the reverse-time dynamics, thereby connecting score estimation with generative sampling directly at the hyperfinite level. Under suitable assumptions, we further derive a hyperfinite Girsanov formula and establish a relationship between likelihood optimization and Fisher-divergence objectives. Finally, we analyze the second-order consistency of the hyperfinite dynamics and show that the leading correction term depends explicitly on the fourth moment of the increment distribution, with the Gaussian value $\kappa=3$ eliminating the leading dispersion contribution. Taken together, these results provide a unified hyperfinite framework for diffusion-based generative modeling--while laying foundations for further extensions--that links discrete grid dynamics, reverse-time diffusion, score matching, and likelihood-based formulations within a common nonstandard setting.
Results demonstrate that MVM provides a direct single-field parameterization of stochastic reverse dynamics while maintaining competitive generation quality.
Yun-Hong Zhang, Chang-Jie Cao, Zhi-Hua Zhang et al.· 0 citations
FluxLite is introduced, a lightweight, training-free proposal-control framework for discrete diffusion, identifying a tilted-path coverage factor that governs robustness to score error, together with finite-particle convergence for a fixed controlled Feynman-Kac recursion.
Yinuo Ren, Haoxuan Chen, Grant M. Rotskoff et al.· 1 citation
A conditioning mechanism for diffusion models based on multi-speed joint diffusion of the target and the condition learns an unconditional joint score network and enforces conditioning at inference via a plug-in correction term, and derives explicit conditional reverse-time SDEs and approximate probability-flow ODEs.
Libo Chen, Souvik Ghosh, Teo Deveney et al.· 0 citations
Discrete diffusion models and flow matching have emerged as powerful frameworks for generative modeling over discrete state spaces, yet efficient few-step generation remains a fundamental challenge. In this work, we introduce the Discrete Average Generator, a principled extension of MeanFlow to Continuous-Time Markov C...
Yi-Dong Ouyang, Zheng-Yan Wan, Themistoklis Haris et al.· 0 citations
This work constructs a cube-to-target map by composing a Gaussian base transformation (the component-wise inverse Gaussian CDF) with an Euler-discretized probability flow ODE, and establishes conditions for diffusion probability-flow transport under mild bounded-derivative assumptions on the learned vector field.
We introduce a stochastic process for modeling the evolution in time of compositional measurements (i.e., a vector of non-negative values that add up to a total of 1). This model is a diffusion, as it is defined as the solution for a stochastic differential equation in the Ito sense, and it has a Dirichlet distribution...
Luo-Er Chen, Omar De la Cruz Cabrera, Oana Mocioalca· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.