SearcharxivSearch

arXiv · 2411.19066

Evaluating marginal likelihood approximations of dose-response relationship models in Bayesian benchmark dose methods for risk assessment

Abstract

Benchmark dose (BMD; a dose associated with a specified change in response) is used to determine the point of departure for the acceptable daily intake of substances for humans. Multiple dose-response relationship models are considered in the BMD method. Bayesian model averaging (BMA) is commonly used, where several models are averaged based on their posterior probabilities, which are determined by calculating the marginal likelihood (ML). Several ML approximation methods are employed in standard software packages, such as BBMD, \texttt{ToxicR}, and Bayesian BMD for the BMD method, because the ML cannot be analytically calculated. Although ML values differ among approximation methods, resulting in different posterior probabilities and BMD estimates, this phenomenon is neither widely recognized nor quantitatively evaluated. In this study, we evaluated the performance of five ML approximation methods: (1) maximum likelihood estimation (MLE)-based Schwarz criterion, (2) Markov chain Monte Carlo (MCMC)-based Schwarz criterion, (3) Laplace approximation, (4) density estimation, and (5) bridge sampling through numerical examples using four real experimental datasets. Eight models and three prior distributions used in BBMD and \texttt{ToxicR} were assumed. The approximation and estimation biases of bridge sampling were the smallest regardless of the dataset or prior distributions. Both the approximation and estimation biases of MCMC-based Schwarz criterion and Laplace approximation were large for some datasets. Thus, the approximation biases of the density estimation were relatively small but were large for some datasets. In terms of the accuracy of ML approximation methods, using Bayesian BMD, in which the bridge sampling is available, is preferred.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sota Minewaki, Tomohiro Ohigashi, Takashi Sozu. 2024-11-28. Evaluating marginal likelihood approximations of dose-response relationship models in Bayesian benchmark dose methods for risk assessment. https://doi.org/10.1016/j.comtox.2025.100347

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