Online algorithm identifies PDEs from noisy data snapshots.
problem Identifying PDEs from sequential solution snapshots.
method Combines weak-form discretization with online proximal gradient descent.
result Efficiently identifies and tracks systems with time-varying coefficients.
WSINDy for PDEs robustly identifies models from noisy data.
problem Identifying nonlinear dynamics from noisy partial differential equations data.
method Weak formulation of PDEs, Fourier-based model identification, sequential-thresholding least-squares.
result WSINDy enables robust identification of PDEs in noisy conditions.
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.
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.
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.
Derives PDEs from data using manifold learning and neural networks.
problem Identifying PDEs from unknown variables and dynamics.
method Combines manifold learning (Diffusion Maps) and neural networks.
result Emergent space identification connects with multiscale computation.
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.
Critical points of scale-invariant curvature energies in 4D are analytic.
problem Analyzing critical points of curvature energies in 4D manifolds.
method Applying Noether's theorem to identify conservation laws and lower order elliptic system of PDEs, then using integrability by compensation and interpolation theory.
result Critical points of scale-invariant curvature energies in 4D are analytic.
PhICNet combines physics and deep learning for forecasting and source identification in dynamical systems.
problem Forecasting and identifying unobservable external sources in spatio-temporal dynamical systems.
method Physics-Incorporated Convolutional Recurrent Neural Network (PhICNet).
result PhICNet can forecast dynamics and identify sources for relatively long periods.
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.
Automates PDE model reduction with time-scale separation.
problem Computational expense in solving high-dimensional PDEs.
method Combines autoencoder and time-continuous model for latent dynamics.
result Automatically learns independent temporal scales in complex systems.
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.
Complex spatiotemporal dynamics of physicochemical processes are often modeled at a microscopic level (through e.g. atomistic, agent-based or lattice models) based on first principles. Some of these processes can also be successfully modeled at the macroscopic level using e.g. partial differential equations (PDEs) desc…
We use methods from exterior differential systems (EDS) to develop a geometric theory of scalar, first-order Lagrangian functionals and their associated Euler-Lagrange PDEs, subject to contact transformations. The first chapter contains an introduction of the classical Poincare-Cartan form in the context of EDS, follow…
Discover equations from data using neural networks with constraints.
problem Discover equations from noisy data without theoretical derivation.
method Solve constrained optimization problem with penalty or trust-region barrier methods.
result Constrained method outperforms penalty method for higher noise levels or fewer collocation points.
Framework uses deep learning and statistical models to solve PDEs with discontinuous coefficients.
problem Solving PDEs with discontinuous coefficients.
method Two-stage physics-informed deep learning and statistical mixture models.
result Framework achieves adaptability and accurate parameter identification.
Develops a nonlocal PINN framework using PDDO for better solution of PDEs with sharp gradients.
problem Dealing with sharp gradients in solutions of PDEs using traditional PINN approaches.
method Integrates long-range interactions (nonlocality) into PINN using Peridynamic Differential Operator (PDDO).
result Nonlocal PINN approach improves solution accuracy and parameter inference for problems with sharp gradients.
We prove that on compact Alexandrov spaces with curvature bounded below the gradient flow of the Dirichlet energy in the L2-space produces the same evolution as the gradient flow of the relative entropy in the L2-Wasserstein space. This means that the heat flow is well defined by either one of the two gradient fl…
New guarantees for uniquely identifying transport maps and vector fields from finite measure-valued data.
problem Unique recovery of transport maps and vector fields from finite measure-valued data.
method Use of Whitney and Takens embedding theorems to establish conditions for unique identification.
result New metric for comparing diffeomorphisms and analogous results in infinitesimal settings.
Paper analyzes and improves GPSP algorithm for block sparse signal recovery.
problem Recovering block sparse signals from noisy data.
method Group Projected Subspace Pursuit (GPSP) with convergence analysis and feature selection criteria.
result GPSP exactly recovers true block sparse signals under certain conditions.
SINDy-PI robustly identifies implicit dynamics from noisy data.
problem Accurately modeling nonlinear dynamics from noisy data.
method Parallel, implicit SINDy algorithm with multiple optimization algorithms and model selection.
result Significantly more noise robust than previous SINDy approaches.
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.
With the advent of modern data collection and storage technologies, data-driven approaches have been developed for discovering the governing partial differential equations (PDE) of physical problems. However, in the extant works the model parameters in the equations are either assumed to be known or have a linear depen…
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.
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.
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 …
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 …
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.
New algorithm improves on static methods in Active Simple Hypothesis Testing.
problem Optimizing Active Simple Hypothesis Testing with active sampling.
method Game-theoretic formulation, differential games, PDEs, Blackwell Approachability.
result Proposes an efficient algorithm that outperforms static methods in ASHT.
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.