- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper trains an MCP-native agent (Qwen3-4B) with RL on a live pool of 70 MCP servers and 527 tools, where the agent has to search for the right tool and then call it correctly. The authors argue that when a reward for reasoning quality and a reward for tool-call correctness are simply added together, the two objectives pull against each other (a "reasoning-tool seesaw"). To address this, they apply each reward only to its own tokens (reasoning tokens vs. tool-call tokens) and project away the part of the reasoning gradient that conflicts with the tool gradient. On LiveMCPBench, success goes from 15.79% to 26.32% with slightly shorter chains of thought, and the paper reports small gains on MCP-Atlas and GAIA.
Critical strengths
-
A good, timely idea. Giving reasoning tokens and tool-call tokens separate credit is simple and intuitive, and how reasoning and tool use interact during agentic RL is a question that matters beyond MCP.
-
Training on real MCP infrastructure. RL on 70 live servers is closer to real deployment than most tool-use RL work, and the authors plan to release data, code and weights.
Critical weaknesses
- The seesaw itself is not convincingly shown.
- There is no evidence of the trade-off in behavior (reasoning improving while tool correctness drops); the only evidence is a gradient-angle plot where both settings stay around 90 degrees, over the first 100 of 512 steps.
- Li et al. (2026) already report reasoning-tool interference in agentic RL, which narrows the novelty.
- The experiments are too thin to support the claims.
- The main result is 15 vs. 25 solved tasks out of 95 from a single run, and ablation variants differ by about 2 tasks.
- The training-data section is missing ("Section ??") while training uses the same 70 servers as evaluation, and the paper contradicts itself on whether gradient surgery is needed.
Questions for authors
- Can you show the seesaw directly, e.g., reasoning reward and tool-call correctness over the full training run for the integrated vs. disentangled settings?
Response to Reviewer hs2C
Thanks for your time, we respond to your concerns one-by-one.
A: For your information, we train with one-sided reward only/both rewards and track the changes of the different components. The curves are saved in https://anonymous.4open.science/r/seesaw_figs-8702/
From the visualizations, we can see that one-sided reward impairs the performance of the other side, justifying the seesaw effect. In the original paper, we visualize the gradient conflict windows during training and the cumulative negative-cosine integral in Figure 2 (a) and (b). The curves show that our designs impair the conflict, while also giving rise to the final performance correspondingly.
A: We have evaluated MCPDisCo on LiveMCP (70 servers, 527 tools, 9 domains, 95 tasks), MCPAtlas (36 servers, 220 tools, 500 tasks), and GAIA (139 tasks for L1+L2). Overall, our method shows consistent improvements over all datasets, for which we think the empirical validation is significant enough.
We also additionally did the significant test, evaluating each method five times using different seeds. Results show significance with p<0.001.
Despite the mentioned concerns above, we would like to emphasize the generalization hierarchy of mcp calling over simple tool call (discussed in RQ3) and the OOD generalization ability of the trained policy, which is an important claim of our paper and barely mentioned by the reviewers.
Hope these can get you through the concerns. We welcome further interaction should any misunderstanding remain. Also, respectively, we merit a rejudgment on score, as a higher rating would increase the likelihood of sharing this work with the broader research community.