VLDB 2026 Research / reviewers in the wild / expert
Junxiang Qiu
dblp:353/9347
· DBLP profile ↗
3ranked-venue papers
2as first author
3since 2021 · last 2026
0000-0003-1257-1268ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 3 · 2 first-author · 3 since 2021Artificial intelligence and machine learning · 2 · 1 first-author · 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
3 papers |
Efficient and distributed learning · 55% Generative modeling · 45% | |
| Computer graphics and multimedia
1 paper |
Image and video processing · 100% |
Topics — the 8 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning › inference acceleration
caching |
2.7 | 3 | 2026 | Accelerating Controllable Generation via Hybrid-grained Cache · AAAI 2026 Accelerating Diffusion Transformer via Error-Optimized Cache · ACM Multimedia 2025 Accelerating Diffusion Transformer via Gradient-Optimized Cache · ICCV 2025 |
Machine learning › Generative modeling
diffusion model |
1.7 | 2 | 2025 | Accelerating Diffusion Transformer via Error-Optimized Cache · ACM Multimedia 2025 Accelerating Diffusion Transformer via Gradient-Optimized Cache · ICCV 2025 |
Machine learning › Generative modeling › diffusion model
diffusion transformer |
1.7 | 2 | 2025 | Accelerating Diffusion Transformer via Error-Optimized Cache · ACM Multimedia 2025 Accelerating Diffusion Transformer via Gradient-Optimized Cache · ICCV 2025 |
Machine learning › Generative modeling › diffusion model
controllable generation |
1.0 | 1 | 2026 | Accelerating Controllable Generation via Hybrid-grained Cache · AAAI 2026 |
Machine learning › Efficient and distributed learning
model compression |
1.0 | 1 | 2026 | Accelerating Controllable Generation via Hybrid-grained Cache · AAAI 2026 |
Machine learning › Efficient and distributed learning
inference acceleration |
0.9 | 1 | 2025 | Accelerating Diffusion Transformer via Gradient-Optimized Cache · ICCV 2025 |
Machine learning › Efficient and distributed learning
model acceleration |
0.9 | 1 | 2025 | Accelerating Diffusion Transformer via Error-Optimized Cache · ACM Multimedia 2025 |
Image and video processing
image segmentation |
0.3 | 1 | 2026 | Accelerating Controllable Generation via Hybrid-grained Cache · AAAI 2026 |
Methods — techniques the papers use, named apart from their topics
feature reuse · 2.0cross-attention map reuse · 2.0gradient-optimized cache · 0.9error-optimized cache · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Accelerating Controllable Generation via Hybrid-grained CacheabstractControllable generative models have been widely used to improve the realism of synthetic visual content. However, such models must handle control conditions and content generation computational requirements, resulting in generally low generation efficiency. To address this issue, we propose a Hybrid-Grained Cache (HGC) approach that reduces computational overhead by adopting cache strategies with different granularities at different computational stages. Specifically, (1) we use a coarse-grained cache (block-level) based on feature reuse to dynamically bypass redundant computations in encoder-decoder blocks between each step of model reasoning. (2) We design a fine-grained cache (prompt-level) that acts within a module, where the fine-grained cache reuses cross-attention maps within consecutive reasoning steps and extends them to the corresponding module computations of adjacent steps. These caches of different granularities can be seamlessly integrated into each computational link of the controllable generation process. We verify the effectiveness of HGC on four benchmark datasets, especially its advantages in balancing generation efficiency and visual quality. For example, on the COCO-Stuff segmentation benchmark, our HGC significantly reduces the computational cost (MACs) by 63% (from 18.22T → 6.70T↓), while keeping the loss of semantic fidelity (quantized performance degradation) within 1.5%. Huixia Ben, Shuo Wang 0008, Jinda Lu, Junxiang Qiu, Shengeng Tang, Yanbin Hao |
AAAI | 5 |
| 2025 | Accelerating Diffusion Transformer via Gradient-Optimized Cache
Junxiang Qiu, Shuo Wang 0008, Jinda Lu, Kezhou Chen, Yanbin Hao |
ICCV | 1 |
| 2025 | Accelerating Diffusion Transformer via Error-Optimized CacheabstractDiffusion Transformer (DiT) is a crucial method for content generation. However, it needs a lot of time to sample. Many studies have attempted to use caching to reduce the time consumption of sampling. Existing caching methods accelerate generation by reusing DiT features from the previous time step and skipping calculations in the next, but they tend to locate and cache low-error modules without focusing on reducing caching-induced errors, resulting in a sharp decline in generated content quality when increasing caching intensity. To solve this problem, we propose the Error-Optimized Cache (EOC). This method introduces three key improvements: (1) Prior knowledge extraction: Extract and process the caching differences; (2) A judgment method for cache optimization: Determine whether certain caching steps need to be optimized; (3) Cache optimization: reduce caching errors. Experiments show that this algorithm significantly reduces the error accumulation caused by caching, especially excessive caching. On the ImageNet dataset, without substantially increasing the computational load, this method improves the FID↓ of the generated images when the rule-based model FORA has a caching level of 75%, 50%, and 25%, and the training-based model Learning-to-cache has a caching level of 22%. Specifically, the FID↓ values change from 30.454 to 21.690 (28.8%), from 6.857 to 5.821 (15.1%), from 3.870 to 3.692 (4.6%), and from 3.539 to 3.451 (2.5%) respectively. Code is available at https://github.com/qiujx0520/EOC_MM2025.git. Junxiang Qiu, Shuo Wang 0008, Jinda Lu, Houcheng Jiang, Yanbin Hao |
ACM Multimedia | 1 |