Bayesian calibration and sensitivity analysis for a karst aquifer model using active subspaces

Mario Teixeira Parente; Daniel Bittner; Steven Mattis; Gabriele Chiogna; Barbara Wohlmuth

doi:10.1029/2019wr024739

Home/Archive/arXiv

arXiv · 1901.03283

Bayesian calibration and sensitivity analysis for a karst aquifer model using active subspaces

Mario Teixeira Parente·Daniel Bittner·Steven Mattis·Gabriele Chiogna·Barbara Wohlmuth

View original source ↗Read source document ↗Export metadata ↓

Abstract

In this article, we perform a parameter study for a recently developed karst hydrological model. The study consists of a high-dimensional Bayesian inverse problem and a global sensitivity analysis. For the first time in karst hydrology, we use the active subspace method to find directions in the parameter space that dominate the Bayesian update from the prior to the posterior distribution in order to effectively reduce the dimension of the problem and for computational efficiency. Additionally, the calculated active subspace can be exploited to construct sensitivity metrics on each of the individual parameters and be used to construct a natural model surrogate. The model consists of 21 parameters to reproduce the hydrological behavior of spring discharge in a karst aquifer located in the Kerschbaum spring recharge area at Waidhofen a.d. Ybbs in Austria. The experimental spatial and time series data for the inference process were collected by the water works in Waidhofen. We show that this case study has implicit low-dimensionality, and we run an adjusted Markov chain Monte Carlo algorithm in a low-dimensional subspace to construct samples of the posterior distribution. The results are visualized and verified by plots of the posterior's push-forward distribution displaying the uncertainty in predicting discharge values due to the experimental noise in the data. Finally, a discussion provides hydrological interpretation of these results for the Kerschbaum area.

Explore related subjects

stat.CO cs.NA math.NA

Keep this discovery

BibTeX RIS

Mario Teixeira Parente, Daniel Bittner, Steven Mattis, Gabriele Chiogna, Barbara Wohlmuth. 2019-01-10. Bayesian calibration and sensitivity analysis for a karst aquifer model using active subspaces. https://doi.org/10.1029/2019wr024739

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

KEEP EXPLORING

Related papers

arXiv2026

Extended One-Liners for the Gamma, Poisson, and Binomial Distributions

We demonstrate explicit transformations of three independent uniforms with exact Gamma$(a,1)$, $a>0$, Poisson$(\lambda)$, $\lambda>0$, and Binomial$(N,p)$, $N\geq 1$, $0\leq p \leq 1$ laws using only elementary operations.

stat.CO↗

arXiv2026

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↗

arXiv2026

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↗