betaFeedback

WorksPhysics and Astronomy

Flow Mesh: A Velocity-Regularized Flow Matching Framework for Stable Distributional Modeling of Physical Fields on Unstructured Meshes

Abstract

Thermal-fluid field distributions underpin the analysis and operation of energy infrastructure, from nuclear-reactor cooling channels to industrial heat exchangers, but resolving these distributions through computational fluid dynamics requires prohibitively large simulation ensembles. Their complex geometries also demand unstructured meshes that are poorly accommodated by generative models developed for regular grids. Here we introduce FlowMesh, a generative framework that combines permutation-invariant mesh encoding with deterministic latent flow matching and an l1 penalty on the learned transport velocity. FlowMesh generates full-field realizations directly on fixed unstructured meshes without auxiliary grid interpolation or a stochastic denoising chain. Across lid-driven-cavity, pressurized-water-reactor subchannel and heat-exchanger datasets, evaluated over six matched training seeds, FlowMesh achieves macro-averaged probability-density-function coverage of 91.7%-97.0%, exceeding an architecture-controlled latent diffusion model by 11.611.6–45.445.4 percentage points. Latent-velocity regularization increases coverage by 3.83.8 percentage points for reactor flows and 1.1 points for heat-exchanger flows, while reducing temperature-field Kullback–Leibler divergence by 1.7-2.4-fold. Each full-field realization requires 1.23 \pm 0.15 s, providing a 585–1902-fold wall-clock acceleration over computational fluid dynamics. FlowMesh therefore makes large-scale generative characterization of thermal-fluid states computationally feasible, providing a foundation for data-driven analysis and digital-twin development in fixed-geometry energy systems.

Introduction

Many decisions in physical and energy systems depend not on a single best-estimate field but on a distribution of plausible states. Nuclear thermal-hydraulic analysis, heat-exchanger design, virtual sensing, and uncertainty-aware digital twins require ensembles of velocity, temperature, pressure, and turbulence fields over uncertain operating conditions. High-fidelity finite-element and computational-fluid-dynamics solvers [1, 2] provide these fields by resolving the governing conservation equations [3], but generating sufficiently large ensembles remains computationally expensive [4]. This creates a fundamental scale mismatch between the cost of high-fidelity simulation and the number of realizations required for uncertainty propagation, probabilistic analysis, and near-real-time state estimation [5, 6].

A second difficulty is geometric. Engineering simulations are commonly defined on unstructured meshes whose nonuniform resolution conforms to curved boundaries, narrow flow passages, wall-adjacent gradients, and locally refined regions [7, 8]. In reactor subchannels and heat-transfer components, these geometric features are part of the physical problem rather than a numerical inconvenience [9, 10]. Mapping such fields to auxiliary Cartesian grids can introduce interpolation error and alter the representation of precisely the regions in which gradients are largest [11, 12]. A useful scientific generative model should therefore operate on the computational representation on which the high-fidelity data are produced.

Diffusion models provide a powerful route to high-dimensional generative modeling, but their standard formulation introduces an additional computational question. Samples are generated through an iterative reverse process that reconstructs data from progressively corrupted states [13, 14]. This strategy is highly successful in image generation, yet scientific field generation raises a different requirement: whether comparable or better distributional fidelity can be obtained through a continuous deterministic transport map while avoiding a long denoising chain. The distinction is especially relevant on learned latent representations of irregular meshes, where the geometry encountered by the generative model is induced by the encoder rather than supplied explicitly to the sampling process.

Iterative denoising can accumulate approximation and discretization error, and accelerated samplers may move intermediate states into regions in which the learned denoiser is less accurate [15, 16]. These observations do not imply that stochastic generative models are intrinsically incompatible with physical systems. Rather, they motivate a testable question: when the target data are high-dimensional physical fields represented on an irregular mesh, does deterministic transport through the learned latent space provide a more effective generative mechanism than iterative stochastic denoising? We address this question with an architecture-controlled comparison in which FlowMesh and a latent DDPM share the same PointNet autoencoder and latent training data. This design separates the representation problem from the generative-transport problem and allows the effect of the sampling mechanism to be assessed directly on the present benchmarks.

Schematic of FlowMesh deterministic latent transport

Figure 1. FlowMesh formulates mesh-based field generation as deterministic latent transport. A permutation-invariant PointNet autoencoder maps physical fields and node coordinates from a fixed unstructured mesh into a compact latent representation. A learned time-dependent velocity field uθ(zt,t)u_\theta(z_t,t) then transports samples from a Gaussian source distribution p0p_0 to the latent data distribution p1p_1 through numerical integration of an ordinary differential equation. The decoder maps the terminal latent state back to the original mesh without interpolation to an auxiliary Cartesian grid. The schematic contrasts this continuous transport formulation with iterative denoising; it is conceptual and does not imply that individual learned trajectories coincide with a physical trajectory or an optimal-transport geodesic.

Here, we introduce FlowMesh, a generative framework for learning distributions of physical fields on fixed unstructured geometries through deterministic latent transport. Three design choices define the approach. First, a permutation-invariant PointNet autoencoder [17] jointly embeds node coordinates and node-associated physical quantities into a fixed-dimensional latent representation without interpolation onto an auxiliary grid. Second, flow matching [18] learns a continuous time-dependent velocity field uθ(zt,t)u_\theta(z_t,t) whose ordinary differential equation transports samples from a Gaussian reference distribution to the latent distribution of the training fields. Third, an ℓ1\ell_1 penalty on the latent velocity magnitude provides a tunable bias against unnecessarily large transport velocities. This penalty is not a Dirichlet-energy term and does not impose a formal Lipschitz constraint. Instead, its effect is evaluated empirically through a five-order-of-magnitude sweep in λ\lambda, together with measurements of distributional accuracy and the sampled Jacobian norm of the learned velocity field. The resulting experiments allow us to distinguish where velocity regularization materially improves latent transport from regimes in which it is unnecessary or detrimental.

FlowMesh addresses a different objective from the deterministic neural operators commonly used for forward surrogate modeling, including DeepONet, MIONet, S-DeepONet, the Fourier neural operator, and transformer-based operators [19, 20, 21, 22, 23]. In their standard supervised form, these models learn a mapping from prescribed inputs to a point prediction of the corresponding field. FlowMesh instead targets the distribution of full fields represented in a simulation ensemble. In the formulation studied here, this distribution is learned over the sampled operating envelope rather than conditioned on a user-specified operating point. The resulting samples are therefore suited to ensemble characterization and uncertainty-propagation tasks rather than deterministic forward prediction. Probabilistic neural operators and conditional generative operators represent an important adjacent class of methods; direct comparison with those formulations is outside the present scope. We therefore treat FlowMesh as complementary to deterministic operator learners rather than as a replacement for them.

We evaluate FlowMesh on three benchmarks that progressively increase the geometric and thermal complexity of the generated fields: a lid-driven cavity, a pressurized-water-reactor subchannel, and a heat exchanger. Six matched training seeds establish that velocity regularization is effectively neutral on the already accurate cavity benchmark but improves the mean distributional fidelity of the PWR and heat-exchanger ensembles, with the largest gain occurring for temperature. An autoencoder-only diagnostic reaches more than 99.4% PDF coverage in the PWR case, showing that the dominant remaining error arises in latent distribution transport rather than mesh reconstruction. Against a latent DDPM using the same PointNet representation, FlowMesh improves macro-averaged PDF coverage by 11.6–45.4 percentage points and reduces sampling cost. Relative to the reference CFD calculations, each generated realization is 585–1,902 times faster. At the same time, a no-slip diagnostic reveals a substantial boundary-condition residual, establishing an important boundary of the present result: high distributional fidelity does not by itself guarantee pointwise satisfaction of the governing constraints. Together, the experiments identify deterministic latent transport as a viable generative representation for physical-field ensembles on fixed unstructured meshes while showing that explicit physical constraints remain necessary for safety-critical deployment.

Results

Choice of benchmarks The three benchmarks are selected to test distinct aspects of the generative problem rather than to reproduce industrial scale. The lid-driven cavity provides a comparatively simple recirculating flow in which unregularized flow matching is already accurate and therefore acts as a useful negative control for the regularizer. The PWR subchannel introduces nuclear-relevant rod geometry, heated boundaries, and coupled velocity, turbulence, and temperature fields. The heat exchanger tests whether the observed behavior persists on a second energy-system geometry with a larger set of thermofluid variables. Each dataset retains the native fixed unstructured node set used by the CFD calculation. The objective is therefore narrower than universal mesh generalization: we test whether deterministic latent transport can reproduce distributions of high-dimensional fields on fixed irregular geometries, and whether velocity regularization provides a reproducible benefit when unregularized transport is less accurate.

Lid-driven cavity flow

We evaluate FlowMesh on the canonical lid-driven cavity (LDC) benchmark to assess its generative performance on an advection-dominated flow. Consider a two-dimensional lid-driven cavity defined on Ω=[0,1]2\Omega= [0,1]^2. A prescribed time-dependent velocity drives the upper boundary in the horizontal direction, while zero-velocity conditions are imposed on the remaining walls. The flow fields are obtained from the incompressible Reynolds-averaged Navier–Stokes equations with a kk–ε\varepsilon turbulence closure. Denoting the velocity by v=(vx,vy)\mathbf{v} = (v_x,v_y) and the pressure by pp, the equations of continuity and momentum are:

∇⋅v=0,(1)\nabla\cdot\mathbf{v} = 0, \tag*{(1)}
∂v∂t+(v⋅∇)v=−∇p+∇⋅[(ν+νt)(∇v+∇vT)],(2)\frac{\partial\mathbf{v}}{\partial t} + (\mathbf{v} \cdot\nabla)\mathbf{v} = -\nabla p + \nabla\cdot\left[(\nu+ \nu_t)\left(\nabla\mathbf{v} + \nabla\mathbf{v}^{\mathsf{T}}\right)\right], \tag*{(2)}

where ν\nu is the kinematic viscosity and νt\nu_t the eddy viscosity.

The turbulent kinetic energy (TKE) field k(x,y,t)k(x,y,t) evolves as

∂k∂t+v⋅∇k=Pk−ε+∇⋅[(ν+νtσk)∇k],(3)\frac{\partial k}{\partial t}+\boldsymbol{v}\cdot\nabla k=P_k-\varepsilon+\nabla\cdot\left[\left(\nu+\frac{\nu_t}{\sigma_k}\right)\nabla k\right], \tag*{(3)}

where PkP_k is the production term, ε\varepsilon the dissipation rate, and σk\sigma_k a model constant.

