Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ruiyi Zhan

dblp:395/4686 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
5since 2021 · last 2026
0009-0005-4231-3237ORCID · corroborated

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

Systems, architecture and hardware · 3 · 1 first-author · 3 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Security and privacy · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 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
3 papers
GPUs and heterogeneous computing · 48% High-performance computing · 36% Parallel and multicore computing · 16%
Artificial intelligence
2 papers
Generative modeling · 36% Efficient and distributed learning · 24% Face, body and person analysis · 14%
Theoretical computer science
1 paper
Algorithms and data structures · 100%

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

TopicWeightPapersLastEvidence papers
Computer vision › Face, body and person analysis › gait analysis
gait recognition
1.012026
From Gradient Analysis to Norm Control: Rethinking Triplet Loss for Gait Recognition · IEEE Trans. Inf. Forensics Secur. 2026
Machine learning › Deep learning architectures and training
loss function design
1.012026
From Gradient Analysis to Norm Control: Rethinking Triplet Loss for Gait Recognition · IEEE Trans. Inf. Forensics Secur. 2026
Machine learning › Representation and self-supervised learning › representation learning › metric learning › deep metric learning
triplet loss
1.012026
From Gradient Analysis to Norm Control: Rethinking Triplet Loss for Gait Recognition · IEEE Trans. Inf. Forensics Secur. 2026
High-performance computing › numerical linear algebra
dense linear algebra
1.012026
Achieving 86% Peak GPU Throughput for Distributed QR Factorization · HPDC 2026
GPUs and heterogeneous computing › multi-GPU computing
distributed GPU computing
1.012026
Achieving 86% Peak GPU Throughput for Distributed QR Factorization · HPDC 2026
GPUs and heterogeneous computing › GPU computing
GPU algorithms
1.012026
Deterministic and Efficient Low Rank Approximation on GPUs · HPDC 2026
GPUs and heterogeneous computing › multi-GPU computing
GPU cluster
1.012026
Achieving 86% Peak GPU Throughput for Distributed QR Factorization · HPDC 2026
GPUs and heterogeneous computing
GPU computing
1.012026
OSLA: A High Performance One-Sided Linear Algebra Library on GPU Architectures · IEEE Trans. Parallel Distributed Syst. 2026
High-performance computing
linear algebra library
1.012026
OSLA: A High Performance One-Sided Linear Algebra Library on GPU Architectures · IEEE Trans. Parallel Distributed Syst. 2026
Parallel and multicore computing › parallel computing › parallel communication
one-sided communication
1.012026
OSLA: A High Performance One-Sided Linear Algebra Library on GPU Architectures · IEEE Trans. Parallel Distributed Syst. 2026
High-performance computing › numerical linear algebra
parallel linear algebra
1.012026
OSLA: A High Performance One-Sided Linear Algebra Library on GPU Architectures · IEEE Trans. Parallel Distributed Syst. 2026
Algorithms and data structures › matrix approximation
low-rank approximation
1.012026
Deterministic and Efficient Low Rank Approximation on GPUs · HPDC 2026
Machine learning › Generative modeling
diffusion model
0.912025
TCAQ-DM: Timestep-Channel Adaptive Quantization for Diffusion Models · AAAI 2025
Machine learning › Generative modeling › diffusion model
diffusion model acceleration
0.912025
TCAQ-DM: Timestep-Channel Adaptive Quantization for Diffusion Models · AAAI 2025
Machine learning › Generative modeling › diffusion model › diffusion model acceleration
diffusion model quantization
0.912025
TCAQ-DM: Timestep-Channel Adaptive Quantization for Diffusion Models · AAAI 2025
Machine learning › Efficient and distributed learning
model compression
0.912025
TCAQ-DM: Timestep-Channel Adaptive Quantization for Diffusion Models · AAAI 2025
Machine learning › Efficient and distributed learning › model compression › quantization
post-training quantization
0.912025
TCAQ-DM: Timestep-Channel Adaptive Quantization for Diffusion Models · AAAI 2025
Algorithms and data structures
numerical linear algebra
0.312026
Deterministic and Efficient Low Rank Approximation on GPUs · HPDC 2026

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

