English
Related papers

Related papers: Solomonoff induction

200 papers

We introduce the principle of Occam's Razor in a form which can be used as a basis for economical formulations of physics. This allows us to explain the general structure of the Lagrangian for a composite physical system, as well as some…

Mathematical Physics · Physics 2016-09-07 Andrei N. Soklakov

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

Ray Solomonoff invented the notion of universal induction featuring an aptly termed "universal" prior probability function over all possible computable environments. The essential property of this prior was its ability to dominate all other…

Information Theory · Computer Science 2011-11-17 Ian Wood , Peter Sunehag , Marcus Hutter

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

An a priori semimeasure (also known as "algorithmic probability" or "the Solomonoff prior" in the context of inductive inference) is defined as the transformation, by a given universal monotone Turing machine, of the uniform measure on the…

Statistics Theory · Mathematics 2016-06-29 Tom F. Sterkenburg

Compression and generalization are fundamentally related through Solomonoff induction and the minimum description length principle (MDL), which predict that simpler models generalize better when data arises from low-complexity…

Machine Learning · Computer Science 2026-05-14 Lukas Silvester Barth , Paulo von Petersenn

We propose and analyze a regularization approach for structured prediction problems. We characterize a large class of loss functions that allows to naturally embed structured outputs in a linear space. We exploit this fact to design…

Machine Learning · Computer Science 2017-07-31 Carlo Ciliberto , Alessandro Rudi , Lorenzo Rosasco

This paper is dedicated to a cautious learning methodology for predicting preferences between alternatives characterized by binary attributes (formally, each alternative is seen as a subset of attributes). By "cautious", we mean that the…

Artificial Intelligence · Computer Science 2022-06-16 Hugo Gilbert , Mohamed Ouaguenouni , Meltem Ozturk , Olivier Spanjaard

Non-deductive reasoning, encompassing inductive and abductive reasoning, is essential in addressing complex real-world questions. One key feature of inductive and abductive reasoning is that there are many valid hypotheses; the simplest…

Artificial Intelligence · Computer Science 2026-03-27 Yunxin Sun , Abulhair Saparov

Sequential decision theory formally solves the problem of rational agents in uncertain worlds if the true environmental prior probability distribution is known. Solomonoff's theory of universal induction formally solves the problem of…

Artificial Intelligence · Computer Science 2007-05-23 Marcus Hutter

Nicod's criterion states that observing a black raven is evidence for the hypothesis H that all ravens are black. We show that Solomonoff induction does not satisfy Nicod's criterion: there are time steps in which observing black ravens…

Machine Learning · Computer Science 2015-10-20 Jan Leike , Marcus Hutter

An earlier introduced characterization of nonuniform learnability that allows the sample size to depend on the hypothesis to which the learner is compared has been redefined using the measure theoretic approach. Where nonuniform…

Machine Learning · Computer Science 2020-11-03 Ankit Bandyopadhyay

We give a brief introduction to the AIXI model, which unifies and overcomes the limitations of sequential decision theory and universal Solomonoff induction. While the former theory is suited for active agents in known environments, the…

Artificial Intelligence · Computer Science 2007-05-23 Marcus Hutter

We study the properties of the Minimum Description Length principle for sequence prediction, considering a two-part MDL estimator which is chosen from a countable class of models. This applies in particular to the important case of…

Machine Learning · Computer Science 2011-11-09 Jan Poland , Marcus Hutter

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

Conformal predictors provide set or functional predictions that are valid under the assumption of randomness, i.e., under the assumption of independent and identically distributed data. The question asked in this paper is whether there are…

Machine Learning · Computer Science 2025-06-10 Vladimir Vovk

With recent advances in natural language processing, rationalization becomes an essential self-explaining diagram to disentangle the black box by selecting a subset of input texts to account for the major variation in prediction. Yet,…

Machine Learning · Computer Science 2023-09-12 Wenbo Zhang , Tong Wu , Yunlong Wang , Yong Cai , Hengrui Cai

Various optimality properties of universal sequence predictors based on Bayes-mixtures in general, and Solomonoff's prediction scheme in particular, will be studied. The probability of observing $x_t$ at time $t$, given past observations…

Machine Learning · Computer Science 2007-05-23 Marcus Hutter

Prompted by misconceptions in the recent literature, we review the justifications for naturalness arguments and Occam's razor found in Bayesian statistics. We discuss the automatic Occam's razor that emerges in Bayesian formalism, bringing…

History and Philosophy of Physics · Physics 2026-04-22 Andrew Fowlie

We study sequential prediction of real-valued, arbitrary and unknown sequences under the squared error loss as well as the best parametric predictor out of a large, continuous class of predictors. Inspired by recent results from…

Machine Learning · Computer Science 2014-01-24 N. Denizcan Vanli , Suleyman S. Kozat