Ziyang Tang

Ziyang Tang

Auto-generated profile, based on publicly available information

Ziyang Tang

Department of Computer and Information Technology, Purdue University, West Lafayette, USA

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
12 September 2023 in Nature Communications
Verified
Journal Article
Open access
PDF file
ZTZiyang Tang
Ziyang Tang
ZLZuotian Li
Zuotian Li
THTieying Hou
Tieying Hou
TZTonglin Zhang
Tonglin Zhang
BYBaijian Yang
Baijian Yang
QSQianqian Song
Qianqian Song
Recent advances in high-throughput molecular imaging have pushed spatial transcriptomics technologies to subcellular resolution, which surpasses the limitations of both single-cell RNA-seq and array-based spatial profiling. The multichannel immunohistochemistry images in such data provide rich information on the cell types, functions, and morphologies of cellular compartments. In this work, we developed a method, single-cell spatial elucidation through image-augmented Graph transformer (SiGra), to leverage such imaging information for revealing spatial domains and enhancing substantially sparse and noisy transcriptomics data. SiGra applies hybrid graph transformers over a single-cell spatial graph. SiGra outperforms state-of-the-art methods on both single-cell and spot-level spatial transcriptomics data from complex tissues. The inclusion of immunohistochemistry images improves the model performance by 37% (95% CI: 27–50%). SiGra improves the characterization of intratumor heterogeneity and intercellular communication and recovers the known microscopic anatomy. Overall, SiGra effectively integrates different spatial modality data to gain deep insights into spatial cellular ecosystems.

23 August 2025 in Nature Communications
Verified
Journal Article
Open access
PDF file
BLBo Li
Bo Li
ZTZiyang Tang
Ziyang Tang
ABAishwarya Budhkar
Aishwarya Budhkar
XLXiang Liu
Xiang Liu
TZTonglin Zhang
Tonglin Zhang
QSQianqian Song
Qianqian Song
Spatial transcriptomics (ST) technologies have transformed our understanding of cellular organization but are limited by sparse signals and restricted gene coverage. To address these challenges, we introduce SpaIM, a style transfer learning model that leverages single-cell RNA sequencing (scRNA-seq) data to predict unmeasured gene expressions in ST profiles. By disentangling shared content and modality-specific styles, SpaIM effectively integrates scRNA-seq’s rich gene expression with the spatial context of ST. Evaluated across 53 datasets spanning sequencing- and imaging-based spatial technologies in various tissue types, SpaIM consistently outperforms 12 state-of-the-art methods in improving gene coverage and expression accuracy. Furthermore, SpaIM enhances downstream analyses, including ligand-receptor interaction inference, spatial domain characterization, and differential gene expression analysis. Released as open-source software, SpaIM expands accessibility and utility in ST research. Overall, SpaIM represents a robust and generalizable framework for enriching ST data with single-cell information, enabling deeper insights into tissue architecture and cellular function.

14 October 2022 in arXiv
Verified
Preprint
Open access
PDF file
ZTZiyang Tang
Ziyang Tang
YDYiheng Duan
Yiheng Duan
SZStephanie Zhang
Stephanie Zhang
Lihong LiLihong Li
Lihong Li
Randomized experiments (a.k.a. A/B tests) are a powerful tool for estimating treatment effects, to inform decisions making in business, healthcare and other applications. In many problems, the treatment has a lasting effect that evolves over time. A limitation with randomized experiments is that they do not easily extend to measure long-term effects, since running long experiments is time-consuming and expensive. In this paper, we take a reinforcement learning (RL) approach that estimates the average reward in a Markov process. Motivated by real-world scenarios where the observed state transition is nonstationary, we develop a new algorithm for a class of nonstationary problems, and demonstrate promising results in two synthetic datasets and one online store dataset.