We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Recently, continuous cache models were proposed as extensions to recurrent neural network language models, to adapt their predictions to local changes in the data distribution. These models only capture the local context, of up to a few thousands tokens. In this paper, we propose an extension of continuous cache models, which can scale to larger contexts. In particular, we use a large scale non-parametric memory component that stores all the hidden activations seen in the past. We leverage recent advances in approximate nearest neighbor search and quantization algorithms to store millions of representations while searching them efficiently. We conduct extensive experiments showing that our approach significantly improves the perplexity of pre-trained language models on new distributions, and can scale efficiently to much larger contexts than previously proposed local cache models.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1711.02604")
get_code_for_paper("1711.02604")
have("1711.02604")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1711.02604.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1711.02604)
Connect an agent — have() is free.