SearcharxivSearch

arXiv · 1812.07801

Efficient treatment of model discrepancy by Gaussian Processes - Importance for imbalanced multiple constraint inversions

Abstract

Mechanistic simulation models are inverted against observations in order to gain inference on modeled processes. However, with the increasing ability to collect high resolution observations, these observations represent more patterns of detailed processes that are not part of a modeling purpose. This mismatch results in model discrepancies, i.e. systematic differences between observations and model predictions. When discrepancies are not accounted for properly, posterior uncertainty is underestimated. Furthermore parameters are inferred so that model discrepancies appear with observation data stream with few records instead of data streams corresponding to the weak model parts. This impedes the identification of weak process formulations that need to be improved. Therefore, we developed an efficient formulation to account for model discrepancy by the statistical model of Gaussian processes (GP). This paper presents a new Bayesian sampling scheme for model parameters and discrepancies, explains the effects of its application on inference by a basic example, and demonstrates applicability to a real world model-data integration study. The GP approach correctly identified model discrepancy in rich data streams. Innovations in sampling allowed successful application to observation data streams of several thousand records. Moreover, the proposed new formulation could be combined with gradient-based optimization. As a consequence, model inversion studies should acknowledge model discrepancies, especially when using multiple imbalanced data streams. To this end, studies can use the proposed GP approach to improve inference on model parameters and modeled processes.

Explore related subjects

Keep this discovery

BibTeXRIS

Thomas Wutzler. 2018-12-19. Efficient treatment of model discrepancy by Gaussian Processes - Importance for imbalanced multiple constraint inversions. https://arxiv.org/abs/1812.07801

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