Large Language Bayes Is Not Reparameterisation-Invariant
Not on the map. Why?
Abstract (arXiv)
Large Language Bayes (LLB) answers an informal modelling question by sampling candidate probabilistic programs from a language model, running approximate inference on each, and averaging them with weights proportional to an exponentiated evidence bound. We show that this weighting depends on how a model is written. The log marginal likelihood is invariant to reparameterisation; the evidence bound is not. On eight schools the centered and non-centered programs are the same measure to 5.7×10-14, yet their weights differ by 6.1×; importance weighting reduces this only to 2.2×, and reproducing the inference LLB actually runs, a full-covariance Gaussian matched to the posterior moments, still leaves 1.9× on eight schools and 8.9× in 64 dimensions. Across likelihood families, dimensions and funnel severities the discrepancy reaches 31.9× and reverses sign, so no single writing is uniformly preferable. It inverts Bayes factors against eight natural competitors, and the induced error in the model posterior, and in any downstream target, is controlled by the spread Delta of the bound shortfalls through a known sharp Hilbert-distance bound. Across 360 programs from six language models the parameterisation written ranges from 0% to 100% centered and is stable within a model. Detecting equivalent programs statistically can falsely merge genuinely different models at practical sample budgets; verifying reparameterisations we generate ourselves cannot, and closes the window.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 19 of its 30 references that are in the map. First posted on arXiv 24 Sep 2026.
Builds on
19 of 30 references.
References · 19
- 2016Variational Inference: A Review for Statisticianscited by 1,472
- 2019The frontier of simulation-based inferencecited by 502
- 2015Importance Weighted Autoencoderscited by 456
- 2017Advances in Variational Inferencecited by 236
- 2019Composable Effects for Flexible and Accelerated Probabilistic Programming in NumPyrocited by 191
- 2016Automatic Differentiation Variational Inferencecited by 159
- 2018Inference Suboptimality in Variational Autoencoderscited by 132
- 2015Practical Bayesian model evaluation using leave-one-out cross-validation and WAICcited by 110
- 2018Tighter Variational Bounds are Not Necessarily Bettercited by 76
- 2022Bayesian Model Selection, the Marginal Likelihood, and Generalizationcited by 57
- 2018Importance Weighting and Variational Inferencecited by 55
- 2013Hamiltonian Monte Carlo for Hierarchical Modelscited by 52
7 more
- 2020Bayesian Workflowcited by 49
- 2015Pareto Smoothed Importance Samplingcited by 42
- 2024Automated Statistical Model Discovery with Language Modelscited by 41
- 2019Automatic Reparameterisation of Probabilistic Programscited by 18
- 2026A Probabilistic Framework for LLM-Based Model Discoverycited by 12
- 2025Large Language Bayescited by 10
- 2026Calibration, Not Compilation: Detecting and Repairing Misspecified Probabilistic Programs Written by Language Modelscited by 1
Built on by
Not cited yet.