Aller au contenu

Context Compaction Cuts Costs: "You Don't Need Long Context

7 novembre 2026

Notes de l’épisode

This episode examines a November 2026 NVIDIA paper arguing that long context windows are largely unnecessary, because later tokens cost far more to generate than early ones. Measured H100 throughput on open-weight models puts serving a 256K window at 3.6 to 7 times the cost of a 16K window. The discussion separates the paper's three kinds of evidence: measured serving throughput, benchmark accuracy results, and dollar savings from a fitted "estimated optimized retail cost" curve, which is a synthetic price and not a real bill. It walks through the three agent regimes: full-history accumulation, compaction at a token threshold, and single-action compaction. It also covers the proposed Semantic State Space Model, which moves a Mamba-style recurrence outside the network into readable text state. The hosts note that the SSSM is only outlined, not trained. They also note the paper doesn't cite MemGPT, its closest conceptual ancestor. Listeners get a clear guide to which of the paper's cost-cutting claims are measured and which are modeled. Sources: 1. You don't need long context — Peter Belcak, Saurav Muralidharan, Jindong Jiang, Yonggan Fu, Wonmin Byeon, Hanrong Ye, Ryan Angilly, Ali Taghibakhshi, Shih-Yang Liu, Siru Ouyang, Greg Heinrich, Pavlo Molchanov, 2026 http://arxiv.org/abs/2611.05306 2. Efficiently Modeling Long Sequences with Structured State Spaces (S4) — Albert Gu, Karan Goel, Christopher Ré, 2021 (ICLR 2022) https://scholar.google.com/scholar?q=Efficiently+Modeling+Long+Sequences+with+Structured+State+Spaces+%28S4%29 3. Mamba: Linear-Time Sequence Modeling with Selective State Spaces — Albert Gu, Tri Dao, 2023 https://scholar.google.com/scholar?q=Mamba%3A+Linear-Time+Sequence+Modeling+with+Selective+State+Spaces 4. MemGPT: Towards LLMs as Operating Systems — Charles Packer, Sarah Wooders, Kevin Lin, Vivian Fang, Shishir G. Patil, Ion Stoica, Joseph E. Gonzalez, 2023 https://scholar.google.com/scholar?q=MemGPT%3A+Towards+LLMs+as+Operating+Systems 5. Lost in the Middle: How Language Models Use Long Contexts — Nelson F. Liu, Kevin Lin, John Hewitt, Ashwin Paranjape, Michele Bevilacqua, Fabio Petroni, Percy Liang, 2023 (TACL 2024) https://scholar.google.com/scholar?q=Lost+in+the+Middle%3A+How+Language+Models+Use+Long+Contexts 6. RULER: What's the Real Context Size of Your Long-Context Language Models? — Cheng-Ping Hsieh, Simeng Sun, Samuel Kriman, Shantanu Acharya, Dima Rekesh, Fei Jia, Yang Zhang, Boris Ginsburg, 2024 https://scholar.google.com/scholar?q=RULER%3A+What%27s+the+Real+Context+Size+of+Your+Long-Context+Language+Models%3F 7. Recurrent Memory Transformer / Scaling Transformer to 1M tokens and beyond with RMT — Aydar Bulatov, Yuri Kuratov, Mikhail Burtsev, 2022-2023 https://scholar.google.com/scholar?q=Recurrent+Memory+Transformer+%2F+Scaling+Transformer+to+1M+tokens+and+beyond+with+RMT 8. Mamba: Linear-Time Sequence Modeling with Selective State Spaces; Mamba-2 / Transformers are SSMs — Albert Gu, Tri Dao, 2023-2024 https://scholar.google.com/scholar?q=Mamba%3A+Linear-Time+Sequence+Modeling+with+Selective+State+Spaces%3B+Mamba-2+%2F+Transformers+are+SSMs 9. Repeat After Me: Transformers are Better than State Space Models at Copying — Samy Jelassi, David Brandfonbrener, Sham Kakade, Eran Malach, 2024 https://scholar.google.com/scholar?q=Repeat+After+Me%3A+Transformers+are+Better+than+State+Space+Models+at+Copying 10. Context Rot / long-context degradation studies (e.g., Chroma context-rot report; NoLiMa: Long-Context Evaluation Beyond Literal Matching) — Chroma research; Ali Modarressi et al., 2025 https://scholar.google.com/scholar?q=Context+Rot+%2F+long-context+degradation+studies+%28e.g.%2C+Chroma+context-rot+report%3B+NoLiMa%3A+Long-Context+Evaluation+Beyond+Literal+Matching%29 11. Efficient Memory Management for Large Language Model Serving with PagedAttention (vLLM) — Woosuk Kwon et al., 2023 https://scholar.google.com/scholar?q=Efficient+Memory+Management+for+Large+Language+Model+Serving+with+PagedAttention+%28vLLM%29 12. LMCache: An Efficient KV Cache Layer for Enterprise-Scale LLM Inference — Yihua Cheng et al., 2025 https://scholar.google.com/scholar?q=LMCache%3A+An+Efficient+KV+Cache+Layer+for+Enterprise-Scale+LLM+Inference 13. Effective context engineering for AI agents / Claude Code auto-compact; Cognition 'Don't build multi-agents' context engineering notes — Anthropic; Cognition, 2025 https://scholar.google.com/scholar?q=Effective+context+engineering+for+AI+agents+%2F+Claude+Code+auto-compact%3B+Cognition+%27Don%27t+build+multi-agents%27+context+engineering+notes 14. Ring Attention, Infini-attention, and Transformer-XL style recurrence — Hao Liu et al.; Tsendsuren Munkhdalai et al.; Zihang Dai et al., 2019-2024 https://scholar.google.com/scholar?q=Ring+Attention%2C+Infini-attention%2C+and+Transformer-XL+style+recurrence 15. Recursive Language Models / agentic reading of long inputs through code and REPL tools — Alex Zhang, Omar Khattab and others, 2025 https://scholar.google.com/scholar?q=Recursive+Language+Models+%2F+agentic+reading+of+long+inputs+through+code+and+REPL+tools 16. On the Computational Complexity of Self-Attention — Feyza Duman Keles, Pruthuvi Mahesakya Wijewardena, Chinmay Hegde, 2023 https://scholar.google.com/scholar?q=On+the+Computational+Complexity+of+Self-Attention Interactive Visualization: Context Compaction Cuts Costs: "You Don't Need Long Context

Tous les épisodes de AI Post Transformers

Paramètres

Affichage

Langue

Détermine les stations affichées en premier sur la page d’accueil.

Historique

Les stations et épisodes écoutés récemment et tes dernières recherches sont seulement enregistrés dans ce navigateur.

Notifications

Un court message quand un podcast que tu suis publie un nouvel épisode. Désactive un podcast précis avec la cloche sur sa page.

Compte

Enregistrez vos favoris – dans l’app et sur le site.

Raccourcis clavier

/
Ouvrir la recherche
Espace
Lecture ou pause
← →
Dans le lecteur : 15 s en arrière, 30 s en avant (épisodes) · dans une rangée : tuile suivante
↑ ↓
Dans une rangée : cible dans la tuile
Début / Fin
Dans une rangée : première ou dernière tuile
Esc
Fermer la fenêtre ou le menu
?
Cet aperçu
En cours de lecture

Voir la station

À suivre

    Ajoutez des épisodes avec « À suivre » – ils seront lus après l'épisode en cours.