Occam's Razor is Only as Sharp as Your ELBO

Introduction to the show: ident: AI Radio. Generated commentary on the latest Artificial Intelligence papers.

Tom: Today's paper: "Occam's Razor is Only as Sharp as Your ELBO".

Jane: The marginal likelihood, also known as the evidence, is regarded as a mathematical embodiment of Occam’s razor, enabling model selection that avoids overfitting.

Tom: First, who's behind it and why it matters.

Paper summary: Tom: We're diving deeper into this paper now, "Occam's Razor is Only as Sharp as Your ELBO". The main idea here is that the marginal likelihood, which we use for model selection because it embodies Occam’s razor, isn't always a reliable guide when we use simplified approximations.

Jane: They show that the evidence lower bound objective from variational inference, the ELBO, can produce overfitting if you make assumptions about your covariance matrix structure that don't match reality. It basically argues that this happens because of how these low-rank approximations simplify the objective function in a way that it stops penalizing complexity properly.

Lu: The paper specifically looks at Bayesian linear regression and conditions on the parameter vector w with a zero-mean Gaussian prior defined by p <ref:2604.25984#pg2>. They then explore how this works when we restrict the approximate posterior to be rank-one which is often necessary for making models computationally tractable in very large neural networks <ref:2604.25984#pg3>.

Meng: So the concern is that these tractability assumptions, like assuming a low-rank structure for the covariance matrix in our approximate posterior q(w), can lead us to select a model that fits the training data too well.

Lalam: The paper concludes by stating that while Bayesian practitioners aiming for large models should be cautious about how these reduced-rank assumptions impact model selection, because we see that the ELBO doesn't always give us the right answer in those scenarios <ref:2604.25984#pg1>.

Tom: It's a subtle point, Jane. It’s not just that the ELBO is wrong; it’s that it behaves differently depending on which approximation we force it to use, and that behavior can be misleading for choosing the right model architecture.

Jane: Exactly. They prove that assuming a diagonal or low-rank plus diagonal covariance matrix underestimates the signal-to-noise ratio in Bayesian linear regression, which translates to underfitting when you rely on it <ref:2604.25984#pg3>.

Lu: But then they show the opposite effect: assuming a low-rank covariance matrix actually overestimates the SNR, leading to overfitting because that simplified structure allows the model to bypass the Occam’s razor penalty entirely <ref:2604.25984#pg3>.

Meng: So if we are building scalable models, and we need these approximations for computation, we have to be aware that those specific assumptions could push us toward overfitting instead of generalization <ref:2604.25984#pg1>.

Lalam: It’s a warning about the trade-off between computational feasibility and statistical accuracy when using ELBO for model selection <ref:2604.25984#pg1>.

Tom: So, to wrap up this part, the key takeaway is that the ELBO doesn't always align with Occam's razor when we make simplifying assumptions about our posterior structure.

Conclusion: Jane: Looking at the whole discussion around "Occam's Razor is Only as Sharp as Your ELBO", it really boils down to how much we trust the mathematical tool we use to pick our models. The authors are pointing out that the evidence lower bound, or ELBO, isn't a perfect embodiment of Occam's razor in practice when dealing with constrained models.

Tom: Yeah, and they bring up something interesting about who is actually choosing the winner in these scenarios. They found that while Bayesian model selection using the exact marginal likelihood sometimes prefers the overfit option, the ELBO doesn't show that preference <ref:2604.25984#pg1>.

Lu: The implication for us is pretty direct: if you are scaling up to very large models and need approximations like low-rank structures just to make them run, you need better methods than standard ELBO hyperparameter learning.

Meng: It suggests that we might need modified ELBO objectives that are specifically tailored to the approximate posterior we're using, instead of relying on a one-size-fits-all approach.

Lalam: They suggest looking at tighter bounds, like the importance weighted evidence lower bound or IWELBO, which they say could prevent underfitting in some cases with diagonal covariance, but even that doesn't solve the problem when uncertainty is limited to a single direction <ref:2604.25984#pg3>.

Tom: So for anyone listening who wants to understand what this means practically, it’s about being aware of the structure you impose on your uncertainty model. The choice of that structure dictates whether your hyperparameter learning process leads to a better model or a worse one.

Jane: It's about recognizing that when we simplify things for the sake of making models scalable, we have to be extra careful because those simplifications can trick our selection process into favoring complexity.

Lu: The final message seems to be that we need more marginal likelihood-based objectives that aren't biased by the assumptions we need to make just to get the math to work for modern, large models <ref:2604.25984#pg1>.

Meng: So it’s not about ditching these approximations entirely, but about finding ways to fix the learning process so that those necessary structural assumptions don't end up hurting our final model selection quality.

Lalam: It really comes back to this: the ELBO doesn't always give us Occam’s razor, and we should probably be looking at better objectives that aren't biased by those structural choices <ref:2604.25984#pg1>.