Transductive confidence machine is universal

DOI10.1007/B14273MaRDI QIDQ5897394zbMATH OpenOpenAlexFDO

Authors Ilia Nouretdinov, Vladimir V. V'yugin, Alexander Gammerman

Publication date 23 February 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b14273

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• scientific article; zbMATH DE number 1966627
• Well-calibrated predictions from on-line compression models
• Well-calibrated predictions from online compression models
• scientific article; zbMATH DE number 1931850
• Universal probability-free prediction

Cited in

(11)

• Universal probability-free prediction
• Prediction algorithms and confidence measures based on algorithmic randomness theory.
• scientific article; zbMATH DE number 1966627 (Why is no real title available?)
• scientific article; zbMATH DE number 2080460 (Why is no real title available?)
• scientific article; zbMATH DE number 1931847 (Why is no real title available?)
• scientific article; zbMATH DE number 1931850 (Why is no real title available?)
• scientific article; zbMATH DE number 1881954 (Why is no real title available?)
• Non-Algorithmic Theory of Randomness
• Prediction with Confidence
• Well-calibrated predictions from online compression models
• Well-calibrated predictions from on-line compression models

This page was built for publication: Transductive confidence machine is universal

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