- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper introduces GRACER, Graph-Regularized Adaptive Compression for Efficient Reasoning, which first regularizes noisy dependency structures through role-constrained repair and then estimates structural credit and downstream uncertainty over the dependency graph. These estimates guide greedy compression of redundant nodes under the information-bottleneck principle. Across six benchmarks and two backbone models, GRACER produces more compact reasoning graphs and improves accuracy.
Critical strengths
The problem is relevant. Repairing and compressing the intermediate graph is a reasonable way to improve both efficiency and answer quality.
The evaluator does not require LLM calls.
GRACER outperforms AoT on all six benchmarks under both backbones.
Critical weaknesses
Structural credit is not answer-facing, and the worked example is internally inconsistent. In the worked example, the last row of A is zero. Therefore, the target node’s credit must satisfy I_8=(1-d)S_8. In Appendix C, d=0.85 and S_8=0.0574, indicating I_8=0.15 \times 0.0574=0.00861. However, the reported fixed-point vector gives I_8=0.0589.
The benchmark definitions and answer-processing rules are not clearly clarified. Please provide detailed experimental settings with dataset versions, splits, instance IDs, transformations, prompts, extraction rules, and metric aggregation. Label restricted subsets clearly in the main results.
The selection of hyperparameters is based on the evaluation sets. According to Appendix A.9 and B.2, the d and \lambda sweeps use “the same capped evaluation scope as the main efficiency analysis,” i.e., the evaluation instances themselves. The selected values reproduce the main result exactly (d = 0.85 produces 86.05, matching Table 1).
No comparison against the number of target-reaching paths, out-degree of descendants, or direct entropy of normalized w_p. Missing related work and baselines on efficient reasoning, such as prompting-based concise reasoning etc.
Questions for authors
Can you provide a reproducible computation of the case study, including the priors, the chain aggregation, and the action selection? How was credit computed at d = 1?
How does GRACER perform with repair, critic, and compression all removed? What does the ‘direct reasoning’ stage do?
Are hyperparameter-selection instances unrelated to the reported evaluation instances?
2 comments
Dear Reviewer rzK1,
We sincerely appreciate your recognition of the value of our work! GRACER evaluates structural credit and downstream uncertainty without additional LLM calls, while its repair and compression modules directly address structural errors and redundancy in generated reasoning graphs. Therefore, it provides a practical post-processing approach for graph-structured reasoning that improves performance while reducing token usage; the underlying idea may also extend to tree-structured reasoning! We have also aimed to make the method, overview, and overall pipeline transparent and easy to follow, thereby addressing an underexplored gap in the post-processing of structured reasoning.
At the same time, we fully understand the concerns you raised. Some details—such as the worked example and benchmark protocol—were insufficiently explained or omitted from the appendix, and we sincerely apologize for the resulting confusion and concern. We have done our best to provide the requested details, although we cannot guarantee that every detail has been fully covered. So, don't be mean to tell us whether any issues remain unresolved after considering our rebuttal! Although the initial assessment was discouraging and we felt that some aspects of the work may not have been fully reflected, we fully respect your judgment and greatly value your feedback!
In the end, if our rebuttal resolves or alleviates your concerns, we would sincerely appreciate your reconsideration of the rating and the opportunity for our work to receive further consideration.
Best regards,
The Authors
Dear Reviewer rzK1,
We sincerely thank you for the constructive feedback, which has helped improve our paper. Below, we clarify the credit computation and evaluation protocol, address hyperparameter selection, and add structural controls and efficient-reasoning baselines.
Structural credit is target-facing, not gold-answer-facing: it assesses node support for reaching the target without reference answers, correctness labels, or additional LLM calls.
Why I8=0.0589? Using (α,β,γ)=(0.5,0.3,0.2), we normalize converged raw credit:
Ii=∑jIjconvIiconv.
Thus, 0.0589 is v8's normalized rather than raw credit. Appendix C.1 summarizes the reproducible computation, including the prior, raw iterations, entropy, chain aggregation, and action selection.
Credit at d=1. The prior vanishes, and propagation on a finite DAG yields zero raw mass. Our safeguard therefore sets Ii=1/N (N=∣V∣) to avoid zero path weights and denominators; we will document it explicitly.
Appendix A.9 now specifies versions, splits, indexed ranges, transformations, extraction, and aggregation. Following AoT, all methods use matched snapshots, wrappers, instances, and scoring. The main-table caption labels these subsets as restricted and matched; we will release the manifest, complete prompts, and evaluation code.
Reply to Q3. No—the sweeps reuse the main evaluation instances. The anchor (d,λlen)=(0.85,0.20) was fixed beforehand; neither instances nor preprocessing were selected from outcomes.
Rationale and sensitivity. We use conventional PageRank d=0.85[1] and empirical λlen=0.20, since information-bottleneck theory gives no universal coefficient.[2] One-at-a-time sweeps fix the other parameter, so d=0.85 reproduces the main configuration. They show sensitivity, not held-out selection or global optimality.
[1] L. Page et al., "The PageRank Citation Ranking: Bringing Order to the Web," Stanford Technical Report 1999-66, 1999. [2] N. Tishby et al., "The Information Bottleneck Method," Allerton, 1999.
Structural controls. Under DeepSeek-V3, we replace only Hi with normalized path count, aggregate descendant out-degree, or direct entropy of normalized path weights.
Path Count ignores route weights and composition; Descendant Out-degree captures branching but not complete target-reaching routes; and Path-weight Entropy uses complete paths and credit but remains length-sensitive. GRACER instead fits a distribution under credit-weighted structural-feature constraints, representing route diversity, relative credit, and path composition.
Efficient-reasoning baselines. Given the rebuttal timeline, we evaluate two representative prompting-based concise-reasoning baselines, CCoT and TALE-EP, under the same protocol, retaining AoT as the closest structured baseline.[3][4]
CCoT controls global length and TALE-EP assigns query-level budgets; neither uses graph dependencies to allocate local fidelity.
[3] S. Nayab et al., "Concise Thoughts: Impact of Output Length on LLM Reasoning and Cost," Information Sciences, 2026. [4] T. Han et al., "Token-Budget-Aware LLM Reasoning," Findings of ACL, 2025.
Removing all three components. This leaves AoT's decomposition-contraction pipeline without graph optimization and therefore corresponds to the reported AoT row.
Direct reasoning. Before graph decomposition, this inherited AoT branch applies standard CoT to the original question; its output joins the decomposition and contraction outputs in final selection. It is not a GRACER graph component.
Best regards,
The Authors