English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Information, learning and falsification

Balduzzi, D. (2011). Information, learning and falsification. In NIPS 2011 Philosophy and Machine Learning Workshop (pp. 1-4).

Item is

Files

show Files

Locators

show
hide
Description:
-

Creators

show
hide
 Creators:
Balduzzi, D1, Author              
Affiliations:
1Max Planck Institute for Intelligent Systems, Max Planck Society, Heisenbergstr. 3 70569 Stuttgart , DE, ou_1497638              

Content

show
hide
Free keywords: -
 Abstract: There are (at least) three approaches to quantifying information. The first, algorithmic information or Kolmogorov complexity, takes events as strings and, given a universal Turing machine, quantifies the information content of a string as the length of the shortest program producing it [1]. The second, Shannon information, takes events as belonging to ensembles and quantifies the information resulting from observing the given event in terms of the number of alternate events that have been ruled out [2]. The third, statistical learning theory, has introduced measures of capacity that control (in part) the expected risk of classifiers [3]. These capacities quantify the expectations regarding future data that learning algorithms embed into classifiers. Solomonoff and Hutter have applied algorithmic information to prove remarkable results on universal induction. Shannon information provides the mathematical foundation for communication and coding theory. However, both approaches have shortcomings. Algorithmic information is not computable, severely limiting its practical usefulness. Shannon information refers to ensembles rather than actual events: it makes no sense to compute the Shannon information of a single string – or rather, there are many answers to this question depending on how a related ensemble is constructed. Although there are asymptotic results linking algorithmic and Shannon information, it is unsatisfying that there is such a large gap – a difference in kind – between the two measures. This note describes a new method of quantifying information, effective information, that links algorithmic information to Shannon information, and also links both to capacities arising in statistical learning theory [4, 5]. After introducing the measure, we show that it provides a non-universal analog of Kolmogorov complexity. We then apply it to derive basic capacities in statistical learning theory: empirical VC-entropy and empirical Rademacher complexity. A nice byproduct of our approach is an interpretation of the explanatory power of a learning algorithm in terms of the number of hypotheses it falsifies [6], counted in two different ways for the two capacities. We also discuss how effective information relates to information gain, Shannon and mutual information.

Details

show
hide
Language(s):
 Dates: 2011-12
 Publication Status: Published in print
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: Balduzzi2011_5
 Degree: -

Event

show
hide
Title: NIPS 2011 Philosophy and Machine Learning Workshop
Place of Event: Sierra Nevada, Spain
Start-/End Date: -

Legal Case

show

Project information

show

Source 1

show
hide
Title: NIPS 2011 Philosophy and Machine Learning Workshop
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 1 - 4 Identifier: -