Learning about the parameter of the Bernoulli model

DOI10.1006/jcss.1997.1502zbMath0880.68064OpenAlexW2166164328MaRDI QIDQ1370861

Vladimir Vovk

Publication date: 28 October 1997

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/84bf79fe5bab4cf3c60a96c45c3de9520f3b1f27

zbMATH Keywords

Kolmogorov complexityBernoulli model

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items

Non-Algorithmic Theory of Randomness

Cites Work

• A universal prior for integers and estimation by minimum description length
• Stochastic complexity and modeling
• A learning criterion for stochastic rules
• Universal coding, information, prediction, and estimation
• Unnamed Item
• Unnamed Item
• Unnamed Item