Repeated Shared Access Enables Grokking, but Edit Propagation Depends on a Fine-Grained Addressable Memory (opens in new tab)
We study factual edit propagation in a controlled synthetic knowledge-graph QA setting, comparing four architectures that cross loop recurrence with shared memory access: dense (Dense), looped (Loop), dense with shared memory (Dense+Mem), and looped with shared memory (LMC). Dense fits in-distribution 2-hop compositions but fails OOD; both looped recomputation and memory rereading cross this OOD grokking barrier, indicating that repeated shared ...
Read the original article