Fast KV Compaction via Attention Matching (arxiv.org) | HN Screenshots

YHacker Newsscreenshots

Screenshot of arxiv.org: Fast KV Compaction via Attention Matching

First screen, captured 8 months ago.

Looks similar

Screenshot of arxiv.org: LoMA: Lossless Compressed Memory Attention

LoMA: Lossless Compressed Memory Attention (arxiv.org)

90 points by PaulHoule 2 years ago | 8 comments

Screenshot of arxiv.org: KV Cache Compression 900000x Beyond TurboQuant and Per-Vector Shannon Limit

KV Cache Compression 900000x Beyond TurboQuant and Per-Vector Shannon Limit (arxiv.org)

40 points by EGreg 6 months ago | 11 comments

Screenshot of arxiv.org: Infinite Retrieval: Attention enhanced LLMs in long-context processing

Infinite Retrieval: Attention enhanced LLMs in long-context processing (arxiv.org)

26 points by TaurenHunter 1 year ago | 3 comments

Screenshot of arxiv.org: Multi-Token Attention

Multi-Token Attention (arxiv.org)

131 points by fzliu 1 year ago | 35 comments

Screenshot of arxiv.org: Flash-KMeans: Fast and Memory-Efficient Exact K-Means

Flash-KMeans: Fast and Memory-Efficient Exact K-Means (arxiv.org)

176 points by matt_d 7 months ago | 14 comments

Screenshot of arxiv.org: Parameter-free KV cache compression for memory-efficient long-context LLMs

Parameter-free KV cache compression for memory-efficient long-context LLMs (arxiv.org)

60 points by PaulHoule 1 year ago | 13 comments