VLDB 2026 Research / reviewers in the wild / expert
Yongmin Hu
dblp:245/8929
· DBLP profile ↗
6ranked-venue papers
1as first author
4since 2021 · last 2026
0009-0005-1041-1748ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 3 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 3 · 3 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Precision at Scale: An End-to-End Graph-based Framework for Mitigating Network Interference in TikTok A/B TestsabstractLarge-scale A/B tests on social platforms suffer from inherent network interference, violating the Stable Unit Treatment Value Assumption (SUTVA) and distorting measured results. Industrial practices for mitigating network interference face a foundational trade-off. For scalability, they often rely on clustering static graphs, which serve as imperfect proxies for true interference pathways. Conversely, theoretically sound methods remain computationally intractable at production scale. This paper presents a production-ready framework deployed at TikTok, which integrates three core contributions to address these challenges: 1) Learned Interference Graph (LIG): Estimates interference probabilities using dynamic interaction patterns for more context-aware modeling. 2) Scalable Community Partitioning (SCP): A Spark-optimized ParLeiden implementation that performs billion-node graph clustering daily and generalizes effectively across diverse interaction types, achieving a purity score of 0.898 for group chat interactions. 3) Sensitivity-Enhanced Estimation (SEE): A multivariate system leveraging Controlled-experiment Using Pre-Experiment Data (CUPED) to mitigate variance inflation from cluster-based randomization. In live production tests, our framework reduces interference rates by 68.8%, correcting a biased treatment effect estimate from +1.44% to a statistically significant +2.08%. It also enables previously undetectable cross-ecosystem measurements, revealing a +0.2% lift in creator upload volumes driven by user-side treatments. Jiayun Ni, Seng You Paul Chee, Yongmin Hu, Runze Yu 0001 |
SIGIR | 6 |
| 2026 | gMatch: Fine-Grained and Hardware-Efficient Subgraph Matching on GPUs
Weitian Chen, Shixuan Sun, Cheng Chen 0008, Yongmin Hu, Yingqian Hu, Minyi Guo |
Proc. VLDB Endow. | 4 |
| 2025 | Effective Durable Community Search in Large Temporal Graph
Yingli Zhou, Yige Jiang, Yixiang Fang, Wensheng Luo 0002, Yongmin Hu, Yingqian Hu, Cheng Chen 0008 |
Proc. VLDB Endow. | 5 |
| 2021 | Automatic Code Generation and Optimization of Large-scale Stencil Computation on Many-core ProcessorsabstractStencil computation is an indispensable building block of many scientific applications and is widely used by the numerical solvers of partial differential equations (PDEs). Due to the complex computation patterns of different stencils and the various hardware targets (e.g., many-core processors), many domain-specific languages (DSLs) have been proposed to optimize stencil computation. However, existing stencil DSLs mostly focus on the performance optimizations on homogeneous many-core processors such as CPUs and GPUs, and fail to embrace emerging heterogeneous many-core processors such as Sunway. In addition, few of them can support expressing stencil with multiple time dependencies and optimizations from both spatial and temporal dimensions. Moreover, most stencil DSLs are unable to generate codes that can run efficiently in large scale, which limits their practical applicability. In this paper, we propose MSC, a new stencil DSL designed to express stencil computation in both spatial and temporal dimensions. It can generate high-performance stencil codes for large-scale execution on emerging many-core processors. Specially, we design several optimization primitives for improving parallelism and data locality, and a communication library for efficient halo exchange in large scale execution. The experiment results show that our MSC achieves better performance compared to the state-of-the-art stencil DSLs. Mingzhen Li 0001, Yi Liu 0013, Hailong Yang 0002, Yongmin Hu, Qingxiao Sun, Bangduo Chen, Xin You 0001, Zhongzhi Luan, Depei Qian 0001 |
ICPP | 4 |
| 2020 | Extremely Low-bit Convolution Optimization for Quantized Neural Network on Modern Computer ArchitecturesabstractWith the continuous demand for higher accuracy of deep neural networks, the model size has increased significantly. Quantization is one of the most widely used model compression methods, which can effectively reduce the model size without severe accuracy loss. Modern processors such as ARM CPU and NVIDIA GPU have already provided the support of low-bit arithmetic instructions. However, there lack efficient and practical optimizations for convolution computation towards extremely low-bit on ARM CPU (e.g., 2 ∼ 8-bit) and NVIDIA GPU (e.g., 4-bit and 8-bit). This paper explores the performance optimization methods of extremely low-bit convolution on diverse architectures. On ARM CPU, we propose two instruction schemes for 2 ∼ 3-bit and 4 ∼ 8-bit convolution with corresponding register allocation methods. In addition, we re-design the GEMM computation with data padding and packing optimizations. We also implement winograd algorithm for convolution with some specific bit width (e.g., 4 ∼ 6-bit) to achieve higher performance. On NVIDIA GPU, we propose a data partition mechanism and multi-level memory access optimizations, to better adapt the computation to GPU thread and memory hierarchy. We also propose quantization fusion to eliminate unnecessary data access. The experiment results demonstrate our implementations achieve better performance of extremely low-bit convolution compared to the state-of-the-art frameworks and libraries such as ncnn and cuDNN. To the best of our knowledge, this is the first work that provides efficient implementations of extremely low-bit convolutions covering 2 ∼ 8-bit on ARM CPU and 4-bit/8-bit on NVIDIA GPU. Qingchang Han, Yongmin Hu, Fengwei Yu, Hailong Yang 0002, Ruihao Gong, Rui Wang 0014, Zhongzhi Luan, Depei Qian 0001 |
ICPP | 2 |
| 2020 | Massively Scaling Seismic Processing on Sunway TaihuLight SupercomputerabstractCommon Midpoint (CMP) and Common Reflection Surface (CRS) are widely used methods for improving the signal-to-noise ratio in the field of seismic processing. These methods are computationally intensive and require high-performance computing. This article optimizes these methods on the Sunway many-core architecture and implements large-scale seismic processing on the Sunway Taihulight supercomputer. We propose the following three optimization techniques: 1) we propose a software cache method to reduce the overhead of memory accesses, and share data among CPEs via the register communication; 2) we re-design the semblance calculation procedure to further reduce the overhead of memory accesses; 3) we propose a vectorization method to improve the performance when processing the small volume of data within short loops. The experimental results show that our implementations of CMP and CRS methods on Sunway achieve 3.50× and 3.01× speedup on average compared to the-state-of-the-art implementations on CPU. In addition, our implementation is capable to run on more than one million cores of Sunway TaihuLight with good scalability. Yongmin Hu, Hailong Yang 0002, Zhongzhi Luan, Lin Gan 0001, Guangwen Yang 0002, Depei Qian 0001 |
IEEE Trans. Parallel Distributed Syst. | 1 |