PDE-DKL combines NNs and GPs for high-dimensional PDE problems.
problem High-dimensional PDE problems with scarce data.
method PDE-constrained Deep Kernel Learning (PDE-DKL) framework.
result High accuracy with reduced data requirements.
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,657 papers · 148 categories
Trend · papers per month
48 results for “High-dimensional PDEs”
A new machine learning method solves high-dimensional Kolmogorov PDEs efficiently.
problem Solving high-dimensional Kolmogorov PDEs and SDEs.
method Stochastic weighted minimization and stochastic gradient descent with Malliavin weights.
result Accurate approximation of high-dimensional Kolmogorov PDEs and SDEs without curse of dimensionality.
In this paper, we propose the idea of radial scaling in frequency domain and activation functions with compact support to produce a multi-scale DNN (MscaleDNN), which will have the multi-scale capability in approximating high frequency and high dimensional functions and speeding up the solution of high dimensional PDEs…
New method solves high-dimensional PDEs fast using physics-informed neural networks.
problem High computational cost in solving high-dimensional PDEs.
method Stochastic Dimension Gradient Descent (SDGD) for physics-informed neural networks (PINNs).
result Solves many high-dimensional PDEs including HJB and Schrödinger equations in 100,000 dimensions in 12 hours.
Hutchinson Trace Estimation for High-Dimensional and High-Order Physics-Informed Neural Networkscs.LG
HTE improves PINNs for high-dimensional, high-order PDEs by reducing computational cost and memory usage.
problem Challenges in solving high-dimensional, high-order PDEs with PINNs due to computational cost and memory constraints.
method Introduces Hutchinson Trace Estimation (HTE) to transform Hessian matrix calculations into Hessian vector products (HVP), reducing computational cost and memory usage.
result HTE significantly reduces memory consumption and computational cost, enabling faster and more efficient solution of high-dimensional and high-order PDEs.
Paper introduces a new method to solve complex PDEs efficiently.
problem Solving high-dimensional semilinear PDEs and BSDEs.
method Decomposes PDEs into linear and nonlinear parts, uses Deep BSDE solver with control variate method.
result Errors of the new method are much smaller than those of the original Deep BSDE solver.
Study evaluates Deep PDE solvers for high-dimensional option pricing, identifying key sources of error.
problem Empirical study on error analysis of Deep PDE solvers for high-dimensional option pricing.
method Comparative experiments with Deep BSDE method and other solvers, identifying three main sources of error.
result Deep BSDE method is superior and robust to option specifications, improving with larger batch sizes and fewer time steps.
High-dimensional partial differential equations (PDE) appear in a number of models from the financial industry, such as in derivative pricing models, credit valuation adjustment (CVA) models, or portfolio optimization models. The PDEs in such applications are high-dimensional as the dimension corresponds to the number …
High-dimensional PDEs have been a longstanding computational challenge. We propose to solve high-dimensional PDEs by approximating the solution with a deep neural network which is trained to satisfy the differential operator, initial condition, and boundary conditions. Our algorithm is meshfree, which is key since mesh…
Physics-Informed Inference Time Scaling for Solving High-Dimensional PDE via Defect Correctionmath.NA
SCaSML improves PDE solvers by correcting errors efficiently.
problem Reliable and error-free high-dimensional PDE solutions.
method Defect correction method to derive a Structural-preserving Law of Defect.
result SCaSML achieves faster convergence and reduced errors in high-dimensional PDEs.
Deep learning solves high-dimensional PDEs efficiently.
problem Solving high-dimensional Kolmogorov PDEs numerically.
method Reformulating as a statistical learning problem using Feynman-Kac formula.
result Single neural network learns entire family of PDEs.
Neural Q-learning tackles high-dimensional PDEs.
problem Solving high-dimensional PDEs is computationally challenging.
method Adapting Q-learning from reinforcement learning to solve PDEs.
result The neural network approximator converges to the PDE solution as the network width increases.
Deep learning model solves high-dimensional PDEs using Actor-Critic approach.
problem Solving high-dimensional nonlinear PDEs efficiently.
method Reformulated PDE into BSDE system, inspired by Actor-Critic algorithm for deep RL.
result Improved model with fewer parameters, faster convergence, and less hyperparameter tuning.
RS-PINN uses randomized smoothing to speed up high-dimensional PDE simulations without sacrificing accuracy.
problem High computational cost and bias in PINNs for high-dimensional PDEs.
method Introduces Gaussian noise for stochastic smoothing of PINNs, enabling Monte Carlo derivative approximation.
result Proposes bias correction techniques and a hybrid method to optimize the bias-variance trade-off.
Neural-PDE learns PDEs from data using LSTM, outperforming traditional methods.
problem Solving time-dependent PDEs numerically is challenging.
method Bidirectional LSTM encoder to learn governing rules from data.
result Neural-PDE efficiently predicts PDE dynamics with minimal parameters.
Paper analyzes DRM for solving high-dimensional elliptic PDEs with generalization bounds.
problem Analyzing generalization error of neural network methods for high-dimensional PDEs.
method Developed a new solution theory for spectral Barron space and derived generalization error bounds.
result Generalization error bounds are independent of dimension and solutions lie in spectral Barron space.
Paper tackles DOCTR-L with SciPhy RL, solving neural PDEs from data.
problem High-dimensional optimal control with stochastic policies.
method Soft HJB equation, Neural PDEs, Physics-Informed Neural Networks.
result Reduces DOCTR-L to solving neural PDEs from data.
Error estimates for nonlinear PDEs using kernel/GP methods.
problem Error analysis of kernel/GP methods for nonlinear and parametric PDEs.
method Sobolev space error estimates based on minimizing norm property of the solution.
result Dimension-benign convergence rates for smooth solutions.
New method uses neural networks to solve complex PDEs from optimal control theory.
problem Solving high-dimensional Hamilton-Jacobi-Bellman PDEs.
method Iterative diffusion optimization techniques, focusing on path measures and divergences.
result Favourable properties of log-variance divergence for Monte Carlo estimators.
Tensor trains simplify solving complex PDEs efficiently.
problem Solving high-dimensional parabolic PDEs using traditional methods is computationally infeasible.
method Reformulate PDEs as backward stochastic differential equations and use tensor train format for compression and efficient computation.
result Tensor train methods achieve a good balance between accuracy and computational efficiency.
In this article, we propose a new numerical approach to high-dimensional partial differential equations (PDEs) arising in the valuation of exotic derivative securities. The proposed method is extended from Reisinger and Wittum (2007) and uses principal component analysis (PCA) of the underlying process in combination w…
NWoS solves high-dimensional Poisson equations using neural networks.
problem Efficiently solving high-dimensional Poisson equations.
method Neural Walk-on-Spheres (NWoS) leveraging stochastic representations and Walk-on-Spheres methods.
result NWoS outperforms competing methods in accuracy, speed, and computational costs.
GenMod: A generative modeling approach for spectral representation of PDEs with random inputsstat.ML
GenMod uses generative models to approximate high-dimensional PDE solutions with limited evaluations.
problem Quantifying uncertainty in high-dimensional PDE systems with random parameters.
method Develops a method using generative models to approximate polynomial chaos coefficients in underdetermined systems.
result The method outperforms sparsity-promoting methods in approximating PDE solutions with limited evaluations.
Quantum machine learning solves high-dimensional PDEs with lower variance and improved accuracy.
problem Approximating solutions to high-dimensional parabolic PDEs.
method Pure Variational Quantum Circuit (VQC) for BSDE approximation, using temporal discretization and Monte Carlo simulation.
result VQC achieves lower variance and improved accuracy in most cases, particularly in highly nonlinear regimes.
Artificial neural networks (ANNs) have very successfully been used in numerical simulations for a series of computational problems ranging from image classification/image recognition, speech recognition, time series analysis, game intelligence, and computational advertising to numerical approximations of partial differ…
In this paper we introduce a numerical method for nonlinear parabolic PDEs that combines operator splitting with deep learning. It divides the PDE approximation problem into a sequence of separate learning problems. Since the computational graph for each of the subproblems is comparatively small, the approach can handl…
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.
Reinforcement Learning with Function-Valued Action Spaces for Partial Differential Equation Controlcs.LG
Recent work has shown that reinforcement learning (RL) is a promising approach to control dynamical systems described by partial differential equations (PDE). This paper shows how to use RL to tackle more general PDE control problems that have continuous high-dimensional action spaces with spatial relationship among ac…
Proposal-Guided Greedy Surrogate Refinement for PDE-Driven High-Dimensional Rare-Event Estimationmath.NA
Proposes a method to refine PDE-driven high-dimensional rare-event simulation.
problem Challenges in constructing accurate surrogates for rare-event simulation.
method Adaptive importance sampling framework that refines a locally constructed surrogate.
result Achieves accuracy comparable to true-model adaptive importance sampling with fewer high-fidelity evaluations.
Tensor Neural Networks solve high-dimensional PDEs for financial pricing.
problem High-dimensional PDEs in financial pricing.
method Tensor Neural Networks (TNN) and Tensor Network Initializer (TNN Init).
result TNN provides significant parameter savings and faster training than DNN.
New learning scheme solves high-dimensional semi-linear PDEs using sparse grids and Picard approximations.
problem Solving high-dimensional semi-linear parabolic PDEs.
method Probabilistic learning scheme based on Picard iteration with SGD, employing sparse grid approximation.
result Convergence proof and polynomial complexity in for high-dimensional PDEs.
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.
In this note we would like to present "an analysts' point of view" on the Nash-Kuiper theorem and in particular highlight the very close connection to some aspects of turbulence -- a paradigm example of a high-dimensional phenomenon.
A new method uses deep learning to efficiently solve complex physics equations in high dimensions.
problem Efficiently solving high-dimensional time-dependent PDEs with dynamic solutions.
method Deep adaptive sampling framework for PINNs extended to spacetime domains using normalizing flows.
result The method effectively identifies and tracks high-residual regions in both space and time.
We propose new machine learning schemes for solving high dimensional nonlinear partial differential equations (PDEs). Relying on the classical backward stochastic differential equation (BSDE) representation of PDEs, our algorithms estimate simultaneously the solution and its gradient by deep neural networks. These appr…
New integration method improves BSDE-based PDE solvers.
problem Discretization bias in standard BSDE-based solvers.
method Proposed Stratonovich-based BSDE formulation with stochastic Heun integration.
result Eliminates bias issues and outperforms EM-based variants.
Paper solves PDEs for optimal investment strategies in volatile markets.
problem Finding optimal investment strategies in volatile markets.
method Numerical methods using time-changed Bessel bridges.
result Solves PDEs for relative arbitrage opportunities in volatility-stabilized markets.
Full error analysis of the random deep splitting method for nonlinear parabolic PDEs and PIDEsmath.NA
Paper analyzes and proves convergence of a new method for solving complex PDEs.
problem Solving high-dimensional nonlinear PDEs and PIDEs with random neural networks.
method Random deep splitting method using random neural networks.
result The method converges to the unique viscosity solution of nonlinear PDEs and PIDEs.
DAS-PINNs uses deep learning to solve complex PDEs more accurately.
problem Solving high-dimensional PDEs with high accuracy.
method Deep neural networks and generative models for adaptive sampling.
result DAS-PINNs significantly improves solution accuracy for low regularity and high-dimensional problems.
The paper shows how neural networks can approximate PDEs with polynomial scaling in dimension.
problem Understanding the complexity of approximating PDE solutions with neural networks.
method Developed a proof technique to simulate gradient descent using neural networks.
result Neural network parameters scale polynomially with input dimension for approximating PDE solutions.
New algorithm solves complex equations using deep learning.
problem High-dimensional nonlinear PDEs and BSDEs.
method Iterated time discretization, deep neural networks, stochastic gradient descent.
result Increased accuracy and reduced complexity compared to existing methods.
This work surveys unsupervised learning methods for high-dimensional uncertainty quantification in complex PDEs.
problem Uncertainty quantification in high-dimensional stochastic inputs of complex PDEs.
method Review and investigation of thirteen dimension reduction methods including linear and nonlinear, spectral, blind source separation, convex and non-convex methods.
result Manifold PCE (m-PCE) provides a cost-effective approach compared to deep neural network-based surrogates.
Letter analyzes training dynamics of a nonlinear contrastive learning model in high dimensions.
problem Understanding training dynamics of nonlinear contrastive learning models in high-dimensional settings.
method High-dimensional analysis using McKean-Vlasov PDEs and low-dimensional ODEs.
result The model's performance evolves according to specific ODEs, revealing features like feature learnability and noise effects.
New method solves PDEs on spheres using physics-informed convolutional neural networks.
problem Solving PDEs on surfaces, especially spheres, with high accuracy and efficiency.
method Physics-informed convolutional neural networks (PICNN) with theoretical analysis and approximation results.
result Established fast convergence rates for PICNN solving PDEs on spheres.
PANIS learns PDE surrogates for heterogeneous materials without solving the PDE.
problem Learning surrogates for parametrized PDEs in heterogeneous media.
method Physics-aware neural implicit solvers combining probabilistic learning and physics-informed discretization.
result Learned surrogates for effective solutions in heterogeneous materials without solving the reference problem.
We analyze the dynamics of an online algorithm for independent component analysis in the high-dimensional scaling limit. As the ambient dimension tends to infinity, and with proper time scaling, we show that the time-varying joint empirical measure of the target feature vector and the estimates provided by the algorith…
PILNO uses neural operators to solve PDEs efficiently on point clouds.
problem Solving partial differential equations (PDEs) on point cloud data efficiently.
method Physics-informed low-rank neural operator framework combining low-rank kernel approximations and an encoder-decoder architecture.
result PILNO efficiently approximates solution operators of PDEs on point cloud data, satisfying PDE constraints and boundary conditions.
LVM-GP solves PDEs with uncertainty using latent variables and Gaussian processes.
problem Uncertainty quantification in PDE solutions with noisy data.
method Combines latent variable model and Gaussian process for uncertainty-aware prediction.
result Efficiently captures functional dependencies and robust uncertainty quantification.