Related papers: Path differentiability of ODE flows
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…
In this paper we investigate the approximation of continuous functions on the Wasserstein space by smooth functions, with smoothness meant in the sense of Lions differentiability. In particular, in the case of a Lipschitz function we are…
This paper investigates existence results for path-dependent differential equations driven by a H{\"o}lder function where the integrals are understood in the Young sense. The two main results are proved via an application of Schauder…
We propose a Variable-Preconditioned Transformed Primal-Dual (VPTPD) method for solving generalized Wasserstein gradient flows based on the structure-preserving JKO scheme. This is a nontrivial extension of the TPD method [Chen et al.…
Discrete gradient methods are geometric integration techniques that can preserve the dissipative structure of gradient flows. Due to the monotonic decay of the function values, they are well suited for general convex and nonconvex…
Flow matching learns a velocity field that transports a base distribution to data. We study how small latent perturbations propagate through these flows and show that Jacobian-vector products (JVPs) provide a practical lens on dependency…
We investigate a family of approximate multi-step proximal point methods, framed as implicit linear discretizations of gradient flow. The resulting methods are multi-step proximal point methods, with similar computational cost in each…
We consider a family of vector fields defined in some bounded domain of R^p, and we assume that they satisfy Hormander's rank condition of some step r, and that their coefficients have r-1 continuous derivatives. We extend to this nonsmooth…
We introduce a class of first-order methods for smooth constrained optimization that are based on an analogy to non-smooth dynamical systems. Two distinctive features of our approach are that (i) projections or optimizations over the entire…
This paper introduces the path derivatives, in the spirit of Dupire's functional It\^o calculus, for the controlled paths in the rough path theory with possibly non-geometric rough paths. The theory allows us to deal with rough integration…
Given a possibly discontinuous, bounded function $f:\mathbb{R}\mapsto\mathbb{R}$, we consider the set of generalized flows, obtained by assigning a probability measure on the set of Carath\'eodory solutions to the ODE ~$\dot x = f(x)$. The…
We study the optimization of non-convex functions that are not necessarily smooth (gradient and/or Hessian are Lipschitz) using first order methods. Smoothness is a restrictive assumption in machine learning in both theory and practice,…
The purpose of this paper is to study some properties of solutions to one dimensional as well as multidimensional stochastic differential equations (SDEs in short) with super-linear growth conditions on the coefficients. Taking inspiration…
We prove that the stochastic differential equation $$ Y_{s,t}(x) = Y_{s,s}(x) + \int_0^{t-s} f(Y_{s,s+u}(x)) dX_{s+u}, Y_{s,s}(x)=x\in\R^d. $$ driven by a L\'evy process whose paths have finite p-variation almost surely for some $p\in[1,2)$…
In this paper, we study flows associated to Sobolev vector fields with subexponentially integrable divergence. Our approach is based on the transport equation following DiPerna-Lions [DPL89]. A key ingredient is to use a quantitative…
Diffusion-based generative models use stochastic differential equations (SDEs) and their equivalent ordinary differential equations (ODEs) to establish a smooth connection between a complex data distribution and a tractable prior…
We address several concerns related to the derivation of drift-ordered fluid equations. Starting from a fully Galilean invariant fluid system, we show how consistent sets of perturbative drift-fluid equations in the case of a isothermal…
This paper introduces a coordinate descent version of the V\~u-Condat algorithm. By coordinate descent, we mean that only a subset of the coordinates of the primal and dual iterates is updated at each iteration, the other coordinates being…
We present rectified flow, a surprisingly simple approach to learning (neural) ordinary differential equation (ODE) models to transport between two empirically observed distributions \pi_0 and \pi_1, hence providing a unified solution to…
To solve convex optimization problems with a noisy gradient input, we analyze the global behavior of subgradient-like flows under stochastic errors. The objective function is composite, being equal to the sum of two convex functions, one…