Solomonoff Induction is a theoretical framework for inductive inference that combines algorithmic probability with Bayesian reasoning to predict future data. It assigns higher probability to sequences generated by shorter computer programs, reflecting a preference for simpler explanations. Formulated using universal Turing machines, it defines an optimal predictor over all computable hypotheses, though it is not computable in practice. It underpins concepts in machine learning, compression, and formal approaches to intelligence.

Posts

Interpretability and Implicit Model Semantics in Biomedicine and Deep Learning

We introduce a framework to analyse interpretability in deep learning, by drawing on a formal notion of model semantics from the philosophy of science. We argue that interpretability is only one aspect of a model’s semantics and illustrate our framework with examples from biomedicine.