Grassmanian Interpolation of Low-Pass Graph Filters: Theory and Applications
Low-pass graph filters are fundamental for signal processing on graphs and other non-Euclidean domains. However, the computation of such filters for parametric graph families can be prohibitively expensive as computation of the corresponding low-frequency subspaces, requires the repeated solution of an eigenvalue problem. We suggest a novel algorithm of low-pass graph filter interpolation based on Riemannian interpolation in normal coordinates on the Grassmann manifold. We derive an error bound estimate for the subspace interpolation and suggest two possible applications for induced parametric graph families. First, we argue that the temporal evolution of the node features may be translated to the evolving graph topology via a similarity correction to adjust the homophily degree of the network. Second, we suggest a dot product graph family induced by a given static graph which allows to infer improved message passing scheme for node classification facilitated by the filter interpolation.
Code (0)
등록된 구현이 없습니다.
Tasks
Node ClassificationSimilar Papers 제목 키워드 기반
Design of Discrete-time Matrix All-Pass Filters Using Subspace Nevanlinna Pick Interpolation
Unitary matrix-valued functions of frequency are matrix all-pass systems, since they preserve the norm of the input vector signals. Typically, such systems are represented and analyzed using their unitary-matrix valued f…
AllBeyond Low-pass Filtering: Graph Convolutional Networks with Automatic Filtering
Graph convolutional networks are becoming indispensable for deep learning from graph-structured data. Most of the existing graph convolutional networks share two big shortcomings. First, they are essentially low-pass fil…
Graph Information Matters: Understanding Graph Filters from Interaction Probability
Graph Neural Networks (GNNs) have received extensive affirmation for their promising performance in graph learning problems. Despite their various neural architectures, most are intrinsically graph filters that provide t…
Graph LearningNode ClassificationGraph Signal Processing over a Probability Space of Shift Operators
Graph signal processing (GSP) uses a shift operator to define a Fourier basis for the set of graph signals. The shift operator is often chosen to capture the graph topology. However, in many applications, the graph topol…
Shape-aware Graph Spectral Learning
Spectral Graph Neural Networks (GNNs) are gaining attention for their ability to surpass the limitations of message-passing GNNs. They rely on supervision from downstream tasks to learn spectral filters that capture the …