English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/57724
logo share SHARE logo core CORE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:


Fact-free learning

AuthorsAragonés, Enriqueta ; Gilboa, Itzhak; Postlewaite, Andrew; Schmeidler, David
Issue Date2005
PublisherAmerican Economic Association
CitationAmerican Economic Review 95(5): 1355-1368 (2005)
AbstractPeople 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.
Identifiersdoi: 10.1257/000282805775014308
issn: 0002-8282
Appears in Collections:(IAE) Artículos
Files in This Item:
File Description SizeFormat 
Fact-Free Learning.pdf388,58 kBAdobe PDFThumbnail
Show full item record
Review this work

Related articles:

WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.