λ\lambdaPressureVelocityTKE
096.0±1.696.0 \pm1.695.7±1.095.7 \pm1.097.7±1.397.7 \pm1.3
10−410^{-4}96.2±2.096.2 \pm2.095.4±0.995.4 \pm0.997.7±1.497.7 \pm1.4
10−310^{-3}96.2±1.296.2 \pm1.295.7±0.895.7 \pm0.897.8±1.297.8 \pm1.2
10−210^{-2}96.4±1.496.4 \pm1.495.7±0.895.7 \pm0.897.6±1.297.6 \pm1.2
10−110^{-1}96.8±0.996.8 \pm0.996.0±0.796.0 \pm0.798.1±0.898.1 \pm0.8
1.050.8±1.550.8 \pm1.514.9±0.114.9 \pm0.160.1±3.460.1 \pm3.4

Table 1. LDC ℓ1\ell_1 velocity-regularization sweep across 6 independent training seeds (PDF coverage, mean ±\pm standard deviation, evaluated against autoencoder-reconstructed reference fields). Coverage varies by less than approximately one percentage point for 0≤λ≤10−10 \le\lambda\le10^{-1}, whereas λ=1\lambda= 1 produces a large loss of fidelity in all three fields. The result establishes a broad low-to-moderate regularization regime in which the cavity solution is insensitive to λ\lambda, followed by clear over-regularization at the largest weight.

Boundary conditions are given by

vx(x,1,t)=V(t),vy(x,1,t)=0,x∈[0,1],(4)v_x(x,1,t)=V(t),\qquad v_y(x,1,t)=0,\qquad x\in[0,1], \tag*{(4)}
v=(0,0)on all remaining walls.(5)\boldsymbol{v}=(0,0)\quad\text{on all remaining walls}. \tag*{(5)}

A uniform pressure field and a zero velocity was set as a initial condition for this system:

v(x,y,0)=(0,0),p(x,y,0)=p0.(6)\boldsymbol{v}(x,y,0)=(0,0),\qquad p(x,y,0)=p_0. \tag*{(6)}

We generate the lid velocity V(t)V(t) randomly and discretize it into 90 uniform time steps, serving as the input forcing profile. Simulations are performed in ANSYS FLUENT using an unstructured mesh with 4225 spatial nodes. The numerical solver outputs the velocity magnitude ∥v∥=vx2+vy2\lVert v\rVert= \sqrt{v_x^2 + v_y^2}, the pressure field p(x,y,t)p(x,y,t), and the TKE field k(x,y,t)k(x,y,t) at every timestep. At the terminal simulation time, these fields constitute the training dataset. We trained FlowMesh on 20,000 samples drawn from the full simulation dataset. Generated and reference fields are compared in Figure 2.

Lid-driven cavity benchmark results on an unstructured mesh

Figure 2. Lid-driven cavity benchmark results on an unstructured mesh. (a) Two-dimensional lid-driven cavity configuration with prescribed boundary conditions and the turbulent kinetic energy (TKE) field at the terminal simulation time. (b) Probability density function (PDF) comparisons between the reference computational fluid dynamics (CFD) data and FlowMesh-generated samples for pressure, velocity magnitude, and TKE. (c) Node-wise diagnostics for velocity magnitude, including mean and variance fields from the reference data and generated samples with and without regularization, mean-error maps relative to the reference, and Kullback-Leibler (KL) and Jensen-Shannon (JS) divergence maps between the reference and generated node-wise distributions.

Without regularization, FlowMesh attains PDF coverages of 97.7±1.3%97.7 \pm1.3\% for TKE, 95.7±1.0%95.7 \pm1.0\% for velocity magnitude, and 96.0±1.6%96.0 \pm1.6\% for pressure, with corresponding KL divergences of 0.0027±0.00190.0027 \pm0.0019, 0.0173±0.00630.0173 \pm0.0063, and 0.0071±0.00580.0071 \pm0.0058, respectively (Table 2). Node-wise statistics (Figure 2c) show that the mean and variance are reproduced across most of the domain, with the largest discrepancies concentrated near the moving lid and the bottom corners, where the flow gradients are strongest.

ModelFieldKL ↓JS ↓PDF Coverage (%) ↑
FlowMesh ℓ1\ell_1 No Reg.Pressure0.0071 ± 0.00580.0027 ± 0.002496.0 ± 1.6
Velocity0.0173 ± 0.00630.0054 ± 0.001795.7 ± 1.0
TKE0.0027 ± 0.00190.0010 ± 0.000797.7 ± 1.3
FlowMesh ℓ1\ell_1, Reg. (λ=10−3\lambda= 10^{-3})Pressure0.0060 ± 0.00410.0023 ± 0.001696.2 ± 1.2
Velocity0.0180 ± 0.00710.0057 ± 0.002095.7 ± 0.8
TKE0.0023 ± 0.00180.0008 ± 0.000697.8 ± 1.2
FlowMesh ℓ1\ell_1, Reg. (λ=10−1\lambda= 10^{-1})Pressure0.0057 ± 0.00300.0018 ± 0.000996.8 ± 0.9
Velocity0.0178 ± 0.00740.0055 ± 0.001996.0 ± 0.7
TKE0.0017 ± 0.00090.0006 ± 0.000398.1 ± 0.8

Table 2. LDC distributional metrics over 6 training seeds (mean ± standard deviation). All configurations share the same architecture, data, and 100-epoch training schedule. Coverage is evaluated against autoencoder-reconstructed reference fields. Regularization changes coverage by less than one percentage point, within the seed-to-seed variability. Lower KL and JS and higher PDF coverage are better.

At λ=10−1\lambda= 10^{-1}, regularization increases the mean PDF coverage by only 0.8, 0.3, and 0.4 percentage points for pressure, velocity, and TKE, respectively. These changes are smaller than the corresponding seed-to-seed standard deviations, and the reported mean-±-standard-deviation intervals overlap for all three fields. The divergence metrics are also field dependent: KL and JS decrease modestly for pressure and TKE but change slightly unfavorably for velocity. The results therefore do not establish a clear LDC improvement from regularization. The summary statistics in Table 3 provide a complementary assessment. The unregularized model is closer to the original data in eight of the nine reported mean, minimum, and maximum statistics, whereas the regularized model is closer only for the maximum velocity. This does not contradict the marginal increase in PDF coverage, because coverage measures overlap of the full empirical distribution, while the reported means and extrema probe only selected statistics and are particularly sensitive to tail samples.

Data OriginFieldMeanMin ValueMax Value
OriginalPressure−234.7000−1570.15002515.7000
Velocity0.03200.00000.7470
TKE0.31300.00007.4450
FlowMesh No RegularizerPressure−226.9062−1239.51042140.1989
Velocity0.0206−0.00510.7677
TKE0.3086−0.13716.9881
FlowMesh With Regularizer (λ=10−1\lambda=10^{-1})Pressure−207.8638−1179.51402037.2308
Velocity0.0203−0.00540.7500
TKE0.2966−0.15036.7631

Table 3. LDC (lid-driven cavity): comparison of statistical values of data across various fields. FlowMesh rows are the mean over 6 independent training seeds (same architecture, data and 100-epoch schedule; only the training seed differs); the Original row is as reported for the original dataset. Negative velocity-magnitude & TKE values are physically inadmissible; the table reports raw model outputs prior to any non-negativity post-processing.

Taken together, the LDC benchmark provides an important negative control. Unregularized flow matching already attains high distributional fidelity, and the changes produced by λ≤10−1\lambda\le10^{-1} are smaller than the seed-to-seed variability for the principal coverage metrics. The data therefore do not support a claim that regularization universally improves FlowMesh. Instead, they show that a broad interval of low-to-moderate regularization leaves an already accurate transport model largely unchanged. At λ=1\lambda= 1, coverage collapses to 50.8%, 14.9%, and 60.1% for pressure, velocity, and TKE, respectively, demonstrating that excessive suppression of the latent velocity can remove the transport capacity required to reach the target distribution.

PWR subchannel

We next test FlowMesh in a nuclear thermal-hydraulics setting in which distributional field modeling has direct engineering relevance. A pressurized-water-reactor (PWR) subchannel confines coolant between heated fuel rods, producing strongly nonuniform velocity, turbulence, and temperature fields on an irregular cross-section. Ensembles of such fields are relevant to uncertainty propagation, virtual sensing, and probabilistic characterization of thermal margins, but obtaining them through repeated CFD calculations is computationally expensive. The benchmark therefore tests whether latent generative transport remains accurate when the field distribution contains both coherent coolant motion and steep wall-adjacent thermal gradients. The operating variables comprise an axially varying wall heat-flux profile,

q(z)=Asin⁡(πzH),z∈[0,H],(7)q(z) = A \sin\left(\frac{\pi z}{H}\right), \qquad z \in[0,H], \tag*{(7)}

where HH is the heated length and AA is the heat-flux amplitude, together with the inlet temperature Tin∈RT_{\mathrm{in}} \in\mathbb{R} and inlet velocity magnitude vin∈Rv_{\mathrm{in}} \in\mathbb{R}. The resulting input space is

Usub={(q,Tin,vin)},(8)\mathcal{U}_{\mathrm{sub}} = \{(q,T_{\mathrm{in}},v_{\mathrm{in}})\}, \tag*{(8)}

where q∈L2([0,H])q \in L^2([0,H]) and Tin,vin∈RT_{\mathrm{in}}, v_{\mathrm{in}} \in\mathbb{R}.

The response is recorded on a transverse plane Ysub⊂R2\mathcal{Y}_{\mathrm{sub}} \subset\mathbb{R}^{2} at a fixed axial location z=z0z = z_{0}. At every mesh node, the model generates the velocity magnitude ∥v(x,y)∥\lVert\mathbf{v}(x,y)\rVert, temperature T(x,y)T(x,y), and turbulent kinetic energy k(x,y)k(x,y). The output space therefore, is three-channel:

Ssub=(L2(Ysub))3,(9)\mathcal{S}_{\mathrm{sub}} = \left(L^{2}(\mathcal{Y}_{\mathrm{sub}})\right)^{3}, \tag*{(9)}

without interpolation of the unstructured field onto a Cartesian grid. We generated 5,000 reference simulations in ANSYS FLUENT on a three-dimensional unstructured mesh and extracted a common transverse section containing 1,733 nodes. The operating parameters were sampled independently as

