Debt-free intelligence: ecological information in minds and machines
Bibliographic record
Abstract
Cognitive scientists and neuroscientists typically understand the brain as a complex communication/information-processing system. A limitation of this framework is that it requires cognitive systems to have prior knowledge about their environment to successfully perform some of their basic functions, such as perceiving. It is unclear how the source of such knowledge can be explained from within this framework. Drawing on Dennett (1981), we refer to this as the loans of intelligence problem. Recent advances in machine learning have resulted in the development of a family of algorithms, including the class known as autoencoders, that seem to provide a way for the information-processing framework to avoid this problem: cognitive systems do not require loans of intelligence, but instead acquire the knowledge necessary for perception through a process of unsupervised learning. This paper argues that although autoencoders do avoid the loans of intelligence problem, how they do so should not be understood from within the information-processing framework. Instead, their success should be interpreted as a proof of concept of how neural networks can attune to Gibsonian information. We thus propose that autoencoders belong to a class of algorithms for modeling the brain that have recently been dubbed direct fit algorithms.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.011 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.002 | 0.010 |
| Scholarly communication | 0.004 | 0.016 |
| Open science | 0.002 | 0.004 |
| Research integrity | 0.002 | 0.003 |
| Insufficient payload (model declined to judge) | 0.005 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".