DeGCN: Accelerating Inference for Deep Graph Convolutional Networks by Exploiting Feature Similarity

Graph Convolutional Networks (GCNs) have become a key model for representation learning on graph structured data. The introduction of residual connections further breaks the depth limitation of traditional GCNs, giving rise to Deep Graph Convolutional Networks (DeepGCNs). We observe that in DeepGCNs, as network depth increases, residual feature values progressively accumulate and grow in magnitude, which significantly reduces the model’s sensitivity to variations in intermediate layer features. Consequently, even when strong feature interventions such as aggregation skipping or mean reuse are applied during inference, the residual features of the optimized model still preserve high similarity to those of the original baseline. Based on this observation, this paper proposes a redundancy aware inference algorithm DGCN for DeepGCNs and further designs a dedicated hardware accelerator DeGCN that works in coordination with it. Unlike existing GCNs accelerators that mainly focus on intra layer sparsity and storage optimization, DeGCN explicitly identifies aggregation skipping and mean reuse behaviors and dynamically organizes differentiated data paths and scheduling strategies, thereby avoiding redundant computations in intermediate layers. For the execution characteristics of the initial layers, where features are sparse and memory access is the performance bottleneck, DeGCN incorporates the CBSR adaptive sparse feature storage format and a multi encoding support mechanism to accommodate input features with different sparsity levels, thereby reducing feature access and decoding overhead. In addition, through cross layer scheduling and execution restructuring mechanisms, DeGCN enables coordinated advancement of multi level computations at the architectural level, thereby maximizing execution overlap and improving overall throughput. Compared with HS-GCN, the strongest evaluated prior accelerator, DeGCN achieves a 4.16 × speedup and 5.12 × higher energy efficiency.

Authors

Institutions

Publication Details

Journal
ACM Transactions on Architecture and Code Optimization
Published
2026-11-06
DOI
https://doi.org/10.1145/3861340
Primary Topic
Parallel Computing and Optimization Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

DeGCN: Accelerating Inference for Deep Graph Convolutional Networks by Exploiting Feature Similarity

Zhenyu Long, Hai Jin, Xiaofei Liao, Jiangqiu Shen et al.
2 links
ACM Transactions on Architecture and Code Optimization
Parallel Computing and Optimization Techniques
article

DeGCN: Accelerating Inference for Deep Graph Convolutional Networks by Exploiting Feature Similarity

Zhenyu Long, Hai Jin, Xiaofei Liao, Jiangqiu Shen, Jianhui Yue, Shunsen Lv, Yu Zhang, Wenju Zhao, Jiaqi Zhai
article en

Abstract

Graph Convolutional Networks (GCNs) have become a key model for representation learning on graph structured data. The introduction of residual connections further breaks the depth limitation of traditional GCNs, giving rise to Deep Graph Convolutional Networks (DeepGCNs). We observe that in DeepGCNs, as network depth increases, residual feature values progressively accumulate and grow in magnitude, which significantly reduces the model’s sensitivity to variations in intermediate layer features. Consequently, even when strong feature interventions such as aggregation skipping or mean reuse are applied during inference, the residual features of the optimized model still preserve high similarity to those of the original baseline. Based on this observation, this paper proposes a redundancy aware inference algorithm DGCN for DeepGCNs and further designs a dedicated hardware accelerator DeGCN that works in coordination with it. Unlike existing GCNs accelerators that mainly focus on intra layer sparsity and storage optimization, DeGCN explicitly identifies aggregation skipping and mean reuse behaviors and dynamically organizes differentiated data paths and scheduling strategies, thereby avoiding redundant computations in intermediate layers. For the execution characteristics of the initial layers, where features are sparse and memory access is the performance bottleneck, DeGCN incorporates the CBSR adaptive sparse feature storage format and a multi encoding support mechanism to accommodate input features with different sparsity levels, thereby reducing feature access and decoding overhead. In addition, through cross layer scheduling and execution restructuring mechanisms, DeGCN enables coordinated advancement of multi level computations at the architectural level, thereby maximizing execution overlap and improving overall throughput. Compared with HS-GCN, the strongest evaluated prior accelerator, DeGCN achieves a 4.16 × speedup and 5.12 × higher energy efficiency.

ACM Transactions on Architecture and Code Optimization
Michigan Technological University (US), Huazhong University of Science and Technology (CN)
Openalex Percentile: Top 13%
Parallel Computing and Optimization Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon