Bayesian Wind Tunnels for Model Selection
Mirrored from arXiv — Machine Learning for archival readability. Support the source by reading on the original site.
Computer Science > Machine Learning
Title:Bayesian Wind Tunnels for Model Selection
Abstract:Prior work has shown that transformers can perform exact Bayesian filtering within a fixed
hypothesis class. Can they also perform Bayesian model selection -- identifying the correct
hypothesis class from data? We introduce model-selection Bayesian wind tunnels: controlled
environments where ground-truth posteriors over hypothesis classes are available in closed
form. Using fixed-point-free involutions -- whose defining property f(f(x))=x is purely
relational -- a 2.8M-parameter transformer achieves 0.01-bit entropy agreement with the
Bayesian optimum (3 seeds), with both integer tokens and opaque symbols whose meanings
change every episode. This extends to non-nested comparisons: involutions vs. 3-cycles
(where neither class is a subset of the other) achieve class-posterior MAE under 0.001,
demonstrating genuine model selection beyond simplicity/subset bias. We then identify a
sharp perceptual access condition: when the discriminative statistic requires arithmetic --
modular addition (rotations) or multiplication (f(x)=cx mod p) -- model selection succeeds
with integer tokens but fails completely with opaque symbols, and this boundary persists
under 112x scaling (2.8M to 316M parameters). A stationarity control confirms the operative
factor: opaque tokens with a fixed relabeling succeed (0.009-bit MAE), showing that stable
semantics, not integer identity, enable circuit compilation. Header subtask diagnostics
localize the failure to the composition of header inversion with arithmetic rather than
header parsing itself. Probing frontier LLMs on the same tasks shows qualitative Bayesian
behavior but a large calibration gap (~55x), measured through lossy probes and therefore
directional rather than exact.
| Comments: | 27 pages |
| Subjects: | Machine Learning (cs.LG); Machine Learning (stat.ML) |
| ACM classes: | I.2.6; G.3 |
| Cite as: | arXiv:2607.19379 [cs.LG] |
| (or arXiv:2607.19379v1 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2607.19379
arXiv-issued DOI via DataCite (pending registration)
|
Access Paper:
- View PDF
- HTML (experimental)
- TeX Source
Current browse context:
References & Citations
Bibliographic and Citation Tools
Code, Data and Media Associated with this Article
Demos
Recommenders and Search Tools
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
More from arXiv — Machine Learning
-
Bankruptcy Prediction via Hybrid Resampling and Stacking Ensemble Techniques with Explainable Artificial Intelligence (XAI)-Driven Analysis
Aug 24
-
Machine Learning and ARIMA Model Averaging for Adaptive Public Health Forecasting: Comparative Evaluation and an Ontario COVID-19 Case Study
Aug 24
-
From Thermal Preference Prediction to Adaptive Thermal Intervention: A Reinforcement Learning Approach Using Physiological and Environmental Sensing
Aug 24
-
BF1: A Causal Dyadic Sparse-Attention Retrofit for Efficient Long-Context Transformers
Aug 24
Discussion (0)
Sign in to join the discussion. Free account, 30 seconds — email code or GitHub.
Sign in →No comments yet. Sign in and be the first to say something.