Search arXivSearch

arXiv · 2002.09868

Flexible Prior Elicitation via the Prior Predictive Distribution

Abstract

The prior distribution for the unknown model parameters plays a crucial role in the process of statistical inference based on Bayesian methods. However, specifying suitable priors is often difficult even when detailed prior knowledge is available in principle. The challenge is to express quantitative information in the form of a probability distribution. Prior elicitation addresses this question by extracting subjective information from an expert and transforming it into a valid prior. Most existing methods, however, require information to be provided on the unobservable parameters, whose effect on the data generating process is often complicated and hard to understand. We propose an alternative approach that only requires knowledge about the observable outcomes - knowledge which is often much easier for experts to provide. Building upon a principled statistical framework, our approach utilizes the prior predictive distribution implied by the model to automatically transform experts judgements about plausible outcome values to suitable priors on the parameters. We also provide computational strategies to perform inference and guidelines to facilitate practical use.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Marcelo Hartmann, Georgi Agiashvili, Paul Bürkner, Arto Klami. 2020-03-16. Flexible Prior Elicitation via the Prior Predictive Distribution. https://arxiv.org/abs/2002.09868

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

KEEP EXPLORING

Related papers

Partial identification and unmeasured confounding with multiple treatments and multiple outcomes

Estimating the health effects of multiple air pollutants is a crucial problem in public health, but one that is difficult due to unmeasured confounding bias. Motivated by this issue, we develop a framework for partial identification of causal effects in the presence of unmeasured confounding in settings with multiple treatments and multiple outcomes. Under a factor confounding assumption, we show that joint partial identification regions for multiple estimands can be more informative than considering partial identification for individual estimands one at a time. We show how assumptions related to the strength of confounding or magnitude of plausible effect sizes for one estimand can reduce the partial identification regions for other estimands. As a special case of this result, we explore how negative control assumptions reduce partial identification regions and discuss conditions under which point identification can be obtained. We develop novel computational approaches to finding partial identification regions under a variety of these assumptions. We then estimate the causal effect of PM$_{2.5}$ components on a variety of public health outcomes in the United States Medicare cohort, where we find that the detrimental effect of certain air pollutants are robust to the potential presence of unmeasured confounding bias.

stat.ME

Dynamic programming principle in cost-efficient sequential design: optimal update scheduling under cost constraints

We study sequential cost-efficient design in a situation where each update of covariates involves a fixed time cost typically considerable compared to a single measurement time. The problem arises from parameter estimation in switching measurements on superconducting Josephson junctions which are components needed in quantum computers and other superconducting electronics. In switching measurements, a sequence of current pulses is applied to the junction and a binary voltage response is observed. The measurement requires a very low temperature that can be kept stable only for a relatively short time, and therefore it is essential to use an efficient design. We use the dynamic programming principle from the mathematical theory of optimal control to solve the optimal update times. Specifically, we give a formulation for $D$-optimal experimental design based on the dynamic programming principle with a binary response model. Our simulations demonstrate the cost-efficiency compared to the previously used methods.

stat.ME

Scalable Krylov Subspace Methods for Generalized Mixed-Effects Models with Crossed Random Effects

Mixed-effects models are widely used to model data with complex grouping structures and high-cardinality categorical predictor variables. However, for high-dimensional crossed random effects, current standard computations relying on Cholesky decompositions can become prohibitively slow. In this work, we present Krylov subspace-based methods that address existing computational bottlenecks, and we analyze them both theoretically and empirically. In particular, we derive new results on the convergence and accuracy of the preconditioned stochastic Lanczos quadrature and conjugate gradient methods for mixed-effects models, and we develop scalable methods for calculating predictive variances. In experiments with simulated and real-world data, the proposed methods yield speedups of several orders of magnitude and are more computationally robust than Cholesky-based computations, while maintaining essentially the same accuracy.

stat.ME