A∼U(540,660) [kW/m2],Tin∼U(536.4,655.6) [K],vin∼U(4.05,4.95) [m/s].(10)A \sim\mathcal{U}(540,660)\ [\mathrm{kW}/\mathrm{m}^{2}], \quad T_{\mathrm{in}} \sim\mathcal{U}(536.4,655.6)\ [\mathrm{K}], \quad v_{\mathrm{in}} \sim\mathcal{U}(4.05,4.95)\ [\mathrm{m}/\mathrm{s}]. \tag*{(10)}

Each condition thus maps to an array in R1733×3\mathbb{R}^{1733 \times3}. This fixed but geometrically irregular node set isolates the distribution-learning problem from mesh interpolation error while retaining the rod-wall boundary layers that make the case challenging.

Across six fixed, matched training seeds, unregularized FlowMesh attains PDF coverages of 89.6 ±\pm 5.0% for velocity, 81.6 ±\pm 6.6% for temperature, and 92.5 ±\pm 3.8% for TKE (Table 4). At λ=10−3\lambda= 10^{-3}, the corresponding means increase to 92.5 ±\pm 2.5%, 83.7 ±\pm 12.1%, and 95.1 ±\pm 1.9%. The gain is most reproducible for velocity and TKE, for which the across-seed variability also decreases. Temperature is more sensitive to training seed at this weight. Increasing the regularization strength to λ=10−1\lambda= 10^{-1} reduces the mean temperature KL divergence from 0.1517 to 0.0635 and increases temperature PDF coverage from 81.6% to 87.9%. This setting also gives the largest macro-averaged coverage, increasing it from 87.90% without regularization to 91.67%. The six-seed experiment therefore supports a field-dependent effect of velocity regularization: moderate regularization improves the mean distributional fidelity of all three PWR fields, but the weight that is most favorable differs across channels and the temperature response is less seed-stable than the velocity and TKE responses.

Table 4: PWR sub-channel distributional metrics over six fixed, matched training seeds (mean ±\pm standard deviation). All configurations share the same architecture, data, and 100-epoch training schedule. FlowMesh is evaluated against autoencoder-reconstructed reference fields. Lower KL and JS and higher PDF coverage are better.

ModelFieldKL ↓\downarrowJS ↓\downarrowPDF Coverage (%) ↑\uparrow
FlowMesh ℓ1\ell_1 No Reg.Velocity0.0613 ±\pm 0.04540.0221 ±\pm 0.016989.6 ±\pm 5.0
Temperature0.1517 ±\pm 0.10410.0545 ±\pm 0.033981.6 ±\pm 6.6
TKE0.0350 ±\pm 0.03230.0118 ±\pm 0.010592.5 ±\pm 3.8
FlowMesh ℓ1\ell_1, Reg. (λ=10−3\lambda= 10^{-3})Velocity0.0323 ±\pm 0.01860.0114 ±\pm 0.005592.5 ±\pm 2.5
Temperature0.1350 ±\pm 0.16750.0536 ±\pm 0.065783.7 ±\pm 12.1
TKE0.0142 ±\pm 0.00950.0050 ±\pm 0.003195.1 ±\pm 1.9
FlowMesh ℓ1\ell_1, Reg. (λ=10−1\lambda= 10^{-1})Velocity0.0397 ±\pm 0.03520.0126 ±\pm 0.010092.4 ±\pm 3.3
Temperature0.0635 ±\pm 0.02860.0242 ±\pm 0.010387.9 ±\pm 4.0
TKE0.0188 ±\pm 0.01790.0063 ±\pm 0.005794.7 ±\pm 2.5

Table 4. PWR sub-channel distributional metrics over six fixed, matched training seeds (mean ±\pm standard deviation). All configurations share the same architecture, data, and 100-epoch training schedule. FlowMesh is evaluated against autoencoder-reconstructed reference fields. Lower KL and JS and higher PDF coverage are better.

The field statistics in Table 5 provide a complementary view of these distributional improvements. The λ=10−1\lambda= 10^{-1} model is closer to the original data in five of the nine reported statistics, primarily the field extrema, whereas the unregularized model is closer for all three field means and the TKE minimum. Thus, the improvements in KL divergence, JS divergence, and PDF coverage do not translate into uniformly improved means and extrema.

Table 5: PWR sub-channel field statistics. Each FlowMesh entry is the average of the corresponding statistic over the 6 training seeds. The Original row reports statistics from the reference dataset. Negative velocity-magnitude & TKE values are physically inadmissible; the table reports raw model outputs prior to any non-negativity post-processing.

Data OriginFieldMeanMin ValueMax Value
OriginalVelocity3.9920.0005.250
OriginalTemperature573.880512.260649.680
OriginalTKE0.0560.0110.146
FlowMesh, No Reg.Velocity4.024−0.263-0.2635.461
FlowMesh, No Reg.Temperature575.795503.519659.990
FlowMesh, No Reg.TKE0.0570.0090.156
FlowMesh, With Reg. (λ=10−1\lambda= 10^{-1})Velocity3.931−0.246-0.2465.415
FlowMesh, With Reg. (λ=10−1\lambda= 10^{-1})Temperature576.075503.580658.834
FlowMesh, With Reg. (λ=10−1\lambda= 10^{-1})TKE0.0540.0080.153

Table 5.

The spatial diagnostics in Figure 3 complement these marginal metrics. The mean fields are reproduced across most of the coolant domain, while the largest KL and JS discrepancies remain concentrated near the heated rod surfaces, where the temperature and velocity gradients are steepest. This localization is consistent with temperature remaining the most challenging field, even though stronger regularization substantially improves its aggregate distributional metrics.

PWR subchannel benchmark results on an unstructured mesh

Figure 3. Pressurized water reactor (PWR) subchannel benchmark results on an unstructured mesh. (a) Schematic of the reactor subchannel geometry showing the fuel rods, coolant inlet conditions, flow direction, and extracted transverse cross-section, illustrated using the temperature field. (b) Probability density function (PDF) comparisons between the reference computational fluid dynamics (CFD) data and FlowMesh-generated samples for velocity magnitude, temperature, and turbulent kinetic energy (TKE), with and without regularization. (c) Node-wise diagnostics for temperature, including mean and variance fields from the reference data and generated samples with and without regularization, mean-error maps relative to the reference, and Kullback-Leibler (KL) and Jensen-Shannon (JS) divergence maps between the reference and generated node-wise distributions.

The separate single-run comparison in Table 6 attains its highest joint PDF coverage with ℓ1\ell_1 supervision and λ=10−3\lambda= 10^{-3}. This configuration achieves coverages of 94.40% for velocity, 93.07% for temperature, and 96.98% for TKE, corresponding to a macro-average of 94.82%, compared with 94.31% for the regularized ℓ2\ell_2 configuration. Relative to the unregularized ℓ1\ell_1 baseline, regularization increases coverage by 1.47, 0.30, and 1.71 percentage points for velocity, temperature, and TKE, respectively.

Table 6: PWR sub-channel single-run comparison of ℓ1\ell_1 and ℓ2\ell_2 flow-matching supervision and the autoencoder reconstruction ceiling. For each loss, the unregularized baseline (λ=0\lambda= 0) is compared with the selected regularized setting (λ=10−3\lambda= 10^{-3}). The autoencoder reconstruction diagnostic passes N=4,000N = 4,000 reference fields through Dψ∘EϕD_{\psi} \circ E_{\phi} and evaluates them using the same metrics; it upper-bounds the distributional fidelity attainable by the latent flow model with this autoencoder. Lower KL, JS, and Wasserstein distance and higher PDF coverage are better.

ModelFieldKL ↓\downarrowJS ↓\downarrowWasserstein ↓\downarrowPDF Coverage (%) ↑\uparrow
Flow Match – No Reg (ℓ1\ell_1, λ=0\lambda=0)Velocity0.02760.01120.065092.93
Flow Match – No Reg (ℓ1\ell_1, λ=0\lambda=0)Temperature0.03220.01371.816592.77
Flow Match – No Reg (ℓ1\ell_1, λ=0\lambda=0)TKE0.01170.00440.001695.27
Flow Match – With Reg (ℓ1\ell_1, λ⋆=10−3\lambda^{\star}=10^{-3})Velocity0.01750.00750.025594.40
Flow Match – With Reg (ℓ1\ell_1, λ⋆=10−3\lambda^{\star}=10^{-3})Temperature0.03100.01342.692193.07
Flow Match – With Reg (ℓ1\ell_1, λ⋆=10−3\lambda^{\star}=10^{-3})TKE0.00470.00180.000696.98
Flow Match – No Reg (ℓ2\ell_2, λ=0\lambda=0)Velocity0.09770.03110.143385.10
Flow Match – No Reg (ℓ2\ell_2, λ=0\lambda=0)Temperature0.02750.01051.373992.17
Flow Match – No Reg (ℓ2\ell_2, λ=0\lambda=0)TKE0.04690.01570.003689.77
Flow Match – With Reg (ℓ2\ell_2, λ⋆=10−3\lambda^{\star}=10^{-3})Velocity0.01370.00530.016294.30
Flow Match – With Reg (ℓ2\ell_2, λ⋆=10−3\lambda^{\star}=10^{-3})Temperature0.02820.01092.057592.39
Flow Match – With Reg (ℓ2\ell_2, λ⋆=10−3\lambda^{\star}=10^{-3})TKE0.00540.00200.000396.25
AE reconstruction (diagnostic)Velocity1.13×10−41.13 \times10^{-4}4.2×10−54.2 \times10^{-5}0.004499.50
AE reconstruction (diagnostic)Temperature8.8×10−58.8 \times10^{-5}3.2×10−53.2 \times10^{-5}0.040099.60
AE reconstruction (diagnostic)TKE2.36×10−42.36 \times10^{-4}7.9×10−57.9 \times10^{-5}8.4×10−58.4 \times10^{-5}99.43

Table 6.

The temperature result is nevertheless metric-dependent. Under ℓ1\ell_1 supervision, regularization slightly improves temperature coverage and KL divergence but increases the Wasserstein distance from 1.8165 to 2.6921. Under ℓ2\ell_2 supervision, temperature coverage increases by only 0.22 percentage points, while KL, JS, and Wasserstein distance all increase slightly. The single-run comparison therefore supports ℓ1\ell_1 regularization as the best joint-coverage configuration and shows clearer benefits for velocity and TKE than for temperature. The autoencoder reconstruction diagnostic attains more than 99.4% coverage and KL divergence below 2.4×10−42.4 \times10^{-4} for every channel. Relative to this ceiling, the selected regularized ℓ1\ell_1 configuration retains a temperature KL gap of approximately 0.0309, indicating that most of the remaining distributional error is introduced by the latent flow stage rather than by autoencoder reconstruction.

