- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper addresses the problem of removing unnecessary agents in multi-agent systems to reduce cost, and proposes a method based on Markov chains, weighted first-passage time, and greedy pruning for agent reduction.
Critical strengths
I suppose that this paper has almost no strengths that would warrant acceptance at ICLR. As I discuss in the weaknesses below, the paper has significant problems in both motivation and experiments, which are difficult to resolve during the rebuttal period. This is why I give my rating.
Critical weaknesses
- The weakness of "redundancy of agents" and "evaluation of pruning combinations" mentioned by the authors are inherent challenges of the multi-agent optimization task itself. There is a lack of analysis regarding the shortcomings of existing prior work, making it uncertain that what is the contribution lies relative to prior work. This not only lacks inspiration for related research but also casts doubt on the value of the paper itself.
- Although many related works are discussed, the paper only compares the proposed method with simple pruning strategies, lacking comparison with the current mainstream multi-agent methods, which calls into question the effectiveness of the method.
Questions for authors
- There are many overly defensive statements in the paper. For example, Lines 239–240 claim that "It does not establish optimality of a particular pruning ranking or identify the cause of an empirical difference between retained subsets". Lines 425–426 note that "These comparisons do not establish superiority of marginal efficiency under the specified quality-constrained cost objective". While this is not strong evidence, such self-negation of the proposed method appears odd and I hopes that this could bring the AC's attention.
- Sections 3 and 4 contain many confusing or undefined symbols, such as , .