Consistency of discrete Bayesian learning
DOI10.1016/J.TCS.2008.06.038zbMATH Open1158.68038OpenAlexW2024736577MaRDI QIDQ950201FDOQ950201
Authors: Jan Poland
Publication date: 22 October 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.06.038
Recommendations
consistencyalmost sure convergenceBayesian learningMAP predictionmarginalizationentropy potentialstochastic model selection
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Bayesian problems; characterization of Bayes procedures (62C10)
Cites Work
- Prediction, Learning, and Games
- Title not available (Why is that?)
- Minimum complexity density estimation
- Merging of Opinions with Increasing Information
- The weighted majority algorithm
- Information-theoretic asymptotics of Bayes methods
- An Information Measure for Classification
- Title not available (Why is that?)
- The minimum description length principle in coding and modeling
- Fisher information and stochastic complexity
- Asymptotics of Discrete MDL for Online Prediction
- Selective sampling using the query by committee algorithm
- Complexity-based induction systems: Comparisons and convergence theorems
- Adaptive online prediction by following the perturbed leader
- Minimum Message Length and Kolmogorov Complexity
- Potential-based algorithms in on-line prediction and game theory
- Learning Theory
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)