Marginal distributional agreement does not imply that each generated realization satisfies the governing constraints. We therefore examined two complementary diagnostics for the regularized ℓ1\ell_1 model with λ=10−3\lambda= 10^{-3}. The global energy diagnostic is comparatively insensitive to the small negative TKE excursions: clipping these values to zero changes the system energy by less than 0.01%. The wall-boundary diagnostic exposes a more consequential limitation. Generated velocity at stationary walls has a mean residual of approximately 1.5 m/s, and forcing the wall values to zero after generation removes approximately 5% of the domain momentum and 3.5% of its kinetic energy. Distributional fidelity and physical admissibility are therefore distinct objectives in the present model. The latter cannot be recovered through benign post-processing and will require hard boundary constraints or constraint-preserving parameterizations in the decoder or latent dynamics.

Heat Exchanger

Heat exchanger benchmark results on an unstructured mesh

Figure 4. Heat exchanger benchmark results on an unstructured mesh. (a) Schematic of the heat exchanger configuration showing the flow direction, internal geometry, and transverse cross-section used for virtual sensing, with velocity magnitude visualized on the sensor plane. (b) Probability density function (PDF) comparisons between the reference computational fluid dynamics (CFD) data and FlowMesh-generated samples with and without regularization for turbulent kinetic energy (TKE), pressure, temperature, three velocity components, and velocity magnitude. (c) Node-wise diagnostics for velocity magnitude, including mean and variance fields from the reference data and generated samples with and without regularization, mean-difference maps relative to the reference, and Kullback–Leibler (KL) and Jensen–Shannon (JS) divergence maps between the reference and generated node-wise distributions.

We next test FlowMesh on a heat-exchanger geometry to determine whether the trends observed in the PWR subchannel persist in a second energy-system configuration with different wall geometry and a larger set of thermofluid variables. The wall heat flux follows the same axial profile used in the PWR benchmark,

q(z)=Asin⁡(πzH),z∈[0,H],(11)q(z) = A \sin\left(\frac{\pi z}{H}\right), \quad z \in[0,H], \tag*{(11)}

where AA is the heat-flux amplitude. The profile is applied uniformly along the streamwise xx-direction,

qwall(x,z):=q(z),x∈[0,L],(12)q_{\mathrm{wall}}(x,z) := q(z), \quad x \in[0,L], \tag*{(12)}

and the operating envelope additionally varies the inlet temperature TinT_{\mathrm{in}} and inlet velocity magnitude uinu_{\mathrm{in}}. The parameter space is therefore

Uhx={qwall(x,z)=Asin⁡(πzH), Tin∈R, uin∈R}.(13)\mathcal{U}_{\mathrm{hx}} = \left\{q_{\mathrm{wall}}(x,z) = A \sin\left(\frac{\pi z}{H}\right),\ T_{\mathrm{in}} \in\mathbb{R},\ u_{\mathrm{in}} \in\mathbb{R}\right\}. \tag*{(13)}

The response is evaluated on a vertical cross-section Yhx⊂R2\mathcal{Y}_{\mathrm{hx}} \subset\mathbb{R}^{2} at fixed transverse location x=x0x=x_{0}. The reported fields comprise turbulent kinetic energy, pressure, temperature, the three velocity components, and velocity magnitude:

shx(z,y)=[k, p, T, uz, uy, ux, ∥u∥]T,(z,y)∈Yhx.(14)s_{\mathrm{hx}}(z,y) = [k,\ p,\ T,\ u_{z},\ u_{y},\ u_{x},\ \lVert u\rVert]^{\mathsf{T}}, \qquad(z,y) \in\mathcal{Y}_{\mathrm{hx}}. \tag*{(14)}

These seven reported channels are generated jointly as separate outputs of the decoder, including ∥u∥\lVert u\rVert, which is not computed from the generated components; they are the quantities used in the distributional comparisons of Table 7 and Table 8.

Table 7: Comparison of FlowMesh metrics (KL, JS, PDF coverage) on the Heat-Exchanger dataset, averaged over 6 independent training seeds. Coverage is evaluated against the autoencoder-reconstructed reference. Lower is better for KL and JS.

ModelFieldKL ↓JS ↓PDF Coverage (%) ↑
FlowMesh No RegularizerTKE0.003 820.001 4297.800
FlowMesh No RegularizerPressure0.004 890.001 7796.162
FlowMesh No RegularizerTemperature0.186 620.066 2280.288
FlowMesh No RegularizerZ-Velocity0.000 380.000 1499.196
FlowMesh No RegularizerY-Velocity0.001 890.000 7098.586
FlowMesh No RegularizerX-Velocity0.003 390.001 3497.784
FlowMesh No RegularizerVelocity Magnitude0.003 210.001 2597.914
FlowMesh With Regularizer (λ=10−1\lambda=10^{-1})TKE0.001 780.000 6398.426
FlowMesh With Regularizer (λ=10−1\lambda=10^{-1})Pressure0.002 600.000 9397.140
FlowMesh With Regularizer (λ=10−1\lambda=10^{-1})Temperature0.111 420.044 0684.487
FlowMesh With Regularizer (λ=10−1\lambda=10^{-1})Z-Velocity0.000 210.000 0899.393
FlowMesh With Regularizer (λ=10−1\lambda=10^{-1})Y-Velocity0.000 830.000 2998.980
FlowMesh With Regularizer (λ=10−1\lambda=10^{-1})X-Velocity0.001 120.000 4298.329
FlowMesh With Regularizer (λ=10−1\lambda=10^{-1})Velocity Magnitude0.001 140.000 4398.398

Table 7.

Table 8: Comparison of statistical values of data across various fields (Heat-Exchanger). FlowMesh rows are the mean over 6 independent training seeds; the Original row is as reported for the original dataset.

Data OriginFieldMeanMin ValueMax Value
OriginalTKE1.07800.04902.9885
OriginalPressure6645.9000−13 974.380025 704.1000
OriginalTemperature292.3600263.8500322.5100
OriginalZ-Velocity0.0009−4.49104.5110
OriginalY-Velocity0.1602−2.18003.4880
OriginalX-Velocity3.91700.00009.2520
OriginalVelocity Magnitude4.19200.00009.2730
FlowMesh No RegularizerTKE1.08000.03033.1224
FlowMesh No RegularizerPressure6654.6775−14 611.238926 844.0859
FlowMesh No RegularizerTemperature293.0365258.6028328.3941
FlowMesh No RegularizerZ-Velocity0.0009−4.62264.6316
FlowMesh No RegularizerY-Velocity0.1604−2.24563.5759
FlowMesh No RegularizerX-Velocity3.9197−0.15009.4946
FlowMesh No RegularizerVelocity Magnitude4.1951−0.15219.5210
FlowMesh With Regularizer (λ=10−1\lambda=10^{-1})TKE1.07320.03843.0997
FlowMesh With Regularizer (λ=10−1\lambda=10^{-1})Pressure6614.1274−14 477.359426 646.2246
FlowMesh With Regularizer (λ=10−1\lambda=10^{-1})Temperature292.8551258.5447328.7100
FlowMesh With Regularizer (λ=10−1\lambda=10^{-1})Z-Velocity0.0009−4.59664.6061
FlowMesh With Regularizer (λ=10−1\lambda=10^{-1})Y-Velocity0.1599−2.23263.5566
FlowMesh With Regularizer (λ=10−1\lambda=10^{-1})X-Velocity3.9070−0.13239.4524
FlowMesh With Regularizer (λ=10−1\lambda=10^{-1})Velocity Magnitude4.1816−0.12969.4803

Table 8.

Table 7 shows that latent-velocity regularization improves the mean KL divergence, JS divergence, and PDF coverage for every reported heat-exchanger field. The macro-average PDF coverage increases from 95.390% without regularization to 96.450% at λ=10−1\lambda= 10^{-1}, corresponding to a gain of 1.060 percentage points. The largest improvement occurs for temperature, whose coverage increases from 80.288% to 84.487%, while its KL divergence decreases from 0.18662 to 0.11142. The remaining fields already attain coverage above 96% without regularization and consequently show smaller coverage gains, although their KL and JS divergences consistently decrease. These results indicate that regularization provides broad improvements across the heat-exchanger fields, with its principal benefit concentrated in the more challenging temperature distribution.

Conceptual interpretation of latent-velocity regularization

Figure 5. Conceptual interpretation of latent-velocity regularization. (a) Unregularized flow matching is free to use latent velocities of any magnitude required by the data-matching objective. Large or rapidly varying transport fields can increase sensitivity of the numerical trajectory to local approximation error. The illustration is schematic and should not be interpreted as a measured trajectory or direct evidence of “manifold detachment.” (b) FlowMesh augments the flow-matching loss with an ℓ1\ell_1 penalty on the latent velocity magnitude. The regularization sweep in Figure 6 shows that increasing λ\lambda is empirically associated with a reduction in the sampled Jacobian norm of the learned velocity field, while moderate values can improve distributional fidelity. The implemented penalty is not a Dirichlet-energy objective and does not establish Wasserstein-geodesic optimality or formal contractivity.

The field statistics in Table 8 provide a complementary assessment. The regularized model is closer to the original data in 13 of the 21 reported mean, minimum, and maximum statistics, whereas the unregularized model is closer in seven and the two models tie in one. The regularized model improves most of the field extrema, while the unregularized model remains closer for several field means. Thus, the distributional improvements are broadly reflected in the summary statistics but are not uniform across every statistic. Because Table 7 and Table 8 report averages without seed-level standard deviations, these comparisons establish improvements in the mean metrics but do not by themselves demonstrate statistical significance across seeds.

Discussion

Deterministic transport versus latent diffusion Table 9 provides the most direct comparison between the two generative mechanisms considered here. FlowMesh achieves higher macro-averaged PDF coverage than the latent DDPM on all three benchmarks, with differences of approximately 11.6, 45.4, and 13.8 percentage points for the LDC, PWR subchannel, and heat exchanger, respectively. Because the two approaches use the same PointNet autoencoder and therefore operate on the same encoded data, the comparison controls for the principal geometric representation. It does not, however, constitute a universal comparison between flow matching and diffusion: the generative networks differ in parameterization and size, and the diffusion baseline uses a standard cosine-schedule DDPM with 250-step DDIM sampling rather than an exhaustively optimized scientific diffusion model. The experiments therefore establish that deterministic flow matching is substantially more effective than this architecture-controlled latent DDPM configuration on the present datasets.

DatasetFlowMesh (Ours)Flow Matching (Lipman et al.)Latent DDPM
Lid-driven Cavity96.9796.4785.39
PWR Subchannel91.6787.9046.30
Heat Exchanger96.4595.3982.70

