Cited by 123Bayesian Modeling and Causal InferenceMachine Learning and AlgorithmsLogic, Reasoning, and Knowledge

Fact-free learning

Open access
Aragones, Enriqueta, Gilboa, Itzhak, Postlewaite, Andrew, Schmeidler, David·2005·American Economic Review

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 R2is 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.

Integrity signals

Registry

Crossref · 10.1257/000282805775014308

Cites

18 of 18 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

The text we found for this paper looks like another document, so its claims and self-check weren’t run. The registry and citation checks still apply.

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The text we found for this paper looks like another document, so the self-check wasn’t run.

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Aragones, E., Gilboa, I., Postlewaite, A., & Schmeidler, D.
Affiliations
  • Institut d'Analisi Economica, CSIC, Campus UAB, 08193 Bellaterra, Spain 08193.
  • Tel Aviv University (IL)
  • University of Pennsylvania (US)
Venue
American Economic Review
Published
2005-11-01
Volume
95
Issue
5
Pages
1355-1368
ISSN
0002-8282 (ISSN-L)
OpenAlex
W3122734808
Cited by
123
References
18
Citations by year
2026: 4 · 2025: 3 · 2024: 3 · 2023: 5 · 2022: 1 · 2021: 10 · 2020: 7 · 2019: 5 · 2018: 4 · 2017: 3 · 2016: 7 · 2015: 2 · 2014: 5 · 2013: 6 · 2012: 5
FWCI
9.52
Type
journal article
Language
en
Open access
Licence
other-oa
Locations
  • American Economic Review (publishedVersion)
  • HAL (submittedVersion)
  • RePEc: Research Papers in Economics (submittedVersion)
  • DIGITAL.CSIC (Spanish National Research Council (CSIC)) (submittedVersion, other-oa)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Bayesian Modeling and Causal Inference
  • Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Algorithms
  • Physical Sciences › Computer Science › Artificial Intelligence › Logic, Reasoning, and Knowledge
Keywords
computational complexity, knowledge base, R-squared, feature selection, computational hardness, knowledge acquisition

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review