- Rating
- 3(+1)
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes PC-SubMax, a sentence-level prompt compression framework based on regularized submodular maximization. The method combines information coverage, semantic diversity, and query relevance with a token-cost penalty to select informative sentences under a token budget. The authors further develop a Regularized Greedy+Max (RGM) algorithm with a approximation guarantee and evaluate its effectiveness across seven benchmarks.
Critical strengths
-
The paper provides a clear and well-motivated formulation of prompt compression as a regularized submodular optimization problem, explicitly considering information coverage, redundancy, and token costs.
-
The proposed RGM algorithm offers a competitive theoretical approximation guarantee with relatively low value-oracle complexity.
-
Extensive experiments across diverse downstream tasks demonstrate competitive compression quality and efficiency compared with existing prompt compression methods.
Critical weaknesses
-
The proposed RGM algorithm builds upon established cost-scaled greedy selection and Greedy+Max augmentation techniques. While Theorem 2 establishes a competitive regularized approximation guarantee, the underlying algorithmic mechanisms closely resemble prior work. Moreover, the experiments primarily compare prompt-compression methods rather than existing submodular optimization algorithms under the same objective. Comparisons with Cost-Scaled Greedy, Greedy+Max, and PartEnum-Twin-Greedy would help clarify the specific benefits of RGM in terms of objective value, computational efficiency, and downstream performance.
-
Multi-hop reasoning often requires multiple complementary sentences to be retained together. Although Appendix C uses beam search to identify multi-hop evidence relationships, the resulting relevance scores are fixed before subset selection. Consequently, the proposed method may select a sentence with high relevance while discarding another sentence required to complete the same evidence chain. The paper does not directly evaluate whether complete supporting evidence chains are preserved. Reporting supporting-fact recall and evidence-chain completeness on HotpotQA would help assess this limitation.
Questions for authors
See weaknesses
3 comments
Thank you for the detailed rebuttal and additional experiments. The comparisons with existing submodular optimization algorithms substantially address my concerns.
The HotpotQA experiments also provide useful evidence that the proposed multi-hop relevance mechanism improves supporting-fact retention and evidence-chain completeness. While the fixed relevance scores still cannot explicitly model dependencies between jointly selected sentences, I acknowledge that the new results substantially strengthen the empirical support for the proposed approach.
In summary, the rebuttal addresses most of my concerns, and I am inclined to revise my rating to 3
We appreciate your recognition of our work and your valuable feedback.
Follow-up on Our Responses
Dear Reviewer,
Thank you again for your careful and thoughtful review. We understand that this is a busy time, and as the discussion period is coming to a close, we wanted to briefly follow up. We hope our responses have adequately addressed your questions and concerns. If our clarifications have resolved the issues you raised, we would sincerely appreciate it if you would consider revisiting your overall assessment of the paper.
We would be very happy to provide any further clarification.
Best regards