- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
In this paper, the authors propose Adaptive Dependency Graph Verification, a training-free framework for process-level verification of LLM reasoning. This method incrementally decomposes a reasoning trajectory into atomic units, constructs a dependency DAG, and verifies each step using its recursively retrieved ancestor context. The conducted experiments on some math benchmarks with Qwen2.5 series models verifiers show improved first-error localization over GoV in many settings. The paper also reports GPT-4o and DeepSeek rationale audits, with approximately 2–11% reductions in verifier context length.
Critical strengths
ADGV addresses a meaningful problem that full-history verification can expose the verifier to irrelevant reasoning, while fixed decomposition may fail to reflect instance-specific dependencies. The proposed ancestor-based context construction is simple, intuitive, and compatible with existing verifier models without additional training. The evaluation covers multiple mathematical benchmarks and verifier scales.
Critical weaknesses
The core pipeline is under-specified and its efficiency claims are incomplete. The paper does not clearly identify the model used for decomposition and dependency analysis, the number of additional inference calls, parsing or invalid-output handling, graph-construction accuracy, or the total end-to-end token and latency cost. Therefore, the reported 2–11% context reduction does not account for the overhead introduced by ADGV itself. In addition, the mapping between newly created atomic-step indices and ProcessBench’s original annotated step indices is unclear, and PARC is mentioned as a baseline but is absent from the reported tables.
Questions for authors
Please refer to the weaknesses above for the concerns. Below are some additionals:
- The experimental setup states that PARC is included in the comparison, but no PARC results appear in the tables. Was PARC evaluated under the same setting?
- Is decomposition and dependency analysis performed by the same verifier model or by a separate model? Please specify the model, decoding settings, and total additional inference cost.