Limits, approximation and size transferability for GNNs on sparse graphs via graphops.
Thien LeStefanie JegelkaPublished in: CoRR (2023)
Keyphrases
- sparse approximation
- maximal cliques
- sparse data
- approximation error
- graph theory
- graph theoretic
- approximation methods
- bipartite graph
- graph clustering
- graph representation
- gaussian graphical models
- sparse approximations
- compressed sensing
- neural network
- sparse coding
- error bounds
- sparse representation
- semi supervised
- feature space
- computational complexity
- search algorithm