NASep 19, 2022
The GenCol algorithm for high-dimensional optimal transport: general formulation and application to barycenters and Wasserstein splinesGero Friesecke, Maximilian Penka
We extend the recently introduced genetic column generation algorithm for high-dimensional multi-marginal optimal transport from symmetric to general problems. We use the algorithm to calculate accurate mesh-free Wasserstein barycenters and cubic Wasserstein splines.
8.8LGMar 15
Sampling Boltzmann distributions via normalizing flow approximation of transport mapsZia Ur Rehman, Gero Friesecke
In a celebrated paper \cite{noe2019boltzmann}, Noé, Olsson, Köhler and Wu introduced an efficient method for sampling high-dimensional Boltzmann distributions arising in molecular dynamics via normalizing flow approximation of transport maps. Here, we place this approach on a firm mathematical foundation. We prove the existence of a normalizing flow between the reference measure and the true Boltzmann distribution up to an arbitrarily small error in the Wasserstein distance. This result covers general Boltzmann distributions from molecular dynamics, which have low regularity due to the presence of interatomic Coulomb and Lennard-Jones interactions. The proof is based on a rigorous construction of the Moser transport map for low-regularity endpoint densities and approximation theorems for neural networks in Sobolev spaces. Numerical simulations for a simple model system and for the alanine dipeptide molecule confirm that the true and generated distributions are close in the Wasserstein distance. Moreover we observe that the RealNVP architecture does not just successfully capture the equilibrium Boltzmann distribution but also the metastable dynamics.
LGMar 23, 2021
Genetic column generation: Fast computation of high-dimensional multi-marginal optimal transport problemsGero Friesecke, Andreas S. Schulz, Daniela Vögler
We introduce a simple, accurate, and extremely efficient method for numerically solving the multi-marginal optimal transport (MMOT) problems arising in density functional theory. The method relies on (i) the sparsity of optimal plans [for $N$ marginals discretized by $\ell$ gridpoints each, general Kantorovich plans require $\ell^N$ gridpoints but the support of optimizers is of size $O(\ell\cdot N)$ [FV18]], (ii) the method of column generation (CG) from discrete optimization which to our knowledge has not hitherto been used in MMOT, and (iii) ideas from machine learning. The well-known bottleneck in CG consists in generating new candidate columns efficiently; we prove that in our context, finding the best new column is an NP-complete problem. To overcome this bottleneck we use a genetic learning method tailormade for MMOT in which the dual state within CG plays the role of an "adversary", in loose similarity to Wasserstein GANs. On a sequence of benchmark problems with up to 120 gridpoints and up to 30 marginals, our method always found the exact optimizers. Moreover, empirically the number of computational steps needed to find them appears to scale only polynomially when both $N$ and $\ell$ are simultaneously increased (while keeping their ratio fixed to mimic a thermodynamic limit of the particle system).
CHEM-PHAug 6, 2015
Pair densities in density functional theoryHuajie Chen, Gero Friesecke
The exact interaction energy of a many-electron system is determined by the electron pair density, which is not well-approximated in standard Kohn-Sham density functional models. Here we study the (complicated but well-defined) exact universal map from density to pair density. We survey how many common functionals, including the most basic version of the LDA (Dirac exchange with no correlation contribution), arise from particular approximations of this map. We develop an algorithm to compute the map numerically, and apply it to one-parameter families {a*rho(a*x)} of one-dimensional homogeneous and inhomogeneous single-particle densities. We observe that the pair density develops remarkable multiscale patterns which strongly depend on both the particle number and the "width" 1/a of the single-particle density. The simulation results are confirmed by rigorous asymptotic results in the limiting regimes a>>1 and a<<1. For one-dimensional homogeneous systems, we show that the whole spectrum of patterns is reproduced surprisingly well by a simple asymptotics-based ansatz which slowly smoothens out the "strictly correlated" a=0 pair density while slowly turning on the a=infty "exchange" terms as a increases. Our findings lend theoretical support to the celebrated semi-empirical idea [Becke93] to mix in a fractional amount of exchange, albeit not to assuming the mixing to be additive and taking the fraction to be a system independent constant.
NAJul 10, 2009
Mean field approximation in conformation dynamicsGero Friesecke, Oliver Junge, Péter Koltai
We propose a new approach to the transfer operator based analysis of the conformation dynamics of molecules. It is based on a statistical independence ansatz for the eigenfunctions of the operator related to a partitioning into subsystems. Numerical tests performed on small systems show excellent qualitative agreement between mean field and exact model, at greatly reduced computational cost.