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 …
Extends RDS filtering to position-orientation space for better image processing.
problem Enhancing and inpainting images with crossing structures.
method Created a version of RDS filtering using gauge frames, studying generalised diffusion.
result RDS filtering on position-orientation space improves denoising and inpainting of crossing structures.
The paper explores how multiway data from PDEs can be accurately tracked using EnKF with specific covariance and precision estimators.
problem Tracking sparse and multiway structures in dynamical processes governed by PDEs.
method Examined several multiway covariance and precision matrix estimators in the context of physics-driven forecasting and EnKF.
result Multiway data from Poisson and convection-diffusion PDEs can be accurately tracked using EnKF with appropriate estimators.
Machine learning for scientific applications faces the challenge of limited data. We propose a framework that leverages a priori known physics to reduce overfitting when training on relatively small datasets. A deep neural network is embedded in a partial differential equation (PDE) that expresses the known physics and…
Improved method using filtered PDEs for robust physics-informed deep learning.
problem Complex real-world problems with noisy and sparse data.
method Proposed a surrogate constraint (FPDE) to filter and reduce the influence of noisy and sparse observation data.
result FPDE models converge better and produce higher quality solutions with less data.
Study supports recovery of PDEs from noisy data using a specific regularization method.
problem Support recovery of PDEs from a single noisy trajectory.
method Applying ℓ1-regularized Pseudo-Least Squares model to a given data set.
result Support of ℓ1-c coefficients asymptotically converges to the true signed-support of the PDE.
Combines neural networks with splitting-up method for filtering equations.
problem Approximating the solution of filtering equations for signal processes.
method Combines splitting-up method with neural networks.
result Produces an approximation of the unnormalised conditional distribution.
Paper tackles singularity detection in PDEs using data-driven self-supervised learning.
problem Detecting singularities in PDE solutions for efficient numerical methods.
method Data-driven self-supervised learning framework with filtering tasks.
result Proposes filtering methods for raw unlabeled data to improve singularity detection.
CPCMs integrate causal drivers for robust portfolio optimization.
problem Degradation of classical portfolio models under structural breaks and lack of arbitrage consistency in machine learning.
method Causal PDE-Control Models integrating structural causal drivers, nonlinear filtering, and forward-backward PDE control.
result CPCM solvers achieve higher Sharpe ratios and lower turnover than benchmarks.
Separates estimation and control in risk-sensitive investment problems with partial observation.
problem Risk-sensitive investment problems with incomplete observation.
method Investigates separability of a general class of risk-sensitive investment management problems using a finite-dimensional filter.
result The separated problem is strictly equivalent to the original control problem.
Probabilistic method combines space and time uncertainties in PDEs.
problem Separate treatment of space and time in PDE solvers obscures interactions and error quantification.
method Gaussian process interpretation of finite difference methods interacting with probabilistic ODE solvers.
result Joint quantification of space- and time-uncertainty possible without sacrificing ODE solver performance.
We consider a Hidden Markov Model (HMM) where the integrated continuous-time Markov chain can be observed at discrete time points perturbed by a Brownian motion. The aim is to derive a filter for the underlying continuous-time Markov chain. The recursion formula for the discrete-time filter is easy to derive, however i…
A new EnKF method for elliptic PDEs reduces dimensionality for accurate state estimation.
problem Elliptic PDEs in fluid flows make traditional EnKF regularization ineffective.
method Low-rank factorization of the Kalman gain based on the Jacobian spectrum.
result Inference can be performed in a low-dimensional subspace of the state space.
Efficiently computes sparse signature coefficients using kernels.
problem Lack of efficient methods for sparse signature coefficients.
method Signature kernels and PDE-based methods.
result Sparse groups of signature coefficients can be isolated effectively.
Proposes a new method for nonlinear Bayesian updates using ensemble kernel regression.
problem Nonlinear and non-Gaussian Bayesian updates for complex systems.
method Combines Kalman filtering for observed components and kernel density estimation for unobserved components, with subsampling and clustering.
result Reduces estimation errors in highly nonlinear scenarios compared to standard linear updates.
Unified approach solves Kyle model with dynamic information.
problem Solving a generalized Kyle model with dynamic information.
method Monge-Kantorovich duality and backward stochastic partial differential equations.
result Characterization of optimal strategies and pricing rules.
Given a Markovian Brownian martingale Z, we build a process X which is a martingale in its own filtration and satisfies X1=Z1. We call X a dynamic bridge, because its terminal value Z1 is not known in advance. We compute explicitly its semimartingale decomposition under both its own filtration $\cF^X$ an…
Discovering the underlying physical behavior of complex systems is a crucial, but less well-understood topic in many engineering disciplines. This study proposes a finite-difference inspired convolutional neural network framework to learn hidden partial differential equations from given data and iteratively estimate fu…
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 …
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.
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.
Kernel method learns PDEs from noisy data.
problem Discovering and solving PDEs from noisy data.
method Kernel smoothing, regression, and operator learning.
result Competitive performance compared to state-of-the-art algorithms.
Solves a PDE for Landsberg surfaces using new Finsler surface insights.
problem Solving the Landsberg's PDE for Finsler surfaces.
method Reduces the system of non-linear PDEs to a single PDE, the Landsberg's PDE, and solves it.
result Obtains a class of solutions for the Landsberg's PDE.
Survey on conservation laws for geometric PDEs.
problem Modeling polyharmonic maps.
method Conservation law approach.
result Overview of conservation laws in geometric PDEs.
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.
PDE-based G-CNNs add geometric symmetries to CNNs without augmentation.
problem Designing CNNs with built-in symmetries like rotation.
method Formulate CNN layers as PDE solvers on homogeneous spaces.
result PDE-G-CNNs achieve better performance with fewer parameters.
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.
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.
The paper presents a PDE method for xVA incorporation in financial derivatives.
problem Incorporating value adjustments (xVA) in financial derivative pricing.
method Analytical solution of PDEs in the Black-Scholes framework.
result New semi-closed formulas for xVA are derived and compared to Monte-Carlo and numerical methods.
New PDEs of mixed type emerge in fluid mechanics and geometry.
problem Analysis of nonlinear PDEs of mixed type.
method Through historical problems and recent trends.
result Many PDEs are of mixed type, requiring new analysis.
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.
Automated PDE discovery from multiple noisy experiments.
problem Inherent variability in experiments makes single experiment inference unreliable.
method Randomised adaptive group Lasso sparsity estimator in deep learning framework.
result More generalizable PDEs found from multiple datasets.
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.
In recent years, data-driven methods have been developed to learn dynamical systems and partial differential equations (PDE). The goal of such work is discovering unknown physics and the corresponding equations. However, prior to achieving this goal, major challenges remain to be resolved, including learning PDE under …
Meta-learning neural networks to solve diverse PDEs efficiently.
problem Efficiently solving new PDE problems with minimal training.
method Neural network meta-learning of PDE problem representations.
result Meta-learned neural networks predict PDE solutions with high accuracy.
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 …
New formula for portfolio risk management using conditional PDEs.
problem Optimal diversification and risk management of portfolios.
method Closed-form formula for conditional probability, Gaussian copulas, conditional risk-neutral PDE.
result Dynamic monitoring of portfolio volatilities and weights from PDEs.
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…
Novel neural network solves PDEs with multi-scale resolution.
problem Solving time-dependent PDEs with varying spatial and temporal scales.
method Multi-scale message passing neural network with temporal and spatial gating modules.
result Outperforms baselines on PDEs with diverse scales.
Error estimates for nonlinear PDEs using kernel/GP methods.
problem Error analysis of kernel/GP methods for nonlinear and parametric PDEs.
method Sobolev space error estimates based on minimizing norm property of the solution.
result Dimension-benign convergence rates for smooth solutions.
Adapts PDE method to prove L∞ estimates for complex Hessian equations.
problem Proving L∞ 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 L∞ 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.