Fact-Free Learning

Enriqueta Aragones (), Itzhak Gilboa (), Andrew Postlewaite () and David Schmeidler ()

No 1491, Cowles Foundation Discussion Papers from Cowles Foundation, Yale University

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)
JEL-codes: C8 D8 (search for similar items in EconPapers)
Date: 2004-11
View list of references

Downloads: (external link)
http://cowles.econ.yale.edu/P/cd/d14b/d1491.pdf (application/pdf)

Related works:
Working Paper: Fact-Free Learning (2004)
Working Paper: Fact-Free Learning (2003)
Journal Article: Fact-Free Learning (2005)
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: http://EconPapers.repec.org/RePEc:cwl:cwldpp:1491

Ordering information: This working paper can be ordered from
Cowles Foundation, Yale University, Box 208281, New Haven, CT 06520-8281 USA
The price is None.

Access Statistics for this paper

More papers in Cowles Foundation Discussion Papers from Cowles Foundation, Yale University
Address: Yale University, Box 208281, New Haven, CT 06520-8281 USA
Contact information at EDIRC.
Series data maintained by Glena Ames ().