Graph-Aware Reinforcement Learning for Reusable Prompt Compression in Black-Box LLMs
This paper proposes a task-aware graph reinforcement learning framework that compresses reusable reasoning contexts in black-box LLMs by training a lightweight policy to make extractive keep-or-drop decisions on graph-structured reasoning units, achieving significant input-cost savings while preserving reasoning accuracy.