We formulate stochastic partial differential equations on Riemannian manifolds, moving surfaces, general evolving Riemannian manifolds (with appropriate assumptions) and Riemannian manifolds with random metrics, in the variational setting of the analysis to stochastic partial differential equations. Considering mainly …
Reconstructing signature features from randomized vector fields in differential equations.
problem Reconstructing signature features from controlled differential equations with random vector fields.
method Using controlled ordinary differential equations driven by continuous bounded variation curves, the study explores the extent to which signature features can be reconstructed from the non-linear flow of these equations.
result The number of signature features that can be reconstructed from the non-linear flow of controlled ordinary differential equations with random vector fields is exponential in the hidden dimension, under certain conditions.
Study on the smoothness of solutions to a specific type of stochastic differential equation.
problem Regularity of solutions to mean-field G-SDEs. method Analysis of first and second order Fréchet differentiability in the random initial condition.
result Established the Fréchet differentiability of the solution and specified the corresponding equations.
In common finance literature, Black-Scholes partial differential equation of option pricing is usually derived with no-arbitrage principle. Considering an asset market, Merton applied the Hamilton-Jacobi-Bellman techniques of his continuous-time consumption-portfolio problem, deriving general equilibrium relationships …
In this paper we are concerned with backward stochastic differential equations with random default time and their applications to default risk. The equations are driven by Brownian motion as well as a mutually independent martingale appearing in a defaultable setting. We show that these equations have unique solutions …
Global approximation for piecewise linear paths via signatures.
problem Global approximation theorems for piecewise linear paths.
method Using signatures of piecewise linear paths and their density in Lp-norms. result Linear functionals of signatures are dense in Lp-norms under an integrability condition. Deep neural nets solve complex insurance math equations.
problem Optimal control problems in insurance math.
method Deep neural network algorithm for elliptic PDEs.
result Solves high-dimensional semilinear elliptic PDEs.
Model predicts stock price volatility using stochastic differential equations.
problem Predicting stock price volatility in financial markets.
method Continuous cascade model using stochastic differential equations with two independent Brownian motions.
result The model accurately reproduces empirical volatility and multifractality.
Physics-informed neural networks are developed to characterize the state of dynamical systems in a random environment. The neural network approximates the probability density function (pdf) or the characteristic function (chf) of the state of these systems which satisfy the Fokker-Planck equation or an integro-differen…
By the classical Martingale Representation Theorem, replication of random vectors can be achieved via stochastic integrals or solutions of stochastic differential equations. We introduce a new approach to replication of random vectors via adapted differentiable processes generated by a controlled ordinary differential …
ICON learns differential equation operators from examples, revealing probabilistic inference.
problem Learning operators for differential equations from limited examples.
method Probabilistic operator learning using ICON architectures trained on diverse datasets.
result ICON implicitly performs Bayesian inference on solution operators.
We study the pricing problem for corporate defaultable bond from the viewpoint of the investors outside the firm that could not exactly know about the information of the firm. We consider the problem for pricing of corporate defaultable bond in the case when the firm value is only declared in some fixed discrete time a…
Enhances uncertainty modeling in random PDEs using PINNs and generative models.
problem Uncertainty in complex systems modeled by random PDEs.
method Combines Physics-Informed Neural Networks (PINNs) with generative modeling techniques.
result Systematic control of uncertainty with maintained predictive accuracy.
Bayesian inference for stochastic differential equations using Wishart diffusions.
problem Inferring stochastic differential equations for regression and dynamical modeling.
method Bayesian non-parametric approach with semi-parametric Wishart processes.
result Modeling diffusion in stochastic differential equations improves performance and avoids overfitting.
The paper studies a new type of stochastic differential equations for financial claims.
problem Analyzing financial claims with random payment times in uncertain markets.
method Investigates linear reflected-backward stochastic differential equations (RBSDEs) under random time events.
result Identifies sufficient conditions for the existence and estimation of solutions to these equations.
The paper solves MMV and MV problems with random coefficients and finds shared optimal strategies.
problem Optimal trading strategies with random market coefficients.
method Backward stochastic differential equations (BSDEs) to find optimal strategies.
result MMV and MV problems share the same optimal portfolio and value under random coefficients.
Neural networks solve SPDEs using Wiener chaos expansion.
problem Solving stochastic partial differential equations (SPDEs) numerically.
method Using neural networks in the truncated Wiener chaos expansion.
result Approximation rates for learning SPDE solutions with noise.
Framework combines random features with CDEs for efficient time-series learning.
problem Efficient training of time-series models with strong inductive bias.
method Random Fourier CDEs and Random Rough DEs using continuous-time reservoirs and log-ODE discretization.
result Unified perspective on random-feature reservoirs and path-signature theory.
RandNet-Parareal uses neural networks to speed up time-parallel PDE solving.
problem Solving systems of time-dependent differential equations efficiently.
method Combines Parareal's sequential and parallel approach with random neural networks.
result Achieves up to 125x and 22x speedup compared to existing methods.
Study on BSDEs with random time horizon, focusing on existence and properties.
problem Existence of solutions to BSDEs and reflected BSDEs with a random time horizon.
method Method of reduction and examination of BSDEs with lahdlaug driver.
result Existence of solutions to BSDEs and reflected BSDEs with a random time horizon.
Algorithm samples constrained stochastic differential equations.
problem Sampling stochastic differential equations with complex constraints.
method Pathspace Metropolis-adjusted manifold sampling.
result Demonstrated effectiveness in various constrained conditions.
Develops path integral for spiked tensor model dynamics.
problem Dynamics of spiked tensor model with random initial conditions.
method Path integral approach applied to partial differential equations.
result Large-N saddle point equations dominated by melonic diagrams. Data-driven discovery of differential equations has been an emerging research topic. We propose a novel algorithm subsampling-based threshold sparse Bayesian regression (SubTSBR) to tackle high noise and outliers. The subsampling technique is used for improving the accuracy of the Bayesian learning algorithm. It has tw…
RODE-Net learns ODEs from data with random parameters using neural networks and GANs.
problem Learning ODEs from data with unknown and random parameters.
method RODE-Net combines symbolic networks and GANs to estimate both the ODE and its parameters.
result RODE-Net can accurately estimate the distribution of model parameters and make reliable predictions.
New method uses randomized sparse neural networks to solve time-dependent PDEs more accurately and efficiently.
problem Numerical challenges in training neural networks sequentially in time to solve time-dependent PDEs.
method Introduces Neural Galerkin schemes that update randomized sparse subsets of network parameters at each time step.
result Up to two orders of magnitude more accurate and two orders of magnitude faster than dense update schemes.
The paper solves a complex control problem with stochastic elements and switching conditions.
problem Non-homogeneous stochastic LQ control with regime switching and random coefficients.
method Explicit optimal control and value obtained through two systems of backward stochastic differential equations (BSDEs). Existence and uniqueness of solutions proved using BMO martingales and contraction mapping method.
result Explicit optimal state feedback control and optimal value derived for the problem.
The study of topological properties of random smooth maps, focusing on Kac-Rice formula and Betti numbers.
problem Topological and geometric properties of random smooth maps.
method Developed a general framework for differential geometric and topological issues of smooth Gaussian Random Fields, generalized Kac-Rice formula, applied to Kostlan random polynomials, and proved an original theorem in Differential Topology.
result The Betti numbers of the solution of a system of regular equations cannot decrease under a C0-small perturbation of the equations. We consider that the price of a firm follows a non linear stochastic delay differential equation. We also assume that any claim value whose value depends on firm value and time follows a non linear stochastic delay differential equation. Using self-financed strategy and replication we are able to derive a Random Partia…
We prove that a single-layer neural network trained with the Q-learning algorithm converges in distribution to a random ordinary differential equation as the size of the model and the number of training steps become large. Analysis of the limit differential equation shows that it has a unique stationary solution which …
Developing efficient numerical algorithms for the solution of high dimensional random Partial Differential Equations (PDEs) has been a challenging task due to the well-known curse of dimensionality. We present a new solution framework for these problems based on a deep learning approach. Specifically, the random PDE is…
Paper develops a new probabilistic method for American options using entropy regularization.
problem Finding optimal stopping times for American options with entropy regularization.
method Entropy-regularized penalization scheme based on Doob-Meyer-Mertens decomposition and reflected backward stochastic differential equations.
result Explicit convergence rates and policy improvement algorithm for American options.
New model solves PDEs using probabilistic random grids.
problem Solving parametric PDEs with probabilistic collocation grids.
method Random Grid Neural Processes (RGNPs) with GICNets.
result Significant computational advantages and improved predictive capabilities.
In this paper we present nonparametric estimators for coefficients in stochastic differential equation if the data are described by independent, identically distributed random variables. The problem is formulated as a nonlinear ill-posed operator equation with a deterministic forward operator described by the Fokker-Pl…
Can neural networks learn to solve partial differential equations (PDEs)? We investigate this question for two (systems of) PDEs, namely, the Poisson equation and the steady Navier--Stokes equations. The contributions of this paper are five-fold. (1) Numerical experiments show that small neural networks (< 500 learnabl…
Study on stochastic mean curvature flow on networks using Ito calculus.
problem Understanding the dynamics of network structures under random influences.
method Application of Ito calculus to derive a stochastic differential equation (SDE) for network edges.
result New insights into the stability, long-term behavior, and pattern formation of complex networks under stochastic influences.
The paper refines optimization algorithms using Lyapunov functions and differential equations.
problem Improving convergence rates of optimization algorithms.
method Revisiting Fazylab's framework, relaxing conditions, and introducing new differential equations.
result Improved convergence rates for optimization algorithms, including Nesterov and Polyak algorithms.
PLoM learns stochastic solutions to PDEs with limited data.
problem Synthesizing solutions to nonlinear PDEs with scarce data.
method Probabilistic Learning on Manifolds constrained by PDEs.
result Learned stochastic solutions minimize PDE residuals.
New methods reduce computational cost for Gaussian Markov Random Fields with sparse constraints.
problem Inference and simulation of GMRFs are computationally prohibitive with many constraints.
method Proposes a basis transformation into blocks of constrained and non-constrained subspaces.
result Significantly outperforms existing alternatives in computational cost.
We consider a generalization of the Heath Jarrow Morton model for the term structure of interest rates where the forward rate is driven by Paretian fluctuations. We derive a generalization of Itô's lemma for the calculation of a differential of a Paretian stochastic variable and use it to derive a Stochastic Differenti…
Deep learning solves complex volatility equations.
problem Solving path-dependent PDEs in rough volatility.
method Interpreting PDE as BSDE, using neural network reservoir approach.
result Proved theoretical convergence for least-square regression.
Probabilistic numerics expands numerical tasks with black box methods.
problem Difficult conditioning of random variables in numerical tasks.
method Construct probabilistic numerical methods based on final outputs, extrapolating limiting quantities.
result Higher orders of convergence achieved in various numerical tasks.
In this article we model a financial derivative price as an observable on the market state function. We apply geometric techniques to integrating the Heisenberg Equation of Motion. We illustrate how the non-commutative nature of the model introduces quantum interference effects that can act as either a drag or a boost …
Proposes SDE framework for uncertainty quantification in graph neural networks.
problem Lack of uncertainty quantification in graph neural networks.
method Introduces Latent Graph Neural Stochastic Differential Equations (LGNSDE) with Bayesian prior-posterior mechanism and Brownian motion.
result LGNSDEs provide theoretically sensible guarantees for uncertainty estimates and are robust to perturbations.
We introduce stochastic normalizing flows, an extension of continuous normalizing flows for maximum likelihood estimation and variational inference (VI) using stochastic differential equations (SDEs). Using the theory of rough paths, the underlying Brownian motion is treated as a latent variable and approximated, enabl…
New method for dynamic valuation in markets with random endowments.
problem Dynamic valuation in markets with random endowments.
method Developed new FBSDE systems and established optimality conditions.
result Established necessary and sufficient conditions for optimality.
Study shows certainty equivalent policy minimizes regret in continuous-time systems.
problem Minimizing regret in continuous-time stochastic linear-quadratic systems.
method Theoretical analysis of randomized certainty equivalent policy.
result Establishes square-root of time regret bounds and linear scaling with parameters.
Paper introduces a method for operator learning using random features.
problem Estimating maps between infinite-dimensional spaces using input-output pairs.
method Function-valued random features method, building a linear combination of random operators.
result The method provides convergence guarantees and error bounds for nonlinear problems.
Statistical (machine learning) tools for equation discovery require large amounts of data that are typically computer generated rather than experimentally observed. Multiscale modeling and stochastic simulations are two areas where learning on simulated data can lead to such discovery. In both, the data are generated w…