Generalized Laplacian Regularized Framelet Graph Neural Networks
This paper introduces a novel Framelet Graph approach based on p-Laplacian GNN. The proposed two models, named p-Laplacian undecimated framelet graph convolution (pL-UFG) and generalized p-Laplacian undecimated framelet graph convolution (pL-fUFG) inherit the nature of p-Laplacian with the expressive power of multi-resolution decomposition of graph signals. The empirical study highlights the excellent performance of the pL-UFG and pL-fUFG in different graph learning tasks including node classification and signal denoising.
Code (1)
Tasks
DenoisingGraph LearningNode ClassificationMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Revisiting Generalized p-Laplacian Regularized Framelet GCNs: Convergence, Energy Dynamic and Training with Non-Linear Diffusion
This paper presents a comprehensive theoretical analysis of the graph p-Laplacian regularized framelet network (pL-UFG) to establish a solid understanding of its properties. We conduct a convergence analysis on pL-UFG, a…
Graph Neural NetworkA Magnetic Framelet-Based Convolutional Neural Network for Directed Graphs
Spectral Graph Convolutional Networks (spectral GCNNs), a powerful tool for analyzing and processing graph data, typically apply frequency filtering via Fourier transform to obtain representations with selective informat…
DenoisingLink PredictionNode ClassificationData-Adaptive Graph Framelets with Generalized Vanishing Moments for Graph Signal Processing
In this paper, we propose a novel and general framework to construct tight framelet systems on graphs with localized supports based on hierarchical partitions. Our construction provides parametrized graph framelet system…
DenoisingGeneralized energy and gradient flow via graph framelets
In this work, we provide a theoretical understanding of the framelet-based graph neural networks through the perspective of energy gradient flow. By viewing the framelet-based models as discretized gradient flows of some…
Graph Neural NetworkAsymptotic Theory of Eigenvectors for Latent Embeddings with Generalized Laplacian Matrices
Laplacian matrices are commonly employed in many real applications, encoding the underlying latent structural information such as graphs and manifolds. The use of the normalization terms naturally gives rise to random ma…
Uncertainty Quantification