Fact-Free Learning

Enriqueta Aragones, Itzhak Gilboa, Andrew Postlewaite and David Schmeidler

PIER Working Paper Archive from Penn Institute for Economic Research, Department of Economics, University of Pennsylvania

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 R2 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: Learning; Behavioral Economics (search for similar items in EconPapers)
JEL-codes: D11 (search for similar items in EconPapers)
Pages: 32 pages
Date: 2003-10-01
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
https://economics.sas.upenn.edu/sites/default/file ... ng-papers/03-023.pdf (application/pdf)

Related works:
Chapter: Fact-Free Learning (2012)
Journal Article: Fact-Free Learning (2005)
Working Paper: Fact-Free Learning (2005)
Working Paper: Fact-Free Learning (2004)
Working Paper: Fact-Free Learning (2004)
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:pen:papers:03-023

Access Statistics for this paper

More papers in PIER Working Paper Archive from Penn Institute for Economic Research, Department of Economics, University of Pennsylvania 133 South 36th Street, Philadelphia, PA 19104. Contact information at EDIRC.
Bibliographic data for series maintained by Administrator ().