Demo Data from EDBT 2026 / reviewers in the wild / expert
Yang Zhang 0079
dblp:06/6785-79
· DBLP profile ↗
3ranked-venue papers
1as first author
3since 2021 · last 2025
0000-0002-6064-0777ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 1 first-author · 3 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 |
Efficient and distributed learning · 65% Optimization for machine learning · 22% Transfer learning and domain adaptation · 6% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning
automated machine learning |
1.0 | 2 | 2021 | Evolving Fully Automated Machine Learning via Life-Long Knowledge Anchors · IEEE Trans. Pattern Anal. Mach. Intell. 2021 Winning Solutions and Post-Challenge Analyses of the ChaLearn AutoDL Challenge 2019 · IEEE Trans. Pattern Anal. Mach. Intell. 2021 |
Machine learning › Optimization for machine learning
evolutionary computation |
0.5 | 1 | 2021 | Evolving Fully Automated Machine Learning via Life-Long Knowledge Anchors · IEEE Trans. Pattern Anal. Mach. Intell. 2021 |
Machine learning › Efficient and distributed learning › automated machine learning
neural architecture search |
0.5 | 1 | 2021 | Winning Solutions and Post-Challenge Analyses of the ChaLearn AutoDL Challenge 2019 · IEEE Trans. Pattern Anal. Mach. Intell. 2021 |
Machine learning › Kernel, tree and ensemble methods
ensemble learning |
0.1 | 1 | 2021 | Winning Solutions and Post-Challenge Analyses of the ChaLearn AutoDL Challenge 2019 · IEEE Trans. Pattern Anal. Mach. Intell. 2021 |
Machine learning › Transfer learning and domain adaptation
meta-learning |
0.1 | 1 | 2021 | Winning Solutions and Post-Challenge Analyses of the ChaLearn AutoDL Challenge 2019 · IEEE Trans. Pattern Anal. Mach. Intell. 2021 |
Methods — techniques the papers use, named apart from their topics
pre-trained network fine-tuning · 0.5model selection · 0.5knowledge anchor · 0.5evolutionary algorithm · 0.5ensemble · 0.5data preprocessing · 0.5data ingestion · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Hy2CRE: Hypernetworks with Hybrid Data Augmentation for Continual Relation ExtractionabstractContinual Relation Extraction (CRE) aims to learn constantly emerging tasks while avoiding forgetting the learned tasks. Previous studies suggest that interference among similar relations is the primary factor contributing to the forgetting of learned tasks. To address this issue, robust training strategies have been employed to enhance the model’s ability for distinguishing between similar relations. However, these methods use the same model parameters for learning all tasks, which increases the risk of conflicts between similar relations within the unified feature space. To address this issue, we propose a model that utilizes a Hypernetwork with Hybrid data augmentation for CRE (Hy2CRE). Specifically, Hy2CRE employs a hypernetwork-based network generator to generate task-specific projection heads for each task during the continual learning process, thereby mitigating the risk of conflicts emerging between similar relations within the model’s feature space. Meanwhile, we introduce a hybrid data augmentation method to further enhance the model’s robustness to similar relations, which integrates data augmentation in both the discrete text space and the continuous semantic space. Experimental results on two benchmark datasets prove the effectiveness of our model. Yang Zhang 0079, Yidong Chen 0001 |
IJCNN | 1 |
| 2021 | Winning Solutions and Post-Challenge Analyses of the ChaLearn AutoDL Challenge 2019abstractThis paper reports the results and post-challenge analyses of ChaLearn's AutoDL challenge series, which helped sorting out a profusion of AutoML solutions for Deep Learning (DL) that had been introduced in a variety of settings, but lacked fair comparisons. All input data modalities (time series, images, videos, text, tabular) were formatted as tensors and all tasks were multi-label classification problems. Code submissions were executed on hidden tasks, with limited time and computational resources, pushing solutions that get results quickly. In this setting, DL methods dominated, though popular Neural Architecture Search (NAS) was impractical. Solutions relied on fine-tuned pre-trained networks, with architectures matching data modality. Post-challenge tests did not reveal improvements beyond the imposed time limit. While no component is particularly original or novel, a high level modular organization emerged featuring a "meta-learner", "data ingestor", "model selector", "model/learner", and "evaluator". This modularity enabled ablation studies, which revealed the importance of (off-platform) meta-learning, ensembling, and efficient data management. Experiments on heterogeneous module combinations further confirm the (local) optimality of the winning solutions. Our challenge legacy includes an ever-lasting benchmark (http://autodl.chalearn.org), the open-sourced code of the winners, and a free "AutoDL self-service." Zhengying Liu, Adrien Pavão, Zhen Xu 0007, Sergio Escalera, Fabio Ferreira, Isabelle Guyon, Sirui Hong, Frank Hutter, Rongrong Ji, Júlio C. S. Jacques Júnior, Marius Lindauer, Meysam Madadi, Thomas Nierhoff, Kangning Niu, Chunguang Pan, Danny Stoll, Sébastien Treguer, Peng Wang 0095, Chenglin Wu 0001, Youcheng Xiong, Arber Zela, Yang Zhang 0079 |
IEEE Trans. Pattern Anal. Mach. Intell. | 25 |
| 2021 | Evolving Fully Automated Machine Learning via Life-Long Knowledge AnchorsabstractAutomated machine learning (AutoML) has achieved remarkable progress on various tasks, which is attributed to its minimal involvement of manual feature and model designs. However, most of existing AutoML pipelines only touch parts of the full machine learning pipeline, e.g., neural architecture search or optimizer selection. This leaves potentially important components such as data cleaning and model ensemble out of the optimization, and still results in considerable human involvement and suboptimal performance. The main challenges lie in the huge search space assembling all possibilities over all components, as well as the generalization ability over different tasks like image, text, and tabular etc. In this paper, we present a first-of-its-kind fully AutoML pipeline, to comprehensively automate data preprocessing, feature engineering, model generation/selection/training and ensemble for an arbitrary dataset and evaluation metric. Our innovation lies in the comprehensive scope of a learning pipeline, with a novel "life-long" knowledge anchor design to fundamentally accelerate the search over the full search space. Such knowledge anchors record detailed information of pipelines and integrates them with an evolutionary algorithm for joint optimization across components. Experiments demonstrate that the result pipeline achieves state-of-the-art performance on multiple datasets and modalities. Specifically, the proposed framework was extensively evaluated in the NeurIPS 2019 AutoDL challenge, and won the only champion with a significant gap against other approaches, on all the image, video, speech, text and tabular tracks. Xiawu Zheng, Yang Zhang 0079, Sirui Hong, Huixia Li, Lang Tang, Youcheng Xiong, Yan Wang 0059, Xiaoshuai Sun, Pengfei Zhu 0001, Chenglin Wu 0001, Rongrong Ji |
IEEE Trans. Pattern Anal. Mach. Intell. | 2 |