Fact-Free Learning

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

American Economic Review, 2005, vol. 95, issue 5, pages 1355-1368

Abstract: People may be surprised to notice 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 knowledge base, 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.

Date: 2005
View list of references View citations in EconPapers

Downloads: (external link)
http://hdl.handle.net/10.1257/000282805775014308 (text/html)
http://www.aeaweb.org/articles/article_detail.php? ... ue_date=December2005 (application/pdf)
Access to full text is restricted to AEA members.

Related works:
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: http://EconPapers.repec.org/RePEc:aea:aecrev:v:95:y:2005:i:5:p:1355-1368

Ordering information: This journal article can be ordered from
http://www.aeaweb.org/subscribe.html

Access Statistics for this article

American Economic Review is edited by Robert Moffitt

More articles in American Economic Review from American Economic Association
Contact information at EDIRC.
Series data maintained by Christopher F. Baum ().