Neural Galerkin schemes use active learning to solve high-dimensional equations.
problem Inaccurate function approximations in high dimensions with limited training data.
method Neural Galerkin schemes based on deep learning with active learning for high-dimensional PDEs.
result Active data collection improves the numerical solution of high-dimensional equations.
Deep Galerkin Method estimates value function for mean-field control problem.
problem Optimal control of agents with average welfare as the objective.
method Apply DGM to estimate value function and distribution evolution.
result Neural network approximations converge to analytical solution.
Paper explores solving HJB equations using neural networks.
problem Solving high-dimensional time-dependent HJB equations.
method Neural Galerkin methods with nonlinearly parametrized trial functions.
result Closed-form solutions for trial functions.
New ARIMA framework improves forecast accuracy for economic and financial time series.
problem Improving forecast accuracy for nonlinear dynamics in time series data.
method Projection-based ARIMA framework using Galerkin basis expansions.
result Galerkin-SARIMA matches or improves forecast accuracy compared to classical ARIMA/SARIMA.
A new method uses neural networks to improve POD-Galerkin models for complex systems.
problem Improving computational efficiency and accuracy in solving non-linear high-dimensional systems.
method Deep learning-based closure modeling using neural networks to approximate POD-Galerkin operators.
result The CD-ROM approach produces more accurate and stable models for complex systems.
Deep learning solves high-dimensional PDEs efficiently.
problem High-dimensional PDEs are computationally challenging.
method Approximate PDE solutions with a deep neural network trained to satisfy PDE conditions.
result Solves PDEs in up to 200 dimensions accurately.
Paper establishes convergence rates for learning elliptic pseudo-differential operators.
problem Learning elliptic pseudo-differential operators in partial differential equations.
method Wavelet-Galerkin framework, structured infinite-dimensional regression problem, sparse estimator, matrix compression, nested-support strategy.
result Obtained convergence rates for the estimator and efficient Galerkin solver.
Develops numerical methods for PDEs on hypergraphs and networks.
problem Solving PDEs on complex geometric structures like hypergraphs and networks.
method Hybrid finite element methods, focusing on hybrid discontinuous Galerkin methods.
result Derives numerical approximations for PDEs on hypergraphs and networks.
This paper is concerned with the following Markovian stochastic differential equation of mean-reversion type \[ dR_t= (θ+σα(R_t, t))R_t dt +σR_t dB_t \] with an initial value R0=r0∈R, where θ∈R and σ>0 are constants, and the mean correction function $α:\mathbb{R}\times[0,\infty)\to α(x,t)\…
Galerkin method outperforms graph-based methods in spectral decompositions.
problem Improving spectral decomposition methods in machine learning.
method Restricting study to a small set of test functions using the Galerkin method.
result Statistical and computational superiority of Galerkin method over graph-based approaches.
A new model captures forward curve dynamics with stochastic volatility.
problem Modeling continuous-time evolution of forward curves in financial markets.
method Affine stochastic volatility model with modulated dynamics.
result Model allows for maturity-specific risk and volatility clustering.
Review and compare model order reduction methods for process engineering.
problem Creating computationally efficient yet accurate models for real-time applications.
method Nonlinear model order reduction methods, including general-purpose and tailored approaches for chemical processes.
result Comparison of eight model order reduction methods applied to an air separation process model.
New method learns diffusion transition density for Bayesian inference.
problem Bayesian inference on diffusions with inaccessible boundaries.
method Neural Galerkin framework to solve FP equation with Dirac mass.
result Approximates likelihood function for efficient posterior sampling.
One popular approach to option pricing in Lévy models is through solving the related partial integro differential equation (PIDE). For the numerical solution of such equations powerful Galerkin methods have been put forward e.g. by Hilber et al. (2013). As in practice large classes of models are maintained simultaneous…
Study methods to recover unknown processes in PDEs from data.
problem Identifying unknown processes in time-dependent PDEs using observational data.
method Theoretical analysis and numerical approaches including Galerkin and collocation algorithms.
result The Galerkin algorithm is more suitable for practical situations with noisy data.
Deep learning method proves convergence for high-dimensional PDEs.
problem Solving high-dimensional nonlinear PDEs for mean field control problems.
method Deep Galerkin method (DGM) for Hamilton-Jacobi-Bellman (HJB) equations.
result DGM converges to the true value function of mean field control problems.
A machine learning approach to compute Black-Scholes prices with uncertain volatility.
problem Approximating financial markets with continuous-time models like Black-Scholes when data is discrete.
method Generalized Polynomial Chaos (gPC) method combined with a machine learning technique called Bi-Fidelity.
result Efficient numerical method to quantify uncertainty in derivative pricing.
We consider generalized linear transient convection-diffusion problems for differential forms on bounded domains in Rn. These involve Lie derivatives with respect to a prescribed smooth vector field. We construct both new Eulerian and semi-Lagrangian approaches to the discretization of the Lie derivatives…
Study optimal semi-static hedging for illiquid markets using dynamic cash and static quoted derivatives.
problem Optimal pricing of exotic derivatives in illiquid markets with bid-ask spreads.
method Use Galerkin method and integration quadratures to approximate hedging problem as convex optimization, solved by interior point method.
result Semi-static hedging improves pricing and reduces transaction costs compared to static or dynamic trading alone.
New boundary treatment improves accuracy for complex PDEs.
problem Order reduction in high-order IMEX schemes for multidimensional PDEs.
method Novel boundary treatment algorithms for Cartesian meshes, treating implicit-explicit stages similarly to interior points.
result Recovery of designed order of convergence by numerical verification.
Study uses orthogonal polynomials to solve option pricing equations.
problem Solving complex option pricing equations for various models.
method Galerkin-based method with Hermite and Laguerre polynomials.
result Compared solutions to existing semi-closed formulas.
Spectral calculus simplifies manifold learning with eigenfunctions.
problem Learning manifold structures from data.
method Reformulate exterior calculus using Laplacian eigenfunctions.
result Spectral convergence to true exterior calculus.
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.
This paper deals with pricing of European and American options, when the underlying asset price follows Heston model, via the interior penalty discontinuous Galerkin finite element method (dGFEM). The advantages of dGFEM space discretization with Rannacher smoothing as time integrator with nonsmooth initial and boundar…
Extends DGM to solve PDEs and HJB equations in optimal control.
problem Solving PDEs and HJB equations in optimal control problems.
method Reparameterization and neural networks for positivity and normalization. Novel importance sampling for integral terms. Alternating stochastic gradient descent for simultaneous optimization.
result Solves PDEs and HJB equations in their primal form.
CoLoRA models predict PDE solutions quickly and accurately with minimal data.
problem Efficiently modeling PDE solutions with limited data.
method Continuous low-rank adaptation of neural networks trained on offline data.
result Predictions are orders of magnitude faster and more accurate than classical methods.
Proves regularity for quasilinear elliptic equations in metric spaces.
problem Regularity of quasilinear elliptic equations in metric measure spaces.
method Galerkin's method as an alternative to difference quotients.
result Second-order and Lipschitz regularity for a wide class of elliptic equations.
New methods for clustering graphs using spectral analysis.
problem Graph clustering for complex systems.
method Transfer operators and spectral properties.
result Spectral clustering can be interpreted using Koopman operators.
Optimizes trading in CFMMs and exchanges using deep learning.
problem Optimizing trading strategies in CFMMs and exchanges.
method Develops a model accounting for interaction between CFMMs and exchanges, employs deep Galerkin method to solve dynamic programming equation.
result Optimal strategy outperforms naïve strategies and is not prone to price slippage.
DGNet solves complex dynamical systems with neural networks and constraints.
problem Real-time accurate solutions for large-scale complex systems.
method Model-constrained discontinuous Galerkin Network (DGNet) for compressible Euler equations.
result DGNet achieves out-of-distribution generalization and improved stability.
Researchers approximate conditional expectation operators using kernel methods.
problem Statistical approximation of conditional expectation operators under minimal assumptions.
method Modifying the domain of the operator, approximating it by Hilbert-Schmidt operators in a reproducing kernel Hilbert space.
result The nonparametric estimate of the operator converges to a specific limiting object.
New rates for GLD and SGLD in infinite-dimensional spaces without dimensionality issues.
problem Gradient Langevin dynamics and SGLD convergence rates in high-dimensional spaces.
method Analysis of GLD and SGLD in infinite-dimensional Hilbert spaces, using stochastic differential equations and Markov chains.
result Derivation of dimension-free convergence rates for GLD and SGLD.
Two neural network methods solve the master equation for MFGs.
problem Approximating Nash equilibria in stochastic, finite-agent games.
method Backward induction and direct PDE tackling neural networks.
result Neural networks can approximate the master equation's solution.
Paper uses autoencoders for efficient reduced-order modeling of eigenvalue problems.
problem Efficiently modeling eigenvalue problems in high dimensions.
method Autoencoder-based reduced-order modeling for eigenvalue problems.
result Autoencoder-based models outperform standard POD-Galerkin methods in neutron diffusion applications.
New deep learning method for option pricing in jump-diffusion models.
problem Option pricing in jump-diffusion models with high-dimensional assets.
method Implicit-explicit minimizing movement time-stepping approach using deep ANNs.
result Consistent and asymptotically correct solutions for large underlyings.
This paper extends transfer operator theory to McKean-Vlasov equations.
problem Analyzing the behavior of complex dynamical systems using transfer operators.
method Extended dynamic mode decomposition and Galerkin projection.
result Finite-dimensional approximations of transfer operators computed.
Book introduces deep learning methods with math, theory, and applications.
problem Understanding deep learning algorithms and their mathematical foundations.
method Reviews various ANN architectures and optimization methods, covers theoretical aspects.
result Provides a solid mathematical foundation for deep learning.
Investigates ML vs. Financial Math for optimizing portfolios of cointelated assets.
problem Dynamic portfolio optimization for cointelated pairs in continuous-time setting.
method Uses cointelation model in Financial Math and Deep Galerkin method for ML. Solves HJB equation numerically.
result Machine Learning outperforms Financial Math in simulated cointelation data.
We propose a formulation of the term structure of interest rates in which the forward curve is seen as the deformation of a string. We derive the general condition that the partial differential equations governing the motion of such string must obey in order to account for the condition of absence of arbitrage opportun…
Deep learning solves complex financial PDEs without mesh.
problem Solving high-dimensional PDEs in finance.
method Deep Galerkin Method using neural networks.
result DGM outperforms traditional methods in high dimensions.
We examine some differential geometric approaches to finding approximate solutions to the continuous time nonlinear filtering problem. Our primary focus is a new projection method for the optimal filter infinite dimensional Stochastic Partial Differential Equation (SPDE), based on the direct L2 metric and on a family o…
Paper characterizes optimal learning trajectories for high-dimensional nonlinear models.
problem Characterizing optimal learning trajectories in high-dimensional nonlinear models.
method Exploits maximum principle and dynamic programming for an optimal control problem of a gradient system.
result Constructs optimal learning trajectories leading to optimal model parameters.
Paper uses neural networks to speed up simulations of complex systems.
problem Rapid simulations of advection-dominated problems in engineering and geophysics.
method Recurrent neural network for approximating nonlinear component of ROM.
result The proposed framework accurately recovers transient dynamics without full nonlinear computations.
Develops VPINNs for solving PDEs with reduced training cost and improved accuracy.
problem Solving partial differential equations efficiently and accurately.
method Integrates variational forms of PDEs into neural network loss functions, using Legendre polynomials as test spaces.
result VPINNs outperform PINNs in terms of accuracy and speed for solving PDEs.
We derive an equation of motion for interest-rate yield curves by applying a minimum Fisher information variational approach to the implied probability density. By construction, solutions to the equation of motion recover observed bond prices. More significantly, the form of the resulting equation explains the success …
A recent paper of Arnold, Falk, and Winther [Bull AMS, 47 (2010)] showed that a large class of mixed finite element methods can be formulated naturally on Hilbert complexes, where using a Galerkin-like approach, one solves a variational problem on a finite-dimensional subcomplex. In a seemingly unrelated research direc…
The objective of this paper is to investigate how noisy and incomplete observations can be integrated in the process of building a reduced-order model. This problematic arises in many scientific domains where there exists a need for accurate low-order descriptions of highly-complex phenomena, which can not be directly …
This paper simplifies hedge ratios in financial models using pathwise algorithmic differentiation.
problem Expensive and unstable computation of hedge ratios from pathwise sensitivities.
method Develops reduced stochastic hedge ratios of the form φ_j^r = Σ_j^r ξ_j^q X_q, retaining sensitivity tensor through empirical averages.
result Two coefficient criteria are introduced to minimize pathwise residuals and satisfy moment equations.