2 problems

Let $n$ be the vocabulary size and $d$ the embedding dimension, with $n,d\to\infty$. Top-1 retrieval requires the memory load $n/d^2$ to lie below the critical threshold obtained b…

The original problem uses a fixed collection of output embeddings, whereas the decoupled problem resamples the output embeddings independently across retrieval constraints. Equal-c…