On the stochastic complexity of learning realizable and unrealizable rules

zbMATH Open0830.68109MaRDI QIDQ1900982FDOQ1900982

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)

Cited In (6)

• An axiomatization of learning rules when counterfactuals are not observed
• Bayesian model learning based on predictive entropy
• Mutual information, metric entropy and cumulative relative entropy risk
• Suboptimal behavior of Bayes and MDL in classification under misspecification
• A learning criterion for stochastic rules
• Bayesian predictiveness, exchangeability and sufficientness in bacterial taxonomy

   Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• A decision-theoretic extension of stochastic complexity and its applications to learning 👍 👎
• Stochastic complexity and the mdl principle 👍 👎
• Stochastic complexity in learning 👍 👎

This page was built for publication: On the stochastic complexity of learning realizable and unrealizable rules

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1900982)