VLDB 2026 Research / reviewers in the wild / expert
Jiayou Zhang
dblp:157/3933
· DBLP profile ↗
3ranked-venue papers
1as first author
3since 2021 · last 2025
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 1 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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
3 papers |
Generative modeling · 32% Representation and self-supervised learning · 32% Language models and text generation · 14% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Bioinformatics and computational biology · 100% |
Topics — the 8 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Representation and self-supervised learning › representation analysis
dimensional collapse |
0.9 | 1 | 2025 | Dimensional Collapse in VQVAEs: Evidence and Remedies · NeurIPS 2025 |
Machine learning › Representation and self-supervised learning › representation analysis
representation collapse |
0.9 | 1 | 2025 | Dimensional Collapse in VQVAEs: Evidence and Remedies · NeurIPS 2025 |
Machine learning › Generative modeling
variational autoencoder |
0.9 | 1 | 2025 | Dimensional Collapse in VQVAEs: Evidence and Remedies · NeurIPS 2025 |
Machine learning › Generative modeling › variational autoencoder
vector-quantized variational autoencoder |
0.9 | 1 | 2025 | Dimensional Collapse in VQVAEs: Evidence and Remedies · NeurIPS 2025 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › game tree search
monte carlo tree search |
0.8 | 1 | 2024 | PromptAgent: Strategic Planning with Language Models Enables Expert-level Prompt Optimization · ICLR 2024 |
Natural language and speech › Language models and text generation › prompting › prompt engineering
prompt optimization |
0.8 | 1 | 2024 | PromptAgent: Strategic Planning with Language Models Enables Expert-level Prompt Optimization · ICLR 2024 |
Knowledge, reasoning and agents › Knowledge representation and reasoning › ontology
ontology matching |
0.2 | 1 | 2023 | GraphPrompt: Graph-Based Prompt Templates for Biomedical Synonym Prediction · AAAI 2023 |
Computer vision › Vision and language › vision-language model
prompt learning |
0.2 | 1 | 2023 | GraphPrompt: Graph-Based Prompt Templates for Biomedical Synonym Prediction · AAAI 2023 |
Methods — techniques the papers use, named apart from their topics
prompt tuning · 1.3graph-based prompt templates · 1.3rank regularization · 0.9divide-and-conquer quantization · 0.9monte carlo tree search · 0.8error feedback reflection · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Dimensional Collapse in VQVAEs: Evidence and RemediesabstractVector-Quantized Variational Autoencoders (VQVAEs) have enabled strong performance in generative modeling by mapping continuous data to learnable codes.
In this work, we identify a surprising yet consistent phenomenon that we term \emph{dimensional collapse}: despite using high-dimensional embeddings, VQVAEs tend to compress their representations into a much smaller subspace, typically only 4 to 10 dimensions.
We provide an in-depth analysis of this phenomenon and reveal its relation to model performance and learning dynamics.
Interestingly, VQVAEs naturally gravitate toward this low-dimensional regime, and enforcing higher-dimensional usage (e.g., via rank regularization) could lead to degraded performance.
To overcome this low-dimensionality limitation, we propose \textbf{Divide-and-Conquer VQ (DCVQ)}, which partitions the latent space into multiple low-dimensional subspaces, each quantized independently.
By design, each subspace respects the model’s preference for low dimensionality, while their combination expands the overall capacity.
Our results show that DCVQ overcomes the inherent dimensional bottleneck and achieves improved reconstruction quality across image datasets. Jiayou Zhang, Yifan Shen 0004, Guangyi Chen 0002, Eric P. Xing |
NeurIPS | 1 |
| 2024 | PromptAgent: Strategic Planning with Language Models Enables Expert-level Prompt OptimizationabstractExpert-level prompts, carefully engineered by human experts who have a deep understanding of both large language models (LLMs) and domain knowledge, are the future of prompting and pivotal to harnessing the full power of advanced LLMs. Discovering such prompts with an automated process remains a sought-after and unresolved challenge. Existing prompt optimization techniques, though automated through iterative sampling, often fall short in injecting domain knowledge and exploring the vast prompt space for complex expert-level prompts efficiently. To address this pressing need and achieve expert-level prompting, we introduce PromptAgent, which autonomously discovers prompts equivalent in quality to those handcrafted by experts. At its core, PromptAgent views prompt optimization as a strategic planning problem and employs a principled planning algorithm (rooted in Monte Carlo Tree Search) to strategically explore the vast expert-level prompt space. PromptAgent interacts with the LLM in a human-like trial-and-error manner during the planning, and injects expert-level knowledge by reflecting on model errors and generating insightful error feedback. This novel formulation allows it to iteratively evaluate intermediate prompts, refine them based on errors, simulate future rewards, and search for high-reward paths leading to expert-level prompts. We apply PromptAgent to 12 tasks spanning three practical domains: BIG-Bench Hard (BBH), domain-expert, and general NLU tasks, showing PromptAgent consistently outperforms strong prompting and prompt optimization baselines by great margins. Our qualitative analysis further emphasizes PromptAgent's capability to distill insightful errors into expert-level prompts. Xinyuan Wang 0010, Zhen Wang 0041, Fan Bai 0006, Haotian Luo, Jiayou Zhang, Nebojsa Jojic, Eric P. Xing, Zhiting Hu |
ICLR | 6 |
| 2023 | GraphPrompt: Graph-Based Prompt Templates for Biomedical Synonym PredictionabstractIn the expansion of biomedical dataset, the same category may be labeled with different terms, thus being tedious and onerous to curate these terms. Therefore, automatically mapping synonymous terms onto the ontologies is desirable, which we name as biomedical synonym prediction task. Unlike biomedical concept normalization (BCN), no clues from context can be used to enhance synonym prediction, making it essential to extract graph features from ontology. We introduce an expert-curated dataset OBO-syn encompassing 70 different types of concepts and 2 million curated concept-term pairs for evaluating synonym prediction methods. We find BCN methods perform weakly on this task for not making full use of graph information. Therefore, we propose GraphPrompt, a prompt-based learning approach that creates prompt templates according to the graphs. GraphPrompt obtained 37.2% and 28.5% improvement on zero-shot and few-shot settings respectively, indicating the effectiveness of these graph-based prompt templates. We envision that our method GraphPrompt and OBO-syn dataset can be broadly applied to graph-based NLP tasks, and serve as the basis for analyzing diverse and accumulating biomedical data. All the data and codes are avalible at: https://github.com/HanwenXuTHU/GraphPrompt Jiayou Zhang, Shizhuo Zhang, Megh Manoj Bhalerao, Yucong Liu, Sheng Wang 0012 |
AAAI | 2 |