arXiv Paper Proposes Training-Free Lexical Prompt Compression for LLMs
A new arXiv preprint describes a deterministic, training-free pipeline for shortening the prompts given to large language models by compressing their lexical content. The authors report a Pareto analysis of the trade-offs between compression and task performance across eleven task categories. The work targets the growing cost and context limits caused by long prompts in techniques like chain-of-thought and in-context learning.