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

242485727969 · Jun 202019922001200920172026
48 results for direct PDE approach

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.

Novel method for shape optimization of non-smooth PDEs.

problem Optimizing shapes governed by non-smooth PDEs.
method Functional variational approach and sensitivity analysis.
result Necessary conditions for locally optimal shapes.

Study uses outer metrics for PDE-constrained shape optimization over diffeomorphism group.

problem Optimizing shapes governed by PDEs over the diffeomorphism group.
method Outer metrics on diffeomorphism group, Riemannian steepest descent method.
result Riemannian approach outperforms other metrics in solving PDE-constrained shape optimization problems.

Paper proves short-time existence for network flow, providing detailed insights.

problem Short-time existence for the flow of a network of curves in the plane.
method Direct PDE approach, handling singularities at vertices using self-similar expanding solutions.
result Substantially more detailed information about network resolution into a regular one.

Optimal neural network approximation for Wasserstein gradient direction via convex optimization.

problem Approximating Wasserstein gradient direction with limited data.
method Two-layer networks with squared-ReLU activations, SDP relaxation.
result Optimal approximation of Wasserstein gradient direction in two-layer networks.

Conservation laws vanishing along characteristic directions of a given system of PDEs are known as characteristic conservation laws, or characteristic integrals. In 2D, they play an important role in the theory of Darboux-integrable equations. In this paper we discuss characteristic integrals in 3D and demonstrate that…

2013-12-18abs ↗pdf ↗

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.

Operator learning approximates complex mappings for PDEs and experimental data.

problem Approximating mappings between infinite-dimensional function spaces for scientific computing.
method Formalizing operator learning as function-to-function regression and incorporating physical constraints.
result Development of rigorous uncertainty quantification frameworks for operator learning.

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.

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.

This paper explains the fundamental relation between Jacobi structures and the classical Spencer operator coming from the theory of PDEs so as to provide a direct and geometric approach to the integrability of Jacobi structures. It uses recent results on the integrability of Spencer operators and multliplicative forms …

2013-09-24abs ↗pdf ↗

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.

DCGD improves training of PINNs by adjusting gradients to avoid negative inner products.

problem Pathological behaviors in PINNs training, especially gradient imbalance.
method Dual Cone Gradient Descent (DCGD) framework to adjust gradient direction.
result DCGD outperforms other optimization algorithms in various evaluation metrics.

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.

Neural networks improve financial derivative pricing accuracy.

problem Improving accuracy in financial derivative pricing.
method Use neural networks to model drift and volatility in SDE models, optimize using SGD for European options and PDE for American options.
result Neural network models outperform traditional models in pricing derivatives.

The study characterizes and analyzes spacelike surfaces with a canonical normal null direction in Minkowski 4-space.

problem Characterizing and analyzing spacelike surfaces with a specific null direction in Minkowski space.
method Using geometric properties, Gauss map, and a nonlinear partial differential equation, the study characterizes and analyzes these surfaces.
result Characterizations and properties of spacelike surfaces with a canonical normal null direction are obtained.

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 ↗