VLDB 2026 Research / reviewers in the wild / expert
Zetong Zhou
dblp:313/1864
· DBLP profile ↗
3ranked-venue papers
0as first author
3since 2021 · last 2025
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 2 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021Databases, data management, data science and information retrieval · 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.
| Artificial intelligence
2 papers |
Vision and language · 57% Language models and text generation · 19% Knowledge representation and reasoning · 19% | |
| Software engineering, system software, and programming languages
1 paper |
Program synthesis and code generation · 100% | |
| Databases, data mining, and information retrieval
1 paper |
Information retrieval · 100% |
Topics — the 10 heaviest of 10, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Knowledge, reasoning and agents › Knowledge representation and reasoning › belief change
knowledge update |
0.9 | 1 | 2025 | Seeking and Updating with Live Visual Knowledge · NeurIPS 2025 |
Natural language and speech › Language models and text generation › large language model evaluation
LLM-as-a-judge |
0.9 | 1 | 2025 | Judge Anything: MLLM as a Judge Across Any Modality · KDD (2) 2025 |
Computer vision › Vision and language › vision-language model
multimodal large language model |
0.9 | 1 | 2025 | Seeking and Updating with Live Visual Knowledge · NeurIPS 2025 |
Computer vision › Vision and language › vision-language model › multimodal large language model
multimodal large language model evaluation |
0.9 | 1 | 2025 | Judge Anything: MLLM as a Judge Across Any Modality · KDD (2) 2025 |
Computer vision › Vision and language
visual question answering |
0.9 | 1 | 2025 | Seeking and Updating with Live Visual Knowledge · NeurIPS 2025 |
Program synthesis and code generation
code generation with language models |
0.9 | 1 | 2025 | FastCoder: Accelerating Repository-level Code Generation via Efficient Retrieval and Verification · ASE 2025 |
Program synthesis and code generation › code generation with language models
inference acceleration |
0.9 | 1 | 2025 | FastCoder: Accelerating Repository-level Code Generation via Efficient Retrieval and Verification · ASE 2025 |
Program synthesis and code generation › code generation with language models
repository-level code generation |
0.9 | 1 | 2025 | FastCoder: Accelerating Repository-level Code Generation via Efficient Retrieval and Verification · ASE 2025 |
Machine learning › Efficient and distributed learning
parameter-efficient fine-tuning |
0.3 | 1 | 2025 | Seeking and Updating with Live Visual Knowledge · NeurIPS 2025 |
Information retrieval
retrieval-augmented generation |
0.3 | 1 | 2025 | FastCoder: Accelerating Repository-level Code Generation via Efficient Retrieval and Verification · ASE 2025 |
Methods — techniques the papers use, named apart from their topics
retrieval · 1.7draft-verification · 1.7caching · 1.7tool use · 0.9parameter-efficient fine-tuning · 0.9agentic visual seeking · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | FastCoder: Accelerating Repository-level Code Generation via Efficient Retrieval and VerificationabstractCode generation is a latency-sensitive task that demands high timeliness. However, with the growing interest and inherent difficulty in repository-level code generation, most existing code generation studies focus on improving the correctness of generated code while overlooking the inference efficiency, which is substantially affected by the overhead during LLM generation. Although there has been work on accelerating LLM inference, these approaches are not tailored to the specific characteristics of code generation; instead, they treat code the same as natural language sequences and ignore its unique syntax and semantic characteristics, which are also crucial for improving efficiency. Consequently, these approaches exhibit limited effectiveness in code generation tasks, particularly for repository-level scenarios with considerable complexity and difficulty. To alleviate this issue, following draft-verification paradigm, we propose FastCoder, a simple yet highly efficient inference acceleration approach specifically designed for code generation, without compromising the quality of the output. FastCoder constructs a multi-source datastore, providing access to both general and project-specific knowledge, facilitating the retrieval of high-quality draft sequences. Moreover, FastCoder reduces the retrieval cost by controlling retrieval timing, and enhances efficiency through parallel retrieval and a context- and LLM preference-aware cache. Experimental results show that FastCoder can reach up to 2.53× and 2.54× speedup compared to autoregressive decoding in repository-level and standalone code generation tasks, respectively, outperforming state-of-the-art inference acceleration approaches by up to 88%. FastCoder can also be integrated with existing correctness-focused code generation approaches to accelerate the LLM generation process, and reach a speedup exceeding 2.6×. Qianhui Zhao, Li Zhang 0029, Fang Liu 0032, Xiaoli Lian, Qiaoyuanhe Meng, Ziqian Jiao, Zetong Zhou, Jia Li 0012, Lin Shi 0006 |
ASE | 7 |
| 2025 | Judge Anything: MLLM as a Judge Across Any Modality
Shu Pu, Yaochen Wang 0001, Dongping Chen, Guohao Wang, Zetong Zhou, Shuang Gong, Yi Gui, Yao Wan 0001, Philip S. Yu |
KDD (2) | 9 |
| 2025 | Seeking and Updating with Live Visual KnowledgeabstractThe visual world around us constantly evolves, from real-time news and social media trends to global infrastructure changes visible through satellite imagery and augmented reality enhancements. However, Multimodal Large Language Models (MLLMs), which automate many tasks, struggle to stay current, limited by the cutoff dates in their fixed training datasets.To quantify this stagnation, we introduce LiveVQA, the first-of-its-kind dataset featuring 107,143 samples and 12 categories data specifically designed to support research in both seeking and updating with live visual knowledge.Drawing from recent news articles, video platforms, and academic publications in April 2024-May 2025, LiveVQA enables evaluation of how models handle latest visual information beyond their knowledge boundaries and how current methods help to update them. Our comprehensive benchmarking of 17 state-of-the-art MLLMs reveals significant performance gaps on content beyond knowledge cutoff, and tool-use or agentic visual seeking framework drastically gain an average of 327% improvement. Furthermore, we explore parameter-efficient fine-tuning methods to update MLLMs with new visual knowledge.We dive deeply to the critical balance between adapter capacity and model capability when updating MLLMs with new visual knowledge. All the experimental dataset and source code are publicly available at: https://livevqa.github.io. Mingyang Fu, Yuyang Peng, Dongping Chen, Zetong Zhou, Benlin Liu, Yao Wan 0001, Zhou Zhao 0001, Philip S. Yu, Ranjay Krishna |
NeurIPS | 4 |