Large Language Bayes Is Not Reparameterisation-Invariant
Abstract
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 , yet their weights differ by ; importance weighting reduces this only to , and reproducing the inference LLB actually runs, a full-covariance Gaussian matched to the posterior moments, still leaves on eight schools and in dimensions. Across likelihood families, dimensions and funnel severities the discrepancy reaches and reverses sign, so no single writing is uniformly preferable. It inverts Bayes factors against eight natural competitors, and we bound the model-posterior error it induces, and that of any downstream target, by , tightly. Across programs from six language models the parameterisation written ranges from to 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.
est. 32% chance this paper gets accepted at ICLR 2027.
What do you think this paper will get?
All positions stay anonymous.