Research
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,695 papers · 148 categories

Trend · papers per month

285583110 · May 202619922001200920172026
48 results for Nonlinear PDEs

Paper quantifies neural operators' efficiency for solving nonlinear parabolic PDEs.

problem Quantifying the efficiency of neural operators for solving nonlinear parabolic PDEs.
method Deriving approximation rates by transferring PDEs to integral equations and leveraging Picard's iteration.
result Neural operators can efficiently approximate solution operators of nonlinear PDEs without exponential complexity growth.

Unified framework solves nonlinear PDEs and IPs using Gaussian processes.

problem Solving and identifying parameters in nonlinear PDEs and inverse problems.
method Gaussian process framework approximating solutions as MAP estimators, reducing to finite-dimensional optimization problem.
result Unified method converges in a small number of iterations for various PDEs.

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.

This paper develops a fast algorithm for solving nonlinear PDEs using sparse Cholesky factorization.

problem Efficiently solving nonlinear PDEs with Gaussian processes and kernel methods.
method Sparse Cholesky factorization for near-linear complexity.
result Near-linear complexity algorithm for working with kernel matrices of nonlinear PDEs.

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 …

2017-09-18abs ↗pdf ↗

Develops a new approach to study nonlinear PDEs and their singularities.

problem Understanding the propagation domains of solutions to nonlinear PDEs.
method Derived geometric machinery and sheaf theory to study nonlinear PDEs and their singular supports.
result Estimates the domains of propagation for solutions of non-linear systems.

Study moduli spaces of elliptic PDEs using derived CC^{\infty}-geometry.

problem Representability of moduli spaces of solutions of elliptic PDEs.
method Derived CC^{\infty}-geometry, stacks of relative jets, nonlinear Fredholm analysis.
result Moduli stack of solutions is relatively representable by quasi-smooth derived CC^{\infty}-schemes.

We propose a numerical method for solving high dimensional fully nonlinear partial differential equations (PDEs). Our algorithm estimates simultaneously by backward time induction the solution and its gradient by multi-layer neural networks, while the Hessian is approximated by automatic differentiation of the gradient…

2019-07-31abs ↗pdf ↗

Study generalizes Picard iteration for nonlinear PDEs, deriving bounds on error.

problem Generalize Picard iteration for nonlinear parabolic PDEs.
method Formulate Picard iteration as abstract state-transition model, derive generalization error bounds.
result Picard depth reduction reduces Picard truncation error without increasing estimation error.

Paper develops techniques to solve complex PDEs involving higher cohomology forms.

problem Develop PDE techniques to study real (p, p) forms on Hermitian manifolds.
method Parabolic approach to establish existence of classical solutions.
result Existence of classical solutions for a large class of fully nonlinear equations.

New machine learning methods solve complex PDEs with improved accuracy.

problem Solving fully nonlinear PDEs with convex Hamiltonian.
method Rewriting PDE in dual stochastic control form, estimating optimal feedback control with neural network, approximating value function with neural networks.
result Improved estimation of PDE solution and its derivatives, especially the second derivative.

We derive a backward and forward nonlinear PDEs that govern the implied volatility of a contingent claim whenever the latter is well-defined. This would include at least any contingent claim written on a positive stock price whose payoff at a possibly random time is convex. We also discuss suitable initial and boundary…

2019-07-17abs ↗pdf ↗

In this paper, we present an initial attempt to learn evolution PDEs from data. Inspired by the latest development of neural network designs in deep learning, we propose a new feed-forward deep network, called PDE-Net, to fulfill two objectives at the same time: to accurately predict dynamics of complex systems and to …

2017-10-26abs ↗pdf ↗

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.

First-order jet bundles can be put at the foundations of the modern geometric approach to nonlinear PDEs, since higher-order jet bundles can be seen as constrained iterated jet bundles. The definition of first-order jet bundles can be given in many equivalent ways - for instance, by means of Grassmann bundles. In this …

2012-07-26abs ↗pdf ↗

A new principle minimizes residual and introduces momentum to improve PDE solution dynamics.

problem Ill-conditioning in Dirac-Frenkel residual minimization leads to non-unique parameter dynamics.
method Introduces a history variable (momentum) to select better-conditioned parameter velocities, preserving residual minimization while promoting smooth parameter evolutions.
result The approach leads to increased robustness in singular and near-singular PDE solution regimes.

GrADE uses graph neural networks and Neural ODE for solving time-dependent nonlinear PDEs efficiently.

problem Solving time-dependent nonlinear PDEs is computationally challenging and time-consuming.
method GrADE combines graph neural networks for spatial modeling and Neural ODE for temporal modeling, using attention mechanisms.
result GrADE efficiently solves PDEs, demonstrating scalability and better accuracy compared to existing methods.

Introduces a new PDE involving differential forms for Kähler geometry.

problem Solving a unified PDE for various important equations in Kähler geometry.
method Introduces a fully nonlinear PDE with differential form Λ and proves solvability conditions.
result Generalizes previous works and proves a conjecture for the dHYM equation.

Neural operators correct PDE residuals to improve BIP solutions.

problem Reducing error in infinite-dimensional Bayesian inverse problems with neural operators.
method Error correction using PDE residuals to improve neural operator approximation.
result Trained neural operators with error correction achieve a quadratic reduction in approximation error.

New algorithm solves Schrödinger bridge problem with mismatched channels.

problem Solving Schrödinger bridge problem with input and noise channel mismatch.
method Design of a Sinkhorn recursion with memory for nonlinear PDEs.
result Demonstrates solving control-affine Schrödinger bridge problem.

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.

G-FuNK learns solutions for nonlinear PDEs on multiple domains and parameters.

problem Predicting time-dependent dynamics of complex systems governed by nonlinear PDEs with varying parameters and domains.
method Graph Fourier Neural Kernels combining domain-adapted and transferable components for non-diffusive and diffusive terms.
result G-FuNK achieves low relative errors on unseen domains and fiber fields, significantly accelerating predictions.

The numerical solution of large-scale PDEs, such as those occurring in data-driven applications, unavoidably require powerful parallel computers and tailored parallel algorithms to make the best possible use of them. In fact, considerations about the parallelization and scalability of realistic problems are often criti…

2017-05-10abs ↗pdf ↗

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 algorithm optimizes nonlinear SDEs online with convergence guarantees.

problem Optimizing nonlinear stochastic differential equations (SDEs) is computationally challenging.
method Forward propagation algorithm that solves an SDE derived using forward differentiation.
result Convergence theorem for nonlinear dissipative SDEs with bounds on stochastic fluctuations.

Study on stability of geodesic maps in non-isotropic manifolds.

problem Stability of totally geodesic wave maps in non-isotropic manifolds.
method Factorization property, PDE system in geodesic normal coordinates, global existence result via hyperboloidal foliation.
result Established global existence for small initial data, leading to geometric stability.

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.