Complexity-based induction systems: Comparisons and convergence theorems
From MaRDI portal
Cited in
(91)- On calibration error of randomized forecasting algorithms
- On universal transfer learning
- Universal forecasting algorithms
- Inductive reasoning and Kolmogorov complexity
- The representation and manipulation of the algorithmic probability measure for problem solving.
- The discovery of algorithmic probability
- The generalized universal law of generalization.
- Applying MDL to learn best model granularity
- Open problems in universal induction \& intelligence
- Obituary: Ray Solomonoff, founding father of algorithmic information theory
- On the computability of Solomonoff induction and AIXI
- Autonomous theory building systems
- Putnam's diagonal argument and the impossibility of a universal learning machine
- A theory of incremental compression
- Thinking with notations: epistemic actions and epistemic activities in mathematical practice
- Predictions and algorithmic statistics for infinite sequences
- Absolutely no free lunches!
- On Martin-Löf (non-)convergence of Solomonoff's universal mixture
- On semimeasures predicting Martin-Löf random sequences
- On universal prediction and Bayesian confirmation
- `Ideal learning' of natural language: positive results about learning from positive evidence
- Predicting non-stationary processes
- Uniform test of algorithmic randomness over a general space
- Sequential predictions based on algorithmic complexity
- Tractability of batch to sequential conversion
- An almost machine-independent theory of program-length complexity, sophistication, and induction
- Things Bayes can't do
- Solomonoff induction violates Nicod's criterion
- On the computability of Solomonoff induction and knowledge-seeking
- A note on Blum static complexity measures
- THE FASTEST AND SHORTEST ALGORITHM FOR ALL WELL-DEFINED PROBLEMS
- HIERARCHIES OF GENERALIZED KOLMOGOROV COMPLEXITIES AND NONENUMERABLE UNIVERSAL MEASURES COMPUTABLE IN THE LIMIT
- Simultaneous predictive Gaussian classifiers
- On Universal Transfer Learning
- Some Sufficient Conditions on an Arbitrary Class of Stochastic Processes for the Existence of a Predictor
- Macrodynamic cooperative complexity of information dynamics
- Universal knowledge-seeking agents
- A philosophical treatise of universal induction
- A test for randomness based on a complexity measure
- On Martin-Löf Convergence of Solomonoff’s Mixture
- Philosophical issues in Kolmogorov complexity
- On asymptotic and finite-time optimality of Bayesian predictors
- Shannon entropy: a rigorous notion at the crossroads between probability, information theory, dynamical systems and statistical physics
- Explanatory and creative alternatives to the MDL principle
- Probability theory for the Brier game
- New error bounds for Solomonoff prediction
- Martingales in the Study of Randomness
- A classical way forward for the regularity and normalization problems
- Simplicity bias, algorithmic probability, and the random logistic map
- Prediction and MDL for infinite sequences
- Solomonoff prediction and Occam's razor
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Reply to the discussion of: ``Statistical exploration of the manifold hypothesis
- Algorithmic randomness and the weak merging of computable probability measures
- On generalized computable universal priors and their convergence
- Algorithmic complexity bounds on future prediction errors
- Merging of opinions in game-theoretic probability
- Nonstochastic bandits: Countable decision set, unbounded costs and reactive environments
- Consistency of discrete Bayesian learning
- Leading strategies in competitive on-line prediction
- The probability of ``undefined (non-converging) output in generating the universal probability distribution
This page was built for publication: Complexity-based induction systems: Comparisons and convergence theorems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4160129)