← Back to all news
arXiv Machine Learning By Ruishan Guo, Yibing Liu, Guoxin Ma, Yan Wang, Yueyang Zhang, Long Xia, Kecheng Chen, Zhiyuan Sun, Daiting Shi

When Less is More: The LLM Scaling Paradox in Context Compression

Read the original on arXiv Machine Learning →

The paper reports a Size‑Fidelity Paradox in large‑language‑model (LLM) context compression: larger compressors can produce lower reconstruction error yet yield less faithful reconstructed contexts. Two key mechanisms drive this effect: knowledge overwriting, where larger models replace source facts with their own beliefs, and semantic drift, where they paraphrase or restructure content. Across 27 compressor setups, mid‑sized models often recover contexts more faithfully, and analysis of embedding geometry shows that larger models organize memory into broader semantic subspaces, leading to ambiguous representations that weaken recovery.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

Related stories

arXiv AI
1d ago

Does Context Compression Preserve Refusal Alignment?

The paper examines whether context compression, which encodes inputs into compact representations while preserving semantic content, maintains refusal alignment in instruction-tuned language models. It finds that encoder-based compression consistently weakens refusal behavior across various model families and architectures, even though reconstruction fidelity remains high. Mechanistic analysis attributes this to attenuation of activation along the decoder’s learned refusal direction, and introduces Memory Steering—a lightweight inference-time intervention that restores refusal rates without retraining.

By Anthony Nguyen, Wenjun Lin
llmssafety
More like this →
arXiv AI
Sep 10

Limits of Reliability and Scaling in Language Models

The paper argues that large language models cannot achieve perfect reliability for any task, even with unlimited scale. It establishes that each generative task has an inherent reliability ceiling set by how much output uncertainty can be resolved from observable context, with a resolvable part that can be improved by more context and a subjective part tied to task ambiguity. The authors derive a scaling law showing that performance is limited by the scarcer resource—either training data or model capacity—and explain how this law explains phenomena such as retrieval augmentation and catastrophic forgetting.

By Subhabrata Majumdar
llms
More like this →