Abstract
A normalizing flow (NF) is a mapping that transforms a chosen probability distribution to a normal distribution. Such flows are a common technique used for data generation and density estimation in machine learning and data science. The density estimate obtained with a NF requires a change of variables formula that involves the computation of the Jacobian determinant of the NF transformation. In order to tractably compute this determinant, continuous normalizing flows (CNF) estimate the mapping and its Jacobian determinant using a neural ODE. Optimal transport (OT) theory has been successfully used to assist in finding CNFs by formulating them as OT problems with a soft penalty for enforcing the standard normal distribution as a target measure. A drawback of OTbased CNFs is the addition of a hyperparameter, \(\alpha \), that controls the strength of the soft penalty and requires significant tuning. We present JKOFlow, an algorithm to solve OTbased CNF without the need of tuning \(\alpha \). This is achieved by integrating the OT CNF framework into a Wasserstein gradient flow framework, also known as the JKO scheme. Instead of tuning \(\alpha \), we repeatedly solve the optimization problem for a fixed \(\alpha \) effectively performing a JKO update with a timestep \(\alpha \). Hence we obtain a ”divide and conquer” algorithm by repeatedly solving simpler problems instead of solving a potentially harder problem with large \(\alpha \).
Similar content being viewed by others
Introduction
A normalizing flow (NF) is a type of generative modeling technique that has shown great promise in applications arising in physics^{1,2,3} as a general framework to construct probability densities for continuous random variables in highdimensional spaces^{4,5,6}. An NF provides a \({\mathcal {C}}^1\)diffeomorphism f (i.e., a normalizing transformation) that transforms the density \(\rho _0\) of an initial distribution \(P_0\) to the density \(\rho _1\) of the standard multivariate normal distribution \(P_1\)—hence the term ”normalizing”. Given such mapping f, the density \(\rho _0\) can be recovered from the Gaussian density via the change of variables formula,
where \(J_f \in \mathbb {R}^{d \times d}\) is the Jacobian of f. Moreover, one can obtain samples with density \(\rho _0\) by pushing forward Gaussian samples via \(f^{1}\).
Remark 1
Throughout the paper we slightly abuse notation, using the same notation for probability distributions and their density functions. Additionally, given a probability distribution \(P_0\) on \(\mathbb {R}^d\) and a measurable mapping \(f:\mathbb {R}^d \rightarrow \mathbb {R}^d\), we define the pushforward distribution of \(P_0\) through f as \((f\sharp P_0)(B)=P_0(f^{1}(B))\) for all Borel measurable \(B\subseteq \mathbb {R}^d\)^{7,8}.
There are two classes of normalizing flows: finite and continuous. A finite flow is defined as a composition of a finite number of \(\mathcal {C}^1\)diffeomorphisms: \(f = f_1 \circ f_2 \circ \cdots \circ f_n\). To make finite flows computationally tractable, each \(f_i\) is chosen to have some regularity properties such as a Jacobian with a tractable determinant; for example, \(J_{f_i}\) may have a triangular structure^{9,10,11}.
On the other hand, continuous normalizing flows (CNFs) estimate f using a neural ODE of the form^{12}:
where \(\theta \) are the parameters of the neural ODE. In this case, f is defined as \(f(x)= z(x,T)\) (for simplicity, we remove the dependence of z on \(\theta \)).
One of the main advantages of CNFs is that we can tractably estimate the logdeterminant of the Jacobian using Jacobi’s identity, which is commonly used in fluid mechanics (see, e.g.,^{8}, p. 114):
This is computationally appealing as one can replace the expensive determinant calculation by a more tractable trace computation of \(\nabla _z v_\theta (z(x,t),t)\). Importantly, no restrictions on \(\nabla _z v_\theta (z(x,t),t)\) (e.g., diagonal or triangular structure) are needed; thus, these Jacobians are also referred to as “freeform Jacobians”^{13}.
The goal in training a CNF is to find parameters, \(\theta \), such that \(f=z(\cdot ,T)\) leads to a good approximation of \(\rho _1\) or, assuming f is invertible, the pushforward of \(\rho _1\) through \(f^{1}\) is a good approximation of \(\rho _0\)^{5,6,10,13}. Indeed, let \(\widehat{\rho }_0\) be this pushforward density obtained with a CNF f; that is, \(\widehat{\rho }_0=f^{1}\sharp \rho _1\). We then minimize the KullbackLeibler (KL) divergence from \(\widehat{\rho }_0\) to \(\rho _0\) given by
where \(\ell (x,T) = \log  \det \nabla z(x,T) \). Dropping the \(\theta \)independent term \(\log \rho _0\) and using Eqs. (2) and (3), this previous optimization problem reduces to the minimization problem
subject to ODE constraints
The ODE Eq. (5) might be stiff for certain values of \(\theta \), leading to extremely long computation times. Indeed, the dependence of v on \(\theta \) is highly nonlinear and might generate vector fields that lead to highly oscillatory trajectories with complex geometry.
Some recent work leverages optimal transport theory to find the CNF^{14,15}. In particular, a kinetic energy regularization term (among others) is added to the loss to “encourage straight trajectories” z(x, t). That is, the flow is trained by solving the following minimization instead of Eq. (4):
subject to Eq. (5). The key insight in^{14,15} is that Eq. (4) is an example of a degenerate OT problem with a soft terminal penalty and without a transportation cost. The first term in the objective function in Eq. (6) given by the time integral is the transportation cost, whereas \(\alpha \) is a hyperparameter that balances the soft penalty and the transportation cost. Including this cost makes the problem wellposed by forcing the solution to be unique^{16}. Additionally, it enforces straight trajectories so that Eq. (5) is not stiff. Indeed^{14,15} empirically demonstrate that including optimal transport theory leads to faster and more stable training of CNFs. Intuitively, we minimize the KL divergence and the arclength of the trajectories.
Although including optimal transport theory into CNFs has been very successful^{14,15,17,18}, there are two key challenges that render them difficult to train. First, estimating the logdeterminant in Eq. (4) via the trace in Eq. (5) is still computationally taxing and commonly used methods rely on stochastic approximations^{13,14}, which add extra error. Second, including the kinetic energy regularization requires tuning of the hyperparameter \(\alpha \). Indeed, if \(\alpha \) is chosen too small in Eq. (6), then the kinetic regularization term dominates the training process, and the optimal solution consists of not moving, i.e., \(f(x) = x\). On the other hand, if \(\alpha \) is chosen too large, we return to the original setting where the problem is illposed, i.e., there are infinitely many solutions. Finally, finding an ”optimal” \(\alpha \) is problem dependent and requires tuning on a casebycase basis.
Our contribution
We present JKOFlow, an optimal transportbased algorithm for training CNFs without the need to tune the hyperparameter \(\alpha \) in Eq. (6). Our approach also leverages fast numerical methods for exact trace estimation from the recently developed optimal transport flow (OTFlow)^{15,19}.
The key idea is to integrate the OTFlow approach into a Wasserstein gradient flow framework, also known as the Jordan, Kinderlehrer, and Otto (JKO) scheme^{20}. Rather than tuning the hyperparameter \(\alpha \) (commonly done using a grid search), the idea is to simply pick any \(\alpha \) and solve a sequence of ”easier” OT problems that gradually approach the target distribution. Each solve is precisely a gradient descent in the space of distributions, a Wasserstein gradient descent, and the scheme provably converges to the desired distribution for all \(\alpha >0\)^{21}. Our experiments show that our proposed approach is effective in generating higher quality samples (and density estimates) and also allows us to reduce the number of parameters required to estimate the desired flow.
Our strategy is reminiscent of debiasing techniques commonly used in inverse problems. Indeed, the transportation cost that serves as a regularizer in Eq. (6) introduces a bias—the smaller \(\alpha \) the more bias is introduced (see, e.g.,^{22}), so good choices of \(\alpha \) tend to be larger. One way to remove the bias and avoid the need to tune the regularization parameter is to perform a sequence of Bregman iterations^{23,24}, also known as nonlinear proximal steps. Hence our approach reduces to debiasing via Bregman or proximal steps in the Wasserstein space. In the context of CNF training, Bregman iterations are advantageous due to the flexibility of the choice for \(\alpha \). Indeed, the resulting loss function is nonconvex and its optimization tends to get harder for large \(\alpha \). Thus, instead of solving one harder problem we solve several “easier” problems.
Optimal transport background and connections to CNFs
Denote by \(\mathcal {P}_2(\mathbb {R}^d)\) the space of Borel probability measures on \(\mathbb {R}^d\) with finite secondorder moments, and let \(\rho _0,\rho _1 \in \mathcal {P}_2(\mathbb {R}^d)\). The quadratic optimal transportation (OT) problem (which also defines the Wasserstain metric \(W_2\)) is then formulated as
where \(\Gamma (\rho _0,\rho _1)\) is the set of probability measures \(\pi \in \mathcal {P}(\mathbb {R}^{2d})\) with fixed x and ymarginal distributions \(\rho _0\) and \(\rho _1\), respectively. Hence the cost of transporting a unit mass from x to y is \(\Vert xy\Vert ^2\), and one attempts to transport \(\rho _0\) to \(\rho _1\) as cheaply as possible. In Eq. (7), \(\pi \) represents a transportation plan, and \(\pi (x,y)\) is the mass being transported from x to y. One can prove that \((\mathcal {P}_2(\mathbb {R}^d),W_2)\) is a complete separable metric space^{8}. OT has recently become a very active research area in PDE, geometry, functional inequalities, economics, data science and elsewhere partly due to equipping the space of probability measures with a (Riemannian) metric^{8,16,25,26}.
As observed in prior works, there are many similarities between OT and NFs^{14,15,18,27}. This connection becomes more transparent when considering the dynamic formulation of Eq. (7). More precisely, the BenamouBrenier formulation of the OT problem is given by^{28}:
Hence, the OT problem can be formulated as a problem of flowing \(\rho _0\) to \(\rho _1\) with a velocity field v that achieves minimal kinetic energy. The optimal velocity field v has several appealing properties. First, particles induced by the optimal flow v travel in straight lines. Second, particles travel with constant speed. Moreover, under suitable conditions on \(\rho _0\) and \(\rho _1\), the optimal velocity field is unique^{8}.
Given a velocity field v, denote by z(x, t) the solution of the ODE
Then, under suitable regularity conditions, we have that the solution of the continuity equation is given by \(\rho (\cdot ,t)=z(\cdot ,t)\sharp \rho _0\). Thus the optimization problem in Eq. (8) can be written as
This previous problem is very similar to (4) with the following differences:

