- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes a training-free framework for mathematical reasoning that integrates Multi-Expert Reasoning, Logic-Preserving Reasoning Abstraction and Chain-level Validation. The framework aims to extract reusable reasoning structures from instance-specific solutions. Experiments on six mathematical reasoning benchmarks demonstrate that the proposed method outperforms several baselines.
Critical strengths
- The paper presents a approach to abstracting reusable reasoning structures from instance-specific mathematical solutions, potentially improving generalization across related problems.
Critical weaknesses
- The proposed method appears to be incremental, with somewhat limited methodological novelty. Several key components, including multi-expert reasoning, logic-preserving query mutation, reasoning abstraction and chain-level validation, are closely related to existing methods (like AdaR, AoT, RLAD).
- The proposed method is specifically designed for mathematical reasoning. However, most of the baselines in Table 1 are general-purpose reasoning optimization methods (LaTRO, GRPO, RAFT++, GPG, InTRO, IC-DAPO). Although they are evaluated on mathematical benchmarks, their underlying methodologies are not specifically designed for mathematical tasks. I recommend including more methods specifically developed for mathematical reasoning, such as those discussed in the Mathematical Reasoning with LLMs part of Related Work, regardless of whether they are training-free or training-based. Additionally, it would be better to evaluate the framework using current proprietary LLMs, such as GPT-5.6 and Claude Opus, as backbone models. Because current experiments show that larger Qwen models benefit less than smaller ones, it is necessary to investigate whether this method works on SOTA models.
Questions for authors
- I wonder whether Logic-Preserving Query Mutation truly preserves the underlying logic. Similar accuracy does not necessarily imply equivalent underlying reasoning structures, so the current experiment shown in Table 4 is insufficient to validate the assumption of logic preservation.
2 comments
Thank you very much for your positive feedback and for acknowledging that your concerns have been fully addressed. We truly appreciate your time and careful consideration.
Since the main concerns are now resolved through our rebuttal and clarifications, we would sincerely appreciate it if you could kindly consider raising your score accordingly. This would mean a great deal to us.
Q1: The proposed method appears to be incremental, with somewhat limited methodological novelty. Several key components, including multi-expert reasoning, logic-preserving query mutation, reasoning abstraction and chain-level validation, are closely related to existing methods (like AdaR, AoT, RLAD).
R1: Thank you for the opportunity to clarify our novelty. Our key contribution is mutation-tested, step-level abstraction: we select ALE–CG reasoning patterns by testing whether they apply to both the original query and its mutated variant.
Unlike AdaR’s use of variants for RLVR training, our test runs at inference time without parameter updates. Unlike AoT’s abstraction-level reasoning, we explicitly test individual ALE–CG candidates on a mutated instance. Unlike RLAD’s jointly trained abstraction and solution policies, we construct and validate problem-specific abstractions at inference time and audit the resulting chain. The additional comparison with AbstRaL and RLAD below complements these methodological distinctions. Due to time constraints, we will extend it to the remaining benchmarks in the next revision.
Q2: The proposed method is specifically designed for mathematical reasoning. However, most of the baselines in Table 1 are general-purpose reasoning optimization methods (LaTRO, GRPO, RAFT++, GPG, InTRO, IC-DAPO). Although they are evaluated on mathematical benchmarks, their underlying methodologies are not specifically designed for mathematical tasks. I recommend including more methods specifically developed for mathematical reasoning, such as those discussed in the Mathematical Reasoning with LLMs part of Related Work, regardless of whether they are training-free or training-based. Additionally, it would be better to evaluate the framework using current proprietary LLMs, such as GPT-5.6 and Claude Opus, as backbone models. Because current experiments show that larger Qwen models benefit less than smaller ones, it is necessary to investigate whether this method works on SOTA models.
R2: Thank you for the suggestions. We add AbstRaL and RLAD, two abstraction-based mathematical-reasoning methods from ICLR 2026, alongside IC-DAPO, our strongest original baseline. Our method outperforms all three on all four benchmarks with both Qwen3.5-4B and Qwen3.5-9B (first table).
We also evaluate Qwen3.5-27B, Qwen3.5-122B-A10B, Qwen3.5-397B-A17B, and GPT5.6-Sol, each with and without our framework. Improvements persist across all four benchmarks for every backbone (second table), showing benefits beyond small models despite generally narrowing gains.
Questions For Authors
Q3: I wonder whether Logic-Preserving Query Mutation truly preserves the underlying logic. Similar accuracy does not necessarily imply equivalent underlying reasoning structures, so the current experiment shown in Table 4 is insufficient to validate the assumption of logic preservation.
R3: Thank you for highlighting this limitation. We add an LLM-assisted review of 270 original–mutated pairs before validator filtering using GPT-6.1 Sol. The review finds that 251 preserve the core reasoning logic; ten contain incomplete variable substitutions, eight contain notation or context inconsistencies, and one remains unresolved. These direct checks support that our mutation procedure preserves the core reasoning logic in most cases.