A Bayesian hierarchical framework for emulating a complex crop yield simulator

Muhammad Mahmudul Hasan; Jonathan Andrew Cumming

Home/Archive/arXiv

arXiv · 2207.12999

A Bayesian hierarchical framework for emulating a complex crop yield simulator

Muhammad Mahmudul Hasan·Jonathan Andrew Cumming

View original source ↗Read source document ↗Export metadata ↓

Abstract

Emulation of complex computer simulations have become an effective tool in the exploration of the behaviour of the simulated processes. Agriculture is one such area where the simulation of crop growth, nutrition, soil condition and pollution could be invaluable in any land management decisions. In this paper, we study output from the EPIC simulation model to investigate the behaviour of crop yield in response to changes in inputs such as fertilizer levels, soil, steepness, and other environmental covariates. We build a model for crop yield around a non-linear Mitscherlich Baule growth model to make inferences about the response of crop yield to changes continuous input variables (fertiliser levels), as well as exploring the impact of categorical factor inputs such as land steepness and soil type. A Bayesian hierarchical approach to the modelling was taking for mixed inputs, requiring Markov Chain Monte Carlo simulations to obtain samples from the posterior distributions, to validate and illustrate the results, and to carry out model selection. Our results highlight a strong response of yield to nitrogen, but surprisingly a weak response to phosphorus and also shows the substantial improvement of the model after adding factor effects response to maximum yield for this particular simulator configuration and catchment.

Explore related subjects

stat.CO stat.AP

Keep this discovery

BibTeX RIS

Muhammad Mahmudul Hasan, Jonathan Andrew Cumming. 2022-07-26. A Bayesian hierarchical framework for emulating a complex crop yield simulator. https://arxiv.org/abs/2207.12999

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↗