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

YHacker Newsscreenshots

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

First screen, captured 6 months ago.

Looks similar

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

Screenshot of arxiv.org: CODA: Rewriting Transformer Blocks as GEMM-Epilogue Programs

CODA: Rewriting Transformer Blocks as GEMM-Epilogue Programs (arxiv.org)

96 points by matt_d 5 months ago | 12 comments

Screenshot of arxiv.org: SparseLoCo: Communication-Efficient LLM Training

SparseLoCo: Communication-Efficient LLM Training (arxiv.org)

11 points by synapz_org 1 year ago | 1 comments

Screenshot of arxiv.org: Scalable MatMul-Free Language Modeling

Scalable MatMul-Free Language Modeling (arxiv.org)

177 points by lykahb 2 years ago | 27 comments

Screenshot of arxiv.org: 26× Faster Inference with Layer-Condensed KV Cache for Large Language Models

26× Faster Inference with Layer-Condensed KV Cache for Large Language Models (arxiv.org)

112 points by georgehill 2 years ago | 16 comments

Screenshot of arxiv.org: Can LLMs Beat Classical Hyperparameter Optimization Algorithms?

Can LLMs Beat Classical Hyperparameter Optimization Algorithms?(arxiv.org)

95 points by galsapir 4 months ago | 15 comments