arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2102.06986cs.LGcs.AIcs.NAmath.NA

How Framelets Enhance Graph Neural Networks

The University of Sydney(悉尼大学);Max Planck Institute for Mathematics in the Sciences(马克斯·普朗克科学数学研究所);Shanghai Jiao Tong University(上海交通大学);The University of New South Wales(新南威尔士大学);University of Cambridge(剑桥大学);Zhejiang Normal University(浙江师范大学);University of California, Los Angeles(加州大学洛杉矶分校)

Xuebin Zheng, Bingxin Zhou, Junbin Gao, Yu Guang Wang, Pietro Lio, Ming Li, Guido Montufar

英文摘要:

This paper presents a new approach for assembling graph neural networks based on framelet transforms. The latter provides a multi-scale representation for graph-structured data. We decompose an input graph into low-pass and high-pass frequencies coefficients for network training, which then defines a framelet-based graph convolution. The framelet decomposition naturally induces a graph pooling strategy by aggregating the graph feature into low-pass and high-pass spectra, which considers both the feature values and geometry of the graph data and conserves the total information. The graph neural networks with the proposed framelet convolution and pooling achieve state-of-the-art performance in many node and graph prediction tasks. Moreover, we propose shrinkage as a new activation for the framelet convolution, which thresholds high-frequency information at different scales. Compared to ReLU, shrinkage activation improves model performance on denoising and signal compression: noises in both node and structure can be significantly reduced by accurately cutting off the high-pass coefficients from framelet decomposition, and the signal can be compressed to less than half its original size with well-preserved prediction performance.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