Learning as Data Compression

DOI10.1007/978-3-540-73001-9_2MaRDI QIDQ5426861zbMATH OpenOpenAlexFDO

Authors Pieter Adriaans

Publication date 13 November 2007

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

Full work available at URL https://doi.org/10.1007/978-3-540-73001-9_2

zbMATH Keywords

DFA inductionlearning as compressionMDLrandomness deficiencytwo-part code optimization

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Computational learning theory (68Q32)

Recommendations

• Using MDL for Grammar Induction
• A theory of incremental compression
• Data compression and learning in time sequences analysis
• Toward an abstract theory of data compression
• Minimum description length induction, Bayesianism, and Kolmogorov complexity

Cited in

(6)

• A quasi-Monte Carlo data compression algorithm for machine learning
• Simple Algorithmic Principles of Discovery, Subjective Beauty, Selective Attention, Curiosity and Creativity
• Using MDL for Grammar Induction
• Teaching and Compressing for Low VC-Dimension
• Face representations via tensorfaces of various complexities
• Simplicity bias, algorithmic probability, and the random logistic map

This page was built for publication: Learning as Data Compression

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