Proposes ENOs for learning PDE solutions that conserve energy.
problem Learning dynamics that obey physical laws, especially in super-resolution settings.
method Energy-consistent Neural Operators (ENOs) with a novel penalty function inspired by energy-based theory.
result ENOs outperform existing DNN models in predicting solutions from data, especially in super-resolution settings.
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.
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.
GIT-Net uses neural networks to approximate PDE operators efficiently.
problem Approximating PDE operators for complex geometries.
method Parametrizes adaptive generalized integral transforms with deep neural networks.
result GIT-Net outperforms existing neural network operators in multiple areas.
Physics-informed WNO learns PDE solutions without labeled data.
problem Data-hungry nature of WNO framework.
method Physics-informed WNO for learning PDE solutions.
result Validated and illustrated with four nonlinear systems.
Physics-informed neural networks and neural operators speed up solving parametric PDEs by orders of magnitude.
problem Solving PDEs for varying parameters is computationally expensive.
method Physics-informed neural networks and neural operators learn solution mappings across parameter spaces.
result Neural operators achieve computational speedups of 10^3 to 10^5 times faster than traditional methods.
Operator learning approximates complex mappings for PDEs and experimental data.
problem Approximating mappings between infinite-dimensional function spaces for scientific computing.
method Formalizing operator learning as function-to-function regression and incorporating physical constraints.
result Development of rigorous uncertainty quantification frameworks for operator learning.
Study generalizes Picard iteration for nonlinear PDEs, deriving bounds on error.
problem Generalize Picard iteration for nonlinear parabolic PDEs.
method Formulate Picard iteration as abstract state-transition model, derive generalization error bounds.
result Picard depth reduction reduces Picard truncation error without increasing estimation error.
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 …
VIDON learns operators with variable sensors, overcoming sensor limitations.
problem Fixed sensor locations restrict operator learning applicability.
method Variable-Input Deep Operator Network (VIDON) with random, varying sensors.
result VIDON efficiently approximates operators in PDEs and is robust to sensor permutations.
Enhances neural operators with physics knowledge for more accurate simulations.
problem Improving accuracy and generalization of neural operators for physical systems.
method Jointly learns from original PDEs and simplified forms, incorporating fundamental physics.
result Significant improvement in nRMSE across various PDE problems.
Paper quantifies neural operators' efficiency for solving nonlinear parabolic PDEs.
problem Quantifying the efficiency of neural operators for solving nonlinear parabolic PDEs.
method Deriving approximation rates by transferring PDEs to integral equations and leveraging Picard's iteration.
result Neural operators can efficiently approximate solution operators of nonlinear PDEs without exponential complexity growth.
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 …
MCNO learns PDE solution operators using Monte Carlo sampling.
problem Learning solution operators for PDEs efficiently and flexibly.
method Directly learns kernel function using Monte Carlo sampling of input-output pairs.
result Competitive accuracy with efficient computational cost on 1D PDE benchmarks.
Improved DeepONets for PDE solution operators with adaptive re-weighting and new architecture.
problem Training DeepONets for PDE solution operators without paired data.
method Adaptive re-weighting of training examples and novel network architecture.
result Consistently improved predictive accuracy by a factor of 10-50x.
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.
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.
NOGaP uses neural operators and GPs to solve PDEs with uncertainty quantification.
problem Lack of uncertainty measures in neural operator solutions for PDEs.
method NOGaP combines neural operators with Gaussian Processes to provide probabilistic solutions.
result NOGaP offers improved prediction accuracy and uncertainty quantification.
We present a framework for recovering/approximating unknown time-dependent partial differential equation (PDE) using its solution data. Instead of identifying the terms in the underlying PDE, we seek to approximate the evolution operator of the underlying PDE numerically. The evolution operator of the PDE, defined in i…
Polynomial Chaos Expansion improves operator learning for PDEs.
problem Approximating mappings between infinite-dimensional functional spaces.
method Polynomial Chaos Expansion (PCE) for operator learning.
result PCE achieves strong performance in operator learning and uncertainty quantification.
FNO-DEQ solves steady-state PDEs as fixed points, outperforming traditional FNOs.
problem Lack of understanding in designing neural network architectures for PDEs.
method Proposes FNO-DEQ, a deep equilibrium architecture that solves steady-state PDEs as fixed points.
result FNO-DEQ outperforms FNO-based architectures in predicting solutions to steady-state PDEs.
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.
In this paper we introduce a numerical method for nonlinear parabolic PDEs that combines operator splitting with deep learning. It divides the PDE approximation problem into a sequence of separate learning problems. Since the computational graph for each of the subproblems is comparatively small, the approach can handl…
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.
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.
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.
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.
PILNO uses neural operators to solve PDEs efficiently on point clouds.
problem Solving partial differential equations (PDEs) on point cloud data efficiently.
method Physics-informed low-rank neural operator framework combining low-rank kernel approximations and an encoder-decoder architecture.
result PILNO efficiently approximates solution operators of PDEs on point cloud data, satisfying PDE constraints and boundary conditions.
New EiV models correct bias in operator learning with noisy data.
problem Bias in operator learning due to noisy independent variables.
method Developed EiV models for MOR-Physics and DeepONet.
result EiV models reduce bias in noisy operator learning.
This article introduces machine learning methods for solving PDEs.
problem Approximating solutions of partial differential equations.
method Machine learning methods, including physics-informed neural networks and deep operator learning.
result Recent advances in machine learning have made PDE solutions more accessible.
Study approximates operator learning for PDEs using Fourier multipliers.
problem Approximating operator behavior for PDE simulations.
method Approximation of operator symbols in Fourier domain using semi-norms.
result Identifies conditions for achieving predefined approximation error.
Scalable Gaussian Process Operator tackles high-dimensional PDEs.
problem Scaling Gaussian Process Operators to high-dimensional, data-intensive regimes.
method Nearest-neighbor-based local kernel approximations, sparse kernel approximation, structured Kronecker factorizations, operator-aware kernel structures, task-informed mean functions.
result Consistently achieves high accuracy across varying discretization scales.
DeepONets combine neural networks with physics constraints for PDEs and parameter estimation.
problem Estimating parameters in PDEs with uncertainty quantification.
method Physics-informed neural networks (PINNs) integrated with Deep Operator Networks (DeepONets) for Bayesian inference.
result Robust and accurate solutions with comprehensive uncertainty quantification.
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.
The paper connects web theory to heavenly PDEs and Einstein metrics.
problem Understanding the correspondence between self-dual metrics and vector fields.
method Using Nijenhuis operators and web theory to construct new heavenly PDEs.
result New integrable heavenly PDEs derived from Nijenhuis operators.
New ADANNs improve PDE approximations.
problem Approximating operators for parametric PDEs.
method Custom ANN architectures and initialization schemes.
result ADANNs significantly outperform existing methods.
GenUQ uses generative models to estimate uncertainty in operator learning.
problem Uncertainty quantification in stochastic operator models.
method Introduces a measure-theoretic approach with a generative hyper-network.
result Outperforms other UQ methods in various example problems.
Neural operators achieve fast convergence rates for solving PDEs.
problem Solving partial differential equations (PDEs) efficiently.
method Two-layer neural operators with gradient descent analysis in RKHS.
result Fast convergence rates are minimax optimal for early-stopped GD.
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.
Researchers use operator learning to predict cardiac activation and repolarization times.
problem Computational demands and need for clear, interpretable information in cardiac electrophysiology.
method Exploiting Fourier Neural Operators (FNO) and Kernel Operator Learning (KOL) to learn operator mappings.
result Both FNO and KOL approaches are computationally efficient and robust to hyperparameters.
Physics-informed DeepONets solve PDEs without paired data, predicting solutions quickly.
problem Lack of paired input-output data for solving PDEs.
method Physics-informed DeepONets use automatic differentiation to enforce physical laws as soft penalty constraints.
result Physics-informed DeepONets can solve PDEs without paired data, predicting solutions up to 3 orders of magnitude faster.
Study shows neural operators can efficiently solve complex reaction-diffusion systems.
problem Efficiently solving nonlinear reaction-diffusion systems using neural operators.
method Laplacian-based neural operators applied to a generalized Gierer-Meinhardt system.
result Explicit approximation error bounds established for neural operators in terms of network parameters.
Paper introduces a Gaussian Process for operator learning in computational mechanics.
problem Efficient and accurate solutions for large datasets with reliable uncertainty quantification.
method Gaussian Process (GP) embedded in a neural operator framework with stochastic dual descent (SDD) algorithm.
result Improves GP resolution independence and scalability for high-dimensional and non-linear systems.
LUNO linearizes neural operators to quantify their predictive uncertainty.
problem Quantifying the predictive error of neural operators for high-stakes simulations.
method Model linearization to push weight-space uncertainty forward to predictions.
result LUNO provides a practical and theoretically sound way to apply Bayesian methods to neural operators.
G-FuNK learns solutions for nonlinear PDEs on multiple domains and parameters.
problem Predicting time-dependent dynamics of complex systems governed by nonlinear PDEs with varying parameters and domains.
method Graph Fourier Neural Kernels combining domain-adapted and transferable components for non-diffusive and diffusive terms.
result G-FuNK achieves low relative errors on unseen domains and fiber fields, significantly accelerating predictions.
Study on neural scaling laws for solving linear systems in-context.
problem Theoretical guarantees for solving linear systems using a linear transformer architecture.
method Neural scaling laws and task diversity for in-domain and out-of-domain generalization.
result Novel notion of task diversity for necessary and sufficient condition of generalization under task shifts.
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 machine learning methods solve complex PDEs with improved accuracy.
problem Solving fully nonlinear PDEs with convex Hamiltonian.
method Rewriting PDE in dual stochastic control form, estimating optimal feedback control with neural network, approximating value function with neural networks.
result Improved estimation of PDE solution and its derivatives, especially the second derivative.