Demo Data from VLDB 2026 / reviewers in the wild / expert
Zimo Zhang
dblp:263/2745
· DBLP profile ↗
3ranked-venue papers
0as first author
3since 2021 · last 2026
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021Systems, architecture and hardware · 1 · 1 since 2021Computer networks · 1 · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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
1 paper |
Cloud and datacenter computing · 100% | |
| Databases, data mining, and information retrieval
1 paper |
Recommender systems · 100% | |
| Artificial intelligence
1 paper |
Deep learning architectures and training · 100% |
Topics — the 2 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cloud and datacenter computing
inference serving |
1.0 | 1 | 2026 | Bat: Efficient Generative Recommender Serving with Bipartite Attention · ASPLOS (2) 2026 |
Cloud and datacenter computing
KV cache reuse |
1.0 | 1 | 2026 | Bat: Efficient Generative Recommender Serving with Bipartite Attention · ASPLOS (2) 2026 |
Methods — techniques the papers use, named apart from their topics
prefix caching · 3.0bipartite attention · 3.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Bat: Efficient Generative Recommender Serving with Bipartite AttentionabstractGenerative Recommenders (GRs) have recently emerged as promising alternatives to traditional Deep Learning Recommendation Models (DLRMs). Despite their potential, GRs remain computationally expensive in inference, exhibiting compute-bound characteristics similar to the prefill stage of Large Language Model (LLM) inference. Prefix caching can reduce redundant computation by reusing previously constructed KV caches. However, the unique properties of GRs, i.e., highly personalized user profiles and real-time item retrieval, make cache reuse across queries challenging, resulting in limited computational savings. Jie Sun 0017, Shaohang Wang, Zimo Zhang, Peng Sun 0006, Bo Zhao 0019, Bingsheng He, Fei Wu 0001, Zeke Wang |
ASPLOS (2) | 3 |
| 2025 | Autonomous Data Scientist (ADaS): A Practical Example of the Future Role of AI in CybersecurityabstractThe volume of network traffic and elusiveness of modern cyber threats challenge the ability of cyber analysts to identify anomalous behavior in networks. In this work, we propose an autonomous agent to enhance analysts’ detection capabilities. To this end, we designed an agent to analyze feature-rich network traffic by autonomously executing the Data Analytic Development Process: (1) data engineering–prepares datasets, (2) feature engineering–selects the most representative features, (3) model engineering–chooses the best algorithm-feature combination, and (4) analytic deployment–applies the optimized analytic to the dataset and identifies anomalous behavior. We refer to this agent as an Autonomous Data Scientist (ADaS), utilizing reinforcement learning as an orchestrator to determine the optimal combination of features and unsupervised clustering algorithm. ADaS operates without labeled training data, and results on popular public datasets (NB15, IoT-23, and KDD’99) demonstrate high detection and low false alarm rates, making it reliable and novel for anomaly detection. Simone F. Green, Abigail Nelson, Zimo Zhang, Aimee Liang, Jeffrey S. Chavis, Paul Velez, Yinzhi Cao, Lanier A. Watkins |
LCN | 3 |
| 2021 | NTU-DensePose: A New Benchmark for Dense Pose Action RecognitionabstractSkeleton-based action recognition has recently gained a lot of attention in computer vision. The previous skeleton-based datasets used sparse poses to represent the human body, which always leads to a large loss of human body detail information. Therefore, the previous skeleton-based methods generally performed worse than the image-based methods. In this paper, we propose a dense-pose-based action recognition dataset NTU-DensePose. This dataset automatically annotates 37,060 video samples with two dense poses, IUV equidistant annotation and IUV equivalent annotation. Each dense pose annotation contains more than 240 keypoints per instance. So the dense-pose-based action recognition method can capture more subtle details and predict human action more accurately than the previous skeleton-based methods. To the best of our knowledge, NTU-DensePose is the first dense-pose-based action recognition dataset. Mengmeng Duan, Haoyue Qiu, Zimo Zhang, Yuan Wu 0004 |
IEEE BigData | 3 |