Related papers: Guaranteeing Higher Order Convergence Rates for Ac…
We introduce in this paper two time discretization schemes tailored for a range of Wasserstein gradient flows. These schemes are designed to preserve mass, positivity and to be uniquely solvable. In addition, they also ensure energy…
We propose a family of optimization methods that achieve linear convergence using first-order gradient information and constant step sizes on a class of convex functions much larger than the smooth and strongly convex ones. This larger…
We develop a two-dimensional high-order numerical scheme that exactly preserves and captures the moving steady states of the shallow water equations with topography or Manning friction. The high-order accuracy relies on a suitable…
Second-order optimization methods exhibit fast convergence to critical points, however, in nonconvex optimization, these methods often require restrictive step-sizes to ensure a monotonically decreasing objective function. In the presence…
This paper establishes the quantitative stability of invariant measures $\mu_{\alpha}$ for $\mathbb{R}^d$-valued ergodic stochastic differential equations driven by rotationally invariant multiplicative $\alpha$-stable processes with…
Flow-based generative models enjoy certain advantages in computing the data generation and the likelihood, and have recently shown competitive empirical performance. Compared to the accumulating theoretical studies on related score-based…
Accelerated first order methods, also called fast gradient methods, are popular optimization methods in the field of convex optimization. However, they are prone to suffer from oscillatory behaviour that slows their convergence when medium…
In this paper, we provide a convergence rate for particle approximations of a class of second-order PDEs on Wasserstein space. We show that, up to some error term, the infinite-dimensional inf(sup)-convolution of the finite-dimensional…
We study the quantitative convergence of drift-diffusion PDEs that arise as Wasserstein gradient flows of linearly convex functions over the space of probability measures on ${\mathbb R}^d$. In this setting, the objective is in general not…
In this paper, we present a novel second-order generalised rotational discrete gradient scheme for numerically approximating the orthonormal frame gradient flow of biaxial nematic liquid crystals. This scheme relies on reformulating the…
This paper discusses several (sub)gradient methods attaining the optimal complexity for smooth problems with Lipschitz continuous gradients, nonsmooth problems with bounded variation of subgradients, weakly smooth problems with H\"older…
We study the minimization of non-convex functionals over the Wasserstein space. While recent work has showed that perturbed Wasserstein gradient methods can avoid saddle points for benign landscapes, existing approaches remain essentially…
As the problem of minimizing functionals on the Wasserstein space encompasses many applications in machine learning, different optimization algorithms on $\mathbb{R}^d$ have received their counterpart analog on the Wasserstein space. We…
In this paper we study the problem of divergence-free numerical MHD and show that the work done so far still has four key unresolved issues. We resolve those issues in this paper. The problem of reconstructing MHD flow variables with…
We establish lower bounds on the complexity of finding $\epsilon$-stationary points of smooth, non-convex high-dimensional functions using first-order methods. We prove that deterministic first-order methods, even applied to arbitrarily…
We study the contraction in Wasserstein distance of the coordinate ascent variational inference algorithm. This is shown to hold under a transport-information inequality at the fixed points and a functional smoothness condition. The results…
We introduce a class of unconditionally energy stable, high order accurate schemes for gradient flows in a very general setting. The new schemes are a high order analogue of the minimizing movements approach for generating a time discrete…
A nonlinear diffusion equation, interpreted as a Wasserstein gradient flow, is numerically solved in one space dimension using a higher-order minimizing movement scheme based on the BDF (backward differentiation formula) discretization. In…
This paper studies the optimization of the KL functional on the Wasserstein space of probability measures, and develops a sampling framework based on Wasserstein gradient descent (WGD). We identify two important subclasses of the…
We develop in this paper an adaptive time-stepping approach for gradient flows with distinct treatments for conservative and non-conservative dynamics. For the non-conservative gradient flows in Lagrangian coordinates, we propose a modified…