Table 9. Comparison of PDF coverage (%) between FlowMesh, vanilla flow matching (Lipman et al.), and a latent DDPM baseline across benchmark datasets. FlowMesh and vanilla flow matching values are unweighted macro-averages across all reported fields using six fixed, matched training seeds. FlowMesh uses ℓ1\ell_1 velocity regularization with λ=10−1\lambda= 10^{-1}, whereas vanilla flow matching uses the identical model with λ=0\lambda= 0. All three models share the same PointNet autoencoder and latent space. Higher values indicate better distributional fidelity.

The result is consistent with two plausible advantages of FlowMesh. First, its sampling trajectory is obtained by integrating a learned velocity field rather than repeatedly estimating a reverse denoising update. Second, the adaptive ODE solver requires fewer network evaluations than the 250-step DDIM sampler used here. These mechanisms are consistent with the measured accuracy and cost differences but are not independently isolated by the present experiments. We therefore interpret the diffusion comparison as evidence for the effectiveness of deterministic latent transport on these mesh-based physical-field distributions, not as evidence that stochastic generative modeling is intrinsically incompatible with physical systems.

Computational cost: deterministic transport versus iterative denoising Table 10 compares the measured computational cost of FlowMesh and the latent DDPM. Under the common 100-epoch training budget and batch size of 128, the recorded training times are 7.6 min for FlowMesh and 39.5 min for DDPM. This wall-clock difference should not be interpreted as an algorithm-only speed-up because the reported implementations use different numerical precision, bf16 for FlowMesh and fp32 for DDPM, and different network sizes. The sampling comparison is more directly interpretable. FlowMesh requires 94.7±11.694.7 \pm11.6 adaptive velocity-network evaluations per generated sample, whereas the selected DDIM sampler uses 250 denoising evaluations. The resulting measured inference costs are approximately 1.4 TFLOP and 2.6 TFLOP per sample, respectively.

MetricFlowMeshLatent DDPM (shared PointNet encoder)
Network parameters20.8 M6.1 M
Forward pass15.1 GFLOP10.6 GFLOP
Training wall-clock (100 epochs)7.6 min39.5 min
Peak training memory9.4 GB6.1 GB
NFE per sample94.7 ±\pm 11.6 (adaptive)250 (DDIM)
Inference cost per sample∼\sim1.4 TFLOP∼\sim2.6 TFLOP
Wall-clock per sample1.23 ±\pm 0.15 s2.24 ±\pm 0.003 s
Sampling memory (batch 1)200 MB310 MB
HardwareA100 (40 GB)A100 (40 GB)

Table 10. Computational cost of FlowMesh versus the latent DDPM baseline. Both models operate on identical PointNet latent spaces; reported differences reflect only the generative component. Measured on one NVIDIA A100 (40 GB) GPU on the 4,096-dimensional latent (reshaped to 1 ×\times 64 ×\times 64), which is identical across datasets; training times were measured on the PWR subchannel latents, with FlowMesh at λ=0\lambda= 0; FLOPs from the PyTorch operator-level profiler. Training uses a matched 100-epoch budget and a batch size of 128; FlowMesh trains in mixed precision (bf16), and DDPM in fp32, following each reference implementation.

End-to-end, one FlowMesh realization, including latent ODE integration and decoder reconstruction, requires 1.23±0.151.23 \pm0.15 s on a single NVIDIA A100 GPU, compared with 2.24 s for the DDIM implementation. The larger practical gain is relative to high-fidelity simulation: depending on the benchmark, FlowMesh is 585–1,902 times faster than the corresponding ANSYS FLUENT calculation (Table 11). Thus, in the implementations evaluated here, deterministic latent transport provides both higher distributional fidelity and lower sampling cost than the latent DDPM while reducing the cost of generating additional thermofluid realizations by approximately three orders of magnitude relative to CFD.

