The theoretical analysis proves that CNDGNN performs better than GCN in the conflicting nodes and explores the key design view when solving the conflicting node problem.
Wenjun Wang, Xin Cao, Ya-Wen Li et al.· Proceedings of the 32nd ACM...· 0 citations
Graph Neural Networks (GNNs) have exhibited extraordinary performance in data mining. The success depends on the message passing mechanism, which is consistent with the homophily assumption that adjacent nodes share similar behaviors. However, the connected nodes in real-world graphs often show dissimilar behaviors, wh...
Wenjun Wang, Xin Cao, Yawen Li et al.· Proceedings of the 32nd ACM...· 0 citations
Experience Memory Graph is proposed, a framework that reformulates agent failure recovery as a graph matching problem and consistently outperforms state-of-the-art reflection baselines in success rate and average reward, while requiring no test-time trial-and-error.
Wenjun Wang, Yuchen Fang, Fengrui Liu 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.