Computational Workflow

Routing Summary

Chapters 11–13 and 15 of Gelman, Vehtari & McElreath (2026): what HMC is actually doing, how to read its diagnostics, the catalogue of failure modes and their fixes, the approximate-inference ladder, and modeling as software development. 16 notes.

Concept Map

ConceptNoteTypeDepends OnKey Result
Typical setThe Typical Set and the Log Posterior Densitydefinition—High-dimensional mass is in a thin shell, not at the mode
Initialization and warmupInitial Values, Adaptation, and WarmupconceptThe Typical Set and the Log Posterior DensityThere is no universal default initial point
and ESSChains, Iterations, and Effective Sample SizedefinitionInitial Values, Adaptation, and Warmup comfortable; means not mixing
MCSEEffective Sample Size and Monte Carlo Standard ErrortheoremChains, Iterations, and Effective Sample SizeEq. 11.1–11.2; MCSE
Reporting precisionHow Many Digits to ReportconceptEffective Sample Size and Monte Carlo Standard ErrorReport only digits MCSE supports
Fail-fast loopFit Fast, Fail Fastconcept—Short runs and approximations to detect problems early
Failure modesFailure Modes and Steps ForwardconceptFit Fast, Fail FastFigures 12.4–12.12; funnels, aliasing, multimodality, the folk theorem
Model changes as computational fixesModeling Ideas to Address Computing ProblemsconceptFailure Modes and Steps ForwardFigures 12.13–12.15; reparameterization, constraints, stronger priors
Convergence remediesWhat to Do About Convergence ProblemsconceptFailure Modes and Steps ForwardThe ordered diagnostic ladder
Approximation ladderApproximate Algorithms and Approximate ModelsconceptFit Fast, Fail FastFigure 13.1; approximating the algorithm vs. the model
Modal approximationsApproximations Based on Joint and Conditional Posterior ModesconceptApproximate Algorithms and Approximate ModelsLaplace; the joint mode’s pole at
VI and PathfinderVariational Inference and PathfinderdefinitionApproximate Algorithms and Approximate ModelsEq. 13.1–13.2; L-BFGS path, KL-best normal, importance resampling
Amortized inferenceSimulation-Based and Amortized InferenceconceptApproximate Algorithms and Approximate ModelsTrain once, infer many times
Divide and conquerDivide-and-Conquer AlgorithmsconceptApproximate Algorithms and Approximate ModelsPartition data, combine posteriors
Simpler models for computationFitting Simpler Models for Computational PurposesconceptApproximate Algorithms and Approximate ModelsSimplify to diagnose, then restore
Software practiceStatistical Modeling as Software Developmentconcept—Version control, modularity, testing, reproducibility

Notes

Sources

  • Gelman Vehtari McElreath 2026 - Bayesian Workflow (book) — Chapters 11–13, 15, pp. 193–260

See Also