In this paper, we first identify the fundamental issue in adversarial graph learning: the mixture dis-
tribution between clean and attacked data samples. Motivated by this problem, we propose Graph
Adversarial Mixture of Experts (GAME), a novel method to improve the model capacity, augment
adversarial graphs, and enrich the graph representation diversity. For acquiring these triple im-
provements, GAME contains three innovative components, including a plug-and-play GAME layer,
a decoupling graph adversarial training strategy DECOG, and a graph diversity regularization strat-
egy GRADIV. GAME outperforms other baselines when evaluated on several datasets given different attack methods. Additional experimental analyses prove the effectiveness of GAME in handling the
complex mixture distribution, generating distinct adversarial graphs, and learning distinguishable
representations.
Chunhui Zhang, Yijun Tian, Mingxuan Ju, Zheyuan (Frank) Liu , Yanfang Ye, Nitesh Chawla, and Chuxu Zhang