- Rating
- 4
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper examines whether LLM agents effectively explore potential collaborators in multi-agent interactions. A controlled two-armed delegation experiment reveals frequent premature commitment in LLM-based peer selection. The authors formulate multi-agent exploration as a partially observable stochastic game and propose Multi-Agent Contextual Exploration (MACE), which uses LinUCB with relational features to guide peer selection. Experiments on HotpotQA, Math500, and GPQA, together with a cross-benchmark transfer evaluation, report improvements over in-context, random, and fixed peer selection; the paper also provides regret guarantees under linear-bandit assumptions.
Critical strengths
-
The two-armed delegation study and peer-selection distributions highlight premature commitment in LLM-based collaboration. This is an important failure mode for systems that rely on agents to identify useful peers through interaction.
-
MACE improves peer selection and downstream performance under both contextual and model heterogeneity. Frozen-parameter evaluation, transfer to 2WikiMultihopQA, and additional appendix analyses provide useful evidence beyond the initial experiments.
Critical weaknesses
-
MACE builds on the well-established LinUCB algorithm, while the main experiments primarily compare against random selection, fixed communication, and LLM-based peer selection. Although the paper includes additional UCB experiments in the appendix, a direct comparison with standard exploration algorithms on the main benchmarks is still missing.
-
The experiments mainly focus on question-answering tasks with a fixed number of agents and relatively few interaction rounds. While these settings provide useful evidence, they do not fully demonstrate whether MACE remains effective in more dynamic environments where agent capabilities or task requirements change over time.
Questions for authors
-
Could the authors compare MACE with standard exploration algorithms, such as UCB or LinUCB, on the main benchmarks to better demonstrate its advantages?
-
The feature ablations in Appendix D.6 are useful, but could the authors further clarify how much of MACE's improvement comes from the explicit exploration mechanism versus the proposed relational features?
-
Would MACE remain effective in more dynamic multi-agent settings, where peer capabilities or task requirements change over time?
2 comments
Dear Reviewer NPXX,
We really appreciate your support for our paper! Please let us know if, by any chance, you have any additional questions. Thank you very much!
Best,
The Authors
I stand by my score, I support the publication of your paper.
Thank you for addressing my questions. I continue to support your paper, and I hope you achieve a great outcome.