Consistency of discrete Bayesian learning

DOI10.1016/j.tcs.2008.06.038zbMath1158.68038OpenAlexW2024736577MaRDI QIDQ950201

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

zbMATH Keywords

consistencyBayesian learningalmost sure convergencemarginalizationMAP predictionentropy potentialstochastic model selection

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Bayesian problems; characterization of Bayes procedures (62C10) Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The weighted majority algorithm
• Selective sampling using the query by committee algorithm
• Potential-based algorithms in on-line prediction and game theory
• Information-theoretic asymptotics of Bayes methods
• Asymptotics of Discrete MDL for Online Prediction
• Merging of Opinions with Increasing Information
• Minimum complexity density estimation
• Complexity-based induction systems: Comparisons and convergence theorems
• Learning Theory
• The minimum description length principle in coding and modeling
• Fisher information and stochastic complexity
• Minimum Message Length and Kolmogorov Complexity
• Prediction, Learning, and Games
• An Information Measure for Classification

This page was built for publication: Consistency of discrete Bayesian learning