VLDB 2026 Research / reviewers in the wild / expert
Xuanting Chen
dblp:322/1125
· DBLP profile ↗
3ranked-venue papers
0as first author
3since 2021 · last 2023
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 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
2 papers |
Information extraction and text analysis · 72% Language models and text generation · 17% Learning paradigms · 6% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Natural language and speech › Information extraction and text analysis
named entity recognition |
1.2 | 2 | 2023 | Learning "O" Helps for Learning More: Handling the Unlabeled Entity Problem for Class-incremental NER · ACL (1) 2023 Searching for Optimal Subword Tokenization in Cross-domain NER · IJCAI 2022 |
Natural language and speech › Information extraction and text analysis › named entity recognition
continual named entity recognition |
0.7 | 1 | 2023 | Learning "O" Helps for Learning More: Handling the Unlabeled Entity Problem for Class-incremental NER · ACL (1) 2023 |
Natural language and speech › Information extraction and text analysis › named entity recognition
cross-domain named entity recognition |
0.6 | 1 | 2022 | Searching for Optimal Subword Tokenization in Cross-domain NER · IJCAI 2022 |
Natural language and speech › Language models and text generation › tokenization
subword tokenization |
0.6 | 1 | 2022 | Searching for Optimal Subword Tokenization in Cross-domain NER · IJCAI 2022 |
Machine learning › Learning paradigms
incremental learning |
0.2 | 1 | 2023 | Learning "O" Helps for Learning More: Handling the Unlabeled Entity Problem for Class-incremental NER · ACL (1) 2023 |
Machine learning › Transfer learning and domain adaptation › domain adaptation
unsupervised domain adaptation |
0.2 | 1 | 2022 | Searching for Optimal Subword Tokenization in Cross-domain NER · IJCAI 2022 |
Methods — techniques the papers use, named apart from their topics
unlabeled entity handling · 0.7class-incremental learning · 0.7optimal transport · 0.6BERT · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Learning "O" Helps for Learning More: Handling the Unlabeled Entity Problem for Class-incremental NERabstractRuotian Ma, Xuanting Chen, Zhang Lin, Xin Zhou, Junzhe Wang, Tao Gui, Qi Zhang, Xiang Gao, Yun Wen Chen. Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2023. Ruotian Ma, Xuanting Chen, Xin Zhou 0012, Junzhe Wang 0001, Tao Gui, Qi Zhang 0001, Xiang Gao 0017, Yun Wen Chen |
ACL (1) | 2 |
| 2022 | Making Parameter-efficient Tuning More Efficient: A Unified Framework for Classification TasksabstractLarge pre-trained language models (PLMs) have demonstrated superior performance in industrial applications. Recent studies have explored parameter-efficient PLM tuning, which only updates a small amount of task-specific parameters while achieving both high efficiency and comparable performance against standard fine-tuning. However, all these methods ignore the inefficiency problem caused by the task-specific output layers, which is inflexible for us to re-use PLMs and introduces non-negligible parameters. In this work, we focus on the text classification task and propose plugin-tuning, a framework that further improves the efficiency of existing parameter-efficient methods with a unified classifier. Specifically, we re-formulate both token and sentence classification tasks into a unified language modeling task, and map label spaces of different tasks into the same vocabulary space. In this way, we can directly re-use the language modeling heads of PLMs, avoiding introducing extra parameters for different tasks. We conduct experiments on six classification benchmarks. The experimental results show that plugin-tuning can achieve comparable performance against fine-tuned PLMs, while further saving around 50% parameters on top of other parameter-efficient methods. Xin Zhou 0012, Ruotian Ma, Yicheng Zou, Xuanting Chen, Tao Gui, Qi Zhang 0001, Xuanjing Huang 0001, Rui Xie 0005, Wei Wu 0014 |
COLING | 4 |
| 2022 | Searching for Optimal Subword Tokenization in Cross-domain NERabstractInput distribution shift is one of the vital problems in unsupervised domain adaptation (UDA). The most popular UDA approaches focus on domain-invariant representation learning, trying to align the features from different domains into a similar feature distribution. However, these approaches ignore the direct alignment of input word distributions between domains, which is a vital factor in word-level classification tasks such as cross-domain NER. In this work, we shed new light on cross-domain NER by introducing a subword-level solution, X-Piece, for input word-level distribution shift in NER. Specifically, we re-tokenize the input words of the source domain to approach the target subword distribution, which is formulated and solved as an optimal transport problem. As this approach focuses on the input level, it can also be combined with previous DIRL methods for further improvement. Experimental results show the effectiveness of the proposed method based on BERT-tagger on four benchmark NER datasets. Also, the proposed method is proved to benefit DIRL methods such as DANN. Ruotian Ma, Yiding Tan, Xin Zhou 0012, Xuanting Chen, Di Liang, Wei Wu 0014, Tao Gui |
IJCAI | 4 |