SearcharxivSearch

arXiv · 2004.05796

Explicit Estimation of Derivatives from Data and Differential Equations by Gaussian Process Regression

Abstract

In this work, we employ the Bayesian inference framework to solve the problem of estimating the solution and particularly, its derivatives, which satisfy a known differential equation, from the given noisy and scarce observations of the solution data only. To address the key issue of accuracy and robustness of derivative estimation, we use the Gaussian processes to jointly model the solution, the derivatives, and the differential equation. By regarding the linear differential equation as a linear constraint, a Gaussian process regression with constraint method (GPRC) is developed to improve the accuracy of prediction of derivatives. For nonlinear differential equations, we propose a Picard-iteration-like approximation of linearization around the Gaussian process obtained only from data so that our GPRC can be still iteratively applicable. Besides, a product of experts method is applied to ensure the initial or boundary condition is considered to further enhance the prediction accuracy of the derivatives. We present several numerical results to illustrate the advantages of our new method in comparison to the standard data-driven Gaussian process regression.

Explore related subjects

Keep this discovery

BibTeXRIS

Hongqiao Wang, Xiang Zhou. 2020-04-13. Explicit Estimation of Derivatives from Data and Differential Equations by Gaussian Process Regression. https://arxiv.org/abs/2004.05796

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Estimating Hierarchically Rank Structured Covariance Matrices

We consider the problem of estimating a high-dimensional covariance matrix from a very limited number of samples. This problem is ubiquitous in computational fluid dynamics, where a small number of fluid snapshots must be used to construct a Gramian matrix determining a reduced-order model, as well as in computational geoscience, where a small ensemble of Earth system forecasts must be used to estimate the covariance matrix associated with the forecast uncertainty. It is common practice to regularize the small-sample covariance by imposing a "localization" structure that enforces a physically realistic correlation length scale, imposing a sparsity constraint, "shrinking" towards a prescribed target, or attenuating small correlations. We propose an alternate technique that regularizes the small-sample covariance by imposing hierarchical rank structure. Compared to regularization methods that assume sparsity such as spatial localization, hierarchical rank structure accommodates a wider range of covariance matrices, roughly corresponding to situations where long-range correlations vary more smoothly than short-range ones. It also results in a data-sparse matrix format that permits highly efficient matrix-vector products. We present theory and algorithms which show how to efficiently estimate a high-dimensional, hierarchically rank structured covariance matrix from limited samples. Through an error analysis and numerical experiments with a variety of model problems, we demonstrate that these techniques are effective at reducing sampling errors, and that in many cases they achieve smaller estimation error than conventional techniques.

stat.CO

Optimal Slice-Adaptive Tuning of Hybrid Slice Sampling

Slice sampling is a Markov chain Monte Carlo algorithm that draws its next state uniformly from a "slice"---a super-level set of the target density function---at each iteration, thereby providing automatic local adaptivity to the scale of the target. In practice the exact slice is not known, so general-purpose implementations use an approximate slice that is grown from a starting interval of length $w>0$, with a computational cost that depends on $w$. This work presents an analysis of the average per-iteration number of target density evaluations, as a function of $w$, of hybrid slice sampling with various slice-finding schemes for targets with contiguous slices. The paper uses the results of the analysis to develop automated, slice-adaptive tuning schemes along with suboptimality bounds and asymptotic convergence guarantees. Simulations demonstrate that the tuning schemes reliably yield near-optimal slice-adaptive tuning with essentially no dependence on the initial setting of $w$.

stat.CO