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

Trend · papers per month

118236354472 · Jun 202019922001200920172026
48 results for PDE analysis

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.

Local Neural Operators enable efficient system-level analysis of complex PDEs.

problem System-level analysis of large-scale dynamical systems using neural operators.
method Integrating local Neural Operators with Krylov subspace iterative methods for stability and bifurcation analysis.
result Demonstrated effectiveness of local Neural Operators in fixed-point, stability, and bifurcation analysis of nonlinear 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.

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.

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.

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.

The paper solves PDEs from matrices with orthogonal columns, linking them to Hessian metrics and symmetric spaces.

problem Solving third order PDEs for strictly convex smooth functions.
method Geometric methods using Hessian metrics and symmetric spaces.
result Explicit solutions and a family of non-generic solutions with applications in Poisson geometry and Kahler structures.

Diffeologies unify infinite-dimensional geometry and PDEs, enhancing classical function spaces.

problem Combining infinite-dimensional geometry and PDEs for optimization problems.
method Review and extension of classical function spaces and mapping spaces.
result Diffeologies provide a unified framework for evolution equations and optimization problems.

A framework for reducing PDEs by symmetry, preserving key structures.

problem Reducing PDEs while preserving geometric structures and symmetries.
method Systematic calculation of reduced forms for various geometric structures.
result Noether's theorem is inherited in reduced systems, preserving conservation laws.

We develop DTs for PDE models using KL-NN and TL, analyzing TL's moment equations and one-shot learning for exactness.

problem Creating accurate digital twins for systems governed by PDEs under changing conditions.
method We use KL-NN surrogate models and transfer learning to construct DTs, analyzing the moment equations and proposing one-shot and few-shot learning methods.
result For linear PDEs, one-shot TL is exact; for nonlinear PDEs, some parameters can be transferred with minimal error.

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.

FM4PDE learns PDE solutions from sparse data.

problem Reconstructing PDE solutions from limited observations.
method Flow-matching generative framework that learns PDE coefficients and solutions.
result Error guarantees for guided procedures, including deterministic and stochastic samplers.

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.

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 ↗

New method detects changepoints in PDEs using optimized neural networks.

problem Detecting changepoints in PDEs with unknown locations and times.
method Online optimized Physics-Informed Neural Networks (PINNs) with Total-Variation penalty.
result Improved parameter estimation and model fitting with changepoints.

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.

Survey on recent developments in isometric immersions using PDE techniques.

problem Analyzing isometric immersions with low Sobolev regularity.
method Compensated compactness and Coulomb-Uhlenbeck gauges.
result Weak continuity and stability of Gauss-Codazzi-Ricci equations.

Study on geodesic distances on SE(3)/SO(2) in machine learning.

problem Investigating the efficiency of computationally efficient sections in selecting geodesic distances.
method Analyzing geodesic distances on reductive homogeneous spaces, proving the efficiency of minimal distance sections.
result Minimal distance sections are not always geodesic minimizers, but minimal horizontal geodesics are.

Study analyzes error in neural network solving PDEs, providing convergence and error bounds.

problem Error analysis of neural network solving PDEs.
method Three-layer tanh neural network with projected gradient descent (PGD).
result Comprehensive error analysis including approximation, generalization, and optimization errors.

For the purpose of understanding second-order scalar PDEs and their hydrodynamic integrability, we introduce G-structures that are induced on hypersurfaces of the space of symmetric matrices (interpreted as the fiber of second-order jet space) and are defined by non-degenerate scalar second-order-only (Hessian) PDEs in…

2010-10-28abs ↗pdf ↗

This work analyzes PINNs for advection-diffusion equations using NTK theory.

problem Understanding and resolving the training difficulties of PINNs for advection-diffusion equations.
method Neural Tangent Kernel (NTK) analysis of PINNs for the linear advection-diffusion equation (LAD).
result PINNs struggle due to spectral bias and convergence rate disparity, especially in advection-dominated and diffusion-dominated regimes.

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.