Related papers: Flows driven by multi-indices Rough Paths
Rough path theory is focused on capturing and making precise the interactions between highly oscillatory and non-linear systems. It draws on the analysis of LC Young and the geometric algebra of KT Chen. The concepts and the uniform…
We introduce the Optimizing a Discrete Loss (ODIL) framework for the numerical solution of Partial Differential Equations (PDE) using machine learning tools. The framework formulates numerical methods as a minimization of discrete residuals…
The non-linear sewing lemma constructs flows of rough differential equations from a braod class of approximations called almost flows. We consider a class of almost flows that could be approximated by solutions of ordinary differential…
We construct a deep learning-based numerical algorithm to solve path-dependent partial differential equations arising in the context of rough volatility. Our approach is based on interpreting the PDE as a solution to an BSDE, building upon…
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)$…
Accurate and efficient prediction of multi-scale flows remains a formidable challenge. Constructing theoretical models and numerical methods often involves the design and optimization of parameters. While gradient descent methods have been…
Normalizing flows are a powerful technique for obtaining reparameterizable samples from complex multimodal distributions. Unfortunately current approaches fall short when the underlying space has a non trivial topology, and are only…
Backward stochastic differential equations (BSDEs) in the sense of Pardoux-Peng [Backward stochastic differential equations and quasilinear parabolic partial differential equations, Lecture Notes in Control and Inform. Sci., 176, 200--217,…
We discuss the solution of regular and singular Sturm-Liouville problems by means of High Order Finite Difference Schemes. We describe a code to define a discrete problem and its numerical solution by means of linear algebra techniques.…
In [1], we proved the existence of solutions to reflected rough differential equations based on an idea of Euler approximation of the solutions which is due to Davie [6]. In this paper, we prove the existence theorem under weaker…
The objective of this paper is to prove the convergence of a linear implicit multi-step numerical method for ordinary differential equations. The algorithm is obtained via Taylor approximations. The convergence is proved following the…
An efficient approximate version of implicit Taylor methods for initial-value problems of systems of ordinary differential equations (ODEs) is introduced. The approach, based on an approximate formulation of Taylor methods, produces a…
Modern deep learning algorithms use variations of gradient descent as their main learning methods. Gradient descent can be understood as the simplest Ordinary Differential Equation (ODE) solver; namely, the Euler method applied to the…
In the spirit of Marcus canonical stochastic differential equations, we study a similar notion of rough differential equations (RDEs), notably dropping the assumption of continuity prevalent in the rough path literature. A new metric is…
Since the breakthrough in rough paths theory for stochastic ordinary differential equations (SDEs), there has been a strong interest in investigating the rough differential equation (RDE) approach and its numerous applications. Rough path…
We introduce a provably stable variant of neural ordinary differential equations (neural ODEs) whose trajectories evolve on an energy functional parametrised by a neural network. Stable neural flows provide an implicit guarantee on…
Integrability properties of (classical, linear, linear growth) rough differential equations (RDEs) are considered, the Jacobian of the RDE flow driven by Gaussian signals being a motivating example. We revisit and extend some recent…
Visualization of turbulent flows is a powerful tool to help understand the turbulence dynamics and induced transport. However, it does not provide a quantitative description of the observed structures. In this paper, an approach to…
The flow is very useful in studying dynamical systems. However, many modern systems--notably differential inclusions--do not have unique solutions, and therefore cannot be described by flows. Richard McGehee has proposed an object, the…
A strongly polynomial algorithm is given for the generalized flow maximization problem. It uses a new variant of the scaling technique, called continuous scaling. The main measure of progress is that within a strongly polynomial number of…