Demo Data from EDBT 2026 / reviewers in the wild / expert
Yaozu An
dblp:31/7672
· DBLP profile ↗
3ranked-venue papers
2as first author
1since 2021 · last 2023
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 2 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 2 first-author · 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
1 paper |
Vision and language · 91% Efficient and distributed learning · 9% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computer vision › Vision and language › vision-language model › prompt learning
hierarchical prompt learning |
0.7 | 1 | 2023 | Hierarchical Prompt Learning for Multi-Task Learning · CVPR 2023 |
Computer vision › Vision and language › vision-language model
prompt learning |
0.7 | 1 | 2023 | Hierarchical Prompt Learning for Multi-Task Learning · CVPR 2023 |
Computer vision › Vision and language
vision-language model |
0.7 | 1 | 2023 | Hierarchical Prompt Learning for Multi-Task Learning · CVPR 2023 |
Machine learning › Efficient and distributed learning
parameter-efficient fine-tuning |
0.2 | 1 | 2023 | Hierarchical Prompt Learning for Multi-Task Learning · CVPR 2023 |
Methods — techniques the papers use, named apart from their topics
prompt learning · 0.7inter-task affinity · 0.7hierarchical task tree · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Hierarchical Prompt Learning for Multi-Task LearningabstractVision-language models (VLMs) can effectively transfer to various vision tasks via prompt learning. Real-world scenarios often require adapting a model to multiple similar yet distinct tasks. Existing methods focus on learning a specific prompt for each task, limiting the ability to exploit potentially shared information from other tasks. Naively training a task-shared prompt using a combination of all tasks ignores fine-grained task correlations. Significant discrepancies across tasks could cause negative transferring. Considering this, we present Hierarchical Prompt (HiPro) learning, a simple and effective method for jointly adapting a pre-trained VLM to multiple downstream tasks. Our method quantifies inter-task affinity and subsequently constructs a hierarchical task tree. Task-shared prompts learned by internal nodes explore the information within the corresponding task group, while task-individual prompts learned by leaf nodes obtain fine-grained information targeted at each task. The combination of hierarchical prompts provides high-quality content of different granularity. We evaluate HiPro on four multi-task learning datasets. The results demonstrate the effectiveness of our method. Yuning Lu, Yaozu An, Zhuokun Yao, Baofeng Zhang, Zhiwei Xiong, Chenguang Gui |
CVPR | 4 |
| 2010 | Spatial-Temporal Motion Compensation Based Video Super Resolution
Yaozu An, Yao Lu 0001, Ziye Yan |
ACCV (2) | 1 |
| 2009 | Spatially Varying Regularization of Image Sequences Super-Resolution
Yaozu An, Yao Lu 0001, Zhengang Zhai |
ACCV (3) | 1 |