Compositional diffusion models simulate coupled PDEs efficiently.
problem Efficiently simulating long-horizon coupled PDE systems.
method Diffusion models trained on decoupled data are composed at inference time.
result Compositional diffusion models recover coupled trajectories with low error.
New integrable systems derived from Nijenhuis geometry.
problem Developing new integrable systems from Nijenhuis geometry.
method Constructing a new series of multicomponent integrable PDE systems.
result Many famous integrable systems are contained within the new series.
Extracts intrinsic spatial coordinates for complex agent systems to learn PDEs.
problem Modeling collective dynamics of heterogeneous agents.
method Data-driven extraction of intrinsic spatial coordinates, learning PDEs in emergent space.
result Collective dynamics can be approximated through learned PDEs in emergent coordinates.
Efficient surrogate modeling for complex PDEs with physical laws.
problem High computational cost of repeated PDE simulations.
method LC-prior Gaussian process with POD and RBF-FD.
result Significantly reduced computational cost and improved accuracy.
Developed MF-PINNs to solve coupled Stokes-Darcy equations more accurately.
problem Solving coupled Stokes-Darcy equations with varying physical constants.
method Combining VP and SV forms with adjusted weights in MF-PINNs.
result Improved accuracy of streamline and pressure fields in numerical experiments.
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.
D2SRM solves complex PDEs using deep learning.
problem High-dimensional, Hessian-dependent fully nonlinear parabolic PDEs.
method Single scalar space-time network generating derivative-consistent approximations trained through residuals and penalties.
result Well-posedness and convergence theory established for globally Lipschitz equations.
BGG-equations are geometric overdetermined systems of PDEs on parabolic geometries. Normal solutions of BGG-equations are particularly interesting and we give a simple formula for the necessary and sufficient additional integrability conditions on a solution. We then discuss a procedure for coupling known solutions of …
Data-efficient PDE operator learning without expensive simulations.
problem Expensive numerical PDE solutions limit data efficiency in machine learning.
method Unsupervised pretraining and in-context learning.
result Highly data-efficient and more generalizable than conventional models.
We consider an integro-differential equation derived from a system of coupled parabolic PDE and an ODE which describes an European option pricing with liquidity shocks. We study the well-posedness and prove comparison principle for the corresponding initial value problem.
Survey of geometric flows from unified string theories.
problem None explicitly stated, but related to understanding geometric flows in string theories.
method Survey of geometric flows in various geometries (complex, almost-complex, symplectic) motivated by string theories.
result Intermediate flows between Ricci and Kähler-Ricci flows, often coupled to additional fields.
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.
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.
We extend martingale transport results to weak martingale transport.
problem Applying martingale transport results to weak martingale transport.
method Change of numeraire for weak martingale transport.
result Established the correspondence between stretched Brownian motion and its geometric counterpart.
New algorithm solves Schrödinger bridge problem with mismatched channels.
problem Solving Schrödinger bridge problem with input and noise channel mismatch.
method Design of a Sinkhorn recursion with memory for nonlinear PDEs.
result Demonstrates solving control-affine Schrödinger bridge problem.
We prove that a smooth Riemannian manifold admitting an imaginary generalized Killing spinor whose Dirac current satisfies an additional algebraic constraint condition can be embedded as spacelike Cauchy hypersurface in a smooth Lorentzian manifold on which the given spinor extends to a null parallel spinor. This is in…
Clarifies relation for solving control-affine Schrödinger bridge problems.
problem Solving control-affine Schrödinger bridge problems via Hopf-Cole transform.
method Applies Hopf-Cole transform to conditions of optimality, resulting in nonlinear PDEs.
result Generic control-affine Schrödinger bridge requires further algorithmic development.
GrADE uses graph neural networks and Neural ODE for solving time-dependent nonlinear PDEs efficiently.
problem Solving time-dependent nonlinear PDEs is computationally challenging and time-consuming.
method GrADE combines graph neural networks for spatial modeling and Neural ODE for temporal modeling, using attention mechanisms.
result GrADE efficiently solves PDEs, demonstrating scalability and better accuracy compared to existing methods.
LVM-GP solves PDEs with uncertainty using latent variables and Gaussian processes.
problem Uncertainty quantification in PDE solutions with noisy data.
method Combines latent variable model and Gaussian process for uncertainty-aware prediction.
result Efficiently captures functional dependencies and robust uncertainty quantification.
Graph Neural Simulators improve data efficiency for PDE surrogates.
problem Lack of data efficiency in neural operators for PDE systems.
method Graph Neural Simulators (GNS) leverage message-passing and numerical time-stepping to learn PDE dynamics efficiently.
result GNS achieves less than 1% relative L2 error using only 3% of available trajectories.
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.
Unique asymptotics found for special geometric flows.
problem Classifying ancient ovals of Ricci flow.
method Analyzing invariant, compact, non-self-similar solutions.
result Uniqueness of the profile function G(z,t). DeepSVM learns SVMs without PDE solving, achieving high pricing accuracy.
problem Computational bottleneck in real-time calibration of stochastic volatility models.
method Physics-informed Deep Operator Network (PI-DeepONet) that enforces terminal payoffs and no-arbitrage conditions.
result DeepSVM achieves high pricing accuracy across various market dynamics.
New method tackles convergence issues in approximating FBSDEs.
problem Convergence issues in approximating coupled FBSDEs.
method Approximates initial condition for a family of FBSDEs, then uses it to approximate the original FBSDE.
result Method converges even when standard deep BSDE method fails.
Recently, a lot of papers proposed to use neural networks to approximately solve partial differential equations (PDEs). Yet, there has been a lack of flexible framework for convenient experimentation. In an attempt to fill the gap, we introduce a PyDEns-module open-sourced on GitHub. Coupled with capabilities of BatchF…
We analyze the dynamics of an online algorithm for independent component analysis in the high-dimensional scaling limit. As the ambient dimension tends to infinity, and with proper time scaling, we show that the time-varying joint empirical measure of the target feature vector and the estimates provided by the algorith…
As the Securities and Exchange Commission(SEC) has implemented a new regulation on short-sellings, short-sellers are required to repurchase stocks once the clearing risk rises to a certain level. Avellaneda and Lipkin proposed a fully coupled SDE system to describe the mechanism which is referred as Hard-To-Borrow(HTB)…
Classifies twisted-austere 3-folds in Euclidean space.
problem Classifying submanifolds in Euclidean space with specific geometric properties.
method Analyzes coupled nonlinear PDEs and geometric properties of submanifolds.
result No other possibilities for the base M exist except for a generalized helicoid in R5. Study reveals optimal price prediction through volume imbalance analysis.
problem Understanding the relationship between prices and volume imbalance in high-frequency trading.
method Developed a market-making model to analyze price-imbalance connection and solve optimization problems.
result Optimal quoting of predictive imbalance is confirmed, useful for financial regulation.
We give new estimates for a critical elliptic system introduced by Rivière-Struwe in \cite{riviere_struwe} (see also the work of Rupflin \cite{rupflin} and Schikorra \cite{schikorra_frames}), which generalises PDE solved by harmonic (and almost harmonic) maps from a Euclidean ball $B_1 \In \R^n$ into Riemannian manifol…
In this paper, we provide a model-independent extension of the paradigm of dynamic hedging of derivative claims. We relate model-independent replication strategies to local martingales having a closed form which we can characterise via solutions of coupled PDEs. We provide a general framework and then apply it to a mar…
The equations governing anti-self-dual and Einstein-Weyl conformal geometries can be regarded as `master dispersionless systems' in four and three dimensions respectively. Their integrability by twistor methods has been established by Penrose and Hitchin. In this note we present, in specially adapted coordinate systems…
New method uses PINNs to solve complex PDEs with sparse measurements.
problem Joint estimation of source and parameters in advection-diffusion equations with limited data.
method Weighted adaptive approach based on neural tangent kernel of PINNs.
result Successful estimation of source function, velocity, and diffusion parameters.
New method learns PDE solutions from low-fidelity data.
problem Challenges in learning PDE surrogates with scarce data.
method Flow matching in infinite-dimensional space with conditional neural operators.
result Accurately learns PDE solutions across different resolutions and fidelities.
Physics-informed neural networks (PINNs) encode physical conservation laws and prior physical knowledge into the neural networks, ensuring the correct physics is represented accurately while alleviating the need for supervised learning to a great degree. While effective for relatively short-term time integration, when …
An efficient method to construct Hamiltonian structures for nonlinear evolution equations is described. It is based on the notions of variational Schouten bracket and l*-covering. The latter serves the role of the cotangent bundle in the category of nonlinear evolution PDEs. We first consider two illustrative examples …
Enhances CEV model pricing with high-order scheme and adaptive time stepping.
problem Improving accuracy in pricing American CEV models with irregularities.
method High-order time adapted scheme, local mesh refinement, adaptive time stepping, fifth-order 5(4) Dormand-Prince method.
result Highly accurate solution with reduced computational runtime.
We present a framework for analyzing the exact dynamics of a class of online learning algorithms in the high-dimensional scaling limit. Our results are applied to two concrete examples: online regularized linear regression and principal component analysis. As the ambient dimension tends to infinity, and with proper tim…
A new method infers parameters from PDEs using Gaussian processes.
problem Estimating unknown parameters in PDEs from noisy data.
method PDE-Informed Gaussian Process (PIGP) method.
result The method bypasses numerical solvers for PDEs and provides uncertainty quantification.
Neural-PDE learns PDEs from data using LSTM, outperforming traditional methods.
problem Solving time-dependent PDEs numerically is challenging.
method Bidirectional LSTM encoder to learn governing rules from data.
result Neural-PDE efficiently predicts PDE dynamics with minimal parameters.
Neural Q-learning tackles high-dimensional PDEs.
problem Solving high-dimensional PDEs is computationally challenging.
method Adapting Q-learning from reinforcement learning to solve PDEs.
result The neural network approximator converges to the PDE solution as the network width increases.
Partial differential equations (PDEs) are commonly derived based on empirical observations. However, recent advances of technology enable us to collect and store massive amount of data, which offers new opportunities for data-driven discovery of PDEs. In this paper, we propose a new deep neural network, called PDE-Net …
This paper studies a limit order book (LOB) model, in which the order dynamics depend on both, the current best available prices and the current volume density functions. For the joint dynamics of the best bid price, the best ask price, and the standing volume densities on both sides of the LOB we derive a weak law of …
PDE-DKL combines NNs and GPs for high-dimensional PDE problems.
problem High-dimensional PDE problems with scarce data.
method PDE-constrained Deep Kernel Learning (PDE-DKL) framework.
result High accuracy with reduced data requirements.
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.
In illiquid markets, option traders may have an incentive to increase their portfolio value by using their impact on the dynamics of the underlying. We provide a mathematical framework within which to value derivatives under market impact in a multi-player framework by introducing strategic interactions into the Almgre…
Meta-learning base distributions for efficient PDE solutions.
problem Efficiently solving parametric parabolic PDEs across different scenarios.
method Meta-learning base distributions to compute PDE solutions.
result Improves generalization to new parameter regimes.