On the stochastic complexity of learning realizable and unrealizable rules

zbMath0830.68109MaRDI QIDQ1900982

Neri Merhav, Ronny Meir

Publication date: 29 November 1995

Published in: Machine Learning (Search for Journal in Brave)

zbMATH Keywords

stochastic complexitymodel selection methods

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items

Suboptimal behavior of Bayes and MDL in classification under misspecification ⋮ Bayesian model learning based on predictive entropy ⋮ Mutual information, metric entropy and cumulative relative entropy risk ⋮ Bayesian predictiveness, exchangeability and sufficientness in bacterial taxonomy