English
Related papers

Related papers: Occam's Razor is Only as Sharp as Your ELBO

200 papers

How do we compare between hypotheses that are entirely consistent with observations? The marginal likelihood (aka Bayesian evidence), which represents the probability of generating our observations from a prior, provides a distinctive…

Machine Learning · Computer Science 2023-05-03 Sanae Lotfi , Pavel Izmailov , Gregory Benton , Micah Goldblum , Andrew Gordon Wilson

When training large models on limited data, avoiding overfitting is paramount. Common grid search or smarter search methods rely on expensive separate runs for each candidate hyperparameter, while carving out a validation set that reduces…

Machine Learning · Computer Science 2026-04-02 Ethan Harvey , Mikhail Petrov , Michael C. Hughes

Recent work in unsupervised representation learning has focused on learning deep directed latent-variable models. Fitting these models by maximizing the marginal likelihood or evidence is typically intractable, thus a common approximation…

Machine Learning · Computer Science 2018-02-15 Alexander A. Alemi , Ben Poole , Ian Fischer , Joshua V. Dillon , Rif A. Saurous , Kevin Murphy

The Evidence Lower Bound (ELBO) is a quantity that plays a key role in variational inference. It can also be used as a criterion in model selection. However, though extremely popular in practice in the variational Bayes community, there has…

Statistics Theory · Mathematics 2019-04-09 Badr-Eddine Chérief-Abdellatif

All fields of science depend on mathematical models. Occam's razor refers to the principle that good models should exclude parameters beyond those minimally required to describe the systems they represent. This is because redundancy can…

Machine Learning · Computer Science 2023-09-08 Botond B Antal , Anthony G Chesebro , Helmut H Strey , Lilianne R Mujica-Parodi , Corey Weistuch

The Bayes factor is the gold-standard figure of merit for comparing fits of models to data, for hypothesis selection and parameter estimation. However it is little used because it is computationally very intensive. Here it is shown how…

Data Analysis, Statistics and Probability · Physics 2020-07-21 David J. Dunstan , Joel Crowne , Alan J. Drew

The task of parametric model selection is cast in terms of a statistical mechanics on the space of probability distributions. Using the techniques of low-temperature expansions, we arrive at a systematic series for the Bayesian posterior…

Condensed Matter · Physics 2008-02-03 Vijay Balasubramanian

This article considers Bayesian model selection via mean-field (MF) variational approximation. Towards this goal, we study the non-asymptotic properties of MF inference under the Bayesian framework that allows latent variables and model…

Methodology · Statistics 2023-12-29 Yangfan Zhang , Yun Yang

In this note we introduce linear regression with basis functions in order to apply Bayesian model selection. The goal is to incorporate Occam's razor as provided by Bayes analysis in order to automatically pick the model optimally able to…

Statistics Theory · Mathematics 2015-12-16 Miguel de Benito Delgado , Philipp Wacker

Neural network sparsification is a promising avenue to save computational time and memory costs, especially in an age where many successful AI models are becoming too large to na\"ively deploy on consumer hardware. While much work has…

Machine Learning · Computer Science 2024-11-06 Rayen Dhahri , Alexander Immer , Betrand Charpentier , Stephan Günnemann , Vincent Fortuin

This article studies the Fisher-Rao gradient, also referred to as the natural gradient, of the evidence lower bound (ELBO) which plays a central role in generative machine learning. It reveals that the gap between the evidence and its lower…

Machine Learning · Computer Science 2025-10-02 Nihat Ay , Jesse van Oostrum , Adwait Datar

The phenomenon of benign overfitting, where a predictor perfectly fits noisy training data while attaining near-optimal expected loss, has received much attention in recent years, but still remains not fully understood beyond well-specified…

Machine Learning · Computer Science 2023-04-18 Ohad Shamir

A number of popular transfer learning methods rely on grid search to select regularization hyperparameters that control over-fitting. This grid search requirement has several key disadvantages: the search is computationally expensive,…

Machine Learning · Computer Science 2025-01-28 Ethan Harvey , Mikhail Petrov , Michael C. Hughes

Theories can be represented as statistical models for empirical testing. There is a vast literature on model selection and multimodel inference that focuses on how to assess which statistical model, and therefore which theory, best fits the…

Applications · Statistics 2021-10-06 Carl Falk , Michael Muthukrishna

Statistical learning theory is often associated with the principle of Occam's razor, which recommends a simplicity preference in inductive inference. This paper distills the core argument for simplicity obtainable from statistical learning…

Machine Learning · Computer Science 2024-12-02 Tom F. Sterkenburg

Amortised inference enables scalable learning of sequential latent-variable models (LVMs) with the evidence lower bound (ELBO). In this setting, variational posteriors are often only partially conditioned. While the true posteriors depend,…

Machine Learning · Computer Science 2021-03-18 Justin Bayer , Maximilian Soelch , Atanas Mirchev , Baris Kayalibay , Patrick van der Smagt

The recent empirical success of unsupervised cross-domain mapping algorithms, between two domains that share common characteristics, is not well-supported by theoretical justifications. This lacuna is especially troubling, given the clear…

Machine Learning · Computer Science 2020-11-03 Tomer Galanti , Sagie Benaim , Lior Wolf

This paper presents new experimental evidence against the utility of Occam's razor. A~systematic procedure is presented for post-processing decision trees produced by C4.5. This procedure was derived by rejecting Occam's razor and instead…

Artificial Intelligence · Computer Science 2008-02-03 G. I. Webb

While there has been progress in developing non-vacuous generalization bounds for deep neural networks, these bounds tend to be uninformative about why deep learning works. In this paper, we develop a compression approach based on…

Machine Learning · Computer Science 2022-11-28 Sanae Lotfi , Marc Finzi , Sanyam Kapoor , Andres Potapczynski , Micah Goldblum , Andrew Gordon Wilson

When used as a surrogate objective for maximum likelihood estimation in latent variable models, the evidence lower bound (ELBO) produces state-of-the-art results. Inspired by this, we consider the extension of the ELBO to a family of lower…

‹ Prev 1 2 3 10 Next ›