Collaboration topology shapes both the performance and execution cost of LLM-based multi-agent systems. Because tasks differ in complexity and required capabilities, recent approaches generate task-specific collaboration graphs that specify agent participation and information flow. However, representative topology gene...
Kai-Rui Yang, Zi-Heng Yi, Xun-Kai Li et al.· 0 citations
LLM-based multi-agent systems generate collaboration traces that record how agents plan tasks, verify intermediate results, and repair failures. Reusing these procedures requires preserving an action's prerequisites and the outputs needed by subsequent agents. Our empirical studies show that grouping these dependencies...
Kai-Rui Yang, Ming-Hao An, Xun-Kai Li et al.· 0 citations
Graph-enhanced multi-agent systems (G-MAS) coordinate large language model agents through communication graphs and role assignments, which determine how agents exchange information and divide responsibilities. However, final-score comparisons across systems combine differences in models, communication patterns, roles,...
Kai-Rui Yang, Xun-Kai Li, Kai-Xiang Zhang et al.· 0 citations
Federated graph learning enables collaborative training over decentralized graph data without sharing raw graph information. As such risks evolve, clients must learn emerging classes from private multimodal graph streams, retain historical categories, and reject samples outside the known class space. In this setting, c...
Zekai Chen, Haodong Lu, Shihao Li et al.· arXiv.org· 0 citations
OpenRTAG provides a standardized testbed for understanding robustness in TAG learning under realistic low-quality settings and systematically evaluates scenario validity and model sensitivity, compares traditional GNNs, LLM-GNNs, and a representative GFM, and investigates the effectiveness, efficiency, and robustness o...
Yu-Ze Dai, Zhi-Han Zhang, Yan Zhao et al.· arXiv.org· 0 citations
A multimodal federated graph unlearning framework built around target-specific representation decoupling that effectively removes requested information, preserves retained graph utility, and achieves a speedup over full retraining.
Haodong Lu, Zekai Chen, Weiwei Ji et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.