Por favor, use este identificador para citar o enlazar a este item:
http://hdl.handle.net/10261/57724
COMPARTIR / EXPORTAR:
SHARE CORE BASE | |
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL | DATACITE | |
Título: | Fact-free learning |
Autor: | Aragonés, Enriqueta CSIC ORCID ; Gilboa, Itzhak; Postlewaite, Andrew; Schmeidler, David | Fecha de publicación: | 2005 | Editor: | American Economic Association | Citación: | American Economic Review 95(5): 1355-1368 (2005) | Resumen: | 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. | URI: | http://hdl.handle.net/10261/57724 | DOI: | 10.1257/000282805775014308 | Identificadores: | doi: 10.1257/000282805775014308 issn: 0002-8282 |
Aparece en las colecciones: | (IAE) Artículos |
Ficheros en este ítem:
Fichero | Descripción | Tamaño | Formato | |
---|---|---|---|---|
Fact-Free Learning.pdf | 388,58 kB | Adobe PDF | Visualizar/Abrir |
CORE Recommender
SCOPUSTM
Citations
62
checked on 16-abr-2024
WEB OF SCIENCETM
Citations
55
checked on 25-feb-2024
Page view(s)
313
checked on 19-abr-2024
Download(s)
310
checked on 19-abr-2024
Google ScholarTM
Check
Altmetric
Altmetric
NOTA: Los ítems de Digital.CSIC están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.