MLLGFeb 2, 2021

Bayesian data-driven discovery of partial differential equations with variable coefficients

arXiv:2102.01432v26 citations
AI Analysis

This work provides a more robust and accurate method for discovering PDEs with variable coefficients, which is crucial for applied scientists and engineers working with noisy experimental or simulation data.

This paper addresses the challenge of discovering Partial Differential Equations (PDEs) with variable coefficients from noisy data. The authors propose a Bayesian sparse learning algorithm, tBGL-SS, which demonstrates improved robustness against noise and offers superior model selection compared to classic metrics like RMSE and AIC.

The discovery of Partial Differential Equations (PDEs) is an essential task for applied science and engineering. However, data-driven discovery of PDEs is generally challenging, primarily stemming from the sensitivity of the discovered equation to noise and the complexities of model selection. In this work, we propose an advanced Bayesian sparse learning algorithm for PDE discovery with variable coefficients, predominantly when the coefficients are spatially or temporally dependent. Specifically, we apply threshold Bayesian group Lasso regression with a spike-and-slab prior (tBGL-SS) and leverage a Gibbs sampler for Bayesian posterior estimation of PDE coefficients. This approach not only enhances the robustness of point estimation with valid uncertainty quantification but also relaxes the computational burden from Bayesian inference through the integration of coefficient thresholds as an approximate MCMC method. Moreover, from the quantified uncertainties, we propose a Bayesian total error bar criteria for model selection, which outperforms classic metrics including the root mean square and the Akaike information criterion. The capability of this method is illustrated by the discovery of several classical benchmark PDEs with spatially or temporally varying coefficients from solution data obtained from the reference simulations. In the experiments, we show that the tBGL-SS method is more robust than the baseline methods under noisy environments and provides better model selection criteria along the regularization path.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes