- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes CoGMem, a framework for communication-budgeted retrieval across agent-private graph memories. It combines heterogeneous GNN retrieval, complementarity-aware gossip, self-vote-protected fusion, and gap-triggered multi-round negotiation. Experiments on GTSQA and Episodic Memory show strong improvements over lexical and system-like baselines. Notably, CoGMem-n matches high-communication hit@1 using only 38% of the bytes on Episodic Memory, although hit@10 decreases substantially.
Critical strengths
-
Important problem and clear insight. Communication-efficient retrieval across private agent memories is a meaningful problem. Using retrieval relevance and information complementarity to guide communication is an intuitive and potentially useful idea.
-
Strong empirical evidence for the learned retriever. The GNN ablations show substantial performance degradation when learned components are removed. The paper also reports accuracy–communication trade-offs and negative findings transparently.
Critical weaknesses
-
Unclear communication assumptions and accounting. The complementarity gate requires knowing whether a candidate exists in the receiver's private graph, relying on cross-partition SAME_AS alignment. How this information is obtained without additional communication or shared knowledge is insufficiently explained. Moreover, Algorithm 1 describes receiver-specific pairwise exchanges, while the communication bound and byte accounting scale linearly with the number of agents. This directly affects the validity of the central communication-efficiency claim.
-
Insufficient evidence for the proposed communication policy's independent contribution. Single-round CoGMem essentially matches High Communication at nearly identical byte costs. CoGMem-n preserves hit@1 with fewer bytes but substantially reduces hit@10, while removing targeted follow-ups leaves hit@1 unchanged. A simple budget-matched top-K truncation baseline using the same GNN and fusion is needed to establish whether complementarity-aware gossip and negotiation provide benefits beyond a strong retriever with candidate truncation.
Questions for authors
-
How are receiver-specific inventories and SAME_AS bridges established and accessed? Does the reported byte accounting include all required cross-agent communication, particularly receiver-specific messages?
-
How does CoGMem-n compare against simple relevance-based top-K truncation under the same byte budget, using the identical GNN encoder and fusion mechanism? This comparison would help establish the independent value of the proposed communication policy.