Related papers: Convergence rates of particle approximation of for…
In this paper, we propose an inexact proximal Newton-type method for nonconvex composite problems. We establish the global convergence rate of the order $\mathcal{O}(k^{-1/2})$ in terms of the minimal norm of the KKT residual mapping and…
This paper studies the convergence rate of the Euler-Maruyama scheme for systems of interacting particles used to approximate solutions of nonlinear Fokker-Planck equations with singular interaction kernels, such as the Keller-Segel model.…
In this paper, we consider a target random variable $Y \sim \CVG$ distributed according to a centered Variance--Gamma distribution. For a generic random element $F=I_2(f)$ in the second Wiener chaos with $\E[F^2]= \E[Y^2]$ we establish a…
Error estimates are proved for finite element approximations to the solution of second-order hyperbolic partial differential equations with coefficients varying in both space and time. Optimal rates of convergence in the energy norm are…
For $\ell\colon \mathbb{R}^d \to [0,\infty)$ we consider the sequence of probability measures $\left(\mu_n\right)_{n \in \mathbb{N}}$, where $\mu_n$ is determined by a density that is proportional to $\exp(-n\ell)$. We allow for infinitely…
This paper extends the algorithm schemes proposed in \cite{Nesterov2007a} and \cite{Nesterov2007b} to the minimization of the sum of a composite objective function and a convex function. Two proximal point-type schemes are provided and…
We consider sampling from a Gibbs distribution by evolving a finite number of particles using a particular score estimator rather than Brownian motion. To accelerate the particles, we consider a second-order score-based ODE, similar to…
We propose a new class of uniformly accurate splitting methods for the Benjamin-Bona-Mahony equation which converge uniformly in the dispersive parameter $\varepsilon$. The proposed splitting schemes are furthermore asymptotic convergent…
Resource-efficiently computing representations of probability distributions and the distances between them while only having access to the samples is a fundamental and useful problem across mathematical sciences. In this paper, we propose a…
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 problem of approximately recovering a probability distribution given noisy measurements of its Chebyshev polynomial moments. This problem arises broadly across algorithms, statistics, and machine learning. By leveraging a…
We prove that front tracking approximations to entropy solutions of scalar conservation laws with convex fluxes converge at a rate of $\Delta x^2$ in the 1-Wasserstein distance $W_1$. Assuming positive initial data, we also show that the…
The convergence of many proximal algorithms involving a gradient descent relies on its Lipschitz constant. To avoid computing it, backtracking rules can be used. While such a rule has already been designed for the forward-backward algorithm…
We demonstrate that for strongly log-convex densities whose potentials are discontinuous on manifolds, the ULA algorithm converges with stepsize bias of order $1/2$ in Wasserstein-p distance. Our resulting bound is then of the same order as…
Clustering plays a crucial role in computer science, facilitating data analysis and problem-solving across numerous fields. By partitioning large datasets into meaningful groups, clustering reveals hidden structures and relationships within…
We propose a hybrid resampling method to approximate finitely supported Wasserstein barycenters on large-scale datasets, which can be combined with any exact solver. Nonasymptotic bounds on the expected error of the objective value as well…
Flow Matching, a promising approach in generative modeling, has recently gained popularity. Relying on ordinary differential equations, it offers a simple and flexible alternative to diffusion models, which are currently the…
In this paper, we provide sufficient conditions for the existence of the invariant distribution and for subgeometric rates of convergence in Wasserstein distance for general state-space Markov chains which are (possibly) not irreducible.…
For first-order smooth optimization, the research on the acceleration phenomenon has a long-time history. Until recently, the mechanism leading to acceleration was not successfully uncovered by the gradient correction term and its…
An inverse problem of wave propagation into a weakly laterally inhomogeneous medium occupying a half-space is considered in the acoustic approximation. The half-space consists of an upper layer and a semi-infinite bottom separated with an…