Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Liao, Ningyi, Yu, Zihao, Zeng, Ruixiao, Luo, Siqiang
Format: Preprint
Veröffentlicht: 2024
Schlagworte:
Online-Zugang:https://arxiv.org/abs/2403.13268
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866911048017117184
author Liao, Ningyi
Yu, Zihao
Zeng, Ruixiao
Luo, Siqiang
author_facet Liao, Ningyi
Yu, Zihao
Zeng, Ruixiao
Luo, Siqiang
contents Graph Neural Networks (GNNs) have shown promising performance, but at the cost of resource-intensive operations on graph-scale matrices. To reduce computational overhead, previous studies attempt to sparsify the graph or network parameters, but with limited flexibility and precision boundaries. In this work, we propose Unifews, a joint sparsification technique to unify graph and weight matrix operations and enhance GNN learning efficiency. The Unifews design enables adaptive compression across GNN layers with progressively increased sparsity, and is applicable to a variety of architectures with on-the-fly simplification. Theoretically, we establish a novel framework to characterize sparsified GNN learning in view of the graph optimization process, showing that Unifews effectively approximates the learning objective with bounded error and reduced computational overhead. Extensive experiments demonstrate that Unifews achieves efficiency improvements with comparable or better accuracy, including 10-20x matrix operation reduction and up to 100x acceleration on graphs up to billion-edge scale.
format Preprint
id arxiv_https___arxiv_org_abs_2403_13268
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Unifews: You Need Fewer Operations for Efficient Graph Neural Networks
Liao, Ningyi
Yu, Zihao
Zeng, Ruixiao
Luo, Siqiang
Machine Learning
Databases
Graph Neural Networks (GNNs) have shown promising performance, but at the cost of resource-intensive operations on graph-scale matrices. To reduce computational overhead, previous studies attempt to sparsify the graph or network parameters, but with limited flexibility and precision boundaries. In this work, we propose Unifews, a joint sparsification technique to unify graph and weight matrix operations and enhance GNN learning efficiency. The Unifews design enables adaptive compression across GNN layers with progressively increased sparsity, and is applicable to a variety of architectures with on-the-fly simplification. Theoretically, we establish a novel framework to characterize sparsified GNN learning in view of the graph optimization process, showing that Unifews effectively approximates the learning objective with bounded error and reduced computational overhead. Extensive experiments demonstrate that Unifews achieves efficiency improvements with comparable or better accuracy, including 10-20x matrix operation reduction and up to 100x acceleration on graphs up to billion-edge scale.
title Unifews: You Need Fewer Operations for Efficient Graph Neural Networks
topic Machine Learning
Databases
url https://arxiv.org/abs/2403.13268