A Regularized Graph Neural Network Based on Approximate Fractional Order Gradients
Zijian Liu, Yaning Wang, Yang Luo, Chunbo Luo
Source abstract
Graph representation learning is a significant challenge in graph signal processing (GSP). The flourishing development of graph neural networks (GNNs) provides effective representations for GSP. To effectively learn from graph signals, we propose a regularized graph neural network based on approximate fractional order gradients (FGNN). The regularized graph neural network propagates the information between neighboring nodes. The approximation strategy for calculating fractional order derivatives avoids falling into fractional order extrema and overcomes the high computational complexity of fractional order derivatives. We further prove that such an approximation is feasible and FGNN is unbiased towards the global optimization solution. Extensive experiments on citation and community networks show that the proposed FGNN has improved recognition accuracy and convergence speed than vanilla FGNN. The five datasets of different sizes and domains confirm the great scalability of our proposed method.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.