Generators that produce a sample in a single network call have nearly caught up with multi-step diffusion models on image benchmarks. One example is MeanFlow, which learns the average velocity over a time interval instead of the instantaneous velocity. Many scientific datasets, however, have holes: rotating objects, periodic motion, and molecular rings all lie on circles, spheres, or tori. A one-step generator is a continuous map from Gaussian noise, which has no holes. A simple winding-number argument then shows that such a map must send some noise into the empty interior of each loop. How much noise ends up there depends on how steep the network is allowed to be. Multi-step samplers avoid the problem by composing many gentle steps into one very steep overall map.
We propose to make this trade-off measurable and to control it. Our claim is that the fraction of samples landing in topological voids ("void mass") has a lower bound that falls as the number of sampling steps grows. We further claim that a one-step model trained with a void penalty can push the unavoidable tear into the low-probability tail of the noise. That penalty competes with the generative objective, so we also test whether an adaptive loss-balancing rule can replace a grid search over its weight. The deliverable has two parts: a law linking step count to void mass, checked on manifolds with known topology, and a one-step training recipe whose value is judged against the cheap alternatives, namely a few extra steps, rejection filtering, and tuned static weights.
Core Claim
Take a generator $g$ with Lipschitz constant $L$, meaning it stretches distances by at most a factor $L$. Suppose it pushes $d$-dimensional Gaussian noise onto data lying on a manifold that surrounds an empty region of radius $r$ (a hole in the manifold's first homology). If a loop in noise space maps once around the hole, the disc that loop bounds must map onto a point inside the hole. This is the same degree reasoning used as a diagnostic in Topological degree as a discrete diagnostic for disentanglement. By the Lipschitz bound, a whole noise ball of radius $r/L$ around that point then lands at least on the order of $r$ away from the data. So
$$ \text{void mass} \;\ge\; \gamma_d\big(B(z^*, r/L)\big), $$
where $\gamma_d$ is the standard Gaussian measure and $z^*$ is the preimage of the hole's center. If a $K$-step sampler uses steps that are each at most $L_1$-Lipschitz, the composed map can reach $L_1^K$. The bound therefore shrinks roughly like $(r/L_1^K)^d$, which is exponential in $K$. One-step models cannot shrink it except by becoming steeper or by moving $z^*$ into the tail of the Gaussian.
This bound explains two findings in the file. Implications of data topology for deep generative models found that ambient DDPMs (denoising diffusion models, which generate by removing noise over hundreds of steps) preserve holes that VAEs fill with "density bridges." Neural Implicit Manifold Learning for Topology-Aware Density Estimation found that pushforward baselines leave bridges its sampler avoids. Our framing locates the cause in step count and steepness, not in the model family.
This differs from the closest work in three ways. Learning Distributions on Manifolds with Free-Form Flows (M-FFF) already samples in one step on manifolds, but only because the manifold is known in closed form and outputs are projected onto it. It also balances likelihood against reconstruction with static weights. Our setting is the one M-FFF cannot address: an unknown manifold embedded in higher dimension, where no projection exists. Mean Flows for One-step Generative Modeling supplies our base generator but says nothing about topology. Physics vs Distributions: Pareto Optimal Flow Matching with Physics Constraints (PBFM) shows that auxiliary constraints conflict with flow-matching gradients and resolves the conflict with gradient projection. That work concerns PDE residuals and multi-step sampling, not topological voids at one step.
Research Program
Measurement. We first establish void mass as a quantity that can be measured without triangulation. Topological degree as a discrete diagnostic for disentanglement identifies triangulation as the scaling bottleneck for topological diagnostics. We avoid it by working on synthetic manifolds, where the true manifold can be sampled densely. Void mass is then the fraction of generated samples farther than a threshold $\tau$ from a dense reference set. We set $\tau$ as a fixed fraction of the hole radius $r$ and report results across several fractions. We pair this with persistent homology of the samples to check which loops and voids survive.
Base model and the step-count law. We train MeanFlow in ambient space, starting from the TorchCFM flow-matching code and adding MeanFlow's Jacobian-vector-product target. We then measure void mass at 1, 2, 4 and 8 steps. We estimate each model's Lipschitz constant empirically and vary the hole radius $r$ while holding curvature fixed. This tests whether trained models sit near the bound or far above it.
Void penalty. We add a training term that penalizes the distance from each one-step output to its nearest data point in the batch. Its purpose is to push the preimage $z^*$ outward, into the tail of the noise. It is not meant to remove the tear, which the bound says is impossible. This penalty conflicts with the MeanFlow regression. The regression's straight-line average velocities are exactly the chords that cut through holes. Too much weight on the penalty should collapse samples onto the easy parts of the manifold, and too little should leave bridges.
Balancing. We balance the two terms with GradNorm, which reweights losses so their gradient norms train at matched rates for about 5% overhead. We also log the cosine between the two gradients throughout training. This tells us whether the conflict is truly directional, which would favor PBFM-style projection, or merely a mismatch of scale, which would favor GradNorm.
Baselines
Naive reference. The do-nothing baseline is plain one-step ambient MeanFlow with no penalty, trained with the same architecture, data, and step budget as every other model. It establishes the raw void mass that the bound predicts. Beating it means lowering one-step void mass without raising Wasserstein-1 distance to held-out data.
Strongest quality reference. This is the ambient DDPM, which Implications of data topology for deep generative models shows recovers the torus's loops and void and the hollow sphere. That paper reports no numbers for these results, and no reported result found on Lacuna for DDPM Wasserstein error on the torus or cyclooctane. We run it at 250 steps with a matched network size as an upper bound on quality. We do not expect to beat it on fidelity. The comparison is fidelity per sampling step.
Strongest topology-aware density baseline. On the circle-mixture benchmark this is EBIM (Neural Implicit Manifold Learning for Topology-Aware Density Estimation). It reports a Wasserstein-1 distance of 0.002 against 0.013 for pushforward baselines, with iterative constrained Langevin sampling. Beating the pushforward figure at one step is the minimum bar. Approaching 0.002 with at most 4 steps would be a clear win, and we time both methods on the same GPU. For context on the one-step image regime, MeanFlow reports a 1-step FID of 2.92 on CIFAR-10 (Mean Flows). We include a CIFAR-10 run only to confirm that the penalty does not harm a manifold without holes.
M-FFF. We run M-FFF on the sphere-only benchmarks where its projection applies. There it is an oracle-geometry reference, since it knows the manifold our method must learn.
Balancing ablations. Two ablations isolate the balancing ingredient, each trained with the same total GPU-hours. One is a static-weight grid search over the penalty weight (eight values, three seeds). The other is PBFM-style conflict-free projection, whose reported costs are up to 3× memory and 2.5× training time when combined with unrolling. A second ablation isolates the penalty itself: applying it at 2 steps versus 1 step shows whether it adds anything once steps are cheap.
Why not just…?
Why not just take two to four steps? This is the most serious threat. Our own bound predicts that void mass falls exponentially with steps, so two steps may already push it below measurement noise. The step-count experiment settles this directly. If 2-step plain MeanFlow matches 1-step penalized MeanFlow, the method contribution shrinks and the paper's result becomes the law itself. That law would still tell practitioners how many steps a given hole radius requires. We will report whichever outcome holds.
Why not just reject samples that land far from the data? Filtering is parallel and adds no sequential latency. However, it needs a reference set or learned manifold detector at test time. It also discards the tear without correcting the density distortion around it: samples near the preimage of the tear are stretched thinly along the manifold. We evaluate Wasserstein-1 distance after filtering. If filtered one-step MeanFlow matches the penalized model, filtering wins on simplicity and we will say so.
Why not just grid-search the penalty weight? On small synthetic manifolds, a grid search is cheap. GradNorm's advantage of matching a 100-run search in one run (GradNorm) matters mainly for the costly spherical-harmonics and cyclooctane runs. We test whether a single weight transfers across hole radii and datasets. If it does, adaptive balancing is unnecessary. The logged gradient cosines will show whether any static weight can even reach the Pareto front, which is the argument PBFM makes for physics constraints.
Why not just distill a DDPM into one step? A distilled one-step student is still a continuous deterministic map from noise, so the same bound applies. We include progressive distillation of our DDPM to 1 step as a check that the void mass we observe comes from the bound and not from MeanFlow specifically.
Proposed Experiments
Datasets. We use the circle mixture, the torus-ellipse and rotating-jar image manifolds, cyclooctane conformations, and the spherical-harmonics sphere in $\mathbb{R}^{2L+1}$ for $L \in \{5,7,9,11\}$. On the last of these, Topological degree as a discrete diagnostic for disentanglement reports that its ΔVAE reaches degree ±1 in 5 of 5 runs.
Metrics. We report void mass, Wasserstein-1 distance to held-out data, recovered Betti numbers (counts of connected components, loops, and voids), wall-clock latency, and the number of network evaluations.
Topology versus curvature control. The first decisive check pairs each manifold with a contractible control of matched curvature, such as an arc in place of a circle or a spherical cap in place of a sphere. Void mass should vanish on the control and persist on the holed manifold. If it does not vanish, curvature rather than topology is the driver.
Scaling with hole size and step count. The second check tests whether log void mass falls roughly linearly in step count $K$, and whether it scales with $r/L$ as the bound predicts, when we vary the hole radius.
One-step penalty test. The third check asks whether penalized one-step models lower void mass relative to plain MeanFlow at no Wasserstein-1 cost. They must also beat filtering and match 2-step plain MeanFlow.
Balancing test. The fourth check asks whether GradNorm balancing matches the best grid point across all datasets in one run. We read that result alongside the gradient-cosine logs, which show whether the loss conflict was directional or only a matter of scale.
References
- Topological degree as a discrete diagnostic for disentanglement, with applications to the ΔVAE⋆
- Implications of data topology for deep generative models
- Neural Implicit Manifold Learning for Topology-Aware Density Estimation
- Learning Distributions on Manifolds with Free-Form Flows
- Mean Flows for One-step Generative Modeling
- Physics vs Distributions: Pareto Optimal Flow Matching with Physics Constraints
- GradNorm: Gradient Normalization for Adaptive Loss Balancing in Deep Multitask Networks