Observe Locally, Classify Globally: Using GNNs to Identify Sparse Matrix Structure
Not on the map. Why?
Abstract (arXiv)
The performance of sparse matrix computation highly depends on the matching of the matrix format with the underlying structure of the data being computed on. Different sparse matrix formats are suitable for different structures of data. Therefore, the first challenge is identifying the matrix structure before the computation to match it with an appropriate data format. The second challenge is to avoid reading the entire dataset before classifying it. This can be done by identifying the matrix structure through samples and their features. Yet, it is possible that global features cannot be determined from a sampling set and must instead be inferred from local features. To address these challenges, we develop a framework that generates sparse matrix structure classifiers using graph convolutional networks. The framework can also be extended to other matrix structures using user-provided generators. The approach achieves 97% classification accuracy on a set of representative sparse matrix shapes.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 5 of its 24 references that are in the map. First posted on arXiv 26 Jul 2023.
Builds on
5 of 24 references.
References · 5
- 2018How Powerful are Graph Neural Networks?cited by 4,355
- 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,414
- 2021On Positional and Structural Node Features for Graph Neural Networks on Non-attributed Graphscited by 49
- 2018A simple yet effective baseline for non-attributed graph classificationcited by 16
- 2022AlphaSparse: Generating High Performance SpMV Codes Directly from Sparse Matricescited by 2
Built on by
Not cited yet.