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

3774110147 · Jun 202019922001200920172026
48 results for PDE reduction

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.

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.

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.

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.

The study describes metrics geodesically compatible with Nijenhuis operators and their applications to integrable systems.

problem Geodesically compatible metrics and their applications to integrable systems.
method Describes metrics geodesically compatible with a gl-regular Nijenhuis operator and shows how these metrics relate to integrable PDE systems.
result Every metric geodesically compatible with a Nijenhuis operator gives a finite-dimensional reduction of an integrable PDE system.

For several classes of second order dispersionless PDEs, we show that the symbols of their formal linearizations define conformal structures which must be Einstein-Weyl in 3D (or self-dual in 4D) if and only if the PDE is integrable by the method of hydrodynamic reductions. This demonstrates that the integrability of t…

2012-08-13abs ↗pdf ↗

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.

The paper solves integrable systems of PDEs, including famous equations.

problem Constructing solutions for multicomponent integrable PDEs.
method Reduction to a finite-dimensional system, using Nijenhuis geometry.
result Animations of multi-component soliton and cnoidal solutions.

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.

Study portfolio optimization with an exponential utility function and illiquid asset.

problem Optimizing a portfolio with a risk-free, liquid, and illiquid risky asset.
method Analytical substitution, Lie algebraic reduction, solving PDEs.
result Different optimization results for exponential utility function compared to HARA.

In this note we discuss some formal properties of universal linearization operator, relate this to brackets of non-linear differential operators and discuss application to the calculus of auxiliary integrals, used in compatibility reductions of PDEs.

2007-12-20abs ↗pdf ↗

Meta-materials simulation sped up with energy surrogates.

problem Challenging simulation of complex meta-materials due to high-fidelity PDEs.
method Learned component-level surrogates using neural networks to model stored potential energy.
result Surrogates enable accurate macroscopic behavior simulation without full structure simulation.

We find three characterizations for a multidimensional (n+1)-web W possessing a reduct reducible subweb: its closed form equations, the integrability of an invariant distribution associated with W, and the relations between the components of its torsion tensor. In the case of codimension one, the latter criterion estab…

2000-10-17abs ↗pdf ↗

American put options are among the most frequently traded single stock options, and their calibration is computationally challenging since no closed-form expression is available. Due to the higher flexibility in comparison to European options, the mathematical model involves additional constraints, and a variational in…

2016-11-19abs ↗pdf ↗

This work surveys unsupervised learning methods for high-dimensional uncertainty quantification in complex PDEs.

problem Uncertainty quantification in high-dimensional stochastic inputs of complex PDEs.
method Review and investigation of thirteen dimension reduction methods including linear and nonlinear, spectral, blind source separation, convex and non-convex methods.
result Manifold PCE (m-PCE) provides a cost-effective approach compared to deep neural network-based surrogates.

A new method combines classical and machine learning PDE solvers efficiently.

problem Combining classical and machine learning PDE solvers to reduce computational cost and improve accuracy.
method Proposes an approximate greedy router to select solvers at each iteration, mimicking a greedy approach.
result Consistently reduces final error and AUC of the error trajectory compared to single-solver baselines and hybrid approaches.

The focus of this paper is the efficient computation of counterparty credit risk exposure on portfolio level. Here, the large number of risk factors rules out traditional PDE-based techniques and allows only a relatively small number of paths for nested Monte Carlo simulations, resulting in large variances of estimator…

2016-08-03abs ↗pdf ↗

New method converts video of dye plumes into PDEs for better understanding.

problem Inferring continuum models from uncalibrated video data.
method Develops a pipeline to convert grayscale recordings into scalar fields, isolates drift, and identifies transport laws.
result Selected reduced model outperforms advection-diffusion baselines and retains structural interpretability.

This paper, in which we develop ideas introduced in \cite{MR}, focuses on \emph{reduction methods} (basically, group actions or, more generally, simmetries) for the bienergy. This type of techniques enable us to produce examples of critical points of the bienergy by reducing the study of the relevant fourth order PDE's…

2016-07-20abs ↗pdf ↗

A new autoencoder combines deep learning with SVD to reduce model complexity.

problem Overcoming the Kolmogorov barrier in high-dimensional systems.
method Learnable weighted hybrid autoencoder combining SVD and deep learning.
result Empirically, the model exhibits a sharpness thousands of times smaller than other models.

Bayesian Gaussian process models handle uncertain data locations in PDE approximations.

problem Handling uncertainties in data locations for PDE approximations.
method Bayesian inference of uncertain inputs integrated into Gaussian process predictions.
result Substantial reduction in predictive uncertainties achieved through Bayesian inference.

Extends dimension reduction to data-driven settings without gradients.

problem Gradient-based dimension reduction limitations in data-driven settings.
method Score ratio matching framework, tailored parameterization, regularization, eigenvalue deflation.
result Outperforms standard score-matching for problems with low-dimensional structure.