Fact-Free Learning

People may be surprised by noticing certain regularities that hold in existing knowledge they have had for some time. That is, they may learn without getting new factual information. We argue that this can be partly explained by computational complexity. We show that, given a database, finding a small set of variables that obtain a certain value of R^2 is computationally hard, in the sense that this term is used in computer science. We discuss some of the implications of this result and of fact-free learning in general.

[1]  David I. Laibson,et al.  Costly Information Acquisition: Experimental Analysis of a Boundedly Rational Model , 2006 .

[2]  Barton L. Lipman,et al.  REPRESENTING PREFERENCES WITH A UNIQUE SUBJECTIVE STATE SPACE , 2001 .

[3]  P. Odifreddi.  Classical recursion theory , 1989 .

[4]  Aldo Rustichini,et al.  Recent developments in modeling unforeseen contingencies , 1998 .

[5]  Luca Anderlini,et al.  Incomplete Written Contracts: Undescribable States of Nature (Now published in Quarterly Journal of Economics (1994), vol.109, pp.1085-1124.) , 1993 .

[6]  Zeev Maoz,et al.  Normative and Structural Causes of Democratic Peace, 1946–1986 , 1993, American Political Science Review.

[7]  Debraj Ray,et al.  Choice Shifts in Groups: A Decision-Theoretic Basis , 2006 .

[8]  I. Kant,et al.  To perpetual peace : a philosophical sketch , 2003 .

[9]  David M. Kreps.  Static choice in the presence of unforeseen contingencies , 1992 .

[10]  Andrei Shleifer,et al.  The Quality of Goverment , 1998 .

[11]  I. Gilboa.  Philosophical Applications of Kolmogorov's Complexity Measure , 1994 .

[12]  Florencio Lopez-de-Silanes,et al.  The quality of government , 1999 .

[13]  Colin L. Mallows,et al.  Some Comments on Cp , 2000, Technometrics.

[14]  Ramon Casadesus-Masanell,et al.  Probabilistic Representation of Complexity , 2001, J. Econ. Theory.

[15]  Z. Maoz,et al.  Realist and Cultural Critiques of the Democratic Peace: A Theoretical and Empirical Reassessment , 1998 .

[16]  C. L. Mallows.  Some comments on C_p , 1973 .

[17]  Trevor Hastie,et al.  The Elements of Statistical Learning , 2001 .

[18]  L. Wittgenstein.  Tractatus Logico-Philosophicus , 2021, Nordic Wittgenstein Review.

[19]  YannakakisMihalis,et al.  On the hardness of approximating minimization problems , 1994 .

[20]  Edoardo Amaldi,et al.  On the Approximability of Minimizing Nonzero Variables or Unsatisfied Relations in Linear Systems , 1998, Theor. Comput. Sci..

[21]  Partha Dasgupta,et al.  Economic Analysis of Markets and Games: Essays in Honor of Frank Hahn , 1992 .

[22]  T. Clifton Morgan,et al.  Grasping the Democratic Peace: Principles for a Post-Cold War World , 1994 .

[23]  David M. Kreps.  A REPRESENTATION THEOREM FOR "PREFERENCE FOR FLEXIBILITY" , 1979 .

[24]  M. Bray,et al.  Rational Expectations Equilibria, Learning, and Model Specification , 1986 .

[25]  C. H. Oh,et al.  Some comments on , 1998 .

[26]  R. Tibshirani.  Regression Shrinkage and Selection via the Lasso , 1996 .

[27]  Carsten Lund,et al.  On the hardness of approximating minimization problems , 1993, STOC.

[28]  Ran Raz,et al.  A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP , 1997, STOC '97.

[29]  H. Simon,et al.  A Behavioral Model of Rational Choice , 1955 .

[30]  Itzhak Gilboa,et al.  A theory of case-based decisions , 2001 .

[31]  N. Goodman.  Fact, Fiction, and Forecast , 1955 .

[32]  C. Mallows.  More comments on C p , 1995 .

[33]  Zeev Maoz,et al.  Alliance, contiguity, wealth, and political stability: Is the lack of conflict among democracies a statistical artifact? 1 , 1992 .

[34]  J. Pearl.  Causality: Models, Reasoning and Inference , 2000 .

[35]  Eddie Dekel,et al.  A Unique Subjective State Space for Unforeseen Contingencies , 1997 .

[36]  Zeev Maoz,et al.  NORMATIVE AND STRUCTURAL CAUSES OF DEMOCRATIC PEACE , 1993 .

[37]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .