Caching Algorithms and Rational Models of Memory

Avi PressUniversity of California, Berkeley
Michael PacerUniversity of California, Berkeley
Thomas GriffithsUniversity of California, Berkeley
Brian ChristianUniversity of California, Berkeley


People face a problem similar to that faced by algorithms that manage the memory of computers: trying to organize informa- tion to maximize the chance it will be available when needed in the future. In computer science, this problem is known as “caching”. Inspired by this analogy, we compared the prop- erties of a model of human memory proposed by Anderson and Schooler (1991) and caching algorithms used in computer science. We tested each algorithm on a dataset relevant to hu- man cognition: headlines from the New York Times. In addi- tion to overall performance, we investigated whether the algo- rithms from computer science replicated the well-documented effects of recency, practice, and spacing on human memory. Anderson and Schooler’s model performed comparably to the worst caching algorithms, but was the only model that captured the spacing effects seen in human memory data. All models showed similar effects of recency and practice.


Caching Algorithms and Rational Models of Memory (216 KB)

Back to Table of Contents