EDBT 2026 Demo / reviewers in the wild / expert
Austin Cheng-Yun Tsai
dblp:324/1039
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2022
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 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 |
Information extraction and text analysis · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Natural language and speech › Information extraction and text analysis › text classification
semi-supervised text classification |
0.6 | 1 | 2022 | Contrast-Enhanced Semi-supervised Text Classification with Few Labels · AAAI 2022 |
Natural language and speech › Information extraction and text analysis
text classification |
0.6 | 1 | 2022 | Contrast-Enhanced Semi-supervised Text Classification with Few Labels · AAAI 2022 |
Methods — techniques the papers use, named apart from their topics
similarity graph · 0.6noisy label learning · 0.6contrastive learning · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Contrast-Enhanced Semi-supervised Text Classification with Few LabelsabstractTraditional text classification requires thousands of annotated data or an additional Neural Machine Translation (NMT) system, which are expensive to obtain in real applications. This paper presents a Contrast-Enhanced Semi-supervised Text Classification (CEST) framework under label-limited settings without incorporating any NMT systems. We propose a certainty-driven sample selection method and a contrast-enhanced similarity graph to utilize data more efficiently in self-training, alleviating the annotation-starving problem. The graph imposes a smoothness constraint on the unlabeled data to improve the coherence and the accuracy of pseudo-labels. Moreover, CEST formulates the training as a “learning from noisy labels” problem and performs the optimization accordingly. A salient feature of this formulation is the explicit suppression of the severe error propagation problem in conventional semi-supervised learning. With solely 30 labeled data per class for both training and validation dataset, CEST outperforms the previous state-of-the-art algorithms by 2.11% accuracy and only falls within the 3.04% accuracy range of fully-supervised pre-training language model fine-tuning on thousands of labeled data. Austin Cheng-Yun Tsai, Sheng-Ya Lin, Li-Chen Fu |
AAAI | 1 |