- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
This paper introduces RouterMAS, a watermarking scheme for multi-agent systems that embeds signals into task delegation distributions. Recognizing that routing choices propagate to downstream reasoning, retries, and execution costs, the authors enforce history-wise preservation of expected continuation utility and invocation cost rather than mere single-step plausibility or marginal average performance.
Critical strengths
-
Beyond characterizing the feasible subspace, the paper analyzes when no valid watermarking direction exists, when to fall back to the original router, and how value estimation errors and controller approximation errors accumulate into overall return drift.
-
Controlled finite-state experiments allow exact calculation of continuation values to cleanly isolate the effects of full value constraints, myopic value constraints, full-rank constraints, and invalid keys.
Critical weaknesses
-
Constrained cost only captures modeled runtime agent calls. The total end-to-end cost of value estimation and controller training, and how it is amortized, is not reported.
-
Confounded comparison between key-directed selection and random feasible perturbation. In Appendix Table 8, the full-constraint method induces a mean KL of 0.0929 versus just 0.0065 for random feasible perturbation. Since expected per-step LLR evidence equals conditional KL, perturbation KL must be matched to tell whether the TPR gain comes from directional selection or simply a much larger distributional shift.
Questions for authors
-
How is value preservation concretely verified on real tasks? What are the confidence level and simultaneous coverage method for the value-estimation error bound, and how many independent continuation rollouts (along with confidence intervals) are used to estimate ? Additionally, how are the exact continuation values obtained for the Exact- ablation labeled as GSM8K in Table 1? Are they computed exactly on the real system, or via an oracle within a finite proxy model?
-
What is the total end-to-end deployment cost? Please report the costs of counterfactual rollout collection, value-estimator training, controller training, online routing, and verification. When encountering unseen execution histories at test time, does the system require fresh rollouts, or does it rely solely on the trained estimator—and how do cost and value drift compare between the two?
-
Does key-directed encoding still outperform random feasible directions under a matched realized KL? Could you scale the random feasible perturbation to match the empirical KL of RouterMAS, pair it with the likelihood-ratio detector corresponding to its own perturbed routing distribution, and evaluate the isolated gain of key-directed optimization?
-
What is the cost-utility trade-off of function-preserving erasure attacks? Could you plot the trade-off curve among attack training budget, detection rate, and task utility loss, and evaluate prefix-level value drift after the attack rather than only aggregate success rate? Finally, can increasing the number of verification decisions recover detection power against erased and behavior-cloned routers?