paper-with-me

홈 › Papers

MELODI: Exploring Memory Compression for Long Contexts

2024-10-04 · Yinpeng Chen, DeLesley Hutchins, Aren Jansen, Andrey Zhmoginov, David Racz, Jesper Andersen

We present MELODI, a novel memory architecture designed to efficiently process long documents using short context windows. The key principle behind MELODI is to represent short-term and long-term memory as a hierarchical compression scheme across both network layers and context windows. Specifically, the short-term memory is achieved through recurrent compression of context windows across multiple layers, ensuring smooth transitions between windows. In contrast, the long-term memory performs further compression within a single middle layer and aggregates information across context windows, effectively consolidating crucial information from the entire history. Compared to a strong baseline - the Memorizing Transformer employing dense attention over a large long-term memory (64K key-value pairs) - our method demonstrates superior performance on various long-context datasets while remarkably reducing the memory footprint by a factor of 8.

📄 PDF Abstract BibTeX arXiv:2410.03156

Code (1)

google-research/meliad jax

Methods 이 논문이 사용한 방법론

Dense Connections Dense Connections, or Fully Connected Connections, are a type of layer in a deep neural network that use a linear operation where every input is connected to every output…
Adam 설명 없음
Linear Layer A Linear Layer is a projection $\mathbf{XW + b}$.
Residual Connection 설명 없음
Position-Wise Feed-Forward Layer 설명 없음
Label Smoothing Label Smoothing is a regularization technique that introduces noise for the labels. This accounts for the fact that datasets may have mistakes in them, so maximizing the…
Attention 설명 없음
Dropout Dropout is a regularization technique for neural networks that drops a unit (along with connections) at training time with a specified probability $p$ (a common value is…

Similar Papers 제목 키워드 기반

Towards Compressive and Scalable Recurrent Memory

2026-02-11 · Yunchong Song, Jushi Kai, Liming Lu, Kaixi Qiu 외 arxiv

Transformers face a quadratic bottleneck in attention when scaling to long contexts. Recent approaches introduce recurrent memory to extend context beyond the current window, yet these often face a fundamental trade-off …

Scaling and compressing melodies using geometric similarity measures

2022-09-19 · Luis Evaristo Caraballo, José Miguel Díaz-Báñez, Fabio Rodríguez, Vanesa Sánchez-Canales 외

Melodic similarity measurement is of key importance in music information retrieval. In this paper, we use geometric matching techniques to measure the similarity between two melodies. We represent music as sets of points…

Audio CompressionGeometric MatchingInformation RetrievalMusic Information Retrieval+1

Gregorian melody, modality, and memory: Segmenting chant with Bayesian nonparametrics

2025-07-01 · Vojtěch Lanz, Jan Hajič arxiv

The idea that Gregorian melodies are constructed from some vocabulary of segments has long been a part of chant scholarship. This so-called "centonisation" theory has received much musicological criticism, but frequent r…

WuYun: Exploring hierarchical skeleton-guided melody generation using knowledge-enhanced deep learning

2023-01-11 · Kejun Zhang, Xinda Wu, Tieyao Zhang, Zhijie Huang 외

Although deep learning has revolutionized music generation, existing methods for structured melody generation follow an end-to-end left-to-right note-by-note generative paradigm and treat each note equally. Here, we pres…

Music Generation

Context Cascade Compression: Exploring the Upper Limits of Text Compression

2025-11-19 · Fanfan Liu, Haibo Qiu arxiv

Million-level token inputs in long-context tasks pose significant computational and memory challenges for Large Language Models (LLMs). Recently, DeepSeek-OCR conducted research into the feasibility of Contexts Optical C…