Related papers: Convex Relaxation for Fokker-Planck
Optimal transport (OT) is a powerful tool in mathematics and data science but faces severe computational and statistical challenges in high dimensions. We propose convex relaxation approaches based on marginal and cluster moment relaxations…
We present a new stability and convergence analysis for the spatial discretization of a time-fractional Fokker--Planck equation in a convex polyhedral domain, using continuous, piecewise-linear, finite elements. The forcing may depend on…
Fractional Fokker-Planck equation plays an important role in describing anomalous dynamics. To the best of our knowledge, the existing discussions mainly focus on this kind of equation involving one diffusion operator. In this paper, we…
Solving the Fokker-Planck equation for high-dimensional complex turbulent dynamical systems is an important and practical issue. However, most traditional methods suffer from the curse of dimensionality and have difficulties in capturing…
We explain the ubiquity and extremely slow evolution of non gaussian out-of-equilibrium distributions for the Hamiltonian Mean-Field model, by means of traditional kinetic theory. Deriving the Fokker-Planck equation for a test particle, one…
We propose a flexible convex relaxation for the phase retrieval problem that operates in the natural domain of the signal. Therefore, we avoid the prohibitive computational cost associated with "lifting" and semidefinite programming (SDP)…
Many high dimensional sparse learning problems are formulated as nonconvex optimization. A popular approach to solve these nonconvex optimization problems is through convex relaxations such as linear and semidefinite programming. In this…
With the potential to find global solutions, significant research interest has focused on convex relaxations of the non-convex OPF problem. Recently, "moment-based" relaxations from the Lasserre hierarchy for polynomial optimization have…
In this article, we propose and study several discrete versions of homogeneous and inhomogeneous one-dimensional Fokker-Planck equations. In particular, for these discretizations of velocity and space, we prove the exponential convergence…
We study the problem of high-dimensional robust mean estimation in the presence of a constant fraction of adversarial outliers. A recent line of work has provided sophisticated polynomial-time algorithms for this problem with…
We develop a new method to solve the Fokker-Planck or Kolmogorov's forward equation that governs the time evolution of the joint probability density function of a continuous-time stochastic nonlinear system. Numerical solution of this…
We develop tractable convex relaxations for rank-constrained quadratic optimization problems over $n \times m$ matrices, a setting for which tractable relaxations are typically only available when the objective or constraints admit spectral…
Convex relaxation methods are powerful tools for studying the lowest energy of many-body problems. By relaxing the representability conditions for marginals to a set of local constraints, along with a global semidefinite constraint, a…
We obtain equilibration rates for a one-dimensional nonlocal Fokker-Planck equation with time-dependent diffusion coefficient and drift, modeling the relaxation of a large swarm of robots, feeling each other in terms of their distance,…
Recently some of us have constructed a Fokker-Planck formalism to describe the equilibration of the terrace-width distribution of a vicinal surface from an arbitrary initial configuration. However, the meaning of the associated relaxation…
The Calder\'on problem consists in recovering an unknown coefficient of a partial differential equation from boundary measurements of its solution. These measurements give rise to a highly nonlinear forward operator. As a consequence, the…
Convex relaxations of non-convex optimal power flow (OPF) problems have recently attracted significant interest. While existing relaxations globally solve many OPF problems, there are practical problems for which existing relaxations fail…
This article presents a rigorous analysis for efficient statistically accurate algorithms for solving the Fokker-Planck equations associated with high-dimensional nonlinear turbulent dynamical systems with conditional Gaussian structures.…
We improve recently introduced consensus-based optimization method, proposed in [R. Pinnau, C. Totzeck, O. Tse and S. Martin, Math. Models Methods Appl. Sci., 27(01):183--204, 2017], which is a gradient-free optimization method for general…
We study mixed-moment models (full zeroth moment, half higher moments) for a Fokker-Planck equation in one space dimension. Mixed-moment minimum-entropy models are known to overcome the zero net-flux problem of full-moment minimum entropy…