Ising on the Graph: Task-specific Graph Subsampling via the Ising Model
<|reference_start|>Ising on the Graph: Task-specific Graph Subsampling via the Ising Model: Reducing a graph while preserving its overall structure 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. For this, the task's loss function does not have to be differentiable. 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.<|reference_end|>
@article{bånkestad2024ising,
    title={Ising on the Graph: Task-specific Graph Subsampling via the Ising Model},
    author={Maria B{aa}nkestad, Jennifer R. Andersson, Sebastian Mair, Jens
  Sj"olund},
    journal={arXiv preprint arXiv:2402.10206},
    year={2024},
    archivePrefix={arXiv},
    eprint={2402.10206},
    primaryClass={cs.LG cs.AI}
}