Shaoyi Huang

Shaoyi Huang

Auto-generated profile, based on publicly available information

Shaoyi Huang

Stevens Institute of Technology, Hoboken, NJ, USA

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 April 2024
Verified
Conference Paper
Open access
HPHongwu Peng
Hongwu Peng
XXXi Xie
Xi Xie
KSKaustubh Shivdikar
Kaustubh Shivdikar
AHAmit Hasan
Amit Hasan
JZJiahui Zhao
Jiahui Zhao
CDCaiwen Ding
Caiwen Ding
In the acceleration of deep neural network training, the graphics processing unit (GPU) has become the mainstream platform. GPUs face substantial challenges on Graph Neural Networks (GNNs), such as workload imbalance and memory access irregularities, leading to underutilized hardware. Existing solutions such as PyG, DGL with cuSPARSE, and GNNAdvisor frameworks partially address these challenges. However, the memory traffic involved with Sparse-Dense Matrix Matrix Multiplication (SpMM) is still significant. We argue that drastic performance improvements can only be achieved by the vertical optimization of algorithm and system innovations, rather than treating the speedup optimization as an "after-thought" (i.e., (i) given a GNN algorithm, designing an accelerator, or (ii) given hardware, mainly optimizing the GNN algorithm). In this paper, we present MaxK-GNN, an advanced high-performance GPU training system integrating algorithm and system innovation. (i) We introduce the MaxK nonlinearity and provide a theoretical analysis of MaxK nonlinearity as a universal approximator, and present the Compressed Balanced Sparse Row (CBSR) format, designed to store the data and index of the feature matrix after nonlinearity; (ii) We design a coalescing enhanced forward computation with row-wise product-based Sparse Matrix-Matrix Multiplication (SpGEMM) Kernel using CBSR for input feature matrix fetching and strategic placement of a sparse output accumulation buffer in shared memory; (iii) We develop an optimized backward computation with outer product-based and Sampled Sparse Matrix Dense Matrix Multiplication (SSpMM) Kernel. We conduct extensive evaluations of MaxK-GNN and report the system training time. Experiments show that MaxK-GNN system could approach the speedup limit according to Amdahl's law. We achieve comparable accuracy to SOTA GNNs, but at a significantly increased speed: 3.22×/4.24× speedup (vs. 5.52×/7.27×) on Reddit compared to DGL and GNNAdvisor implementations. Our implementation can be found on GitHub1.

13 July 2026
Verified
Conference Paper
Open access
HZHengyi Zhu
Hengyi Zhu
GZGrace Li Zhang
Grace Li Zhang
SHShaoyi Huang
Shaoyi Huang

8 June 2025
Verified
Conference Paper
Open access
YLYuebo Luo
Yuebo Luo
SLShiyang Li
Shiyang Li
JTJunran Tao
Junran Tao
KTKiran Gautam Thorat
Kiran Gautam Thorat
XXXi Xie
Xi Xie
SHShaoyi Huang
Shaoyi Huang

26 July 2026
Verified
Conference Paper
Open access
YLYuebo Luo
Yuebo Luo
SLShiyang Li
Shiyang Li
YFYifei Feng
Yifei Feng
VKVishal Kancharla
Vishal Kancharla
SHShaoyi Huang
Shaoyi Huang
CDCaiwen Ding
Caiwen Ding

22 June 2026
Verified
Conference Paper
Open access
CYChence Yang
Chence Yang
NCNingxi Cheng
Ningxi Cheng
CZCi Zhang
Ci Zhang
LLLei Lu
Lei Lu
QTQitao Tan
Qitao Tan
GYGeng Yuan
Geng Yuan

26 July 2026
Verified
Conference Paper
Open access
YCYixiao Chen
Yixiao Chen
AAArman Akbari
Arman Akbari
AAArash Akbari
Arash Akbari
ZMZhendong Mi
Zhendong Mi
ENEnfu Nan
Enfu Nan
YWYanzhi Wang
Yanzhi Wang
Hybrid GPU-CPU deployment of large Mixture-of-Experts (MoE) models is often latency-bound by CPU-side expert execution and cross-device orchestration overhead. To overcome this limitation, we propose a structured expert routing strategy, implemented via asymmetric expert skipping, which reduces expert activation in latency-critical layers while applying lightweight magnitude compensation and norm calibration to preserve model accuracy. Experiments on quantized Qwen3 (30B and 235B) models show that our method improves end-to-end generation throughput by up to 60% while achieving 3.6% higher accuracy than uniform expert reduction under the same compute budget.