Consistency of discrete Bayesian learning
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1191514 (Why is no real title available?)
- scientific article; zbMATH DE number 1010621 (Why is no real title available?)
- Adaptive online prediction by following the perturbed leader
- An Information Measure for Classification
- Asymptotics of Discrete MDL for Online Prediction
- Complexity-based induction systems: Comparisons and convergence theorems
- Fisher information and stochastic complexity
- Information-theoretic asymptotics of Bayes methods
- Learning Theory
- Merging of Opinions with Increasing Information
- Minimum Message Length and Kolmogorov Complexity
- Minimum complexity density estimation
- Potential-based algorithms in on-line prediction and game theory
- Prediction, Learning, and Games
- Selective sampling using the query by committee algorithm
- The minimum description length principle in coding and modeling
- The weighted majority algorithm
Cited in
(5)
This page was built for publication: Consistency of discrete Bayesian learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q950201)