arXiv:2603.21736 · v3

Representational Acquisition Under Bounded Resources

首次提交 2026-03-23 17:25

版本更新 2026-11-01 15:13

雷达观测 2026-11-04 23:43

摘要

A learner's obligation to keep acquired content usable imposes a storage-access tradeoff, with exact endpoints that force different physical organizations. For an exact concept-learning task, we determine the storage-read curve within a constant factor. One-read compound queries force answer-specific cells and exponentially costly updates; one-bit, order-independent updates instead force fact-specific cells. At minimum storage capacity, a robust counterpart holds: when update stretch is averaged uniformly over all semantic cube edges, small excess stretch bounds expected distance from a coordinate encoding under the uniform content distribution. It also bounds the information inaccessible to a one-read consumer. Preservation imposes further constraints. On a common invariant ready-state domain, old content preserved by ordinary zero-read overwrites must factor through the unwritten coordinates. Distributed encodings can require reading every cell to choose a preserving update. For conditional Horn reasoning, we obtain a second pair of exact endpoints: maintaining answers makes use local, while minimum storage and one-change named revision force a rule vector whose optimal query-read cost is determined exactly. These results explain how acquired distinctions, subsequent uses, and update constraints jointly determine the costs and organization of a retained resource.

作者备注：76 pages, 1 figure, 6 tables