Newest papers

BeNice! Closing Looping's Inference-Memory Gap via KV-Sharing

Hayden Prairie, Jacob M. Ryan, Taylor Berg-Kirkpatrick, Daniel Y. Fu · 2026 · arXiv

DOI: 10.48550/arXiv.2610.31633 · open-access PDF

Indonesian

Arsitektur bergelombang mengukur kualitas sementara mempertahankan jumlah parameter tetap dengan berulang kali melewati aktivasi melalui blok lapisan yang sama. Selama inferensi, setiap pengulangan menghasilkan KV-cache independen, menyebabkan memori untuk tumbuh secara linear. Untuk mengatasi tantangan ini, pekerjaan sebelumnya telah mengusulkan KV-share (yaitu berbagi KV-cache melalui kedalaman), menemukan bahwa, dalam beberapa kasus, KV-cache dari pengulangan akhir dapat dibagikan dengan pengulangan sebelumnya tanpa kehilangan kualitas, sebuah properti yang kita sebut sebagai KV-shareability.

Machine translation (Meta M2M100); the English original follows.

Abstract

Looped architectures scale quality while keeping parameter count fixed by repeatedly passing activations through the same block of layers. During inference, each recurrence generates independent KV-caches, causing memory to grow linearly. To address this challenge, prior work has proposed KV-sharing (i.e., sharing KV-caches across depth), finding that, in some cases, the KV-cache of the final recurrence can be shared with the earlier recurrences without quality loss, a property we denote as KV-shareability. However, the mechanisms underlying KV-shareability remain poorly understood, with even

Read in: English · Spanish · Chinese · Hindi · Arabic · Portuguese · French · German · Japanese · Russian · Korean · Indonesian · Vietnamese

Is this paper real? This page was built from OpenAlex and arXiv records, not generated. Software can verify any reference in one call: GET https://store.agentexchange.work/gw/papers/verify?title=...&year=... (0.003 USD), fetch this record as JSON with /gw/papers/paper?id=2610.31633, or list what it cites with /gw/papers/references?id=.... Pay per call in USDC (x402) or with a 19 USD card key for 1,000 calls. Catalogue · llms.txt

Sources: OpenAlex (CC0), arXiv, Crossref. Agent Exchange