Ising on the Graph: Task-specific Graph Subsampling via the Ising Model
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912314788151296 |
|---|---|
| author | Bånkestad, Maria Andersson, Jennifer R. Mair, Sebastian Sjölund, Jens |
| author_facet | Bånkestad, Maria Andersson, Jennifer R. Mair, Sebastian Sjölund, Jens |
| contents | Reducing a graph while preserving its overall properties is an important problem with many applications. Typically, reduction approaches either remove edges (sparsification) or merge nodes (coarsening) in an unsupervised way with no specific downstream task in mind. In this paper, we present an approach for subsampling graph structures using an Ising model defined on either the nodes or edges and learning the external magnetic field of the Ising model using a graph neural network. Our approach is task-specific as it can learn how to reduce a graph for a specific downstream task in an end-to-end fashion without requiring a differentiable loss function for the task. We showcase the versatility of our approach on four distinct applications: image segmentation, explainability for graph classification, 3D shape sparsification, and sparse approximate matrix inverse determination. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_10206 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Ising on the Graph: Task-specific Graph Subsampling via the Ising Model Bånkestad, Maria Andersson, Jennifer R. Mair, Sebastian Sjölund, Jens Machine Learning Artificial Intelligence Reducing a graph while preserving its overall properties is an important problem with many applications. Typically, reduction approaches either remove edges (sparsification) or merge nodes (coarsening) in an unsupervised way with no specific downstream task in mind. In this paper, we present an approach for subsampling graph structures using an Ising model defined on either the nodes or edges and learning the external magnetic field of the Ising model using a graph neural network. Our approach is task-specific as it can learn how to reduce a graph for a specific downstream task in an end-to-end fashion without requiring a differentiable loss function for the task. We showcase the versatility of our approach on four distinct applications: image segmentation, explainability for graph classification, 3D shape sparsification, and sparse approximate matrix inverse determination. |
| title | Ising on the Graph: Task-specific Graph Subsampling via the Ising Model |
| topic | Machine Learning Artificial Intelligence |
| url | https://arxiv.org/abs/2402.10206 |