TheMachine Press

A daily newspaper for the age of artificial intelligence.

Morning editionPermanent story

research

Recall Is Not the Same as Reusable Knowledge

Across eleven models and seventy relations, linear readability before fine-tuning predicts whether a newly labeled relation generalizes.

Published Updated Story ID: mp-2026-10-18-027
Read the complete editionStory JSON

Summary

Across eleven models and seventy relations, linear readability before fine-tuning predicts whether a newly labeled relation generalizes.

A model may recall a fact without representing it in a form that supports new learning. The authors create arbitrary relabelings of known relations—such as mapping continents to animal words—fine-tune on a subset of subjects and test whether the new labels transfer to held-out subjects sharing the original answer. Across eleven language models and seventy relations, the linear readability of the original relation before fine-tuning predicted later generalization, with within-model correlations from 0.87 to 0.92. The association survived controls for recall accuracy, subject frequency and training-set structure. The study uses constructed relations, but it cleanly separates stored facts from representations that can be repurposed.

Why it matters

Across eleven models and seventy relations, linear readability before fine-tuning predicts whether a newly labeled relation generalizes.

Limits and context

No additional limitation was separately recorded.

Key claims

  1. Across eleven models and seventy relations, linear readability before fine-tuning predicts whether a newly labeled relation generalizes.

    Evidence: source-2026-10-18-016

Sources

  1. arXiv preprint 2610.22300, original v1arXiv · primary research

Corrections

No corrections have been recorded for this story.