Liangji Zhu

dblp:400/4166 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2025
0009-0000-7772-5315ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2 · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
High-performance computing · 50% Distributed systems · 30% Performance modeling and evaluation · 15%
Artificial intelligence
1 paper
Generative modeling · 100%

Topics — the 9 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Generative modeling
diffusion model
0.912025
Generative Latent Diffusion for Efficient Spatiotemporal Data Reduction · SC 2025
Distributed systems › fault tolerance
checkpointing
0.912025
Stability-preserving Lossy Compression for Large-scale Partial Differential Equations · SC 2025
High-performance computing › lossy compression
error-bounded lossy compression
0.912025
Generative Latent Diffusion for Efficient Spatiotemporal Data Reduction · SC 2025
Distributed systems
fault tolerance
0.912025
Stability-preserving Lossy Compression for Large-scale Partial Differential Equations · SC 2025
Performance modeling and evaluation › numerical algorithms
numerical stability
0.912025
Stability-preserving Lossy Compression for Large-scale Partial Differential Equations · SC 2025
High-performance computing
scientific computing
0.912025
Stability-preserving Lossy Compression for Large-scale Partial Differential Equations · SC 2025
High-performance computing
scientific data compression
0.912025
Generative Latent Diffusion for Efficient Spatiotemporal Data Reduction · SC 2025
Storage systems
data reduction
0.312025
Generative Latent Diffusion for Efficient Spatiotemporal Data Reduction · SC 2025
High-performance computing
supercomputing
0.312025
Stability-preserving Lossy Compression for Large-scale Partial Differential Equations · SC 2025

Methods — techniques the papers use, named apart from their topics

variational autoencoder · 1.7generative interpolation · 1.7conditional diffusion model · 1.7stability-preserving lossy compression · 0.9
YearPublicationVenuePosition
2025 Stability-preserving Lossy Compression for Large-scale Partial Differential Equations
abstract
Checkpoint/Restart (C/R) strategies are vital for fault tolerance in PDE-based scientific simulations, yet traditional checkpointing incurs significant I/O overhead. Lossy compression offers a scalable solution by reducing checkpoint data size, but conventional methods often lack control over physical invariants (e.g., energy), leading to instability such as oscillations or divergence in Partial Differential Equations (PDE) systems. This paper introduces a stability-preserving compression approach tailored for PDE simulations by explicitly controlling kinetic and potential energy perturbations to ensure stable restarts. Extensive experiments conducted across diverse PDE configurations demonstrate that our method maintains numerical stability with minimal error magnification—even across multiple checkpoint-restart cycles—outperforming state-of-the-art lossy compressors. Parallel evaluations on the Frontier supercomputer show up to 8.4× improvement in checkpoint write performance and 6.3× in read performance, while maintaining relative L2 errors ∼ 2e-6 throughout continued simulation. These results provide practical guidance for balancing compression accuracy, stability, and computational efficiency in large-scale PDE applications.
Qian Gong, Mark Ainsworth, Jieyang Chen, Xin Liang 0001, Liangji Zhu, Ethan Klasky, Tushar M. Athawale, Qing Liu 0002, Anand Rangarajan 0001, Sanjay Ranka, Scott Klasky
SC5
2025 Generative Latent Diffusion for Efficient Spatiotemporal Data Reduction
abstract
Generative models have demonstrated strong performance in conditional settings and can be viewed as a form of data compression, where the condition serves as a compact representation. However, their limited controllability and reconstruction accuracy restrict their practical application to data compression. In this work, we propose an efficient latent diffusion framework that bridges this gap by combining a variational autoencoder with a conditional diffusion model. Our method compresses only a small number of keyframes into latent space and uses them as conditioning inputs to reconstruct the remaining frames via generative interpolation, eliminating the need to store latent representations for every frame. This approach enables accurate spatiotemporal reconstruction while significantly reducing storage costs. Experimental results across multiple datasets show that our method achieves up to 10× higher compression ratios than rule-based state-of-the-art compressors such as SZ3, and up to 63% better performance than leading learning-based methods under the same reconstruction error.
Xiao Li 0048, Liangji Zhu, Anand Rangarajan 0001, Sanjay Ranka
SC2