Fact-Free Learning

Itzhak Gilboa, Enriqueta Aragones, Andrew Postlewaite and David Schmeidler

Post-Print from HAL

Abstract: 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.

Keywords: Computational complexity; Linear regression; Rule-based reasoning (search for similar items in EconPapers)
Date: 2005
References: Add references at CitEc
Citations: View citations in EconPapers (8)

Published in American Economic Review, 2005, Vol.95, pp.1355-1368. ⟨10.1257/000282805775014308⟩

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
Chapter: Fact-Free Learning (2012)
Journal Article: Fact-Free Learning (2005)
Working Paper: Fact-Free Learning (2004)
Working Paper: Fact-Free Learning (2004)
Working Paper: Fact-Free Learning (2003)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hal:journl:hal-00481243

DOI: 10.1257/000282805775014308

Access Statistics for this paper

More papers in Post-Print from HAL
Bibliographic data for series maintained by CCSD (hal@ccsd.cnrs.fr).