Shiyang Chen

Mr. Shiyang Chen

orcid

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
14 May 2024 in Nature Methods
Verified
Journal Article
Open access
PDF file
GAGustaf Ahdritz
Gustaf Ahdritz
NBNazim Bouatta
Nazim Bouatta
CFChristina Floristean
Christina Floristean
SKSachin Kadyan
Sachin Kadyan
QXQinghui Xia
Qinghui Xia
MAMohammed AlQuraishi
Mohammed AlQuraishi
AlphaFold2 revolutionized structural biology with the ability to predict protein structures with exceptionally high accuracy. Its implementation, however, lacks the code and data required to train new models. These are necessary to (1) tackle new tasks, like protein–ligand complex structure prediction, (2) investigate the process by which the model learns and (3) assess the model’s capacity to generalize to unseen regions of fold space. Here we report OpenFold, a fast, memory efficient and trainable implementation of AlphaFold2. We train OpenFold from scratch, matching the accuracy of AlphaFold2. Having established parity, we find that OpenFold is remarkably robust at generalizing even when the size and diversity of its training set is deliberately limited, including near-complete elisions of classes of secondary structure elements. By analyzing intermediate structures produced during training, we also gain insights into the hierarchical manner in which OpenFold learns to fold. In sum, our studies demonstrate the power and utility of OpenFold, which we believe will prove to be a crucial resource for the protein modeling community.

11 January 2023 in Informatics
Verified
Journal Article
Open access
PDF file
YWYifei Wang
Yifei Wang
SCShiyang Chen
Shiyang Chen
GCGuobin Chen
Guobin Chen
ESEthan Shurberg
Ethan Shurberg
HLHang Liu
Hang Liu
Pengyu HongPengyu Hong
Pengyu Hong
This work considers the task of representation learning on the attributed relational graph (ARG). Both the nodes and edges in an ARG are associated with attributes/features allowing ARGs to encode rich structural information widely observed in real applications. Existing graph neural networks offer limited ability to capture complex interactions within local structural contexts, which hinders them from taking advantage of the expression power of ARGs. We propose motif convolution module (MCM), a new motif-based graph representation learning technique to better utilize local structural information. The ability to handle continuous edge and node features is one of MCM’s advantages over existing motif-based models. MCM builds a motif vocabulary in an unsupervised way and deploys a novel motif convolution operation to extract the local structural context of individual nodes, which is then used to learn higher level node representations via multilayer perceptron and/or message passing in graph neural networks. When compared with other graph learning approaches to classifying synthetic graphs, our approach is substantially better at capturing structural context. We also demonstrate the performance and explainability advantages of our approach by applying it to several molecular benchmarks.

15 November 2025
Verified
Conference Paper
Open access
YSYu Sun
Yu Sun
ZCZachary Coalson
Zachary Coalson
SCShiyang Chen
Shiyang Chen
HLHang Liu
Hang Liu
ZZZhao Zhang
Zhao Zhang
LYLishan Yang
Lishan Yang

11 November 2023
Verified
Conference Paper
Open access
SCShiyang Chen
Shiyang Chen
DZDa Zheng
Da Zheng
CDCaiwen Ding
Caiwen Ding
CHChengying Huan
Chengying Huan
YJYuede Ji
Yuede Ji
HLHang Liu
Hang Liu
Graph learning is becoming increasingly popular due to its superior performance in tackling many grand challenges. While quantization is widely used to accelerate Graph Neural Network (GNN) computation, quantized training faces remarkable roadblocks. Current quantized GNN training systems often experience longer training time than their full-precision counterparts for two reasons: (i) addressing the quantization accuracy challenge leads to excessive overhead, and (ii) the optimization potential exposed by quantization is not adequately leveraged. This paper introduces Tango which re-thinks quantization challenges and opportunities for graph neural network training on GPUs with three contributions: Firstly, we introduce efficient rules to maintain accuracy during quantized GNN training. Secondly, we design and implement quantization-aware primitives and inter-primitive optimizations to speed up GNN training. Finally, we integrate Tango with the popular Deep Graph Library (DGL) system and demonstrate its superior performance over the state-of-the-art approaches on various GNN models and datasets.

26 April 2024 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
CHChengying Huan
Chengying Huan
Yongchao LiuYongchao Liu
Yongchao Liu
HZHeng Zhang
Heng Zhang
HLHang Liu
Hang Liu
SCShiyang Chen
Shiyang Chen
YWYanjun Wu
Yanjun Wu
Temporal graphs are widely used for time-critical applications, which enable the extraction of graph structural information with temporal features but cannot be efficiently supported by static graph computing systems. However, the current state-of-the-art solutions for temporal graph problems are not only ad-hoc and suboptimal, but they also exhibit poor scalability, particularly in terms of their inability to scale to evolving graphs with flexible edge modifications (including insertions and deletions) and diverse execution environments. In this paper, we present two key observations. Firstly, temporal path problems can be characterized as topological-optimum problems, which can be efficiently resolved using a universal single-scan execution model. Secondly, data redundancy in transformed temporal graphs can be mitigated by merging superfluous vertices. Building upon these fundamental insights, we propose TeGraph+, a versatile temporal graph computing engine that makes the following contributions: (1) a unified optimization strategy and execution model for temporal graph problems; (2) a novel graph transformation model with graph redundancy reduction strategy; (3) a spanning tree decomposition (STD) based distributed execution model which uses an efficient transformed graph decomposition strategy to partition the transformed graph into different spanning trees for distributed execution; (4) an efficient mixed imperative and lazy graph update strategy that offers support for evolving graphs with flexible edge modifications; (5) a general system framework with user-friendly APIs and the support of various execution environments, including in-memory, out-of-core, and distributed execution environments. Our extensive evaluation reveals that TeGraph+ can achieve up to $241\times$ speedups over the state-of-the-art counterparts.

11 November 2023
Verified
Conference Paper
Open access
WFWang Feng
Wang Feng
SCShiyang Chen
Shiyang Chen
HLHang Liu
Hang Liu
YJYuede Ji
Yuede Ji
The K shortest path (KSP) algorithm, which finds the top K shortest simple paths from a source to a target vertex, has a wide range of real-world applications, e.g., routing, vulnerability detection, and biology analysis. While the top K shortest simple paths offer invaluable insights, computing them is time-consuming. For example, on a Twitter graph (61.6M vertices and 1.5B edges), the best parallel method needs about 20 minutes to get 128 shortest paths between two vertices. A key observation we made is existing works search K shortest paths from the original graph, while top K shortest paths only cover a meager portion of the original graph, e.g., less than 0.001% on a Twitter graph for K = 128. This paper introduces PeeK, a pruning-centric approach for KSP computation. First, PeeK applies K upper bound pruning to prune the vertices and edges that will not appear in any of the K shortest paths. Second, PeeK adaptively compacts the graph that, not only removes the deleted vertices or edges but also efficiently computes the downstream task. Furthermore, we design efficient techniques to parallelize and distribute PeeK. We compare PeeK with five algorithms on various graphs. For parallel computation with 32 threads, PeeK achieves 5.1× and 28.8× speedup over the state-of-the-art for K = 8, 128, respectively. More importantly, when K increases, the runtime of PeeK is barely affected. In particular, when K increases from 2 to 128 (64×), the runtime of PeeK only increases 1.1×, while the state-of-the-art method increases 10.3×.