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

Trend · papers per month

6.3%12.5%18.8%25.0% · Mar 199319922001200920172026
48 results for curve-dependent PDE

New algorithm uses deep learning for option pricing in rough volatility models.

problem Evaluating options in affine rough stochastic volatility models.
method Developed a numerical scheme based on deep learning for curve-dependent PDEs.
result Numerical simulations show the new method is a promising alternative to Monte Carlo simulations.

The process of un-reduction, a sort of reversal of reduction by the Lie group symmetries of a variational problem, is explored in the setting of field theories. This process is applied to the problem of curve matching in the plane, when the curves depend on more than one independent variable. This situation occurs in a…

2015-08-21abs ↗pdf ↗

H. Hotelling proved that in the n-dimensional Euclidean or spherical space, the volume of a tube of small radius about a curve depends only on the length of the curve and the radius. A. Gray and L. Vanhecke extended Hotelling's theorem to rank one symmetric spaces computing the volumes of the tubes explicitly in these …

2015-06-08abs ↗pdf ↗

Notes on Frenet-Serret formulas for curves in flat pseudo-hermitian manifolds.

problem Analyzing curves in flat pseudo-hermitian manifolds.
method Deriving Frenet-Serret formulas and applying them to specific conditions.
result Characterizations of curves and classification based on their geometric properties.

The paper proposes a new method for modeling and quantifying uncertainty in multiple closed curves.

problem Modeling and uncertainty quantification of multiple closed curves.
method A multiple-output, multi-dimensional Gaussian process modeling framework.
result The proposed method provides meaningful uncertainty quantification for curve and shape-related tasks.

Solves second-order PDEs using quotients and differential invariants.

problem Solving second-order PDEs with first-order quotients.
method Solve the quotient PDE using differential invariants, then add new constraints to solve the original PDE.
result New method for solving second-order scalar PDEs with infinite-dimensional symmetry algebras.

PRISMA uses PDE residuals for fast, robust, and accurate inference.

problem Slow gradient-based optimization and instability in PDE residual-based methods.
method Integrates PDE residuals directly into the model's architecture via attention mechanisms in the spectral domain.
result Competitive accuracy with significantly lower inference costs and faster speeds.

Using the theory of the symmetry group for PDEs [15, 17], we derive the symmetry group G associated to surfaces PDE. Several group invariant solutions of the surfaces PDE are given by solving a reduced system of partial differential equations.

2010-07-07abs ↗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.

Develops arithmetic PDE geometry concepts like curvature and cohomology.

problem Creating a geometry framework for arithmetic PDEs.
method Introducing arithmetic analogues of Levi-Civita and Chern connections, then developing curvature and characteristic classes.
result Arithmetic analogues of curvature and characteristic classes have been developed.

DL-PDE discovers PDEs from noisy, sparse data using neural networks and sparse regressions.

problem Discovering PDEs from noisy, sparse data.
method Combines neural networks and sparse regressions to discover PDEs from meta-data generated by a neural network.
result Achieves satisfactory results in real-world engineering settings with noisy and limited data.

PDE-NetGen converts physical equations to neural networks for various scientific problems.

problem Bridging physics and deep learning for efficient neural network architectures.
method Combines symbolic calculus and neural network generation to translate PDEs into NN architectures.
result Generates compact, computationally-efficient physics-informed NN architectures.

VarNet solves PDEs with deep neural networks using variational loss.

problem Solving partial differential equations (PDEs) efficiently and accurately.
method VarNet uses a novel variational loss function and optimizes space-time samples for training deep neural networks.
result VarNet models are smooth, differentiable, and directly usable for PDE control and optimization.

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.

It is shown that the characteristic vector field associated to a first order PDE has the same form of an infinitesimal generator of an odd-symplectic transformation with contact Hamiltonian the given PDE. It is considered under which condition such PDE has a characteristic vector field commuting with a generator of an …

2002-10-04abs ↗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 ↗

We consider the problem of computing the integrable sub-distributions of the non-integrable Vessiot distribution of multi-dimensional second order partial differential equations (PDEs). We use Vessiot theory and solvable structures to find the largest integrable distributions contained in the Vessiot distribution assoc…

2014-01-02abs ↗pdf ↗

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.

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.

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.

Generative model improved using Liouville PDE-based sliced-Wasserstein flow.

problem Improving generative models for fair regression.
method Transformed sliced-Wasserstein flow into Liouville PDE-based formalism, handling density estimation with normalizing flows of neural ODE.
result Outperforms in convergence and fairness with reduced variance.

New integrable matrix PDEs derived from Frölicher-Nijenhuis brackets.

problem Developing integrable systems from tensor field properties.
method Using Frölicher-Nijenhuis brackets to generate bi-differential graded algebras and PDE systems.
result New integrable nonlinear matrix PDEs and systems are derived.