TEDDY: Trimming Edges with Degree-based Discrimination strategY
<|reference_start|>TEDDY: Trimming Edges with Degree-based Discrimination strategY: Since the pioneering work on the lottery ticket hypothesis for graph neural networks (GNNs) was proposed in Chen et al. (2021), the study on finding graph lottery tickets (GLT) has become one of the pivotal focus in the GNN community, inspiring researchers to discover sparser GLT while achieving comparable performance to original dense networks. In parallel, the graph structure has gained substantial attention as a crucial factor in GNN training dynamics, also elucidated by several recent studies. Despite this, contemporary studies on GLT, in general, have not fully exploited inherent pathways in the graph structure and identified tickets in an iterative manner, which is time-consuming and inefficient. To address these limitations, we introduce TEDDY, a one-shot edge sparsification framework that leverages structural information by incorporating edge-degree information. Following edge sparsification, we encourage the parameter sparsity during training via simple projected gradient descent on the $\ell_0$ ball. Given the target sparsity levels for both the graph structure and the model parameters, our TEDDY facilitates efficient and rapid realization of GLT within a single training. Remarkably, our experimental results demonstrate that TEDDY significantly surpasses conventional iterative approaches in generalization, even when conducting one-shot sparsification that solely utilizes graph structures, without taking feature information into account.<|reference_end|>
@article{seo2024teddy:,
    title={TEDDY: Trimming Edges with Degree-based Discrimination strategY},
    author={Hyunjin Seo, Jihun Yun, Eunho Yang},
    journal={arXiv preprint arXiv:2402.01261},
    year={2024},
    archivePrefix={arXiv},
    eprint={2402.01261},
    primaryClass={cs.LG cs.AI}
}