PDE-DKL: PDE-constrained deep kernel learning in high dimensionality
Weihao Yan, Christoph Brune, Mengwu Guo

TL;DR
The paper introduces PDE-DKL, a novel framework combining deep learning and Gaussian processes under PDE constraints to efficiently solve high-dimensional PDE problems with limited data and provide uncertainty quantification.
Contribution
It proposes a PDE-constrained deep kernel learning approach that leverages low-dimensional latent representations to unify neural networks and Gaussian processes for high-dimensional PDEs.
Findings
Achieves high accuracy with limited data
Provides robust uncertainty quantification
Demonstrates scalability to high-dimensional problems
Abstract
Many physics-informed machine learning methods for PDE-based problems rely on Gaussian processes (GPs) or neural networks (NNs). However, both face limitations when data are scarce and the dimensionality is high. Although GPs are known for their robust uncertainty quantification in low-dimensional settings, their computational complexity becomes prohibitive as the dimensionality increases. In contrast, while conventional NNs can accommodate high-dimensional input, they often require extensive training data and do not offer uncertainty quantification. To address these challenges, we propose a PDE-constrained Deep Kernel Learning (PDE-DKL) framework that combines DL and GPs under explicit PDE constraints. Specifically, NNs learn a low-dimensional latent representation of the high-dimensional PDE problem, reducing the complexity of the problem. GPs then perform kernel regression subject to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Applications · Anomaly Detection Techniques and Applications · Machine Learning and Data Classification
MethodsGreedy Policy Search
