Latent Context Language Models compress context tokens up to 16x, cutting time-to-first-token by 8.8x on the RULER benchmark
The models are open-sourced on GitHub and Hugging Face.
The models are open-sourced on GitHub and Hugging Face.
The models are open-sourced on GitHub and Hugging Face.
The models are open-sourced on GitHub and Hugging Face.
End-to-End Context Compression at Scale Encoder-decoder compressors - map a long token sequence to a shorter sequence of latent embeddings, not competitive with KV cache compression. This work revisits encoder-decoder compression. Perform an architecture search, pre-training many variants from scratch to determine how best to design and train encoder-decoder compressors. Continually pre-train a family of 0.6B-encoder, 4B-decoder models on over 350B tokens each, at compression ratios of 1:4, 1:8, and 1:16. "We introduce Latent Context Language Models (LCLMs), a family of compressors that improve the Pareto frontier across general-task performance, compression speed, and peak memory usage.
Instead, we use a small encoder to convert raw text into compact latent representations in small chunks. The larger decoder then only takes in those compressed latent representations. This technique does not require the full prefill, and it is hardware and software friendly. 4/10 https://x.com/micahgoldblum/status/2064361017522503781/photo/1
With the right architecture + training recipe, learned compression works far better than prior work suggested. We trained 4×, 8×, and 16× compressors jointly with pretrained decoders on 350B+ tokens, and we tested out tons of architectures and staged training pipelines. 5/10 https://x.com/micahgoldblum/status/2064361019686707242/photo/1
Our models establish a new Pareto frontier on long-context benchmarks like RULER, LongBench, and LongHealth. At high compression ratios, we see much lower memory consumption, substantially faster TTFT, and strong long-context accuracy. 6/10 https://x.com/micahgoldblum/status/2064361021829988620/photo/1
We trained language models that compress massive contexts into tiny latent representations. Latent Context Language Models (LCLMs) outperform existing KV cache compression methods on the latency/accuracy frontier. 🧵1/10 https://x.com/micahgoldblum/status/2064361011994337772/photo/1
models: https://huggingface.co/latent-context code: https://github.com/LeonLixyz/LCLM arxiv: https://arxiv.org/abs/2606.09659
Paper📝: https://arxiv.org/abs/2606.09659 Models🤖: https://huggingface.co/latent-context Code💻: https://github.com/LeonLixyz/LCLM 10/10
@micahgoldblum Compression architecture == ConvNet-style hierarchy through pooling/stride.
Ask a question below.
Published answers will appear here.