Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yuancheng Tu

dblp:20/7789 · DBLP profile ↗
← Back
6ranked-venue papers
0as first author
2since 2021 · last 2023
0000-0003-0875-7625ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 5 · 1 since 2021Databases, data management, data science and information retrieval · 3 · 2 since 2021Applied, interdisciplinary, general and emerging computing · 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
Information extraction and text analysis · 69% Question answering and dialogue systems · 23% Transfer learning and domain adaptation · 5%
Databases, data mining, and information retrieval
2 papers
Information retrieval · 98% Data mining · 2%

Topics — the 10 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Natural language and speech › Question answering and dialogue systems
question generation
0.712023
Zero-shot Clarifying Question Generation for Conversational Search · WWW 2023
Information retrieval › interactive information retrieval › conversational information seeking › conversational search
clarifying question generation
0.712023
Zero-shot Clarifying Question Generation for Conversational Search · WWW 2023
Information retrieval › interactive information retrieval › conversational information seeking
conversational search
0.712023
Zero-shot Clarifying Question Generation for Conversational Search · WWW 2023
Natural language and speech › Information extraction and text analysis › named entity recognition
few-shot named entity recognition
0.512021
Meta Self-training for Few-shot Neural Sequence Labeling · KDD 2021
Natural language and speech › Information extraction and text analysis › sequence labeling
few-shot sequence labeling
0.512021
Meta Self-training for Few-shot Neural Sequence Labeling · KDD 2021
Natural language and speech › Information extraction and text analysis
named entity recognition
0.512021
Meta Self-training for Few-shot Neural Sequence Labeling · KDD 2021
Natural language and speech › Information extraction and text analysis
sequence labeling
0.512021
Meta Self-training for Few-shot Neural Sequence Labeling · KDD 2021
Machine learning › Transfer learning and domain adaptation
meta-learning
0.112021
Meta Self-training for Few-shot Neural Sequence Labeling · KDD 2021
Machine learning › Learning paradigms
multi-label classification
0.112009
Aspect Guided Text Categorization with Unobserved Labels · ICDM 2009
Data mining › text mining
text classification
0.012009
Aspect Guided Text Categorization with Unobserved Labels · ICDM 2009

Methods — techniques the papers use, named apart from their topics

zero-shot learning · 1.3self-training · 0.5pseudo-label re-weighting · 0.5meta-learning · 0.5constrained optimization · 0.2aspect variables · 0.2
YearPublicationVenuePosition
2023 Zero-shot Clarifying Question Generation for Conversational Search
abstract
A long-standing challenge for search and conversational assistants is query intention detection in ambiguous queries. Asking clarifying questions in conversational search has been widely studied and considered an effective solution to resolve query ambiguity. Existing work have explored various approaches for clarifying question ranking and generation. However, due to the lack of real conversational search data, they have to use artificial datasets for training, which limits their generalizability to real-world search scenarios. As a result, the industry has shown reluctance to implement them in reality, further suspending the availability of real conversational search interaction data. The above dilemma can be formulated as a cold start problem of clarifying question generation and conversational search in general. Furthermore, even if we do have large-scale conversational logs, it is not realistic to gather training data that can comprehensively cover all possible queries and topics in open-domain search scenarios. The risk of fitting bias when training a clarifying question retrieval/generation model on incomprehensive dataset is thus another important challenge.
Zhenduo Wang, Yuancheng Tu, Corby Rosset, Nick Craswell, Qingyao Ai
WWW2
2021 Meta Self-training for Few-shot Neural Sequence Labeling
abstract
Neural sequence labeling is widely adopted for many Natural Language Processing (NLP) tasks, such as Named Entity Recognition (NER) and slot tagging for dialog systems and semantic parsing. Recent advances with large-scale pre-trained language models have shown remarkable success in these tasks when fine-tuned on large amounts of task-specific labeled data. However, obtaining such large-scale labeled training data is not only costly, but also may not be feasible in many sensitive user applications due to data access and privacy constraints. This is exacerbated for sequence labeling tasks requiring such annotations at token-level. In this work, we develop techniques to address the label scarcity challenge for neural sequence labeling models. Specifically, we propose a meta self-training framework which leverages very few manually annotated labels for training neural sequence models. While self-training serves as an effective mechanism to learn from large amounts of unlabeled data via iterative knowledge exchange -- meta-learning helps in adaptive sample re-weighting to mitigate error propagation from noisy pseudo-labels. Extensive experiments on six benchmark datasets including two for massive multilingual NER and four slot tagging datasets for task-oriented dialog systems demonstrate the effectiveness of our method. With only 10 labeled examples for each class in each task, the proposed method achieves 10% improvement over state-of-the-art methods demonstrating its effectiveness for limited training labels regime.
Yaqing Wang 0001, Subhabrata Mukherjee, Haoda Chu, Yuancheng Tu, Jing Gao 0004, Ahmed Awadallah 0001
KDD4
2009 Aspect Guided Text Categorization with Unobserved Labels
abstract
This paper proposes a novel multiclass classification method and exhibits its advantage in the domain of text categorization with a large label space and, most importantly, when some of the labels were not observed in the training data. The key insight is the introduction of intermediate aspect variables that encode properties of the labels. Aspect variables serve as a joint representation for observed and unobserved labels. This way the classification problem can be viewed as a structure learning problem with natural constraints on assignments to the aspect variables. We solve the problem as a constrained optimization problem over multiple learners and show significant improvement in classifying short sentences into a large label space of categories, including previously unobserved categories.
Dan Roth 0001, Yuancheng Tu
ICDM2
2009 Unsupervised Constraint Driven Learning For Transliteration Discovery
Ming-Wei Chang, Dan Goldwasser, Dan Roth 0001, Yuancheng Tu
HLT-NAACL4
2004 Semantic Role Labeling Via Generalized Inference Over Classifiers
Vasin Punyakanok, Dan Roth 0001, Scott Yih, Dav Zimak, Yuancheng Tu
CoNLL5
2003 Phrasenet: towards context sensitive lexical semantics
Xin Li 0018, Dan Roth 0001, Yuancheng Tu
CoNLL3