- Rating
- 4(+1)
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies the training opportunity problem in recursive agent swarm system. It identifies the problem by introducing the "update coverage" to analyze the sampling probability introduced by the depth. LACA tackles this problem by saving training trajectories to estimate a 2-stage team value to select the subteam and the order of agents to update. LACA is benchmark on 3 benchmarks, showing better performance compared with GRPO and DAPO baselines.
Critical strengths
- This paper studies swarm training, which is an important problem, where the theoretical and empirical results have large gaps.
- The experiment is detailed, which is an important evidence to support its theoretical claim.
- The high level motivation of this work is to increase the training opportunity of subsequent agents, which is reasonable to me.
Critical weaknesses
- I'm still a bit confused about the motivation of the design. See questions.
Questions for authors
- What is the motivation of altering subteam and update order?Why would it improve the performance?
- Is there any theoretical guarantee that the strategy of randomly selecting teams/orders, as described in the paper, can improve performance?
A General Response by the Authors
Dear Area Chairs and Reviewers,
Thank you for handling our submission. To support your evaluation, we briefly summarize below: (1) an overview of our work, (2) the strengths highlighted by the reviewers, and (3) the responses we provided to address their concerns.
(1) Overview of our work. Agent swarms increasingly rely on nested delegation, yet standard credit assignment only reweights team reward across roles and fails to ensure that nested policies receive usable training data. We study how delegation depth and the learning of higher-level agents limit the training opportunities of independently updated subagents, introduce update coverage to make this failure measurable, and propose LACA to address it. Our key contributions are:
(2) Strengths. We are glad that all three reviewers recognized strengths of our work. In particular:
(3) Responses to address the reviewers' concerns. We provided detailed clarifications and added new experiments along several axes:
In addition, we have incorporated the above responses in Sections 1, 2, 5, and 6 and Appendices C and E, and highlighted the revisions in blue.
We believe that the detailed point-by-point responses and the updated submission can address the reviewers' concerns. The revised submission presents a clearer motivation for recursive delegation and for LACA, with measured token costs and controlled comparisons across depths and components.
Thank you again for your time and consideration.
Sincerely, Authors of #38820