- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes MetaThink, an adaptive reasoning framework based on multi-token metacognitive reasoning. It aims to reduce the computational overhead caused by large reasoning models using long CoT reasoning for problems of different difficulty levels. MetaThink introduces a multi-token natural language metacognitive stage before the actual reasoning process, allowing the model to assess whether a problem requires CoT. The authors also design a reward function that gives higher rewards to correct non-CoT responses, enabling the model to learn an adaptive reasoning strategy through GRPO. Experiments are conducted on DeepSeek-R1-Distill-Qwen-1.5B and 7B across three mathematical reasoning benchmarks.
Critical strengths
-
The proposed method is relatively simple and can be easily integrated into the standard GRPO training framework.
-
MetaThink achieves better experimental results than several existing adaptive reasoning methods.
Critical weaknesses
-
Compared with single-token decisions, MetaThink introduces additional autoregressive computation and natural language generation. Therefore, it is unclear whether the performance improvements actually come from the multi-token metacognitive stage. The current evidence is not sufficient to show how much benefit the metacognitive content itself provides compared with other decision mechanisms under the same computational budget.
-
The experiments mainly focus on mathematical reasoning tasks with verifiable answers. It remains unclear how well the proposed method generalizes to other types of tasks.
Questions for authors
-
Could the authors provide more details or quantitative results comparing MetaThink with control methods that use a similar number of decision tokens but do not generate problem-specific metacognitive content? For example, a control method could use a fixed or generic multi-token prefix before making the same CoT/Non-CoT decision.
-
For problems where MetaThink chooses Non-CoT, how many incorrect answers become correct when CoT is forced? Conversely, for problems where MetaThink chooses CoT, how many can still be answered correctly when Non-CoT is forced? In addition, under the same CoT usage rate or average token budget, how much accuracy improvement does MetaThink achieve compared with random routing or other simple routing strategies?
4 comments
(2) Simple routing strategies. Under matched cost (question-length routing assigns CoT to the longest questions at the same CoT rate):
| Routing Strategy | MATH500 Acc |
|---|---|
| Random (same CoT rate) | 79.9 |
| Random (same token budget) | 83.1 |
| Question length (same CoT rate) | 81.8 |
| MetaThink | 84.8 |
MetaThink outperforms these strategies by +4.9, +1.7, and +3.0, respectively. This confirms that the gains come from problem-aware routing, not just from using CoT less often.
Both analyses have been added as the new Section 4.4 (L461-L479), highlighted in : the simple routing strategies are reported in Table 6 (L468-L474) and the forced-mode analysis in Table 7 (L487-L492).
Dear Reviewer,
I hope this message finds you well. As the discussion period is nearing its end with only four days remaining, I wanted to ensure we have addressed all your concerns satisfactorily. If there are any additional points or feedback you'd like us to consider, please let us know. Your insights are invaluable to us, and we're eager to address any remaining issues to improve our work.
Thank you again for your time and effort in reviewing our submission.
Dear Reviewer heZk,
Thank you for your careful review and constructive suggestions. We have addressed each of your concerns:
- We add the requested fixed, length-matched training control, supporting the contribution of metacognitive content beyond additional decision tokens.
- We add coding experiments demonstrating generalization beyond mathematical reasoning.
- We provide the requested forced-mode analysis, quantifying when switching the selected reasoning mode helps or hurts.
- We compare against random and question-length routing under matched costs, demonstrating the benefit of learned routing.
As the discussion phase draws to a close, we believe these experiments address your concerns about the mechanism, generalization, and routing quality. We would appreciate your confirmation and would be happy to clarify any remaining points.
Thank you again for your time and thoughtful feedback.
Best regards,
Authors
We sincerely thank you for your insightful and constructive comments. In response, we have thoroughly revised the manuscript to enhance its clarity and rigor. Below, we address each of your comments in turn, and revisions made specifically in response to your comments are highlighted in blue in the revised manuscript for your convenience. Two of the new experiments were also requested by other reviewers and therefore carry their colors: the length-matched training control (Q1) is highlighted in red (shared with Reviewer 1), and the coding experiment (Q2) is highlighted in green (shared with Reviewer 2).
A1: Thank you for your suggestion. Following it, we trained a Fixed variant on DeepSeek-R1-Distill-Qwen-1.5B (λ = 1.1), replacing the learned meta block with a fixed, length-matched generic template followed by the same decision statement, under identical SFT and RL settings.
The Fixed variant still collapses (CoT rate 0.8%, accuracy 76.8), while ours does not. Since the two variants differ only in whether the meta block carries meaningful content, this shows that it is the metacognitive content, not a longer decision sequence, that prevents decision collapse.
We have added this experiment to Section 4.3 (L426-L430) and Table 5 (L454-L459), highlighted in red because it is shared with Reviewer 1. The sentence relating this training-time control to the Appendix E interventions (Section 4.3, L431) is highlighted in blue.
A2: Thank you for the question. We conducted an experiment in the coding domain. We trained DeepSeek-R1-Distill-Qwen-1.5B on the DeepCoder-Preview-Dataset and evaluated on MBPP+ and HumanEval+:
MetaThink matches the Pass@1 of Vanilla CoT RL while using CoT on only 56.3% (MBPP+) and 42.6% (HumanEval+) of problems, and outperforms AdaptThink in Pass@1 on both benchmarks. This shows that our method generalizes beyond mathematics. Extending it to interactive tool-use agents is a promising direction for future work.
We have added this experiment as the new Section 4.5 (L481-L485), with the results in Table 8 (L494-L503), highlighted in green because it is shared with Reviewer 2.
A3: Thank you for the questions. We analyze these questions using MetaThink-1.5B (λ=1.2) on MATH500 because its 56.4% CoT rate gives balanced CoT and Non-CoT samples.
(1) Forced-mode analysis. We forced the opposite mode on each problem and regenerated:
Non-CoT decisions are mostly correct. 90.4% of these problems are already solved, and forcing CoT gains only 18 problems (3.6% of MATH500), the small cost λ=1.2 accepts in exchange for efficiency. CoT decisions are necessary. Forcing Non-CoT would lose 79 correct answers (34.8%).