Related papers: A neural network approach for solving the Monge-Am…
In moving mesh methods, the underlying mesh is dynamically adapted without changing the connectivity of the mesh. We specifically consider the generation of meshes which are adapted to a scalar monitor function through equidistribution.…
The Monge-Amp\`{e}re equation arises in the theory of optimal transport. When more complicated cost functions are involved in the optimal transportation problem, which are motivated e.g. from economics, the corresponding equation for the…
We consider the Monge problem of optimal transport between a compactly supported source measure and a target probability measure with unbounded support. We consider the convergence of optimal maps and potential functions when the target…
An equation of Monge-Amp\`ere type has, for the first time, been solved numerically on the surface of the sphere in order to generate optimally transported (OT) meshes, equidistributed with respect to a monitor function. Optimal transport…
We consider the numerical solution of the optimal transport problem between densities that are supported on sets of unequal dimension. Recent work by McCann and Pass reformulates this problem into a non-local Monge-Amp\`ere type equation.…
We consider the numerical construction of minimal Lagrangian graphs, which is related to recent applications in materials science, molecular engineering, and theoretical physics. It is known that this problem can be formulated as an…
We introduce novel a posteriori error indicators for a nonlinear least-squares solver for smooth solutions of the Monge--Amp\`ere equation on convex polygonal domains in $\mathbb{R}^2$. At each iteration, our iterative scheme decouples the…
In this paper, we explore the fundamental role of the Monge-Amp\`ere equation in deep learning, particularly in the context of Boltzmann machines and energy-based models. We first review the structure of Boltzmann learning and its relation…
As an alternative to PINNs, a Deep Ritz framework is proposed to solve fully nonlinear PDEs. A least-squares algorithm is advocated to decouple the nonlinearities from the variational features of several fully nonlinear PDEs. A splitting…
We propose a boundary neuron method with random features (BNM-RF) for solving partial differential equations. The method approximates the unknown boundary function by a shallow network within the boundary integral formulation. With randomly…
We construct solutions to Monge-Amp\`ere equations whose Monge-Amp\`ere measures contain singular components supported on low codimensional sets. We also study the regularity of such solutions. To motivate our construction, we present…
Motivated by conjectures in Mirror Symmetry, we continue the study of the real Monge--Amp\`ere operator on the boundary of a simplex. This can be formulated in terms of optimal transport, and we consider, more generally, the problem of…
The aim of this paper is to obtain quantitative bounds for solutions to the optimal matching problem in dimension two. These bounds show that up to a logarithmically divergent shift, the optimal transport maps are close to be the identity…
We introduce and analyze a statistical estimator for Monge transport maps: solutions to the quadratic optimal transport problem in Euclidean space. For absolutely continuous source measures, this map is uniquely defined as the gradient of a…
It is well known that the quadratic-cost optimal transportation problem is formally equivalent to the second boundary value problem for the Monge-Amp\`ere equation. Viscosity solutions are a powerful tool for analysing and approximating…
The elliptic Monge-Amp\`ere equation is a fully nonlinear Partial Differential Equation that originated in geometric surface theory and has been applied in dynamic meteorology, elasticity, geometric optics, image processing and image…
This work builds the connection between the regularity theory of optimal transportation map, Monge-Amp\`{e}re equation and GANs, which gives a theoretic understanding of the major drawbacks of GANs: convergence difficulty and mode collapse.…
We rephrase Monge's optimal transportation (OT) problem with quadratic cost--via a Monge-Amp\`ere equation--as an infinite-dimensional optimization problem, which is in fact a convex problem when the target is a log-concave measure with…
We propose a numerical method to solve the Monge-Ampere equation which admits a classical convex solution. The Monge-Ampere equation is reformulated into an equivalent first-order system. We adopt a novel reconstructed discontinuous…
Monotone gradient functions play a central role in solving the Monge formulation of the optimal transport (OT) problem, which arises in modern applications ranging from fluid dynamics to robot swarm control. When the transport cost is the…