DatasetMesh NodesCFD (s/sample)FlowMesh (s/sample)Speed-up{sup}†`
Lid-driven Cavity (LDC)422523401.23(15)1902
PWR Subchannel17337201.23(15)585
Heat Exchanger (HX)397718001.23(15)1463

Table 11. Per-sample computation time for each benchmark dataset. CFD reference times correspond to single-case ANSYS FLUENT runs on a 12-core Xeon CPU. FlowMesh inference is measured on a single NVIDIA A100 (40 GB) GPU (batch size 1, adaptive Dormand–Prince ODE solver, regularised model λ=10−3\lambda= 10^{-3}), averaged over 1,000 samples following 20 warm-up runs. Speed-up is the ratio of the CFD wall-clock time to the FlowMesh wall-clock time.

Relation to neural operators The present work targets distributional generation rather than deterministic forward regression. Neural operators such as DeepONet [19], MIONet [20], S-DeepONet [24], the Fourier neural operator [22], geometry-informed operators [25], and transformer-based operators are commonly trained to predict a field associated with a specified input function or parameter set. Under standard pointwise regression losses, these models are naturally evaluated through prediction error at that operating condition. FlowMesh instead generates an ensemble of fields whose distribution approximates the distribution represented by the training simulations. Because each reference solution is a deterministic RANS field, this distribution is the push-forward of the operating-condition distribution used to generate the dataset, p(s)=G#p(u)p(s) = G_{\#} p(u) (Appendix § 8.3). It therefore characterizes the sampled operating envelope (uniform over the ranges of Eq. (10) for the PWR subchannel) rather than a physical operational-uncertainty distribution, and when uu and p(u)p(u) are known the same ensemble can also be obtained by evaluating a deterministic operator on sampled inputs; FlowMesh learns it from field samples alone.

The distinction is particularly relevant in energy applications in which an ensemble, rather than a single best-estimate field, is required. Examples include estimating the distribution of peak coolant temperature across an uncertain operating envelope, generating synthetic field ensembles for downstream uncertainty propagation, and producing candidate states for sensor-placement or probabilistic-analysis studies. The present implementation should not, however, be interpreted as a conditional neural operator: as formulated in the Methods, the latent velocity field is not explicitly conditioned on a requested operating point. Conditional generation at prescribed heat flux, inlet temperature, or inlet velocity is therefore a natural extension rather than a capability demonstrated here.

Probabilistic neural operators, stochastic operator models, ensembles, and Bayesian formulations also address uncertainty in function-space prediction and are scientifically relevant comparators. We do not claim that generative flow matching is the only mechanism capable of representing field distributions. The comparison in this work is deliberately narrower: given a common PointNet representation, we compare deterministic latent flow matching, its velocity-regularized variants, and a standard latent DDPM. Deterministic neural operators remain complementary when fast point prediction at specified operating conditions is the primary objective.

Decomposing reconstruction and transport error The two-stage architecture introduces two distinct sources of error: compression and reconstruction through the autoencoder, and distributional transport in latent space. The autoencoder-only diagnostic in Table 6 attains PDF coverage above 99.4% and KL divergence below 2.4×10−42.4 \times10^{-4} for all three PWR fields. By contrast, the selected regularized ℓ1\ell_1 flow model yields a temperature KL divergence of 0.0310 and PDF coverage of 93.07%. The approximately 0.0309 KL gap relative to the autoencoder reconstruction therefore arises predominantly after encoding, indicating that latent distribution transport, rather than mesh reconstruction, is the principal remaining source of error in this benchmark. We use the autoencoder result as an empirical reconstruction reference rather than as a formal mathematical upper bound on every possible decoded distribution.

Limitations Several limitations define the present scope. First, all experiments use a fixed mesh for each physical system. PointNet provides permutation invariance to node ordering, but the study does not demonstrate zero-shot transfer across mesh topologies, resolutions, or geometries. Second, the generative velocity field is not explicitly conditioned on operating parameters in the formulation reported here. FlowMesh therefore learns the field distribution over the sampled operating envelope rather than a conditional distribution at an arbitrary prescribed operating point. Extending the model to conditional transport is necessary for many digital-twin applications.

Third, distributional fidelity does not guarantee physical admissibility. The PWR model exhibits a mean no-slip wall residual of approximately 1.5 m/s, and post-hoc correction changes domain momentum and kinetic energy non-negligibly. Hard boundary conditions, conservation constraints, or constraint-preserving output parameterizations will therefore be required before the method can be considered for safety-critical operational use. Small negative values also occur in quantities such as velocity magnitude and TKE, showing that positivity is not enforced by construction.

Fourth, the regularization weight is problem dependent. The principal six-seed comparisons use λ=10−1\lambda= 10^{-1}, whereas the separate PWR loss ablation and computational-cost measurements use λ=10−3\lambda= 10^{-3}. The sweep demonstrates a broad useful regime but does not provide an automatic selection rule. Fifth, the latent DDPM shares the same PointNet representation and training data but is not parameter-matched to the FlowMesh velocity network and uses a standard 250-step DDIM sampler. The reported diffusion gap therefore applies to this controlled baseline rather than to the full class of diffusion or score-based generative models.

Finally, the present benchmarks are fixed-geometry thermo­fluid field ensembles. Generalization to transient three-dimensional systems, discontinuous multiphase or reacting flows, previously unseen geometries, and out-of-distribution operating regimes remains to be established. These limitations bound the current conclusion to deterministic generative transport of distributions on the fixed unstructured geometries evaluated here.

The present results establish a narrower foundation for those applications. Permutation-invariant encoding can compress fixed unstructured-mesh fields with little reconstruction loss, deterministic flow matching can reproduce their distributions more accurately and cheaply than the latent DDPM evaluated here, and moderate velocity regularization can improve transport in the benchmarks for which the unregularized model is less accurate. The next scientific step is not simply to scale the architecture, but to integrate conditional operating variables, hard conservation and boundary constraints, topology-changing geometries, and transient dynamics into the generative process. Demonstrating those capabilities would determine whether deterministic latent transport can progress from efficient ensemble generation toward trustworthy generative digital twins for nuclear and other safety-critical energy systems.

Conclusion

FlowMesh shows that deterministic latent transport can generate distributions of high-dimensional physical fields on fixed unstructured meshes without interpolation to an auxiliary grid. Across lid-driven-cavity, PWR-subchannel, and heat-exchanger benchmarks, it attains 91.7–97.0% macro-averaged PDF coverage and outperforms a latent DDPM built on the same PointNet representation by 11.6–45.4 percentage points, while reducing the cost of each additional realization by roughly three orders of magnitude relative to the reference CFD. The effect of velocity regularization is regime dependent: it leaves the already accurate cavity model essentially unchanged but improves mean coverage where unregularized transport is less accurate, most strongly for temperature. An autoencoder-only diagnostic locates the remaining error primarily in latent transport rather than in mesh reconstruction.

Nuclear thermal hydraulics provides both the most demanding test case and the clearest limitation. In the PWR subchannel, high distributional fidelity coexists with a mean no-slip residual of approximately 1.5 m/s at stationary walls, showing that matching field statistics does not by itself enforce physical admissibility. Integrating hard boundary and conservation constraints into the decoder or the latent dynamics is therefore the next scientific challenge, together with conditioning on operating variables and extending the approach to topology-changing geometries and transient dynamics.

With such constraints in place, inexpensive ensemble generation after a high-fidelity dataset has been constructed could support rapid uncertainty propagation across coolant states, synthetic field ensembles for sensor-placement studies, and probabilistic exploration of thermal margins in nuclear reactors, heat exchangers, and other energy systems in which complex geometry makes repeated CFD evaluation costly.

Methods

Overview and rationale for the coupling

FlowMesh separates geometric compression from distributional generation. A PointNet-based autoencoder first maps a field defined on a fixed unordered node set to a compact latent representation. Because the same node-wise transformation is followed by a symmetric pooling operation, the encoded representation is invariant to permutations of the input ordering. A flow-matching model is then trained on the encoded states and learns a deterministic time-dependent velocity field whose ordinary differential equation transports samples from a Gaussian reference distribution to the latent data distribution. The generative variable t∈[0,1]t \in[0,1] parameterizes this probability-transport path and is not physical simulation time.

The autoencoder and flow model are trained sequentially. This design allows reconstruction error and latent-transport error to be diagnosed separately, as demonstrated by the autoencoder-only experiment in Table 6. We additionally augment the flow objective with an ℓ1\ell_1 penalty on the latent velocity magnitude. The penalty does not directly constrain derivatives of the velocity field and therefore is not a formal Lipschitz or Dirichlet-energy regularizer. Its influence on local velocity-field variation is assessed empirically through the Jacobian-norm diagnostic in Figure 6. The regularization sweep is used to determine whether the penalty improves generation, leaves it unchanged, or suppresses transport excessively.

Three-panel regularization sweep showing KL divergence, latent velocity Lipschitz, and PDF coverage

Figure 6. Regularization sweep maps the accuracy–stability trade-off in latent transport. PWR subchannel benchmark, single-run sweep. (a) Temperature KL divergence as a function of regularization strength λ∈{0,10−4,10−3,10−2,10−1,1}\lambda\in\{0, 10^{-4}, 10^{-3}, 10^{-2}, 10^{-1}, 1\}. Under ℓ1\ell_1 supervision, KL decreases from the unregularized value of approximately 0.032 to approximately 0.022 at λ=10−4\lambda= 10^{-4} and remains comparatively low through moderate λ\lambda, before increasing sharply at λ=1\lambda= 1. The ℓ2\ell_2 model deteriorates at smaller regularization weights. (b) Empirical Jacobian-norm proxy J^=max⁡(z,t)∈S∥∇zuθ(z,t)∥F\hat{J} = \max_{(z,t)\in S} \lVert\nabla_z u_\theta(z,t)\rVert_F estimated on the sampled evaluation set SS. The proxy decreases from approximately 65 at small λ\lambda to approximately 28 for ℓ1\ell_1 and 32 for ℓ2\ell_2 at λ=1\lambda= 1. This is an empirical measure of local velocity-field variation, not a proof of a global Lipschitz bound. (c) Temperature and velocity PDF coverage versus λ\lambda. Small-to-moderate ℓ1\ell_1 regularization improves both fields in this single run, whereas excessive regularization causes both to collapse. Together, the panels show that useful regularization occurs in an intermediate regime: reducing latent-velocity freedom can improve distributional transport, but suppressing it too strongly prevents the model from reaching the target distribution.

Operating in latent space also reduces the dimensionality presented to the generative model relative to the original mesh fields. The actual computational consequences of this compression are quantified through measured network evaluations, FLOPs, memory, and wall-clock sampling time in Table 10, rather than inferred from dimensionality alone.

Latent Encoding of Unstructured Mesh

Each sample is a field on a fixed mesh of NN nodes, X={(xi,fi)}i=1N\mathcal{X} = \{(\mathbf{x}_i,\mathbf{f}_i)\}_{i=1}^{N}, where xi∈R2\mathbf{x}_i \in\mathbb{R}^{2} are node coordinates and fi∈Rd\mathbf{f}_i \in\mathbb{R}^{d} are the node-associated physical quantities (d=3d = 3 for the cavity and subchannel, d=7d = 7 for the heat exchanger). Each field channel is standardized to zero mean and unit variance over all samples and nodes; coordinates are left unscaled. A separate autoencoder is trained for each dataset.

The encoder EϕE_{\phi} follows PointNet [17] but uses mean rather than max pooling. Each node input ui=[xi;fi]∈R2+d\mathbf{u}_i = [\mathbf{x}_i;\mathbf{f}_i] \in\mathbb{R}^{2+d} passes through a shared node-wise MLP with widths 64, 128 and 256 and ReLU activations,

hi=MLP⁡ϕ(ui)∈R256,(15)\mathbf{h}_i = \operatorname{MLP}_{\phi}(\mathbf{u}_i) \in\mathbb{R}^{256}, \tag*{(15)}

and the node embeddings are averaged,

g=1N∑i=1Nhi.(16)\mathbf{g} = \frac{1}{N} \sum_{i=1}^{N} \mathbf{h}_i. \tag*{(16)}

which makes the encoding invariant to node ordering. A linear layer then maps the pooled feature to the latent,

z=reshape⁡1×64×64(Wg+b),W∈R4096×256.(17)z = \operatorname{reshape}_{1 \times64 \times64}(Wg + b), \qquad W \in\mathbb{R}^{4096 \times256}. \tag*{(17)}

The reshape to a 1×64×641 \times64 \times64 array has no spatial meaning; it allows both generative models to use standard image U-Net architectures. Because zz is an affine function of gg, the latent distribution lies on an affine subspace of dimension at most 256 within R4096\mathbb{R}^{4096}. The latent size is identical for all three datasets, compared with 4225×34225 \times3, 1733×31733 \times3 and 3977×73977 \times7 field values for the cavity, subchannel and heat exchanger, respectively.

The decoder DψD_\psi maps zz back to the fields on the fixed node set. Two convolutional layers (1→16→321 \to16 \to32 channels) are followed by adaptive average pooling to 8×88 \times8 and fully connected layers whose output has size N×dN \times d, so that each output entry corresponds to a fixed node of the mesh. Node coordinates are encoder inputs only and are not reconstructed; each trained decoder is therefore specific to its mesh.

The autoencoder minimizes the mean-squared reconstruction error of the standardized fields,

LAE=1Nd∑i=1N∥f^i−fi∥22,(18)\mathcal{L}_{\mathrm{AE}} = \frac{1}{Nd}\sum_{i=1}^{N}\lVert\hat{\mathbf{f}}_i - \mathbf{f}_i \rVert_2^2, \tag*{(18)}

using Adam (learning rate 10−410^{-4}, batch size 32, 50 epochs). Reconstruction fidelity is assessed by the relative mean-squared error of the de-standardized fields and by the distributional diagnostic in Table 6.

Model architecture

In our methodology, we have employed Flow Matching (FM), a simulation-free framework that learns a time-dependent velocity field whose flow transports samples from a simple source distribution to the target data distribution. FM constructs a continuous-time probability path ptp_t interpolating between a Gaussian source distribution p0=N(0,I)p_0 = \mathcal{N}(0, I) and the target latent-data distribution p1=pdatap_1 = p_{\mathrm{data}}, and trains a neural velocity field uθ(t,z)u_\theta(t, z) to reproduce the instantaneous velocities that generate this path. The flow defined by uθu_\theta is then used in sampling by integrating with the following ODE:

ddtψt(z)=uθ(t,ψt(z)),ψ0(z)=z(19)\frac{d}{dt}\psi_t(z) = u_\theta(t, \psi_t(z)), \qquad\psi_0(z) = z \tag*{(19)}

Model parametrization

The velocity field uθ(z,t)u_\theta(z,t) is parameterized by a U-Net of the ADM architecture [26] operating on the 1×64×641 \times64 \times64 latent array, with 64 base channels, channel multipliers (1,2,3,4)(1, 2, 3, 4), two residual blocks per resolution, single-head self-attention at the 16×1616 \times16 feature resolution, and no dropout (20.8 M parameters). The generative time tt enters through sinusoidal embeddings. The network receives no other input: neither the operating parameters nor any observation of the field is provided, so the model learns the unconditional latent distribution p1p_1. Its output is a velocity with the same shape as zz. The same configuration is used for all three datasets and is trained in bfloat16 mixed precision.

Training

Using a straight-line interpolation between independent samples z0∼p0z_0 \sim p_0 and z1∼p1z_1 \sim p_1, the network is trained by minimizing either the ℓ1\ell_1 or ℓ2\ell_2 error between the predicted and target velocities:

LCFMℓ1(θ)=Et,z0,z1[∥uθ(zt,t)−ut(zt∣z1)∥1],(20)\mathcal{L}_{\mathrm{CFM}}^{\ell_1}(\theta) = \mathbb{E}_{t,z_0,z_1}\left[\lVert u_\theta(z_t,t) - u_t(z_t \mid z_1)\rVert_1\right], \tag*{(20)}

or

LCFMℓ2(θ)=Et,z0,z1[∥uθ(zt,t)−ut(zt∣z1)∥22].(21)\mathcal{L}_{\mathrm{CFM}}^{\ell_2}(\theta) = \mathbb{E}_{t,z_0,z_1}\left[\lVert u_\theta(z_t,t) - u_t(z_t \mid z_1)\rVert_2^2\right]. \tag*{(21)}

Here,

zt=(1−t)z0+tz1,ut(zt∣z1)=z1−zt1−t.(22)z_t = (1-t)z_0 + tz_1, \qquad u_t(z_t \mid z_1) = \frac{z_1-z_t}{1-t}. \tag*{(22)}

Unless otherwise stated, results labeled ℓ1\ell_1 use LCFMℓ1\mathcal{L}_{\mathrm{CFM}}^{\ell_1}, whereas results labeled ℓ2\ell_2 use LCFMℓ2\mathcal{L}_{\mathrm{CFM}}^{\ell_2}. Following [27], “conditional” in LCFM\mathcal{L}_{\mathrm{CFM}} refers to conditioning the target velocity utu_t on the endpoint z1z_1, not on physical inputs.

Here, ztz_t is the interpolated sample at time tt, and utu_t is the ground-truth instantaneous velocity. During each training iteration, batches of (z0,z1)(z_0,z_1) pairs are drawn, and an independent tt value is sampled uniformly in [0,1][0,1] for each pair. The interpolated samples ztz_t and their corresponding target velocities utu_t are computed analytically. The network parameters are optimized using the Adam optimizer (β1=0.9\beta_1 = 0.9, β2=0.999\beta_2 = 0.999) with a constant learning rate.

Sampling

To generate novel samples from the learned model, we begin by drawing an initial point z0∼p0z_0 \sim p_0 from the Gaussian distribution and evolving it forward in continuous time according to the learned probability flow z˙t=uθ(zt,t)\dot{z}_t = u_\theta(z_t,t). For numerical integration, we employ the adaptive Dormand-Prince method, which provides a favorable balance between accuracy and computational efficiency for this task. The solver adjusts its step size adaptively based on local error estimates, with relative and absolute tolerances tuned on a held-out validation set.

Latent diffusion baseline

To separate geometric representation from the choice of generative mechanism, the diffusion baseline uses the same trained PointNet autoencoder as FlowMesh, including the same encoder EϕE_\phi, decoder DψD_\psi, latent representation, and reconstruction objective LAE\mathcal{L}_{\mathrm{AE}}. The encoded training samples presented to the two generative models are therefore identical. The latent diffusion model is a denoising diffusion probabilistic model (DDPM) [13] trained with a cosine noise schedule and sampled with a 250-step DDIM procedure. The noise-prediction network is a U-Net operating on the same 1×64×641 \times64 \times64 latent array, with encoder widths (32,64,128,256)(32, 64, 128, 256), bottleneck widths (256,256,128)(256, 256, 128), 128-dimensional time embeddings, and four-head self-attention with group normalization in every block (6.1 M parameters), using T=1000T = 1000 diffusion steps.

The comparison controls the geometric representation, dataset, batch size, and evaluation pipeline, but it is not parameter matched: the FlowMesh and DDPM generative networks have different parameter counts and computational graphs, as reported in Table 10. Their training implementations also use different numerical precision. Consequently, differences in distributional accuracy isolate the generative pipelines under a shared latent representation, but should not be interpreted as a theorem that flow matching is intrinsically superior to all diffusion architectures.

Latent-velocity regularization and stability diagnostics

Flow matching learns a velocity field uθ(z,t)u_\theta(z,t) whose ODE

dztdt=uθ(zt,t),z0∼p0,(23)\frac{d z_t}{d t} = \mathbf{u}_\theta(z_t,t), \qquad z_0 \sim p_0, \tag*{(23)}

transports probability mass from the reference distribution toward the latent data distribution. Under the usual regularity assumptions, the corresponding density satisfies the continuity equation

∂pt∂t+∇z⋅(ptuθ)=0.(24)\frac{\partial p_t}{\partial t} + \nabla_z \cdot(p_t \mathbf{u}_\theta) = 0. \tag*{(24)}

We augment the flow-matching objective with an ℓ1\ell_1 penalty on the magnitude of the latent transport velocity:

L(θ)=LCFMq(θ)+λEt,zt[∥uθ(zt,t)∥1],q∈{1,2},(25)\mathcal{L}(\theta) = \mathcal{L}_{\mathrm{CFM}}^{q}(\theta) + \lambda\mathbb{E}_{t,z_t}\left[\left\|\mathbf{u}_\theta(z_t,t)\right\|_1\right], \qquad q \in\{1,2\}, \tag*{(25)}

where λ≥0\lambda\ge0 controls the strength of the penalty. The regularizer directly discourages large latent velocities. It does not contain derivatives of uθ\mathbf{u}_\theta and therefore should not be interpreted as a Dirichlet-energy penalty or as direct mathematical control of the Lipschitz constant. Unlike kinetic-energy and Jacobian-norm regularizers for continuous-time flows [28], which penalize ∥uθ∥22\|\mathbf{u}_\theta\|_2^2 and estimate ∥∇zuθ∥F2\|\nabla_z\mathbf{u}_\theta\|_F^2, respectively, the ℓ1\ell_1 penalty uses only the network output, adds negligible cost, and requires no stochastic trace estimator.

To determine whether reducing velocity magnitude is associated with a smoother learned vector field, we separately evaluate the Jacobian ∇zuθ\nabla_z\mathbf{u}_\theta after training. We report the empirical proxy

J^=max⁡(z,t)∈S∥∇zuθ(z,t)∥F,(26)\hat{J} = \max_{(z,t)\in S} \left\|\nabla_z\mathbf{u}_\theta(z,t)\right\|_F, \tag*{(26)}

where SS is the finite evaluation set used in the regularization sweep. A decrease in J^\hat{J} indicates lower local sensitivity over the sampled region, but does not constitute a global Lipschitz bound. Figure 6 shows that increasing λ\lambda is empirically associated with a decrease in this Jacobian-norm proxy. The same sweep also shows that this reduction is beneficial only over an intermediate range: excessive regularization suppresses the transport sufficiently strongly that distributional fidelity collapses.

Flow matching is closely related to continuous probability transport, and optimal transport provides useful mathematical context for such dynamics. The Benamou–Brenier formulation of the Wasserstein-2 distance minimizes an L2L^2 kinetic action of the form

∫01∫∥u(z,t)∥22pt(z) dz dt(27)\int_{0}^{1} \int\lVert\mathbf{u}(\mathbf{z},t) \rVert_{2}^{2} p_t(\mathbf{z}) \, \mathrm{d}\mathbf{z} \, \mathrm{d}t \tag*{(27)}

subject to the continuity equation and prescribed endpoint distributions. The ℓ1\ell_1 velocity penalty used in FlowMesh is a different objective and does not imply recovery of the Benamou–Brenier minimizer or a Wasserstein-2 geodesic. We therefore use optimal transport only as conceptual context for continuous distribution transport, not as a theoretical characterization of the learned FlowMesh trajectories.

Acknowledgments

This work used the Delta and DeltaAI systems at the National Center for Supercomputing Applications [awards OAC 2005572 and OAC 2320345] through allocation CIS240093 from the Advanced Cyberinfrastructure Coordination Ecosystem: Services & Support (ACCESS) program, which is supported by National Science Foundation grants #2138259, #2138286, #2138307, #2137603, and #2138296.

Declaration of Generative AI and AI-Assisted Technologies

Generative AI tools were used during manuscript preparation for language editing, structural organization, and refinement of selected visual materials. All numerical experiments, reported quantitative results, scientific interpretations, references, and conclusions were independently checked and approved by the authors. The authors take full responsibility for the accuracy, integrity, and originality of the final manuscript.

Appendix

Random Vectors

Let (Ω,F,P)(\Omega,\mathcal{F},\mathbb{P}) be a probability space. A random vector in Rd\mathbb{R}^{d} is a measurable function

X:Ω→RdX:\Omega\to\mathbb{R}^{d}

such that for every Borel set B∈B(Rd)B\in\mathcal{B}(\mathbb{R}^{d}), the event

{ω∈Ω:X(ω)∈B}∈F.\{\omega\in\Omega:X(\omega)\in B\}\in\mathcal{F}.

The law (or distribution) of XX is the push-forward measure

μX(B)=P(X∈B)=P({ω∈Ω:X(ω)∈B}).\mu_{X}(B)=\mathbb{P}(X\in B)=\mathbb{P}(\{\omega\in\Omega:X(\omega)\in B\}).

If μX\mu_{X} is absolutely continuous with respect to the Lebesgue measure λ\lambda on Rd\mathbb{R}^{d}, then there exists a probability density function (pdf) pXp_{X} such that

μX(B)=∫BpX(x) dx,∀B∈B(Rd).\mu_{X}(B)=\int_{B}p_{X}(x)\,dx,\quad\forall B\in\mathcal{B}(\mathbb{R}^{d}).

Expectation is defined for an integrable random vector XX as

E[X]=∫ΩX(ω) dP(ω)=∫Rdx pX(x) dx.\mathbb{E}[X] = \int_{\Omega} X(\omega)\,\mathrm{d}P(\omega) = \int_{\mathbb{R}^{d}} x\,p_X(x)\,\mathrm{d}x.

Conditional density and Expectation

Let (X,Y)(X,Y) be a random vector on Rm×Rn\mathbb{R}^{m} \times\mathbb{R}^{n} with joint density pX,Y(x,y)p_{X,Y}(x,y). The marginal densities are given by

pX(x)=∫RnpX,Y(x,y) dy,pY(y)=∫RmpX,Y(x,y) dx.p_X(x) = \int_{\mathbb{R}^{n}} p_{X,Y}(x,y)\,\mathrm{d}y,\qquad p_Y(y) = \int_{\mathbb{R}^{m}} p_{X,Y}(x,y)\,\mathrm{d}x.

If pY(y)>0p_Y(y) > 0, then the conditional density of XX given Y=yY = y is defined as

pX∣Y(x∣y)=pX,Y(x,y)pY(y).p_{X\mid Y}(x\mid y) = \frac{p_{X,Y}(x,y)}{p_Y(y)}.

The conditional expectation of XX given Y=yY = y is

E[X∣Y=y]=∫Rmx pX∣Y(x∣y) dx.\mathbb{E}[X\mid Y = y] = \int_{\mathbb{R}^{m}} x\,p_{X\mid Y}(x\mid y)\,\mathrm{d}x.

More generally, conditional expectation is defined as a random variable Z=E[X∣Y]Z = \mathbb{E}[X\mid Y] satisfying:

  1. ZZ is σ(Y)\sigma(Y)-measurable, where σ(Y)\sigma(Y) is the σ\sigma-algebra generated by YY.

  2. For every bounded measurable gg,

E[Xg(Y)]=E[Zg(Y)].\mathbb{E}[Xg(Y)] = \mathbb{E}[Zg(Y)].

Diffeomorphisms and push-forward maps

Let MM and NN be smooth manifolds. A map T:M→NT : M \to N is a diffeomorphism if:

  1. TT is bijective,

  2. TT is smooth,

  3. T−1T^{-1} is smooth.

If μ\mu is a measure on MM, then the push-forward measure under TT is

T#μ(B)=μ(T−1(B)),∀B⊆N.T_{\#}\mu(B) = \mu\left(T^{-1}(B)\right),\quad\forall B \subseteq N.

If X∼μX \sim\mu and Y=T(X)Y = T(X), then Y∼T#μY \sim T_{\#}\mu. If μ\mu admits density pXp_X and TT is differentiable, then the density of YY is

pY(y)=pX(T−1(y))∣det⁡∇T−1(y)∣.p_Y(y) = p_X\left(T^{-1}(y)\right)\left|\det\nabla T^{-1}(y)\right|.

Velocity fields and Flows

A vector field on a smooth manifold MM is a smooth section of the tangent bundle, that is, a mapping

V:M→TMV : M \to TM

such that V(x)∈TxMV(x) \in T_xM for all x∈Mx \in M.

Let u:[0,1]×Rd→Rdu : [0,1] \times\mathbb{R}^{d} \to\mathbb{R}^{d} be a time-dependent vector field. The associated flow {ψt}t∈[0,1]\{\psi_t\}_{t\in[0,1]} is defined as the solution to the ordinary differential equation

ddtψt(x)=u(t,ψt(x)),ψ0(x)=x.\frac{\mathrm{d}}{\mathrm{d}t}\psi_t(x) = u\left(t,\psi_t(x)\right),\qquad\psi_0(x) = x.

If uu is measurable in tt and Lipschitz continuous in xx, then the flow exists and is unique, and each map ψt:Rd→Rd\psi_t : \mathbb{R}^{d} \to\mathbb{R}^{d} is a diffeomorphism.

In flow matching, the vector field is parameterized by a neural network uθ(t,x)u_\theta(t,x). The generative model is defined by the probability flow ordinary differential equation.

ddtxt=uθ(t,xt),x0∼p0,\frac{\mathrm{d}}{\mathrm{d}t}x_t = u_\theta(t,x_t),\qquad x_0 \sim p_0,

where p0p_0 is a prescribed reference distribution. In the idealized setting, the terminal random variable satisfies x1∼p1x_1 \sim p_1, where p1p_1 denotes the target data distribution.

Constructing probability paths

Let p0p_0 and p1p_1 be two probability measures on Rd\mathbb{R}^d. A probability path is a family {pt}t∈[0,1]\{p_t\}_{t\in[0,1]} interpolating between them, i.e.

pt∣t=0=p0,pt∣t=1=p1.p_t\big|_{t=0}=p_0,\qquad p_t\big|_{t=1}=p_1.

One natural choice is the linear interpolation in sample space:

xt=(1−t)x0+tx1,x0∼p0, x1∼p1.x_t=(1-t)x_0+tx_1,\qquad x_0\sim p_0,\ x_1\sim p_1.

This induces a probability path pt=Law⁡(xt)p_t=\operatorname{Law}(x_t).

The instantaneous velocity of this interpolation is

ut(xt∣x1)=x1−xt1−t,t∈[0,1).u_t(x_t\mid x_1)=\frac{x_1-x_t}{1-t},\qquad t\in[0,1).

Alternatively, one can define optimal transport paths. If TT is the optimal transport map sending p0p_0 to p1p_1, then the McCann interpolation is

pt=((1−t)Id⁡+tT)#p0.p_t=\big((1-t)\operatorname{Id}+tT\big)_{\#}p_0.

This path minimizes the quadratic Wasserstein distance W2(pt,ps)W_2(p_t,p_s) and provides a geodesic in Wasserstein space.

Flow matching also constructs continuous probability paths, but a generic flow-matching path need not be an optimal-transport geodesic. In the present implementation, training uses straight-line interpolation between independently sampled source and target latent states. The learned velocity field is therefore trained to reproduce that prescribed probability path rather than to solve the Monge–Kantorovich or Benamou–Brenier optimization problem. The connection to optimal transport is conceptual unless the coupling and training objective are explicitly chosen to enforce optimal-transport structure.

References

  1. [1]Olgierd C Zienkiewicz and Robert Leroy Taylor. The finite element method set. Elsevier, 2005.
  2. [2]John David Anderson, John Wendt, et al. Computational fluid dynamics, volume 206. Springer, 1995.
  3. [3]Alfio Quarteroni and Alberto Valli. Numerical approximation of partial differential equations. Springer, 1994.
  4. [4]Peter Benner, Serkan Gugercin, and Karen Willcox. A survey of projection-based model reduction methods for parametric dynamical systems. SIAM review, 57(4):483–531, 2015.DOI
  5. [5]Kazuma Kobayashi and Syed Bahauddin Alam. Deep neural operator-driven real-time inference to enable digital twin solutions for nuclear energy systems. Scientific reports, 14(1):2101, 2024.DOI
  6. [6]Yuantao Yao, Te Han, Jie Yu, and Min Xie. Uncertainty-aware deep learning for reliable health monitoring in safety-critical energy systems. Energy, 291:130419, 2024.DOI
  7. [7]Pascal Jean Frey and Paul-Louis George. Mesh generation: application to finite elements. Iste, 2007.
  8. [8]Michael M. Bronstein, Joan Bruna, Yann LeCun, Arthur Szlam, and Pierre Vandergheynst. Geometric deep learning: Going beyond euclidean data. IEEE Signal Processing Magazine, 34(4):18–42, 2017.DOI
  9. [9]Joe F Thompson. Grid generation techniques in computational fluid dynamics. AIAA journal, 22(11):1505–1523, 1984.DOI
  10. [10]Dimitri J Mavriplis. Directional agglomeration multigrid techniques for high-reynolds-number viscous flows. AIAA journal, 37(10):1222–1230, 1999.DOI
  11. [11]Joe F Thompson, Bharat K Soni, and Nigel P Weatherill. Handbook of grid generation. CRC press, 1998.
  12. [12]Alvaro Sanchez-Gonzalez, Jonathan Godwin, Tobias Pfaff, Rex Ying, Jure Leskovec, and Peter Battaglia. Learning to simulate complex physics with graph networks. In Hal Daumé III and Aarti Singh, editors, Proceedings of the 37th International Conference on Machine Learning, volume 119 of Proceedings of Machine Learning Research, pages 8459–8468. PMLR, 13–18 Jul 2020.
  13. [13]Jonathan Ho, Ajay Jain, and Pieter Abbeel. Denoising diffusion probabilistic models. Advances in neural information processing systems, 33:6840–6851, 2020.arxiv.org/abs/2006.11239
  14. [14]Robin Rombach, Andreas Blattmann, Dominik Lorenz, Patrick Esser, and Björn Ommer. High-resolution image synthesis with latent diffusion models. In Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, pages 10684–10695, 2022.arxiv.org/abs/2112.10752
  15. [15]Wenpin Tang and Hanyang Zhao. Contractive diffusion probabilistic models. SIAM Journal on Imaging Sciences, 19(2):1364–1389, 2026.arxiv.org/abs/2401.13115
  16. [16]YAO Yuzhe, Jun Chen, Zeyi Huang, Haonan Lin, Mengmeng Wang, Guang Dai, and Jingdong Wang. Manifold constraint reduces operatorwise bias in accelerated diffusion sampling. In The Thirteenth International Conference on Learning Representations, 2025.
  17. [17]Charles R Qi, Hao Su, Kaichun Mo, and Leonidas J Guibas. Pointnet: Deep learning on point sets for 3d classification and segmentation. In Proceedings of the IEEE conference on computer vision and pattern recognition, pages 652–660, 2017.arxiv.org/abs/1612.00593
  18. [18]Yaron Lipman, Ricky TQ Chen, Heli Ben-Hamu, Maximilian Nickel, and Matt Le. Flow matching for generative modeling. arXiv preprint arXiv:2210.02747, 2022.arxiv.org/abs/2210.02747
  19. [19]Lu Lu, Pengzhan Jin, Guofei Pang, Zhongqiang Zhang, and George Em Karniadakis. Learning nonlinear operators via deeponet based on the universal approximation theorem of operators. Nature machine intelligence, 3(3):218–229, 2021.
  20. [20]Pengzhan Jin, Shuai Meng, and Lu Lu. Mionet: Learning multiple-input operators via tensor product. SIAM Journal on Scientific Computing, 44(6):A3490–A3514, 2022.arxiv.org/abs/2202.06137
  21. [21]Junyan He, Shashank Kushwaha, Jaewan Park, Seid Koric, Diab Abueidda, and Iwona Jasiuk. Sequential deep operator networks (s-deeponet) for predicting full-field solutions under time-dependent loads. Engineering Applications of Artificial Intelligence, 127:107258, 2024.DOI
  22. [22]Zongyi Li, Nikola Kovachki, Kamyar Azizzadenesheli, Burigede Liu, Kaushik Bhattacharya, Andrew Stuart, and Anima Anandkumar. Fourier neural operator for parametric partial differential equations. arXiv preprint arXiv:2010.08895, 2020.arxiv.org/abs/2010.08895
  23. [23]Zhongkai Hao, Zhengyi Wang, Hang Su, Chengyang Ying, Yinpeng Dong, Songming Liu, Ze Cheng, Jian Song, and Jun Zhu. Gnot: A general neural operator transformer for operator learning. In International conference on machine learning, pages 12556–12569. PMLR, 2023.arxiv.org/abs/2302.14376
  24. [24]Somdatta Goswami, Aniruddha Bora, Yue Yu, and George Em Karniadakis. Physics-informed deep neural operator networks, 2022.arxiv.org/abs/2207.05748
  25. [25]Zongyi Li, Nikola Kovachki, Chris Choy, Boyi Li, Jean Kossaifi, Shourya Otta, Mohammad Amin Nabian, Maximilian Stadler, Christian Hundt, Kamyar Azizzadenesheli, et al. Geometry-informed neural operator for large-scale 3d pdes. Advances in Neural Information Processing Systems, 36:35836–35854, 2023.arxiv.org/abs/2309.00583
  26. [26]Prafulla Dhariwal and Alexander Nichol. Diffusion models beat gans on image synthesis. Advances in neural information processing systems, 34:8780–8794, 2021.
  27. [27]Yaron Lipman, Marton Havasi, Peter Holderrieth, Neta Shaul, Matt Le, Brian Karrer, Ricky TQ Chen, David Lopez-Paz, Heli Ben-Hamu, and Itai Gat. Flow matching guide and code. arXiv preprint arXiv:2412.06264, 2024.arxiv.org/abs/2412.06264
  28. [28]Chris Finlay, Jörn-Henrik Jacobsen, Levon Nurbekyan, and Adam Oberman. How to train your neural ode: the world of jacobian and kinetic regularization. In International conference on machine learning, pages 3154–3164. PMLR, 2020.arxiv.org/abs/2002.02798

Paper details

vlnc:W_ky8wa4me
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 2

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Physics and Astronomy

Generative AI tools

View statement
Looking for related papers…
Contents