Demo Data from EDBT 2026 / reviewers in the wild / expert
Qipeng Zhang
dblp:124/1541
· DBLP profile ↗
5ranked-venue papers
1as first author
3since 2021 · last 2025
0000-0001-6891-478XORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 2 since 2021Systems, architecture and hardware · 2 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 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.
| Artificial intelligence
2 papers |
Generative modeling · 83% Efficient and distributed learning · 17% | |
| Theoretical computer science
1 paper |
Automated reasoning and model checking · 50% Mathematical optimization · 50% | |
| Computer graphics and multimedia
1 paper |
Computer animation and physical simulation · 100% |
Topics — the 9 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Generative modeling
diffusion model |
1.6 | 2 | 2025 | Differentiable Solver Search for Fast Diffusion Sampling · ICML 2025 G2P-DDM: Generating Sign Pose Sequence from Gloss Sequence with Discrete Diffusion Model · AAAI 2024 |
Machine learning › Generative modeling › diffusion model
diffusion sampling |
0.9 | 1 | 2025 | Differentiable Solver Search for Fast Diffusion Sampling · ICML 2025 |
Machine learning › Efficient and distributed learning
model compression |
0.9 | 1 | 2025 | Differentiable Solver Search for Fast Diffusion Sampling · ICML 2025 |
Machine learning › Generative modeling › diffusion model › diffusion model acceleration
sampling acceleration |
0.9 | 1 | 2025 | Differentiable Solver Search for Fast Diffusion Sampling · ICML 2025 |
Mathematical optimization › numerical analysis
ODE solvers |
0.9 | 1 | 2025 | Differentiable Solver Search for Fast Diffusion Sampling · ICML 2025 |
Automated reasoning and model checking › satisfiability › SAT solving
solver design |
0.9 | 1 | 2025 | Differentiable Solver Search for Fast Diffusion Sampling · ICML 2025 |
Machine learning › Generative modeling › diffusion model
discrete diffusion model |
0.8 | 1 | 2024 | G2P-DDM: Generating Sign Pose Sequence from Gloss Sequence with Discrete Diffusion Model · AAAI 2024 |
Computer animation and physical simulation › gesture generation
sign language production |
0.8 | 1 | 2024 | G2P-DDM: Generating Sign Pose Sequence from Gloss Sequence with Discrete Diffusion Model · AAAI 2024 |
Machine learning › Generative modeling › vector-quantized generative models
vector-quantized autoencoder |
0.2 | 1 | 2024 | G2P-DDM: Generating Sign Pose Sequence from Gloss Sequence with Discrete Diffusion Model · AAAI 2024 |
Methods — techniques the papers use, named apart from their topics
multistep methods · 1.7lagrange interpolation · 1.7differentiable search · 1.7vector quantization · 1.5u-net · 1.5VAE · 1.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Differentiable Solver Search for Fast Diffusion SamplingabstractDiffusion models have demonstrated remarkable generation quality but at the cost of numerous function evaluations. Recently, advanced ODE-based solvers have been developed to mitigate the substantial computational demands of reverse-diffusion solving under limited sampling steps. However, these solvers, heavily inspired by Adams-like multistep methods, rely solely on t-related Lagrange interpolation. We show that t-related Lagrange interpolation is suboptimal for diffusion model and reveal a compact search space comprised of time steps and solver coefficients. Building on our analysis, we propose a novel differentiable solver search algorithm to identify more optimal solver. Equipped with the searched solver, rectified-flow models, e.g., SiT-XL/2 and FlowDCN-XL/2, achieve FID scores of 2.40 and 2.35, respectively, on ImageNet-$256\times256$ with only 10 steps. Meanwhile, DDPM model, DiT-XL/2, reaches a FID score of 2.33 with only 10 steps. Notably, our searched solver outperforms traditional solvers by a significant margin. Moreover, our searched solver demonstrates generality across various model architectures, resolutions, and model sizes. Zexian Li, Qipeng Zhang, Tianhui Song, Xubin Li, Tiezheng Ge, Bo Zheng 0007, Limin Wang 0002 |
ICML | 3 |
| 2024 | G2P-DDM: Generating Sign Pose Sequence from Gloss Sequence with Discrete Diffusion ModelabstractThe Sign Language Production (SLP) project aims to automatically translate spoken languages into sign sequences. Our approach focuses on the transformation of sign gloss sequences into their corresponding sign pose sequences (G2P). In this paper, we present a novel solution for this task by converting the continuous pose space generation problem into a discrete sequence generation problem. We introduce the Pose-VQVAE framework, which combines Variational Autoencoders (VAEs) with vector quantization to produce a discrete latent representation for continuous pose sequences. Additionally, we propose the G2P-DDM model, a discrete denoising diffusion architecture for length-varied discrete sequence data, to model the latent prior. To further enhance the quality of pose sequence generation in the discrete space, we present the CodeUnet model to leverage spatial-temporal information. Lastly, we develop a heuristic sequential clustering method to predict variable lengths of pose sequences for corresponding gloss sequences. Our results show that our model outperforms state-of-the-art G2P models on the public SLP evaluation benchmark. For more generated results, please visit our project page: https://slpdiffusier.github.io/g2p-ddm. Pan Xie, Qipeng Zhang, Taiying Peng, Hao Tang 0005, Zexian Li |
AAAI | 2 |
| 2024 | Sign Language Production with Latent Motion TransformerabstractSign Language Production (SLP) is the tough task of turning sign language into sign videos. The main goal of SLP is to create these videos using a sign gloss. In this research, we’ve developed a new method to make high-quality sign videos without using human poses as a middle step. Our model works in two main parts: first, it learns from a generator and the video’s hidden features, and next, it uses another model to understand the order of these hidden features. To make this method even better for sign videos, we make several significant improvements. (i) In the first stage, we take an improved 3D VQ-GAN to learn downsampled latent representations. (ii) In the second stage, we introduce sequence-to-sequence attention to better leverage conditional information. (iii) The separated two-stage training discards the realistic visual semantic of the latent codes in the second stage. To endow the latent sequences semantic information, we extend the token-level autoregressive latent codes learning with perceptual loss and reconstruction loss for the prior model with visual perception. Compared with previous state-of-the-art approaches, our model performs consistently better on two word-level sign language datasets, i.e., WLASL and NMFs-CSL. Pan Xie, Taiying Peng, Qipeng Zhang |
WACV | 4 |
| 2019 | JDap: Supporting in-memory data persistence in javascript using Intel's PMDK
Litong You, Qipeng Zhang, Tianyou Li, Chen Li 0009, Yuting Chen 0001, Linpeng Huang |
J. Syst. Archit. | 3 |
| 2018 | SPMP: A JavaScript Support for Shared Persistent Memory on Node.js
Qipeng Zhang, Tianyou Li, Yuting Chen 0001, Linpeng Huang, Andy Rudoff |
ICA3PP (2) | 1 |