Text Compression Algorithm Based on Feedback Self-Optimization Using Lightweight LLMs

Large Language Models (LLMs) have demonstrated impressive capabilities in text summarization and question answering. However, their outputs often rely on shallow rephrasing of the input, leading to summaries that may overlook key information or misrepresent the source content. Moreover, LLMs face challenges when processing excessively long inputs due to context limitations and information dilution. To address these issues, we propose a two-stage text compression framework based on lightweight LLMs. In the first stage, semantically salient text units are identified using a combination of lightweight LLM scoring and embedding-based ranking to achieve concise input compression. In the second stage, the same lightweight LLM is employed to regenerate coherent and informative summaries from the compressed inputs. Experimental results on multiple QA datasets demonstrate that our system achieves competitive performance against standard baselines while significantly reducing model size and input length. The framework is highly adaptable, interpretable, and suitable for integration into resource-constrained environments and document processing scenarios characterized by noisy or semantically irrelevant content.