On the stability of polynomial spectral graph filters
Spectral graph filters are a key component in state-of-the-art machine learning models used for graph-based learning, such as graph neural networks. For certain tasks stability of the spectral graph filters is important for learning suitable representations. Understanding the type of structural pert...
Main Authors: | Kenlay, H, Thanou, D, Dong, X |
---|---|
Format: | Conference item |
Language: | English |
Published: |
IEEE
2020
|
Similar Items
-
Interpretable stability bounds for spectral graph filters
by: Kenlay, H, et al.
Published: (2021) -
On the stability of graph convolutional neural networks under edge rewiring
by: Kenlay, H, et al.
Published: (2021) -
Structure-aware robustness certificates for graph classification
by: Osselin, P, et al.
Published: (2023) -
Learning heat diffusion graphs
by: Thanou, D, et al.
Published: (2017) -
Laplacian matrix learning for smooth graph signal representation
by: Dong, X, et al.
Published: (2015)