Related papers: Monotone discretizations of levelset convex geomet…
The widespread application of modern machine learning has increased the need for robust statistical algorithms. This work studies one such fundamental statistical measure known as the Tukey depth. We study the problem in the continuum…
We establish a well-posedness and error-estimation framework that solves Hamilton-Jacobi equations by minimizing the least-squares residual of monotone finite-difference discretizations. This approach also applies naturally to second-order…
We propose novel connections between several neural network architectures and viscosity solutions of some Hamilton--Jacobi (HJ) partial differential equations (PDEs) whose Hamiltonian is convex and only depends on the spatial gradient of…
Stochastic optimal principle leads to the resolution of a partial differential equation (PDE), namely the Hamilton-Jacobi-Bellman (HJB) equation. In general, this equation cannot be solved analytically, thus numerical algorithms are the…
We prove first-order convergence of semi-discrete monotone finite difference schemes for Hamilton--Jacobi equations on the Wasserstein space over a finite graph. A central challenge is the boundary degeneracy of the Wasserstein simplex,…
This paper is concerned with monotone (time-explicit) finite difference schemes associated with first order Hamilton-Jacobi equations posed on a junction. They extend the schemes recently introduced by Costeseque, Lebacque and Monneau…
This paper introduces the Fej\'er-monotone hybrid steepest descent method (FM-HSDM), a new member to the HSDM family of algorithms, for solving affinely constrained minimization tasks in real Hilbert spaces, where convex smooth and…
We adapt the Gradient Discretisation Method (GDM), originally designed for elliptic and parabolic partial differential equations, to the case of a linear scalar hyperbolic equations. This enables the simultaneous design and convergence…
We present a new fast approximate algorithm for Tukey (halfspace) depth level sets and its implementation-ABCDepth. Given a $d$-dimensional data set for any $d\geq 1$, the algorithm is based on a representation of level sets as…
We present a simple algorithm to approximate the viscosity solution of Hamilton-Jacobi (HJ) equations by means of an artificial deep neural network. The algorithm uses a stochastic gradient descent-based method to minimize the least square…
This paper develops a new framework for designing and analyzing convergent finite difference methods for approximating both classical and viscosity solutions of second order fully nonlinear partial differential equations (PDEs) in 1-D. The…
The aim of this paper is to develop a general method for constructing approximation schemes for viscosity solutions of fully nonlinear pathwise stochastic partial differential equations, and for proving their convergence. Our results apply…
We propose a globally convergent numerical method, called the convexification, to numerically compute the viscosity solution to first-order Hamilton-Jacobi equations through the vanishing viscosity process where the viscosity parameter is a…
Computing tasks may often be posed as optimization problems. The objective functions for real-world scenarios are often nonconvex and/or nondifferentiable. State-of-the-art methods for solving these problems typically only guarantee…
We consider a stochastic discretization of the stationary viscous Hamilton Jacobi equation on the flat d dimensional torus, associated with a Hamiltonian, convex and superlinear in the momentum variable. We show that each discrete problem…
This paper presents a finite-dimensional approximation for a class of partial differential equations on the space of probability measures. These equations are satisfied in the sense of viscosity solutions. The main result states the…
In this paper we establish a connection between non-convex optimization methods for training deep neural networks and nonlinear partial differential equations (PDEs). Relaxation techniques arising in statistical physics which have already…
Halfspace (or Tukey) depth is a fundamental and robust measure of centrality of data points in multivariate datasets. Computing the depth of a point with respect to the uniform distribution on an open convex body in $\mathbb{R}^d$ is a…
We study the global convergence of the gradient descent method of the minimization of strictly convex functionals on an open and bounded set of a Hilbert space. Such results are unknown for this type of sets, unlike the case of the entire…
We present a framework for efficient extraction of the viscosity solutions of nonlinear Hamilton-Jacobi equations with convex Hamiltonians. These viscosity solutions play a central role in areas such as front propagation, mean-field games,…