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 |
---|---|
格式: | Conference item |
語言: | English |
出版: |
IEEE
2020
|
相似書籍
-
Interpretable stability bounds for spectral graph filters
由: Kenlay, H, et al.
出版: (2021) -
On the stability of graph convolutional neural networks under edge rewiring
由: Kenlay, H, et al.
出版: (2021) -
On spectral polynomial of splices and links of graphs
由: Harishchandra Ramane, et al.
出版: (2022-12-01) -
Structure-aware robustness certificates for graph classification
由: Osselin, P, et al.
出版: (2023) -
The spectral polynomials of two joining graphs: splices and links
由: Feriha Celik, et al.
出版: (2022-01-01)