- Rating
- 2
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
This paper studies post-training quantization for multi-agent LLM systems. The authors measure each message’s contribution as the drop in task score when the message is removed. They diagnose two causes of the degradation under quantization: senders lose their complementary contributions, and receivers make less use of helpful messages. Based on this, they propose Q-RoR.
Critical strengths
This paper studies post-training quantization for multi-agent LLM systems. The authors measure each message’s contribution as the drop in task score when the message is removed. They diagnose two causes of the degradation under quantization: senders lose their complementary contributions, and receivers make less use of helpful messages. Based on this, they propose Q-RoR.
Critical weaknesses
The paper frequently switches between different terms and referents for the same concepts. This substantially reduces readability, and understanding the method required considerable extra effort. This work frames its goal as the joint optimization of graph structure and model quantization. However, the experiments use only a single six-agent workflow, and the method is not evaluated under broader agent/graph settings. In addition, the optimized graph structure is reported only for Qwen3-8B (G1 in Appendix C.6); the optimized graphs for the other settings are not given. Taken together, these two points make the final results look more like an engineering advantage, and they do not fully match the motivation and findings developed at length in the earlier sections. The paper reports only inference runtime (Q5, Table 6), and it does not include the inference time of the FP model as a reference.
Questions for authors
- Could the authors report the optimized graph structures for all settings, and analyze why these optimized structures may improve multi-agent performance under quantization?
- Could the authors report the inference time of the FP model as a reference in Table 6?
- When discussing algorithmic efficiency, would it be more appropriate to compare the offline calibration and graph-search time?