// findings.yaml
12 empirical claims
Each finding cites a source and reports effect size, standard error, p-value, and sample size where available.
Gibbs sampling and related sampling-based approaches provide a general, computationally feasible route to marginal and conditional posterior distributions in Bayesian hierarchical models where analytical integration is intractable. Enabled the wide adoption of MCMC for applied Bayesian inference in the 1990s.
// method: theoretical derivation; simulation studies on hierarchical Normal and binomial models
Inverse-Gamma(ε, ε) priors on variance parameters — a historically common 'non-informative' default in hierarchical Bayesian models — are in fact strongly informative with influence that does not vanish as ε → 0. Half-Cauchy and half-Normal priors on the standard deviation are recommended weakly-informative alternatives that avoid this pathology.
// method: analytical analysis of prior influence; simulation comparison on 8-schools-style hierarchical model
The No-U-Turn Sampler matches or exceeds the efficiency of hand-tuned HMC across a range of target distributions while eliminating the need to specify trajectory length, and outperforms random-walk Metropolis by one to three orders of magnitude in effective sample size per gradient evaluation on correlated Gaussian and logistic regression targets.
// effect: 1-3 orders of magnitude ESS/grad-eval improvement vs. random-walk Metropolis
// method: benchmark on 250-dim correlated Gaussian, logistic regression, hierarchical Bayesian logistic regression
Mean-field variational inference provides dramatically faster approximate posterior inference than MCMC on large-scale latent-variable models (e.g. LDA topic models with millions of documents), at the cost of underestimating posterior variance due to the KL(q||p) forward-KL objective that is mode-seeking rather than mean-matching.
// method: review of applications; comparison to MCMC on LDA, Gaussian mixtures, Bayesian nonparametrics
Partial pooling via hierarchical models produces group-level estimates with lower mean squared error than either complete pooling (ignoring group structure) or no pooling (fitting separate models per group), particularly for groups with small sample sizes. The shrinkage is automatic and adapts to the estimated between-group variance.
// method: textbook demonstration across Radon, 8-schools, roaches, and election forecasting case studies
Posterior predictive checks using realized discrepancy measures T(y, θ) — test quantities that may depend on both data and parameters — provide a principled Bayesian analogue to goodness-of-fit testing. Systematic divergence between T applied to observed vs. replicated data reveals specific modes of model misspecification that point estimates of fit cannot.
// method: theoretical framework with applications to hierarchical models and binomial/normal data
Bayes factors are sensitive to the choice of prior on model parameters in a way that p-values are not; improper priors under the models being compared render the Bayes factor undefined. Proper, weakly-informative priors chosen with the comparison in mind are required for interpretable model comparison.
// method: review of theoretical and applied literature on Bayesian model comparison
Penalised Complexity (PC) priors constructed by penalizing KL divergence from a simpler base model (e.g. zero variance, independence) produce interpretable, weakly-informative defaults for random-effect variances, autoregressive correlation parameters, and overdispersion terms — with a single user-chosen scale that has clear probabilistic meaning.
// method: derivation from KL-divergence base-model penalization; applications to BYM spatial models, AR(1) parameters
Stan's implementation of NUTS with dynamic trajectory doubling, dual-averaging step-size adaptation, and dense-mass-matrix adaptation produces reliable posterior samples for a wide class of continuous-parameter Bayesian models without user tuning. Combined with automatic differentiation and a C++ backend, it enables Bayesian inference at scales previously requiring bespoke Gibbs samplers.
// method: description of Stan implementation; benchmarks on hierarchical GLMs, IRT, Gaussian processes
Approximate Bayesian Computation enables posterior inference for models with intractable likelihoods (e.g. coalescent simulators, agent-based models) by replacing likelihood evaluation with simulation and distance-based acceptance of parameters. ABC-SMC and regression-adjustment variants substantially improve efficiency over rejection ABC for moderate-dimensional parameter spaces.
// method: review of rejection ABC, ABC-MCMC, ABC-SMC with applications in population genetics and epidemiology
The modern applied Bayesian workflow centers on iterative model building: start with weakly-informative priors and a simple model, use HMC/NUTS for posterior computation, apply posterior predictive checks to detect misspecification, refine priors and model structure, and validate via cross-validation (e.g. PSIS-LOO). Prior sensitivity analysis — refitting with varied priors — is recommended for any published Bayesian analysis.
// method: expert consensus review across Bayesian methodology community
Bayesian credible intervals admit the direct probabilistic interpretation that practitioners often incorrectly ascribe to frequentist confidence intervals. This interpretive clarity, combined with modeling flexibility for hierarchical and non-standard likelihoods, is a primary reason behavioral and social sciences have increasingly adopted Bayesian methods.
// method: pedagogical exposition with worked examples across t-tests, ANOVA, regression, and hierarchical models