REVIEW 4 major objections 5 minor 24 references
Debate2Create: Robot Co-design via Multi-Agent LLM Debate
T0 review · 4 major / 5 minor · reviewed 2026-08-04 · deepseek-v4-flash
Pith's one-line read Simulator-grounded multi-agent debate can co-optimize a robot's body and reward, reporting up to 9x baseline gains on locomotion benchmarks.
desk verdict D2C's debate framework is a novel and clearly written configuration, but the abstract's five-benchmark claims are absent from the body; the paper is a single-task pilot presented with an overclaiming abstract. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The load-bearing mechanism is the thesis-antithesis-synthesis debate loop grounded in physical simulation. A design agent (thesis) proposes a morphological edit; a control agent responds with a reward function (antithesis); the design agent then revises the morphology in light of simulator feedback (synthesis). A panel of pluralistic judges—each specialized in one criterion—reads the simulation metrics and writes textured feedback, while a hall-of-fame archive carries the best pairs forward. The simulator is what makes the debate objective: proposals win or lose on measured forward distance, not on rhetorical persuasiveness. This loop is what allows the two coupled design variables to be opt
What would settle it
Re-train the specific designs and rewards reported by D2C with a substantially larger training budget or a different reinforcement-learning algorithm, then recompute the default-normalized scores; if the D2C designs no longer beat the baselines, the claim fails. A cheaper check is to run the same discovered morphologies under the default task reward: if the advantage disappears, the morphology itself is not better—only the co-designed reward is.
Extended reading notes
Core claim
On its own terms, the central discovery is that joint morphology-reward optimization can be driven by a structured dialectical debate between two specialized LLM agents, with a physics simulator serving as the impartial judge. In each round, a design agent proposes a targeted edit to exposed morphology parameters; a control agent writes a reward function tailored to that new body; both the thesis and synthesis variants are trained with reinforcement learning and evaluated on a task score; and pluralistic judges produce feedback on multiple criteria—speed, stability, energy—that feeds the next round. The reported outcome is concrete: on quadruped locomotion, the best D2C design-reward pair sc
Load-bearing premise
The load-bearing premise is that training a policy for a fixed number of PPO steps faithfully approximates the optimal policy for each proposed design-reward pair, so the reported task scores reflect design quality rather than training speed or reward-function exploitability.
Editorial extensions
If this is right
- If D2C's claim holds, robot co-design no longer requires a hand-fixed objective: the agents can shape both body and reward from task-level feedback.
- The reported transfer of D2C rewards to default morphologies in 4/5 tasks implies the discovered reward functions capture general locomotion principles, not quirks of the evolved body.
- The 18-35% gain of iterative debate over compute-matched zero-shot generation implies that the debate loop is adding value through feedback, not just through extra LLM inference.
- D2C's diverse, specialized morphologies emerging without a diversity objective suggests debate-driven search can explore design space naturally.
- Because all candidates are trained with the same fixed PPO budget, the method provides a practical, parallelizable recipe for design search in simulation.
Reading between the lines
- The debate protocol is general: any simulator that returns a scalar or vector performance metric could stand in for locomotion, so the approach could extend to manipulator design, soft robots, or control of non-robot physical systems.
- The paper's fixed training budget makes the reported scores a joint measure of design quality and trainability; an external test would be to re-train the final designs with much larger budgets or a different RL algorithm and see if the ranking survives.
- The pluralistic judges are a natural insertion point for human priorities—cost, safety, aesthetics—without changing the reward template, since the judges already abstract multiple criteria into one feedback signal.
- The authors frame the debate as thesis-antithesis-synthesis, but the judge feedback is arguably as important as the debate itself; an ablation that removes judge feedback or replaces it with the raw metric would isolate whether linguistic critique is doing causal work.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper proposes Debate2Create (D2C), a multi-agent large-language-model framework for robot co-design. A design agent and a control agent engage in a thesis–antithesis–synthesis loop, and a panel of LLM judges provides feedback grounded in simulated physics metrics. The authors formalize co-design as maximizing a task score S over morphology–reward pairs, evaluate candidate pairs in the Brax Ant environment under a fixed PPO training budget, and report that D2C discovers an Ant variant that travels 73% farther than the default morphology. The abstract additionally claims state-of-the-art results across five MuJoCo benchmarks, gains of 3.2x on Ant and nearly 9x on Swimmer, 18–35% gains over zero-shot generation, and reward transfer in 4/5 tasks.
Significance. If fully supported, a structured multi-agent LLM debate grounded in physics-based evaluation would be a meaningful contribution to robot co-design. The proposed loop is a sensible use of LLM agents, and the idea of separating training reward from task score is methodologically sound. However, the paper as submitted provides no machine-checked proofs, no code, no ablations, and no multi-seed experiments. The only numerical evidence is a single Ant result in Table I and one trajectory in Figure 2. The abstract's central quantitative claims — five benchmarks, 9x gains, transfer in 4/5 tasks — are entirely absent from the body. The significance of the work therefore cannot be assessed from this manuscript; as written it is a preliminary single-task observation, not the multi-benchmark demonstration promised in the abstract.
major comments (4)
- [Abstract and Section III/V] The abstract claims results across five MuJoCo benchmarks, with gains up to 3.2x on Ant and nearly 9x on Swimmer, and reward transfer in 4/5 tasks. The body contains none of these results. Section III is titled 'Experiments: Ant Locomotion' and reports only Ant: Table I compares the default Ant score 3715.42 with one D2C design score 6421.67. No Swimmer, no other benchmark, no baseline algorithms, and no transfer experiments appear anywhere. Section V explicitly states 'We evaluated D2C on a single task and with relatively constrained design edits.' The abstract and the body are internally inconsistent; the central quantitative claim is unsupported by the submitted evidence.
- [Section II-A and Eq. (1)] Equation (1) defines S(m, π*(m, r)) as the score of the optimal policy for a morphology–reward pair, and Eq. (2) optimizes this. The actual protocol trains PPO for 'a fixed number of steps' (Section II-A). A fixed-step PPO run does not generally produce π*(m, r); it produces a policy at a particular point in training. If the budget is small or the reward is easy to optimize, the score measures training speed or reward exploitability rather than the true quality of the (m, r) pair. The paper's interpretation of the 73% gain as evidence of better co-design is therefore not justified by the reported protocol.
- [Table I, Algorithm 1, Section II-B] The reported D2C score is the best design–reward pair selected from an archive of up to eight candidate pairs per round over K rounds (Algorithm 1, output arg max over H). No baseline is given the same number of candidates, training budget, or selection procedure. The comparison 'D2C (6421.67) vs. Ant (3715.42)' conflates the effect of the debate-driven search with the effect of selecting the best of many reward candidates and morphologies. Without a compute-matched random-search or single-agent baseline, the reported improvement could be due to candidate multiplicity rather than the multi-agent debate mechanism.
- [Section III, Figure 2, Table I] No statistical reproducibility evidence is provided. Figure 2 reports 95% confidence intervals over multiple reward candidates per design, not over independent seeds of the entire pipeline. Table I reports a single point estimate with no variance, no number of runs, and no seed information. The paper includes no code, no configuration details, and no prompt templates, so the single positive Ant result cannot be independently reproduced or checked for reward hacking. This is a load-bearing issue for the paper's only in-body experimental claim.
minor comments (5)
- [Section II-A] The reward function r is described as 'code snippet' and 'predefined template', but no template or example is given. This makes it impossible to assess the likelihood of reward hacking or to reproduce the results.
- [Abstract and Section II-B] 'GPT-5' is named as the LLM, but no version or configuration detail is provided. Given the sensitivity of LLM-driven optimization to model choice, this should be specified.
- [Section V] The limitations paragraph acknowledges single-task evaluation and constrained edits, but the abstract and intro already promise broader results. The mismatch between the abstract and the limitations should be resolved.
- [Table I] Reward terms are listed without coefficients, so the comparison between the D2C reward and the Ant default reward is qualitative only. Coefficients are needed to interpret the contribution of terms like 'height_stability' or 'pitch_alignment'.
- [Throughout] Minor editorial issues: 'Debate2Create' and 'D2C' are used interchangeably; 'theDebate2Createframework' has a spacing error in Figure 1; Eq. (2) has mismatched parentheses. These do not affect the technical content.
Circularity Check
No circular derivation: D2C is a simulator-grounded search loop; the only self-reference is a harmless prior-work citation, though the abstract's five-benchmark claims are contradicted by the body.
full rationale
D2C's derivation chain is not a derivation: Eq. (1)-(2) define a search objective, and Algorithm 1 evaluates candidate (m,r) pairs by training with LLM-proposed rewards and scoring with S. Choosing arg max over the archive is exactly the optimization being performed, not a hidden reuse of the answer. There is no fitted parameter renamed as a prediction: the LLM-generated rewards are evaluated under the separate task score S, and Section II-A explicitly separates training and evaluation to avoid reward hacking. The only self-citation, RoboMorph [3], appears as a baseline in related work and does not justify any load-bearing step; the novelty claim is independent of it. A concrete limitation passage in Section V states: "We evaluated D2C on a single task and with relatively constrained design edits," which directly contradicts the abstract's claims of five MuJoCo benchmarks, gains up to 3.2x/9x, and 4/5 reward transfer. That is an internal-evidence problem, not circularity. Likewise, the fixed PPO budget means the reported S need not equal S(m, pi*(m,r)) of Eq. (1), but that is a validity concern, not a circular one. Score 1 only for a minor non-load-bearing self-citation; no circular steps.
Assumptions & free parameters
assumptions (4)
- domain assumption Fixed-budget PPO training approximates the optimal policy π*(m,r) well enough for S(m, π*(m,r)) comparisons.
- domain assumption The simulator score S (forward distance) is a faithful, non-gameable measure of locomotion performance across morphologies.
- domain assumption GPT-5 produces syntactically and semantically valid reward code within the template after basic validation/debugging.
- domain assumption The parametric edit space of the base Ant XML contains high-performing designs; no topology changes are considered.
Cite this review
Pith. "Pith review of Debate2Create: Robot Co-design via Multi-Agent LLM Debate." pith.science (2026). https://pith.science/paper/UERL2TEG
@misc{pith2026251025850,
author = {Pith},
title = {Pith review of: Debate2Create: Robot Co-design via Multi-Agent LLM Debate},
year = {2026},
howpublished = {\url{https://pith.science/paper/UERL2TEG}},
note = {Machine review of arXiv:2510.25850}
}
read the original abstract
We introduce Debate2Create (D2C), a multi-agent LLM framework that formulates robot co-design as structured, iterative debate grounded in physics-based evaluation. A design agent and control agent engage in a thesis-antithesis-synthesis loop, while criterion-specific LLM judges provide multi-objective feedback to steer exploration. Across five MuJoCo locomotion benchmarks, D2C achieves the highest default-normalized score among the evaluated LLM-based and black-box baselines, with gains up to 3.2x on Ant and nearly 9x on Swimmer. Iterative debate yields 18-35% gains over compute-matched zero-shot generation, and D2C-generated rewards transfer to default morphologies in 4/5 tasks. These results suggest that structured, simulator-grounded multi-agent interaction is a useful mechanism for joint morphology-reward optimization under a fixed-topology, per-candidate-RL protocol. Project page: debate2create.github.io.
Figures
Reference graph
Works this paper leans on
-
[1]
Morphological computation for adaptive behavior and cognition,
R. Pfeifer, F. Iida, and G. G ´omez, “Morphological computation for adaptive behavior and cognition,” inInternational Congress Series, vol
-
[2]
Scalable co- optimization of morphology and control in embodied machines,
N. Cheney, J. Bongard, V . SunSpiral, and H. Lipson, “Scalable co- optimization of morphology and control in embodied machines,”Journal of The Royal Society Interface, vol. 15, no. 143, p. 20170937, 2018
2018
-
[3]
Robomorph: Evolving robot morphology using large language models,
K. Qiu, W. Pałucki, K. Ciebiera, P. Fijałkowski, M. Cygan, and Ł. Kuci ´nski, “Robomorph: Evolving robot morphology using large language models,”arXiv preprint arXiv:2407.08626, 2024
arXiv 2024
-
[4]
LASeR: Towards diversified and generalizable robot design with large language models,
J. Song, Y . Yang, H. Xiao, W. Peng, W. Yao, and F. Wang, “LASeR: Towards diversified and generalizable robot design with large language models,” inProceedings of the International Conference on Learning Representations (ICLR), 2025
2025
-
[5]
Code as policies: Language model programs for embodied control,
J. Liang, W. Huang, F. Xia, P. Xu, K. Hausman, B. Ichter, P. Florence, and A. Zeng, “Code as policies: Language model programs for embodied control,”arXiv preprint arXiv:2209.07753, 2022
arXiv 2022
-
[6]
Do as i can, not as i say: Grounding language in robotic affordances,
M. Ahn, A. Brohan, N. Brown, Y . Chebotar, O. Cortes, B. David, C. Finn, C. Fu, K. Gopalakrishnan, K. Hausmanet al., “Do as i can, not as i say: Grounding language in robotic affordances,”arXiv preprint arXiv:2204.01691, 2022
arXiv 2022
-
[7]
EUREKA: Human-level reward design via coding large language models,
Y . J. Ma, W. Liang, G. Wang, D.-A. Huang, O. Bastani, D. Jayaraman, Y . Zhu, L. Fan, and A. Anandkumar, “EUREKA: Human-level reward design via coding large language models,” inProceedings of the Inter- national Conference on Learning Representations (ICLR), 2024
2024
-
[8]
Dreureka: Language model guided sim-to-real transfer,
Y . J. Ma, W. Liang, H. Wang, S. Wang, Y . Zhu, L. Fan, O. Bastani, and D. Jayaraman, “Dreureka: Language model guided sim-to-real transfer,” inRobotics: Science and Systems (RSS), 2024
2024
Show all 24 references
-
[9]
Encouraging divergent thinking in large language models through multi-agent debate,
T. Liang, Z. He, W. Jiao, X. Wang, Y . Wang, R. Wang, Y . Yang, S. Shi, and Z. Tu, “Encouraging divergent thinking in large language models through multi-agent debate,”arXiv preprint arXiv:2305.19118, 2023
2023 arXiv
-
[10]
Improving factuality and reasoning in language models through multiagent debate,
Y . Du, S. Li, A. Torralba, J. B. Tenenbaum, and I. Mordatch, “Improving factuality and reasoning in language models through multiagent debate,” inForty-first International Conference on Machine Learning, 2023
2023
-
[11]
Debating with more persuasive llms leads to more truthful answers,
A. Khan, J. Hughes, D. Valentine, L. Ruis, K. Sachan, A. Radhakrishnan, E. Grefenstette, S. R. Bowman, T. Rockt ¨aschel, and E. Perez, “Debating with more persuasive llms leads to more truthful answers,”arXiv preprint arXiv:2402.06782, 2024
2024 arXiv
-
[12]
Openai gym,
G. Brockman, V . Cheung, L. Pettersson, J. Schneider, J. Schul- man, J. Tang, and W. Zaremba, “Openai gym,”arXiv preprint arXiv:1606.01540, 2016
2016 arXiv
-
[13]
Brax - a differentiable physics engine for large scale rigid body simulation,
C. D. Freeman, E. Frey, A. Raichuk, S. Girgin, I. Mordatch, and O. Bachem, “Brax - a differentiable physics engine for large scale rigid body simulation,” 2021. [Online]. Available: http://github.com/google/brax
2021
-
[14]
Prox- imal policy optimization algorithms,
J. Schulman, F. Wolski, P. Dhariwal, A. Radford, and O. Klimov, “Prox- imal policy optimization algorithms,”arXiv preprint arXiv:1707.06347, 2017
2017 arXiv
-
[15]
Text2Robot: Evolutionary robot design from text descriptions,
R. P. Ringel, Z. S. Charlick, J. Liu, B. Xia, and B. Chen, “Text2Robot: Evolutionary robot design from text descriptions,” inProceedings of the IEEE International Conference on Robotics and Automation (ICRA), 2025
2025
-
[16]
Reward design with language models,
M. Kwon, S. M. Xie, K. Bullard, and D. Sadigh, “Reward design with language models,”arXiv preprint arXiv:2303.00001, 2023
2023 arXiv
-
[17]
Language to rewards for robotic skill synthesis,
W. Yu, N. Gileadi, C. Fu, S. Kirmani, K.-H. Lee, M. G. Arenas, H.- T. L. Chiang, T. Erez, L. Hasenclever, J. Humpliket al., “Language to rewards for robotic skill synthesis,”arXiv preprint arXiv:2306.08647, 2023
2023 arXiv
-
[18]
Text2reward: Automated dense reward function generation for reinforcement learning,
T. Xie, S. Zhao, C. H. Wu, Y . Liu, Q. Luo, V . Zhong, Y . Yang, and T. Yu, “Text2reward: Automated dense reward function generation for reinforcement learning,” inInternational Conference on Learning Representations (ICLR), 2024 (07/05/2024-11/05/2024, Vienna, Austria), 2024
2024
-
[19]
Vlmgineer: Vision language models as robotic toolsmiths,
G. J. Gao, T. Li, J. Shi, Y . Li, Z. Zhang, N. Figueroa, and D. Jayaraman, “Vlmgineer: Vision language models as robotic toolsmiths,”arXiv preprint arXiv:2507.12644, 2025
2025 arXiv
-
[20]
Robomore: Llm-based robot co-design via joint optimization of morphology and reward,
J. Fang, Y . Sun, C. Ma, Q. Lu, and L. Yao, “Robomore: Llm-based robot co-design via joint optimization of morphology and reward,”arXiv preprint arXiv:2506.00276, 2025
2025 arXiv
-
[21]
Chateval: Towards better llm-based evaluators through multi- agent debate,
C.-M. Chan, W. Chen, Y . Su, J. Yu, W. Xue, S. Zhang, J. Fu, and Z. Liu, “Chateval: Towards better llm-based evaluators through multi- agent debate,”arXiv preprint arXiv:2308.07201, 2023
2023 arXiv
-
[22]
A survey on llm-as-a-judge,
J. Gu, X. Jiang, Z. Shi, H. Tan, X. Zhai, C. Xu, W. Li, Y . Shen, S. Ma, H. Liuet al., “A survey on llm-as-a-judge,”arXiv preprint arXiv:2411.15594, 2024
2024 arXiv
-
[23]
The perfect blend: Redefining rlhf with mixture of judges,
T. Xu, E. Helenowski, K. A. Sankararaman, D. Jin, K. Peng, E. Han, S. Nie, C. Zhu, H. Zhang, W. Zhou, Z. Zeng, Y . He, K. Mandyam, A. Talabzadeh, M. Khabsa, G. Cohen, Y . Tian, H. Ma, S. Wang, and H. Fang, “The perfect blend: Redefining rlhf with mixture of judges,” arXiv prep...
2024 arXiv
-
[1291]
Elsevier, 2006, pp. 22–29
2006
Reviewed August 4, 2026 · model on record in the stance chip above.
Discussion (0). Sign in to comment.