PC-SubMax: Efficient Prompt Compression via Regularized Submodular Maximization
cs.CL
Submitted: 2026-09-26
Updated: 2026-09-26
Terminology
Sources
- Training Verifiers to Solve Math Word Problems
- In-context Autoencoder for Context Compression in a Large Language Model
- RULER: What's the Real Context Size of Your Long-Context Language Models?
- DocSage: An Information Structuring Agent for Multi-Doc Multi-Entity Question Answering
- CodeNet: A Large-Scale AI for Code Dataset for Learning a Diversity of Coding Tasks
- Read As Human: Compressing Context via Parallelizable Close Reading and Skimming
- COMI: Coarse-to-fine Context Compression via Marginal Information Gain
- LLaMA: Open and Efficient Foundation Language Models
Related papers
- Exploring Solution Divergence and Its Effect on Large Language Model Problem Solving
- Ishigaki-IDS-Bench: A Benchmark for Generating Information Delivery Specification from BIM Information Requirements
- Subliminal Steering: Stronger Encoding of Hidden Signals
- MedStruct-S: A Benchmark for Key Discovery, Key-Conditioned QA and Semi-Structured Extraction from OCR Clinical Reports
- The End of Transformers? On Challenging Attention and the Rise of Sub-Quadratic Architectures
- Untangling the Mechanisms of Misleading Context in Medical Question Answering