arXiv (All)
open access
Kronecker Product Attention: Memory-Efficient KV Compression via Structured Factorization
Efficient autoregressive generation is increasingly limited by the memory footprint of the key-value (KV) cache, which grows linearly with sequence length, batch size, and model depth. Existing approaches such as Multi-Query Attention (MQA), Grouped-Query Attention (GQA), Multi-Head Latent Attention
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Tucker Bottleneck Attention for Multi-Dimensional Sequence Modeling#1233129
- PREM: Prefix-Steered Recurrent Memory for Long-Video Understanding#1049340
- DimGrow: Memory-Efficient Field-level Embedding Dimension Search#1131394
- Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLM#1232620
- Sequential Functional Structured Tucker Compression for Large Language Model Attentions#1155652
Record · ID 1296664
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive