A Simplicity Bubble Problem in Formal-Theoretic Learning Systems

doi:10.1145/321892.321894

G. Chaitin, A Theory of Program Size Formally Identical to Information Theory, Journal of the ACM 22 (3) (1975) 329–340 · 1975

Earlier work this paper cites.

C. H. Bennett, Logical Depth and Physical Complexity, in: A Half-Century Survey on The Universal Turing Machine, Oxford University Press, Inc., USA, 1988, pp. 227–257

1988

Earlier work this paper cites.

T. M. Mitchell, Machine Learning, McGraw-Hill series in computer science, McGraw-Hill, New York, 1997

1997

Earlier work this paper cites.

doi:10.1109/4235.585893

D. Wolpert, W. Macready, No free lunch theorems for optimization, IEEE Transactions on Evolutionary Computation 1 (1) (1997) 67–82 · 1997

Earlier work this paper cites.

C. S. Calude, Information and Randomness: An algorithmic perspective, 2nd Edition, Springer-Verlag, 2002

2002

Earlier work this paper cites.

G. Chaitin, Algorithmic Information Theory, 3rd Edition, Cambridge University Press, 2004

2004

Earlier work this paper cites.

arXiv:ISBN0-471-06259-6

T. M. Cover, J. A. Thomas, Elements of Information Theory, John Wiley & Sons, Inc., Hoboken, NJ, USA, 2005 · 2005

Earlier work this paper cites.

C. M. Bishop, Pattern recognition and machine learning, Information science and statistics, Springer, New York, 2006

2006

Earlier work this paper cites.

arXiv:http://doi.org/10.1007/978-0-387-68441-3

R. G. Downey, D. R. Hirschfeldt, Algorithmic Randomness and Complexity , Theory and Applications of Computability, Springer New York, New York, NY, 2010 · 2010

Earlier work this paper cites.

K. P. Murphy, Machine learning: a probabilistic perspective, 2012

2012

Earlier work this paper cites.

doi:10.1142/9789814374309_0015

G. Chaitin, Life as Evolving Software , in: H. Zenil (Ed.), A Computable Universe, World Scientific Publishing, Singapure, 2012, pp. 277–302 · 2012

Cited alongside, same era.

doi:10.5829/idosi.wasj.2013.24.itmies.80032

M. Shcherbakov, A. Brebels, N. Shcherbakova, A. Tyukov, T. Janovsky, V. Kamaev, A survey of forecast error measures, World Applied Sciences Journal 24 (2013) 171–176 · 2013

Cited alongside, same era.

M. A. Nielsen, Neural networks and deep learning , Determination press, 2015. URL http://neuralnetworksanddeeplearning.com

2015

Cited alongside, same era.

I. Goodfellow, Y. Bengio, A. Courville, Deep Learning, MIT Press, 2016, http://www.deeplearningbook.org

2016

Cited alongside, same era.

doi:10.1142/9789813109032_0001

F. S. Abrahão, The “paradox” of computability and a recursive relative version of the Busy Beaver function, in: C. Calude, M. Burgin (Eds.), Information and Complexity, 1st Edition, World Scientific Publishing, Singapure, 2016, Ch. 1, pp. 3–15 · 2016

Cited alongside, same era.

doi:10.1007/978-3-030-11298-1

M. Li, P. Vitányi, An Introduction to Kolmogorov Complexity and Its Applications, 4th Edition, Texts in Computer Science, Springer, Cham, 2019 · 2019

Later among the works it cites.

doi:10.1016/j.tcs.2019.03.008

F. S. Abrahão, K. Wehmuth, A. Ziviani, Algorithmic networks: Central time to trigger expected emergent open-endedness, Theoretical Computer Science 785 (2019) 83–116 · 2019

Later among the works it cites.

doi:10.1007/s42452-020-2862-5

G. Smith, The paradox of big data , SN Applied Sciences 2 (6) (2020) 1041 · 2020

Later among the works it cites.

doi:10.3389/frai.2020.567356

S. Hernández-Orozco, H. Zenil, J. Riedel, A. Uccello, N. A. Kiani, J. Tegnér, Algorithmic Probability-Guided Machine Learning on Non-Differentiable Spaces , Frontiers in Artificial Intelligence 3 (2021) 567356 · 2020

Later among the works it cites.

B. Mirzasoleiman, J. A. Bilmes, J. Leskovec, Coresets for data-efficient training of machine learning models , in: Proceedings of the 37th International Conference on Machine Learning, ICML 2020, 13-18 July 2020, Virtual Event, Vol. 119 of Proceedings of Machine Learning Research, PMLR, 2020, pp. 6950–6960. URL http://proceedings.mlr.press/v119/mirzasoleiman20a.html