GSTAM: Efficient Graph Distillation with Structural Attention-Matching
<|reference_start|>GSTAM: Efficient Graph Distillation with Structural Attention-Matching: Graph distillation has emerged as a solution for reducing large graph datasets to smaller, more manageable, and informative ones. Existing methods primarily target node classification, involve computationally intensive processes, and fail to capture the true distribution of the full graph dataset. To address these issues, we introduce Graph Distillation with Structural Attention Matching (GSTAM), a novel method for condensing graph classification datasets. GSTAM leverages the attention maps of GNNs to distill structural information from the original dataset into synthetic graphs. The structural attention-matching mechanism exploits the areas of the input graph that GNNs prioritize for classification, effectively distilling such information into the synthetic graphs and improving overall distillation performance. Comprehensive experiments demonstrate GSTAM's superiority over existing methods, achieving 0.45% to 6.5% better performance in extreme condensation ratios, highlighting its potential use in advancing distillation for graph classification tasks (Code available at https://github.com/arashrasti96/GSTAM).<|reference_end|>
@article{rasti-meymandi2024gstam:,
    title={GSTAM: Efficient Graph Distillation with Structural Attention-Matching},
    author={Arash Rasti-Meymandi, Ahmad Sajedi, Zhaopan Xu, Konstantinos N.
  Plataniotis},
    journal={arXiv preprint arXiv:2408.16871},
    year={2024},
    archivePrefix={arXiv},
    eprint={2408.16871},
    primaryClass={cs.LG cs.AI}
}