Falsifiable implies Learnable

The paper demonstrates that falsifiability is fundamental to learning. We prove the following theorem for statistical learning and sequential prediction: If a theory is falsifiable then it is learnable -- i.e. admits a strategy that predicts optimally. An analogous result is shown for universal induction.

[1]  Bernhard Schölkopf,et al.  Falsificationism and Statistical Learning Theory: Comparing the Popper and Vapnik-Chervonenkis Dimensions , 2009 .

[2]  Gary James Jason,et al.  The Logic of Scientific Discovery , 1988 .

[3]  Gábor Lugosi,et al.  Prediction, learning, and games , 2006 .

[4]  Ray J. Solomonoff,et al.  A Formal Theory of Inductive Inference. Part II , 1964, Inf. Control..

[5]  David Balduzzi,et al.  Information, learning and falsification , 2011, NIPS 2011.

[6]  Vladimir N. Vapnik,et al.  The Nature of Statistical Learning Theory , 2000, Statistics for Engineering and Information Science.

[7]  Peter Godfrey-Smith,et al.  Popper's Philosophy of Science: Looking Ahead , 2010 .

[8]  Karthik Sridharan,et al.  Statistical Learning and Sequential Prediction , 2014 .

[9]  Sanjeev R. Kulkarni,et al.  Reliable Reasoning: Induction and Statistical Learning Theory , 2007 .

[10]  Peter L. Bartlett,et al.  A Stochastic View of Optimal Regret through Minimax Duality , 2009, COLT.

[11]  Cosma Rohilla Shalizi,et al.  Philosophy and the practice of Bayesian statistics. , 2010, The British journal of mathematical and statistical psychology.

[12]  Ming Li,et al.  An Introduction to Kolmogorov Complexity and Its Applications , 1997, Texts in Computer Science.

[13]  S. Boucheron,et al.  A sharp concentration inequality with applications , 1999, Random Struct. Algorithms.

[14]  A. Kolmogorov.  Three approaches to the quantitative definition of information , 1968 .

[15]  Gábor Lugosi,et al.  Introduction to Statistical Learning Theory , 2004, Advanced Lectures on Machine Learning.

[16]  Ambuj Tewari,et al.  Online learning via sequential complexities , 2010, J. Mach. Learn. Res..

[17]  David Balduzzi,et al.  Falsification and Future Performance , 2011, Algorithmic Probability and Friends.

[18]  Vladimir Koltchinskii,et al.  Rademacher penalties and structural risk minimization , 2001, IEEE Trans. Inf. Theory.

[19]  Marcus Hutter.  Universal Learning Theory , 2010, Encyclopedia of Machine Learning.