deterministic low rank approximation · 2.0two-level blocking · 1.0one-sided communication · 1.0norm regularization · 1.0gradient analysis · 1.0critical-path-guided pipeline · 1.0chained GEMM updates · 1.01d column block-cyclic layout · 1.0timestep-channel joint reparameterization · 0.9progressively aligned reconstruction · 0.9dynamically adaptive quantization · 0.9
YearPublicationVenuePosition
2026 Deterministic and Efficient Low Rank Approximation on GPUs
Lu Shi 0006, Weijie Shen, Ruiyi Zhan, Dajun Huang, Weiwei Xu 0006, Shaoshuai Zhang
HPDC3
2026 Achieving 86% Peak GPU Throughput for Distributed QR Factorization
abstract
This poster studies how to make distributed dense QR run efficiently on modern GPU clusters. Dense QR factorization is a core primitive for least-squares solvers, orthogonalization, eigensolvers, and many machine learning workloads. On distributed GPU systems, however, existing libraries still leave a large fraction of hardware peak unused because panel factorization and its associated communication remain on the critical path. This poster presents a macro–micro co-designed distributed QR framework. At the macro level, our approach replaces the conventional 2D block-cyclic layout with a 1D column block-cyclic layout and removes idle bubbles through a critical-path-guided pipeline. At the micro level, it optimizes the local TSQR/WY path, reshapes trailing updates with two-level blocking, and reduces workspace pressure with chained GEMM updates. It reaches 86.3% of FP32 peak on a single A100, 86.0% on a single H200, and 75.5% of peak on 8 × H200 with explicit Q. More importantly, it raises 8-GPU H200 strong-scaling efficiency to 73% versus 46% for cuSOLVERMp, directly targeting the intra-node regime most relevant in practice. It also maintains a stable 1.6 × speedup on 16 × H200.
Ruiyi Zhan
HPDC1
2026 From Gradient Analysis to Norm Control: Rethinking Triplet Loss for Gait Recognition
abstract
Gait recognition has attracted increasing attention in both academia and industry as a non-intrusive human recognition technology from a distance without requiring cooperation. Triplet loss, which enforces relative distance constraints, is a fundamental component in gait recognition. Recently, several gait-specific triplet losses have been introduced to gait recognition. However, they only focus on sample selection and weighting to enhance constraints without exploring the gradient properties of Cosine/Euclidean metrics, which fundamentally influence the model training efficiency and feature discriminability. In this paper, we theoretically analyze triplet loss gradients combined with weight decay and identify inherent limitations due to inadequate norm-control: Cosine metric triplet loss (Lcos) exhibits excessive gradients resulting from small feature norms, while Euclidean metric triplet loss (Leuc) suffers from a small margin-to-norm ratio due to large feature norms. To address these issues, we propose two norm-control approaches to constrain the feature norm in a stable range: 1) Norm-Variance-Regularized Collaboration. 2) Norm-Based Regularization. Extensive experiments show that our methods outperform state-of-the-art results under both Cosine and Euclidean evaluation metrics on three in-the-wild datasets: Gait3D, GREW, and BUAA-Duke-Gait. The code will be available at https://github.com/bgdpgz/TL-Gait.
Guozhen Peng, Yunhong Wang 0001, Zhuguanyu Wu, Shaoxiong Zhang 0001, Ruiyi Zhan, Annan Li
IEEE Trans. Inf. Forensics Secur.6
2026 OSLA: A High Performance One-Sided Linear Algebra Library on GPU Architectures
Lu Shi 0006, Ruiyi Zhan, Gaoyuan Zou, Geyong Min, Hancong Duan, Shaoshuai Zhang
IEEE Trans. Parallel Distributed Syst.2
2025 TCAQ-DM: Timestep-Channel Adaptive Quantization for Diffusion Models
abstract
Diffusion models have achieved remarkable success in the image and video generation tasks. Nevertheless, they often require a large amount of memory and time overhead during inference, due to the complex network architecture and considerable number of timesteps for iterative diffusion. Recently, the post-training quantization (PTQ) technique has proved a promising way to reduce the inference cost by quantizing the float-point operations to low-bit ones. However, most of them fail to tackle with the large variations in the distribution of activations across distinct channels and timesteps, as well as the inconsistent of input between quantization and inference on diffusion models, thus leaving much room for improvement. To address the above issues, we propose a novel method dubbed Timestep-Channel Adaptive Quantization for Diffusion Models (TCAQ-DM). Specifically, we develop a timestep-channel joint reparameterization (TCR) module to balance the activation range along both the timesteps and channels, facilitating the successive reconstruction procedure. Subsequently, we employ a dynamically adaptive quantization (DAQ) module that mitigate the quantization error by selecting an optimal quantizer for each post-Softmax layers according to their specific types of distributions. Moreover, we present a progressively aligned reconstruction (PAR) strategy to mitigate the bias caused by the input mismatch. Extensive experiments on various benchmarks and distinct diffusion models demonstrate that the proposed method substantially outperforms the state-of-the-art approaches in most cases, especially yielding comparable FID metrics to the full precision model on CIFAR-10 in the W6A6 setting, while enabling generating available images in the W4A4 settings.
Haocheng Huang, Jiaxin Chen 0002, Jinyang Guo 0002, Ruiyi Zhan, Yunhong Wang 0001
AAAI4