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

Trend · papers per month

215430645860 · Jun 202019922001200920172026
48 results for PDE approach

Adapts PDE method to prove LL^\infty estimates for complex Hessian equations.

problem Proving LL^\infty estimates for complex Hessian equations on transverse Kähler manifolds.
method Adapts PDE approach of Guo-Phong-Tong and Guo-Phong-Tong-Wang [17, 18].
result Obtains LL^\infty estimate for transverse complex Monge-Ampère equations.

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.

Deep learning for HJB PDEs using synthetic data and residual minimization.

problem Solving Hamilton-Jacobi-Bellman PDEs for optimal control problems.
method Gradient-augmented synthetic dataset for supervised learning, residual minimization.
result Improves accuracy and efficiency of deep learning for HJB PDEs.

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 ↗

Improved neural PDEs trained on augmented data enhance model accuracy and efficiency.

problem Training neural PDEs on limited data to accurately represent complex systems.
method Space-filling sampling of local states to generate augmented training data.
result Data-augmented neural PDEs outperform traditional emulators in accuracy and stability.

Develops a new approach to describe gauge theories with background fields using presymplectic structures.

problem Describing gauge theories with background fields using presymplectic structures.
method Extension of the presymplectic BV-AKSZ approach to include background fields.
result Gauge theories with background fields correspond to presymplectic gauge PDEs over gauge PDEs describing background fields.

Deep NURBS improves PINNs for solving PDEs on arbitrary geometries.

problem Solving partial differential equations on complex geometries with physics constraints.
method Combines admissible NURBS parametrizations and PINN solver for arbitrary geometries.
result High convergence rate and accuracy for most PDEs using Deep NURBS.

Efficiently optimizes hyperparameters for PDE and inverse problems using Gaussian processes.

problem Hyperparameter optimization for scientific computing and inference methods.
method Bilevel optimization with Gauss-Newton linearization for efficient hyperparameter updates.
result Significant improvements in accuracy and robustness compared to random initialization.

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…

2019-07-08abs ↗pdf ↗

Partial differential equations (PDEs) are indispensable for modeling many physical phenomena and also commonly used for solving image processing tasks. In the latter area, PDE-based approaches interpret image data as discretizations of multivariate functions and the output of image processing algorithms as solutions to…

2018-04-12abs ↗pdf ↗

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.

As is known, an option price is a solution to a certain partial differential equation (PDE) with terminal conditions (payoff functions). There is a close association between the solution of PDE and the solution of a backward stochastic differential equation (BSDE). We can either solve the PDE to obtain option prices or…

2019-04-11abs ↗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.

A new method solves complex financial equations efficiently.

problem Solving worst-case and best-case prices for two-factor uncertain volatility models.
method Decompose and integrate, then optimize; piecewise constant control; closed-form Green's functions; 2D convolution integrals; monotone numerical integration; Fast Fourier Transforms.
result The method efficiently computes the value function and optimal control, converging to the viscosity solution of the HJB equation.

Many processes in science and engineering can be described by partial differential equations (PDEs). Traditionally, PDEs are derived by considering first principles of physics to derive the relations between the involved physical quantities of interest. A different approach is to measure the quantities of interest and …

2018-08-31abs ↗pdf ↗

Neural IVP solves IVPs with neural networks, overcoming scaling and conditioning issues.

problem Solving initial value PDEs with neural networks is challenging due to numerical errors and limited scalability.
method Developed an ODE-based approach to solve IVPs with neural networks, preventing ill-conditioning and scaling issues.
result Neural IVP solves challenging PDEs with neural networks efficiently and accurately.

New method reduces PDE surrogate model training costs by selectively acquiring time steps.

problem High computational cost of generating training data for PDE surrogate models.
method STAP (Selective Time-Step Acquisition for PDEs) framework that acquires only important time steps.
result Demonstrated effectiveness on several benchmark PDEs, reducing training costs.

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 ↗

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.

New approach connects UQ in SciML to viscous HJ PDEs for efficient uncertainty quantification.

problem Challenges in interpretability and expensive training procedures in UQ for SciML.
method Established connection between Bayesian inference and viscous HJ PDEs, developed Riccati-based methodology.
result Efficiently updates model predictions without retraining or data access, suitable for real-time inferences.