Taming Gradient Oversmoothing and Expansion in Graph Neural Networks
<|reference_start|>Taming Gradient Oversmoothing and Expansion in Graph Neural Networks: Oversmoothing has been claimed as a primary bottleneck for multi-layered graph neural networks (GNNs). Multiple analyses have examined how and why oversmoothing occurs. However, none of the prior work addressed how optimization is performed under the oversmoothing regime. In this work, we show the presence of $\textit{gradient oversmoothing}$ preventing optimization during training. We further analyze that GNNs with residual connections, a well-known solution to help gradient flow in deep architecture, introduce $\textit{gradient expansion}$, a phenomenon of the gradient explosion in diverse directions. Therefore, adding residual connections cannot be a solution for making a GNN deep. Our analysis reveals that constraining the Lipschitz bound of each layer can neutralize the gradient expansion. To this end, we provide a simple yet effective normalization method to prevent the gradient expansion. An empirical study shows that the residual GNNs with hundreds of layers can be efficiently trained with the proposed normalization without compromising performance. Additional studies show that the empirical observations corroborate our theoretical analysis.<|reference_end|>
@article{park2024taming,
    title={Taming Gradient Oversmoothing and Expansion in Graph Neural Networks},
    author={MoonJeong Park, Dongwoo Kim},
    journal={arXiv preprint arXiv:2410.04824},
    year={2024},
    archivePrefix={arXiv},
    eprint={2410.04824},
    primaryClass={cs.LG stat.ML}
}