the objective function in Eq. (4) does not have the kinetic energy of trajectories,

the terminal constraint is imposed as a soft constraint in Eq. (4) and as a hard constraint in Eq. (9), and

v in Eq. (4) is \(\theta \)dependent, whereas the formulation in Eq. (9) is in the nonparametric regime.
So the NF defined by Eq. (4) can be thought of as an approximation to a degenerate transportation problem that lacks transportation cost. Based on this insight one can regularize Eq. (4) by adding the transportation cost and arrive at Eq. (6) or some closely related version of it^{14,15,18,27}. It has been observed that the transportation cost (kinetic energy) regularization significantly improves the training of NFs.
JKOflow: Wasserstein gradient flows for CNFs
While the OTbased formulation of CNFs in Eq. (6) has been found successful in some applications^{14,15,18,27}, a key difficulty arises in choosing how to balance the kinetic energy term and the KLdivergence, i.e., on selecting \(\alpha \). This difficulty is typical in problems where the constraints are imposed in a soft fashion. Standard training of CNFs typically involves tuning for a “large but hopefully stable enough” step size \(\alpha \) so that the KL divergence term is sufficiently small after training. To this end, we propose an approach that avoids the need to tune \(\alpha \) by using the fact that the solution to Eq. (6) is an approximation to a backward Euler (or proximal point) algorithm when discretizing the Wasserstein gradient flow using the Jordan–Kinderlehrer–Otto (JKO) scheme^{20}.
The seminal work in^{20} provides a gradient flow structure of the Fokker–Planck equation using an implicit time discretization. That is, given \(\alpha > 0\), density at \(k{\text {th}}\) iteration, \(\rho ^{(k)}\), and terminal density \(\rho _1\), one finds
for \(k=0,1,\ldots \), and \(\rho ^{(0)} = \rho _0\). Here, \(\alpha \) takes the role of a step size when applying a proximal point method to the KL divergence using the Wasserstein2 metric, and \(\{\rho ^{(k)}\}\) provably converges to \(\rho _1\)^{20,21}. Hence, repeatedly solving Eq. (9) with the KL penalty acting as a soft constraint yields an arbitrarily accurate approximation of \(\rho _1\). In the parametric regime each iteration takes the form
Thus we solve a sequence of problems Eq. (6), where the initial density of the current subproblem is given by the pushforward of the density generated in the previous subproblem.
Importantly, our proposed approach does not require tuning \(\alpha \). Instead, we solve a sequence of subproblems that is guaranteed to converge to \(\rho _1\)^{20} prior to the neural network parameterization; see Algorithm 1. Indeed, since the traditional approach is equivalent to JKOFlow with one iteration, JKOFlow is generally more computationally expensive. But we crucially note that in the traditional singleshot setting, tuning \(\alpha \) may require training the model many times as well. JKOFlow provides a way to automate hyperparameter tuning of \(\alpha \). In our experiments, we observe that ten iterations of JKOFlow leads to good results for a highdimensional physics problem, see “Numerical experiments”. While our proposed methodology can be used in tandem with any algorithm used to solve Eq. (11), an important numerical aspect in our approach is to leverage fast computational methods that use exact trace estimation in Eq. (5); this approach is called OTFlow^{15}. Consequently, we avoid the use of stochastic approximation methods for the trace, e.g., Hutchinson’s estimator^{22,29,30}, as is typically done in CNF methods^{13,14}. A surprising result of our proposed method is that it empirically shows improved performance even with fewer number of parameters (see Fig. 3).
Related works
Density estimation
Multivariate density estimation is a fundamental problem in statistics^{31,32}, High Energy Physics (HEP)^{33} and in other fields of science dealing with multivariate data. For instance, particle physicists in HEP study possible distributions from a set of high energy data. Another application of density estimation is in confidence level calculations of particles in Higgs searches at Large Electron Positron Colliders (LEP)^{34} and discriminant methods used in the search for new particles^{33}. One of the main advantages of NFs over other generative models is that they provide density estimates of probability distributions using Eq. (1). That is, we do not need to apply a separate density estimation technique after generating samples from a distribution, e.g., as in GANs^{35}.
Finite flows
Finite normalizing flows^{4,5,6,36} use a composition of discrete transformations, where specific architectures are chosen to allow for efficient inverse and Jacobian determinant computations. NICE^{37}, RealNVP^{38}, IAF^{39}, and MAF^{10} use either autoregressive or coupling flows where the Jacobian is triangular, so the Jacobian determinant can be tractably computed. GLOW^{40} expands upon RealNVP by introducing an additional invertible convolution step. These flows are based on either coupling layers or autoregressive transformations, whose tractable invertibility allows for density evaluation and generative sampling. Neural Spline Flows^{41} use splines instead of the coupling layers used in GLOW and RealNVP. Using monotonic neural networks, NAF^{42} require positivity of the weights, which UMNN^{43} circumvent this requirement by parameterizing the Jacobian and then integrating numerically. A recent work, called Normalizing Field Flows (NFFs)^{44}, generalizes NFs to include learning random fields from scattered measurements; in particular, NFFs can be used to solve datadriven forward, inverse, and mixed forward/inverse stochastic partial differential equations.
Continuous and optimal transportbased flows
Modeling flows with differential equations is a natural and commonly used method^{27,45,46,47,48,49,50}. In particular, CNFs model their flow via a neural ordinary differential equation^{12,13,51}. Among the most wellknown CNFs are FFJORD^{13}, which estimates the determinant of the Jacobian by accumulating its trace along the trajectories, and the trace is estimated using Hutchinson’s estimator^{22,29,30}. To promote straight trajectories, RNODE^{14} regularizes FFJORD with a transport cost \(L(\varvec{x},T)\). RNODE also includes the Frobenius norm of the Jacobian \(\Vert \nabla \textbf{v}\Vert _F^2\) to stabilize training. The trace and the Frobenius norm are estimated using a stochastic estimator and report speedup by a factor of 2.8.
MongeAmpère Flows^{18} and Potential Flow Generators^{17} similarly draw from OT theory but parameterize a potential function instead of the dynamics directly. OT is also used in other generative models^{52,53,54,55,56,57}. OTFlow^{15} is based on a discretizethenoptimize approach^{58} that also parameterizes the potential function. To evaluate the KL divergence, OTFlow estimates the density using an exact trace computation following the work of^{19}.
Wasserstein gradient flows
Our proposed method is most closely related to^{59}, which also employs a JKObased scheme to perform generative modeling. But a key difference is that^{59} reformulates the KLdivergence as an optimization over difference of expectations (see^{59}, Prop. 3.1); this makes their approach akin to GANs, where the density cannot be obtained without using a separate density estimation technique. Our proposed method is also closely related to methods that use inputconvex CNNs^{60,61,62}. Reference^{62} focuses on the special case with KL divergence as objective function.^{60} solve a sequence of subproblems different from the fluid flow formulation presented in Eq. (11). They also require an endtoend training scheme that backpropagates to the initial distribution; this can become a computational burden when the number of time discretizations is large. Reference^{61} utilizes a JKObased scheme to approximate a population dynamics given an observed trajectory and focus on applications in computational biology. Other related works include natural gradient methods^{63} and implicit schemes based on the Wasserstein1 distance^{64}.
Numerical experiments
We demonstrate the effectiveness of our proposed JKOFlow on a series of synthetic and realworld datasets. As previously mentioned, we compute each update in Eq. (10) by solving Eq. (6) using the OTFlow solver^{15}, which leverages fast and exact trace computations. We also use the same architecture provided in^{15}. Henceforth, we shall also call the traditional CNF approach the “singleshot” approach. We also clarify that \(\alpha \) in our experiments refers to the parameter in Eq. (6).
Maximum mean discrepancy metric (MMD)
Our density estimation problem requires approximating a density \(\rho _0\) by finding a transformation f such that \(f^{1}\sharp \rho _1\) has density \(\widehat{\rho }_0\) close to \(\rho _0\), where \(\rho _1\) is the standard multivariate Gaussian. However, \(\rho _0\) is not known in realworld density estimation scenarios, such as in physics applications, all we have are samples \(X = \{x_i\}_{i=1}^n\) from the unknown distribution. Consequently, we use the observed samples X and samples \(\widehat{X}=\{\widehat{x}_j\}_{j=1}^m\), \(\widehat{x}_j=f^{1}(q_j)\), generated by the CNF and samples \(Q=\{q_j\}_{j=1}^m\) from \(\rho _1\) to determine if their corresponding distributions are close in some sense. To measure the discrepancy we use a particular integral probability metric^{65,66,67} known as maximum mean discrepancy (MMD) defined as follows^{68}: let x and y be random vectors in \(\mathbb {R}^d\) with distributions \(\mu _x\) and \(\mu _y\), respectively, and let \(\mathcal {H}\) be a reproducing kernel Hilbert space (RKHS) of functions on \(\mathbb {R}^d\) with Gaussian kernel (see^{69} for an introduction o RKHS’s)
Then the MMD of \(\mu _x\) and \(\mu _y\) is given by
It can be shown that \(\textrm{MMD}_\mathcal {H}\) defines a metric on the class of probability measures on \(\mathbb {R}^d\)^{68,70}. The squaredMMD can be written in terms of the kernel as follows:
where \(x,x^\prime \) are iid \(\mu _x\) independent of \(y,y^\prime \) which are iid \(\mu _y\). An unbiased estimate of the squaredMMD based on the samples X and \(\widehat{X}\) defined above is given by^{68}:
Note that the MMD is not used for algorithmic training of the CNF, it is only used to compare the densities \(\rho _0\) and \(\widehat{\rho }_0\) based on the samples X and \(\widehat{X}\).
Synthetic 2D data set
We begin by testing our method on seven twodimensional (2D) benchmark datasets for density estimation algorithms commonly used in machine learning^{13,43}; see Fig. 2. We generate results with JKOFlow for different values of \(\alpha \) and for different number of iterations. We use \(\alpha = 1\), 5, 10, and 50, and for each \(\alpha \) we use the single shot approach \(k=1\) and JKOFlow with \(k=5\) iterations from Eq. (10). Note that in CNFs, we are interested in estimating the density (and generating samples) from \(\rho _0\); consequently, once we have the optimal weights \(\theta ^{(1)}, \theta ^{(2)}, \ldots , \theta ^{(5)}\), we must “flow backwards” starting with samples from the normal distribution \(\rho _1\). Figure 1 shows that JKOFlow outperforms the single shot approach for different values of \(\alpha \). In particular, the performance for the single shot approach varies drastically for different values of \(\alpha \), with \(\alpha =1\) being an order of magnitude higher in MMD than \(\alpha =5\). On the other hand, JKOFlow performs consistently regardless of the value of \(\alpha \) for most datasets. There is one exception for the spirals dataset with \(\alpha = 1\); this is because only five iterations are used in the JKO scheme and more are needed. When 10 iterations are used instead, we achieve a similar order of accuracy (\(2.3e4\)). As previously mentioned, this is expected as JKOFlow is a proximal point algorithm that converges regardless of the step size \(\alpha \). In this case, five JKOFlow iterations are enough to obtain this consistency. Additional plots and hyperparameter setups for different benchmark datasets with similar performance results are shown in the Supplementary Information. Table 1 summarizes the comparison between the single shot and JKOFlow on all synthetic 2D datasets for different values of \(\alpha \). We also show an illustration of all the datasets, estimated densities, and generated samples with JKOFlow in Fig. 2.
Varying network size
In addition to obtaining consistent results for different values of \(\alpha \), we also empirically observe that JKOFlow outperforms the single shot approach for different numbers of network parameters, i.e., network size. We illustrate this in Fig. 3. This is also intuitive as we reformulate the problem of finding a single “difficult” optimal transportation problem as a sequence of “smaller and easier” OT problems. In this setup, we vary the width of a twolayer ResNet^{71}. In particular, we choose the widths to be \(m=3, 4, 5, 8\), and 16. These correspond to 40, 53, 68, 125, and 365 parameters. The hyperparameter \(\alpha \) is chosen to be the best performing value for each synthetic dataset. All datasets vary m for fixed \(\alpha = 5\), except the 2 Spiral dataset, which uses \(\alpha =50\); we chose these \(\alpha \) values as they performed the best in the fixed m experiments. Similar results are also shown for the remaining synthetic datasets in the Supplementary Information. Table 2 summarizes the comparison between the single shot and JKOFlow on all synthetic 2D datasets.
Density estimation on a physics dataset
We train JKOFlow on the 43dimensional Miniboone dataset which is a highdimensional, realworld physics dataset used as benchmark for highdimensional density estimation algorithms in physics^{72}. For this physics problem, our method is trained for \(\alpha = 0.5, \, 1, \, 5, \, 10,\,50\) and using 10 JKOFlow iterations. Fig. 4 shows generated samples with JKOFlow and the standard singleshot approach for \(\alpha = 5\). Since Miniboone is a highdimensional dataset, we follow^{15} and plot twodimensional slices. JKOFlow generates better quality samples. Similar experiments for \(\alpha =1, 10\), and 50 are shown in the Supplementary Information. Table 3 summarizes the results for all values of \(\alpha \). Note that we compute MMD values for all the dimensions as well as 2D slices; this is because we only have limited data ( 3000 testing samples) and the 2D slice MMD give a better indication on the improvement of the generated samples. Results show that the MMD is consistent across all \(\alpha \) values for JKOFlow. We also show the convergence (in MMD\(^2\)) of the miniboone dataset across each 2D slice in Fig. 5. As expected, smaller step size \(\alpha \) values converge slower (see \(\alpha = 0.5)\), but all converge to similar accuracy (unlike the singleshot).
Conclusion
We propose a new approach we call JKOFlow to train OTregularized CNFs without having to tune the regularization parameter \(\alpha \). The key idea is to embed an underlying OTbased CNF solver into a Wasserstein gradient flow framework, also known as the JKO scheme; this approach makes the regularization parameter act as a “time” variable. Thus, instead of tuning \(\alpha \), we repeatedly solve proximal updates for a fixed (time variable) \(\alpha \). In our setting, we choose OTFlow^{15}, which leverages exact trace estimation for fast CNF training. Our numerical experiments show that JKOFlow leads to improved performance over the traditional approach. Moreover, JKOFlow achieves similar results regardless of the choice of \(\alpha \). We also empirically observe improved performance when varying the size of the neural network. Future work will investigate JKOFlow on similar problems such as deep learningbased methods for optimal control^{73,74,75} and mean field games^{19,76,77}.
Data availability
The datasets used and/or analysed during the current study available from the corresponding author on reasonable request.
References
Brehmer, J., Kling, F., Espejo, I. & Cranmer, K. Madminer: Machine learningbased inference for particle physics. Comput. Softw. Big Sci. 4(1), 1–25 (2020).
Carleo, G. et al. Machine learning and the physical sciences. Rev. Modern Phys. 91(4), 045002 (2019).
F. Noé, S. Olsson, J. Köhler, & H. Wu. Boltzmann generators: Sampling equilibrium states of manybody systems with deep learning. Science. 365(6457), eaaw1147 (2019).
I. Kobyzev, S. Prince, & M. Brubaker. Normalizing flows: An introduction and review of current methods. in IEEE Transactions on Pattern Analysis and Machine Intelligence (2020).
G. Papamakarios, E. Nalisnick, D. J. Rezende, S. Mohamed, & B. Lakshminarayanan. Normalizing flows for probabilistic modeling and inference. arXiv:1912.02762 (2019).
D. J. Rezende & S. Mohamed. Variational inference with normalizing flows. in International Conference on Machine Learning (ICML), 1530–1538 (2015).
G. Peyré & M. Cuturi. Computational optimal transport. (2018).
Villani, C. in Topics in Optimal Transportation Vol. 58 (American Mathematical Society, Providence, RI, 2003).
R. Baptista, Y. Marzouk, R. E. Morrison, & O. Zahm. Learning nonGaussian graphical models via Hessian scores and triangular transport. arXiv preprint arXiv:2101.03093 (2021).
G. Papamakarios, T. Pavlakou, & I. Murray. Masked autoregressive flow for density estimation. in Advances in Neural Information Processing Systems (NeurIPS), 2338–2347 (2017).
Zech, J. & Marzouk, Y. Sparse approximation of triangular transports, part II: The infinitedimensional case. Construct. Approximation 55(3), 987–1036 (2022).
C. Chen, C. Li, L. Chen, W. Wang, Y. Pu, & L. C. Duke. Continuoustime flows for efficient inference and density estimation. in International Conference on Machine Learning (ICML), 824–833 (2018).
W. Grathwohl, R. T. Chen, J. Betterncourt, I. Sutskever, & D. Duvenaud. FFJORD: Freeform continuous dynamics for scalable reversible generative models. in International Conference on Learning Representations (ICLR) (2019).
C. Finlay, J.H. Jacobsen, L. Nurbekyan, & A. M. Oberman. How to train your neural ODE: The world of Jacobian and kinetic regularization. in International Conference on Machine Learning (ICML), 3154–3164 (2020).
D. Onken, S. Wu Fung, X. Li, & L. Ruthotto. Otflow: Fast and accurate continuous normalizing flows via optimal transport. in Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 35 (2021).
Villani, C. Optimal Transport: Old and New Vol. 338 (Springer Science & Business Media, New York, 2008).
L. Yang and G. E. Karniadakis. Potential flow generator with \({L}_2\) optimal transport regularity for generative models. in IEEE Transactions on Neural Networks and Learning Systems (2020).
L. Zhang, W. E, & L. Wang. MongeAmpère flow for generative modeling. arXiv:1809.10188 (2018).
Ruthotto, L., Osher, S. J., Li, W., Nurbekyan, L. & Fung, S. W. A machine learning framework for solving highdimensional mean field game and mean field control problems. Proc. Natl. Acad. Sci. 117(17), 9183–9193 (2020).
Jordan, R., Kinderlehrer, D. & Otto, F. The variational formulation of the FokkerPlanck equation. SIAM J. Math. Anal. 29(1), 1–17 (1998).
A. Salim, A. Korba, & G. Luise. The Wasserstein proximal gradient algorithm. in Advances in Neural Information Processing Systems (H. Larochelle, M. Ranzato, R. Hadsell, M. Balcan, & H. Lin, eds.), Vol. 33, 12356–12366. (Curran Associates, Inc., 2020).
L. Tenorio. An Introduction to Data Analysis and Uncertainty Quantification for Inverse Problems. (SIAM, 2017).
M. Burger, S. Osher, J. Xu, & G. Gilboa. Nonlinear inverse scale space methods for image restoration. in Variational, Geometric, and Level Set Methods in Computer Vision (N. Paragios, O. Faugeras, T. Chan, & C. Schnörr, eds.), 25–36 (Springer, 2005).
Osher, S., Burger, M., Goldfarb, D., Xu, J. & Yin, W. An iterative regularization method for total variationbased image restoration. Multisc. Model. Simulat. 4(2), 460–489 (2005).
Peyré, G. & Cuturi, M. Computational optimal transport. Foundations Trends Mach. Learn. 11(5–6), 355–607 (2019).
F. Santambrogio. Optimal Transport for aAplied Mathematicians, Vol. 87 of Progress in Nonlinear Differential Equations and their Applications. Birkhäuser/Springer, Cham, 2015. Calculus of variations, PDEs, and modeling.
M. Welling & Y. W. Teh. Bayesian learning via stochastic gradient Langevin dynamics. in International Conference on Machine Learning (ICML), 681–688 (2011).
Benamou, J.D. & Brenier, Y. A computational fluid mechanics solution to the MongeKantorovich mass transfer problem. Numerische Mathematik 84(3), 375–393 (2000).
Avron, H. & Toledo, S. Randomized algorithms for estimating the trace of an implicit symmetric positive semidefinite matrix. J. ACM (JACM) 58(2), 1–34 (2011).
Hutchinson, M. F. A stochastic estimator of the trace of the influence matrix for Laplacian smoothing splines. Commun. Stat.Simulat. Comput. 19(2), 433–450 (1990).
Scott, D. W. Multivariate Density Estimation: Theory, Practice, and Visualization (Wiley, New York, 2015).
Silverman, B. W. Density Estimation for Statistics and Data Analysis (CRC Press, New York, 1986).
Cranmer, K. Kernel estimation in highenergy physics. Comput. Phys. Commun. 136(3), 198–207 (2001).
Collaboration, O. & Abbiendi, G. Search for neutral Higgs bosons in collisions at 189 gev. Eur. Phys. J. CParticles Fields. 12(4), 567–586 (2000).
Goodfellow, I. et al. Generative adversarial networks. Commun. ACM 63(11), 139–144 (2020).
Tabak, E. G. & Turner, C. V. A family of nonparametric density estimation algorithms. Commun. Pure Appl. Math. 66(2), 145–164 (2013).
L. Dinh, D. Krueger, & Y. Bengio. NICE: Nonlinear independent components estimation. in International Conference on Learning Representations (ICLR) (Y. Bengio & Y. LeCun, eds.) (2015).
L. Dinh, J. SohlDickstein, & S. Bengio. Density estimation using real NVP. in International Conference on Learning Representations (ICLR) (2017).
D. P. Kingma, T. Salimans, R. Jozefowicz, X. Chen, I. Sutskever, & M. Welling. Improved variational inference with inverse autoregressive flow. in Advances in Neural Information Processing Systems (NeurIPS), 4743–4751 (2016).
D. P. Kingma & P. Dhariwal. Glow: Generative flow with invertible 1x1 convolutions. in Advances in Neural Information Processing Systems (NeurIPS), 10215–10224 (2018).
C. Durkan, A. Bekasov, I. Murray, & G. Papamakarios. Neural spline flows. in Advances in Neural Information Processing Systems (NeurIPS), 7509–7520 (2019).
C.W. Huang, D. Krueger, A. Lacoste, & A. Courville. Neural autoregressive flows. in International Conference on Machine Learning (ICML) 2078–2087 (2018).
A. Wehenkel & G. Louppe. Unconstrained monotonic neural networks. in Advances in Neural Information Processing Systems (NeurIPS), 1543–1553 (2019).
Guo, L., Wu, H. & Zhou, T. Normalizing field flows: Solving forward and inverse stochastic differential equations using physicsinformed flow models. J. Comput. Phys. 461, 111202 (2022).
C.W. Huang, R. T. Chen, C. Tsirigotis, & A. Courville. Convex potential flows: Universal probability distributions with optimal transport and convex optimization. arXiv preprint arXiv:2012.05942 (2020).
Neal, R. M. MCMC using Hamiltonian dynamics. Handbook Markov Chain Monte Carlo 2(11), 2 (2011).
Y. Park, D. Maddix, F.X. Aubet, K. Kan, J. Gasthaus, & Y. Wang. Learning quantile functions without quantile crossing for distributionfree time series forecasting. in International Conference on Artificial Intelligence and Statistics, 8127–8150. (PMLR, 2022).
Ruthotto, L. & Haber, E. An introduction to deep generative modeling. GAMMMitteilungen 44(2), e202100008 (2021).
T. Salimans, D. Kingma, & M. Welling. Markov chain Monte Carlo and variational inference: Bridging the gap. in International Conference on Machine Learning (ICML), 1218–1226 (2015).
Suykens, J., Verrelst, H. & Vandewalle, J. Online learning FokkerPlanck machine. Neural Process. Lett. 7, 81–89 (1998).
T. Q. Chen, Y. Rubanova, J. Bettencourt, & D. K. Duvenaud. Neural ordinary differential equations. in Advances in Neural Information Processing Systems (NeurIPS), 6571–6583, (2018).
G. Avraham, Y. Zuo, & T. Drummond. Parallel optimal transport GAN. in IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 4406–4415 (2019).
Lei, N., Su, K., Cui, L., Yau, S.T. & Gu, X. D. A geometric view of optimal transportation and generative model. Comput. Aided Geometr. Design 68, 1–21 (2019).
J. Lin, K. Lensink, & E. Haber. Fluid flow mass transport for generative networks. arXiv:1910.01694 (2019).
T. Salimans, H. Zhang, A. Radford, & D. N. Metaxas. Improving GANs using optimal transport. in International Conference on Learning Representations (ICLR) (2018).
M. Sanjabi, J. Ba, M. Razaviyayn, & J. D. Lee. On the convergence and robustness of training gans with regularized optimal transport. in Advances in Neural Information Processing Systems (NeurIPS), 7091–7101 (2018).
A. Tanaka. Discriminator optimal transport. in Advances in Neural Information Processing Systems (NeurIPS), 6816–6826 (2019).
D. Onken & L. Ruthotto. Discretizeoptimize vs. optimizediscretize for timeseries regression and continuous normalizing flows. arXiv:2005.13420 (2020).
J. Fan, Q. Zhang, A. Taghvaei, & Y. Chen. Variational Wasserstein gradient flow. in Proceedings of the 39th International Conference on Machine Learning, volume 162 of Proceedings of Machine Learning Research (K. Chaudhuri, S. Jegelka, L. Song, C. Szepesvari, G. Niu, & S. Sabato, eds.), 6185–6215. PMLR, 17–23 Jul 2022.
D. AlvarezMelis, Y. Schiff, & Y. Mroueh. Optimizing functionals on the space of probabilities with input convex neural networks. arXiv preprint arXiv:2106.00774 (2021).
C. Bunne, L. Papaxanthos, A. Krause, & M. Cuturi. Proximal optimal transport modeling of population dynamics. in International Conference on Artificial Intelligence and Statistics, 6511–6528. (PMLR, 2022).
Mokrov, P. et al. Largescale Wasserstein gradient flows. Adv. Neural Inform. Process. Syst. 34, 15243–15256 (2021).
L. Nurbekyan, W. Lei, & Y. Yang. Efficient natural gradient descent methods for largescale optimization problems. arXiv preprint arXiv:2202.06236 (2022).
H. Heaton, S. W. Fung, A. T. Lin, S. Osher, & W. Yin. Wassersteinbased projections with applications to inverse problems. arXiv preprint arXiv:2008.02200 (2020).
Müller, A. Integral probability metrics and their generating classes of functions. Adv. Appl. Probability 29(2), 429–443 (1997).
Rachev, S. T., Klebanov, L. B., Stoyanov, S. V. & Fabozzi, F. The Methods of Distances in the Theory of Probability and Statistics Vol. 10 (Springer, New York, 2013).
Zolotarev, V. M. Metric distances in spaces of random variables and their distributions. Math. USSRSbornik 30(3), 373 (1976).
Gretton, A., Borgwardt, K. M., Rasch, M. J., Schölkopf, B. & Smola, A. A kernel twosample test. J. Mach. Learn. Res. (JMLR) 13(25), 723–773 (2012).
Paulsen, V. I. & Raghupathi, M. An Introduction to the Theory of Reproducing Kernel Hilbert Spaces Vol. 152 (Cambridge University Press, Cambridge, 2016).
K. Fukumizu, A. Gretton, X. Sun, & B. Schölkopf. Kernel measures of conditional dependence. Adv. Neural Inform. Process. Syst. 20 (2007).
K. He, X. Zhang, S. Ren, & J. Sun. Deep residual learning for image recognition. in IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 770–778 (2016).
B. Roe. MiniBooNE particle identification. UCI Machine Learning Repository (2010).
W. H. Fleming & H. M. Soner. Controlled Markov Processes and Viscosity Solutions, Vol. 25 of Stochastic Modelling and Applied Probability, 2nd Edn. (Springer, 2006).
D. Onken, L. Nurbekyan, X. Li, S. W. Fung, S. Osher, & L. Ruthotto. A neural network approach applied to multiagent optimal control. in 2021 European Control Conference (ECC), 1036–1041. (IEEE, 2021).
D. Onken, L. Nurbekyan, X. Li, S. W. Fung, S. Osher, & L. Ruthotto. A neural network approach for highdimensional optimal control applied to multiagent path finding. in IEEE Transactions on Control Systems Technology (2022).
Agrawal, S., Lee, W., Fung, S. W. & Nurbekyan, L. Random features for highdimensional nonlocal meanfield games. J. Comput. Phys. 459, 111136 (2022).
Lin, A. T., Fung, S. W., Li, W., Nurbekyan, L. & Osher, S. J. Alternating the population and control neural networks to solve highdimensional stochastic meanfield games. Proc. Natl. Acad. Sci. 118(31), e2024713118 (2021).
Acknowledgements
LN and SO were partially funded by AFOSR MURI FA955018502, ONR N000141812527, N00014182012093 and N000142012787.
Author information
Authors and Affiliations
Contributions
A.V., L.N., and S.W.F. performed the research. All Authors wrote the manuscript.
Corresponding author
Ethics declarations
Competing Interests
The authors declare no competing interests.
Additional information
Publisher's note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Supplementary Information
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Vidal, A., Wu Fung, S., Tenorio, L. et al. Taming hyperparameter tuning in continuous normalizing flows using the JKO scheme. Sci Rep 13, 4501 (2023). https://doi.org/10.1038/s4159802331521y
Received:
Accepted:
Published:
DOI: https://doi.org/10.1038/s4159802331521y
This article is cited by

A Machine Learning Framework for Geodesics Under Spherical Wasserstein–Fisher–Rao Metric and Its Application for Weighted Sample Generation
Journal of Scientific Computing (2024)
Comments
By submitting a comment you agree to abide by our Terms and Community Guidelines. If you find something abusive or that does not comply with our terms or guidelines please flag it as inappropriate.