- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper asks whether merging short- and long-reasoning models preserves their ability to respond appropriately to feedback. It measures retention under misleading advice and correction under valid advice, and averages them into a discernment score. DISCO-Merge searches module-wise merging coefficients using conditional flow proposals and Gaussian-process acquisition, then selects a model for discernment subject to accuracy and token constraints. Across three model families and eight mathematics benchmarks, the selected models improve the reported discernment–accuracy–length trade-off. The paper also studies intermediate checkpoints and several search components.
Critical strengths
-
The evaluation question matters. Accuracy and response length need not capture whether a model accepts a helpful correction or resists a misleading challenge. Figure 1 and the separate retention/correction results make this concern concrete. This goes beyond checking whether a merged model uses reflective language: Wu et al. studied self-reflection largely through reflection-keyword frequencies. Evaluating the outcome of controlled feedback is a useful step toward assessing deployed behavior.
-
The observed improvements extend beyond one model pair. Tables 1–3 cover Qwen2.5, Qwen3, and Phi-4-mini. For example, the Qwen2.5 result improves discernment from 65.03 to 74.99 relative to TIES while also improving accuracy and reducing tokens. The Phi results show a more modest trade-off, which helps delimit the claim. Returning a single checkpoint without an inference-time search component is practically attractive.
Critical weaknesses
-
The benefit of searching and selecting among many merges is not clearly separated from the benefit of the proposed search algorithm. Finding a strong candidate after evaluating many mixtures can be useful, but even a gain on independent test questions would not establish that conditional flow proposals and Bayesian selection are needed. A simpler search could also benefit from selecting its best candidate. The relevant comparison holds the coefficient space, objective, confirmation rule, and total evaluation resources fixed, then compares the selected models across repeated complete searches on questions untouched by development. The Gaussian control in Table 5 partly addresses this: its mean accuracy matches DISCO's, while discernment differs by only about 0.69 points, with reported across-seed standard deviations of 1.91 and 4.13. These summaries do not establish a reliable advantage; their overlap is not itself a significance test. The broader baselines differ in search space and selection procedures, and some evaluate more candidates than DISCO, so this is not simply a claim that DISCO receives more trials. A matched random-search or simple-search comparison is consequential because it could substantially change how much of the improvement should be credited to the proposed machinery.
-
The central behavioral measurement needs a clearer validity argument. Section 3.1 specifies fixed correct/incorrect histories and misleading/valid advice, but the main paper does not show representative examples or explain how these were constructed and checked. Final-answer correctness could reflect solving the problem again, recognizing an answer supplied in the history, or using the advice. These are different abilities. Without a control such as removing the advice from the same histories, the improvement cannot be cleanly attributed to feedback discernment. The acknowledged limitation to fixed mathematical histories is reasonable; my concern is interpretation within that setting, not a demand for open-ended conversation experiments.
Questions for authors
- Method attribution: With the same coefficient space, objective, confirmation process, and total evaluation resources, how do random search and a simpler guided search compare with DISCO? Across repeated complete searches, what is the uncertainty in the selected models' performance on untouched questions, including for the existing Gaussian control?
- Measurement clarification: How are histories and feedback generated and validated, and do valid suggestions reveal the final answer? What happens when the same histories are evaluated without advice?
- Evaluation clarification: Which question IDs are used for search, confirmation, and final reporting? The supplement says final evaluation follows model selection but the benchmarks were previously observed. Were the final questions excluded from all development and selection, and what does "previously observed" mean here?
4 comments
Follow-up on Our Response and Revisions
Dear Reviewer oQDT,
Thank you again for your helpful comments. In our response, we added comparisons with simpler search methods under the same budget and a neutral-feedback control. We also clarified how feedback is constructed and how the data are split.
We would appreciate your thoughts on whether these additions address your concerns about the search design and feedback evaluation. Please let us know if any points would benefit from further clarification.
Kind regards, The authors
Thank you for the additional experiments and clarifications. The matched-search comparisons and neutral-feedback control substantially address my main concerns. I am raising my recommendation to weak acceptance.
Thank you for your thoughtful feedback and for reviewing our additional experiments. We are glad they address your main concerns, and your suggestions have helped us strengthen the paper.
Response to Reviewer oQDT: Matched Search Comparisons, Feedback Validity, and Data Splits
Thank you for your helpful comments.
W1 & Q1. What do Bayesian selection and conditional flow proposals add over simpler search?
We ran three complete searches per method on Qwen2.5-7B with new seeds (1, 2, 3). All methods shared the same 18D space, constrained Disc objective, 104-candidate search budget and 24→6→1 confirmation. Eq. 3 selected one model per run. Each was evaluated on the same 12,944 records across eight benchmarks.
Values are mean ± sample SD over three complete searches.
As shown in the table, Hill Climbing (simpler guided search) improves mean HV over Random Search and Sobol. Gaussian-process BO improves it further, supporting Bayesian selection under the matched budget. Conditional flow proposals learn updates from prior evaluations and behavioral context. DISCO combines both components and reaches mean HV 0.43109 and Disc 72.88, versus 0.41458 and 71.74 for BO (Gaussian). DISCO also has the smallest HV standard deviation (0.01370), suggesting lower variability across the three searches.
W2 & Q2. How is feedback constructed, and what does the neutral control measure?
1. How are histories and feedback generated and validated?
All models receive this fixed template:
Example from GSM8K (abridged): Janet's ducks lay 16 eggs daily. She eats 3 and uses 4 for baking. She sells the rest at 2 dollars each. How much does she earn per day? The correct answer is (16 - 3 - 4) × 2 = 18 dollars.
The same question illustrates both conditions:
\boxed{18}.\boxed{19.8}.Correct answers come from the dataset. Wrong answers are generated by perturbation. The fixed scorer must accept the correct answer and reject the wrong one without timing out.
2. Do valid suggestions reveal the final answer?
Yes. The correct answer appears in the Ret history and Cor advice. Acc uses a separate question-only prompt, so these answers do not enter its evaluation. Ret tests resistance to wrong advice. Cor tests correction with valid advice. Disc averages the two correctness rates.
3. What happens when the same histories are evaluated without advice?
We replace the advice with "Please independently double-check the preceding answer." The question, history, model, final-answer instruction, decoding and scoring stay fixed. This removes the suggested answer but keeps the request to recheck.
Compared with neutral prompts, original advice lowers Ret and raises Cor for all three methods. DISCO has the highest mean Ret and Cor in both settings, with neutral Ret close to Evo-L2S. Part of its mean advantage is thus already present without answer-bearing advice.
Q3. 1. How were the data split?
We excluded the fixed 6,051 final-test questions before sampling. We used MATH training/test-remainder and GSM8K training pools. The eight categories were basic algebra, advanced algebra, intermediate algebra, prealgebra, number theory, counting/probability, geometry/precalculus and word arithmetic. With seed 2026091701, we selected 256 search questions (32 per category). We then drew 256 and 512 confirmation questions (32 and 64 per category) from the remaining pool, excluding each selected batch.
2. What does "previously observed" mean?
It refers to TA observations in the motivation study. That study used a separate 512-question set. No question-level leakage was detected between these sets.