Related papers: Gradient flow approach to local mean-field spin sy…
The gradient flow of the Canham-Helfrich functional is tackled via the Generalized Minimizing Movements approach. We prove the existence of solutions in Wasserstein spaces of varifolds, as well as upper and lower diameter bounds. In the…
In this paper we present a numerical scheme for nonlinear continuity equations, which is based on the gradient flow formulation of an energy functional with respect to the quadratic transportation distance. It can be applied to a large…
We analyze gradient flows with jumps generated by a finite set of complete vector fields in involution using some Radon measures $u\in \mathcal{U}_a$ as admissible perturbations. Both the evolution of a bounded gradient flow $\{x^u(t,\l)\in…
We construct a family of semimartingales that describes the behavior of a particle system with sticky-reflecting interaction. The model is a physical improvement of the Howitt-Warren flow, an infinite system of diffusion particles on the…
We introduce Wasserstein-like dynamical transport distances between vector-valued densities on the real line. The mobility function from the scalar theory is replaced by a mobility matrix, that is subject to positivity and concavity…
We introduce a gradient flow formulation of linear Boltzmann equations. Under a diffusive scaling we derive a diffusion equation by using the machinery of gradient flows.
We study the modeling of a compressible two-phase flow in a porous medium. The governing free boundary problem is known as the Verigin problem with phase transition. We introduce a novel variational framework to construct weak solutions.…
We present a way to use Stein's method in order to bound the Wasserstein distance of order $2$ between two measures $\nu$ and $\mu$ supported on $\mathbb{R}^d$ such that $\mu$ is the reversible measure of a diffusion process. In order to…
In several machine learning tasks for graph structured data, the graphs under consideration may be composed of a varying number of nodes. Therefore, it is necessary to design pooling methods that aggregate the graph representations of…
We introduce in this paper new and very effective numerical methods based on neural networks for the approximation of the mean curvature flow of either oriented or non-orientable surfaces. To learn the correct interface evolution law, our…
In this paper, we investigate the training process of generative networks that use a type of probability density distance named particle-based distance as the objective function, e.g. MMD GAN, Cram\'er GAN, EIEG GAN. However, these GANs…
A popular method to perform adversarial attacks on neuronal networks is the so-called fast gradient sign method and its iterative variant. In this paper, we interpret this method as an explicit Euler discretization of a differential…
We develop a gradient-flow theory for time-dependent functionals defined in abstract metric spaces. Global well-posedness and asymptotic behavior of solutions are provided. Conditions on functionals and metric spaces allow to consider the…
It is well known that nonlinear diffusion equations can be interpreted as a gradient flow in the space of probability measures equipped with the Euclidean Wasserstein distance. Under suitable convexity conditions on the nonlinearity, due to…
Mainstream flow matching methods typically focus on learning the local velocity field, which inherently requires multiple integration steps during generation. In contrast, Mean Velocity Flow models establish a relationship between the local…
This paper introduces a novel data driven framework for constructing accurate and general equivariant models of multiscale phenomena which does not rely on specific assumptions about the underlying physics. This framework is illustrated…
We consider a system consisting of a geometric evolution equation for a hypersurface and a parabolic equation on this evolving hypersurface. More precisely, we discuss mean curvature flow scaled with a term that depends on a quantity…
We develop a new computational framework to solve the partial differential equations (PDEs) governing the flow of the joint probability density functions (PDFs) in continuous-time stochastic nonlinear systems. The need for computing the…
Sampling a target probability distribution with an unknown normalization constant is a fundamental challenge in computational science and engineering. Recent work shows that algorithms derived by considering gradient flows in the space of…
The Stein Variational Gradient Descent (SVGD) algorithm is a deterministic particle method for sampling. However, a mean-field analysis reveals that the gradient flow corresponding to the SVGD algorithm (i.e., the Stein Variational Gradient…