HackerPapers

arXiv:1104.5466cs.LG

Notes on a New Philosophy of Empirical Science

Daniel Burfoot

Abstract

This book presents a methodology and philosophy of empirical science based on large scale lossless data compression. In this view a theory is scientific if it can be used to build a data compression program, and it is valuable if it can compress a standard benchmark database to a small size, taking into account the length of the compressor itself. This methodology therefore includes an Occam principle as well as a solution to the problem of demarcation. Because of the fundamental difficulty of lossless compression, this type of research must be empirical in nature: compression can only be achieved by discovering and characterizing empirical regularities in the data. Because of this, the philosophy provides a way to reformulate fields such as computer vision and computational linguistics as empirical sciences: the former by attempting to compress databases of natural images, the latter by attempting to compress large text databases. The book argues that the rigor and objectivity of the compression principle should set the stage for systematic progress in these fields. The argument is especially strong in the context of computer vision, which is plagued by chronic problems of evaluation. The book also considers the field of machine learning. Here the traditional approach requires that the models proposed to solve learning problems be extremely simple, in order to avoid overfitting. However, the world may contain intrinsically complex phenomena, which would require complex models to understand. The compression philosophy can justify complex models because of the large quantity of data being modeled (if the target database is 100 Gb, it is easy to justify a 10 Mb model). The complex models and abstractions learned on the basis of the raw data (images, language, etc) can then be reused to solve any specific learning problem, such as face recognition or machine translation.

arXiv comments
Draft Version
Journal reference
DOI
Subjects
cs.LGMachine Learning math.STStatistics Theory stat.MLMachine Learning (Statistics)

On Hacker News

Linked by 3 identifiable commenters in 5 comments across 5 threads, from Jul 2016 to Feb 2025. Found in 1 HN submission from Jul 2023 to Jul 2023. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments5 threads

    • This is an old idea dating back to the earliest algorithmic information theory work in the '50s/60s like Ray Solomonoff on universal induction: given a powerful learning algorithm, create AI by encoding all possible data as a binary stream (with no further preprocessing or…

      gwernView on HNParent context

    • I wrote a book about this 10 years ago: https://arxiv.org/abs/1104.5466 Annotation doesn't scale. You are not going to get to real intelligence by labelling billions of data points. I expect that computer vision for autonomous vehicles will become good enough for practical use…

      d_burfootView on HNParent context

  1. General and Surprising 1 comment
    • A couple of years ago I wrote a book about a new philosophy of science based on the following methodology: - Obtain a large dataset of observations related to a phenomenon of interest (eg English text, bioimaging data, economic reports, car-mounted camera recordings, etc)…

      d_burfootView on HNParent context

  2. Tom Wolfe takes on linguistics 1 comment
    • If you are a hacker who is interested in linguistics, you might want to check out the work we are doing at my startup Ozora Research (http://ozoraresearch.com). Our goal is to build high-quality, sophisticated NLP solutions for "cleantext" : text that has been professionally…

      d_burfootView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.