A theory of incremental compression

DOI10.1016/j.ins.2020.08.035zbMath1475.68122arXiv1908.03781OpenAlexW2967644042MaRDI QIDQ2056272

Arthur Franz, Roman Soletskyi, Oleksandr Antonenko

Publication date: 2 December 2021

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1908.03781

zbMATH Keywords

featureautoencoderKolmogorov complexitycompressionMartin-Löf randomnessOccam's razor

Mathematics Subject Classification ID

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

Related Items (1)

A new algorithm for compression of partially commutative alphabets

Uses Software

• darch
• PRMLT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal ordered problem solver
• Modeling by shortest data description
• Estimating the dimension of a model
• Universal artificial intelligence. Sequential decisions based on algorithmic probability.
• THE FASTEST AND SHORTEST ALGORITHM FOR ALL WELL-DEFINED PROBLEMS
• Reducing the Dimensionality of Data with Neural Networks
• A new look at the Bayes procedure
• Complexity-based induction systems: Comparisons and convergence theorems
• Kolmogorov Complexity and Algorithmic Randomness
• Compression of Data Streams Down to Their Information Content
• A Fast Learning Algorithm for Deep Belief Nets
• A formal theory of inductive inference. Part I
• A formal theory of inductive inference. Part II
• Perception as Bayesian Inference
• An introduction to Kolmogorov complexity and its applications

This page was built for publication: A theory of incremental compression