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

Yuqiao Wen

dblp:311/4692 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
5since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 5 · 4 first-author · 5 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
4 papers
Machine translation · 30% Information extraction and text analysis · 26% Question answering and dialogue systems · 22%
Theoretical computer science
1 paper
Algorithms and data structures · 100%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Machine translation › neural machine translation
multilingual neural machine translation
0.912025
EBBS: An Ensemble with Bi-Level Beam Search for Zero-Shot Machine Translation · AAAI 2025
Natural language and speech › Machine translation › neural machine translation › multilingual neural machine translation
zero-shot translation
0.912025
EBBS: An Ensemble with Bi-Level Beam Search for Zero-Shot Machine Translation · AAAI 2025
Natural language and speech › Information extraction and text analysis › syntactic parsing › constituency parsing
discontinuous constituency parsing
0.812024
Tree-Averaging Algorithms for Ensemble-Based Unsupervised Discontinuous Constituency Parsing · ACL (1) 2024
Natural language and speech › Information extraction and text analysis
syntactic parsing
0.812024
Tree-Averaging Algorithms for Ensemble-Based Unsupervised Discontinuous Constituency Parsing · ACL (1) 2024
Natural language and speech › Question answering and dialogue systems
dialogue generation
0.712023
An Equal-Size Hard EM Algorithm for Diverse Dialogue Generation · ICLR 2023
Natural language and speech › Question answering and dialogue systems › dialogue generation
diverse response generation
0.712023
An Equal-Size Hard EM Algorithm for Diverse Dialogue Generation · ICLR 2023
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › parameter estimation
expectation-maximization
0.712023
An Equal-Size Hard EM Algorithm for Diverse Dialogue Generation · ICLR 2023
Machine learning › Efficient and distributed learning › model compression
knowledge distillation
0.712023
f-Divergence Minimization for Sequence-Level Knowledge Distillation · ACL (1) 2023

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

ensemble · 2.4exact algorithm · 1.5complexity analysis · 1.5knowledge distillation · 0.9beam search · 0.9f-divergence minimization · 0.7equal-size hard EM · 0.7
YearPublicationVenuePosition
2025 EBBS: An Ensemble with Bi-Level Beam Search for Zero-Shot Machine Translation
abstract
The ability of zero-shot translation emerges when we train a multilingual model with certain translation directions; the model can then directly translate in unseen directions. Alternatively, zero-shot translation can be accomplished by pivoting through a third language (e.g., English). In our work, we observe that both direct and pivot translations are noisy and achieve less satisfactory performance. We propose EBBS, an ensemble method with a novel bi-level beam search algorithm, where each ensemble component explores its own prediction step by step at the lower level but all components are synchronized by a "soft voting" mechanism at the upper level. Results on two popular multilingual translation datasets show that EBBS consistently outperforms direct and pivot translations, as well as existing ensemble techniques. Further, we can distill the ensemble's knowledge back to the multilingual model to improve inference efficiency; profoundly, our EBBS-distilled model can even outperform EBBS as it learns from the ensemble knowledge.
Yuqiao Wen, Behzad Shayegh, Chenyang Huang 0001, Yanshuai Cao, Lili Mou
AAAI1
2024 Tree-Averaging Algorithms for Ensemble-Based Unsupervised Discontinuous Constituency Parsing
abstract
We address unsupervised discontinuous constituency parsing, where we observe a high variance in the performance of the only previous model in the literature.We propose to build an ensemble of different runs of the existing discontinuous parser by averaging the predicted trees, to stabilize and boost performance.To begin with, we provide comprehensive computational complexity analysis (in terms of P and NP-complete) for tree averaging under different setups of binarity and continuity.We then develop an efficient exact algorithm to tackle the task, which runs in a reasonable time for all samples in our experiments.Results on three datasets show our method outperforms all baselines in all metrics; we also provide in-depth analyses of our approach.1
Behzad Shayegh, Yuqiao Wen, Lili Mou
ACL (1)2
2023 f-Divergence Minimization for Sequence-Level Knowledge Distillation
abstract
Knowledge distillation (KD) is the process of transferring knowledge from a large model to a small one.It has gained increasing attention in the natural language processing community, driven by the demands of compressing evergrowing language models.In this work, we propose an f -DISTILL framework, which formulates sequence-level knowledge distillation as minimizing a generalized f -divergence function.We propose four distilling variants under our framework and show that existing SeqKD and ENGINE approaches are approximations of our f -DISTILL methods.We further derive step-wise decomposition for our f -DISTILL, reducing intractable sequence-level divergence to word-level losses that can be computed in a tractable manner.Experiments across four datasets show that our methods outperform existing KD approaches, and that our symmetric distilling losses can better force the student to learn from the teacher distribution.1
Yuqiao Wen, Zichao Li 0001, Wenyu Du, Lili Mou
ACL (1)1
2023 An Equal-Size Hard EM Algorithm for Diverse Dialogue Generation
Yuqiao Wen, Yongchang Hao, Yanshuai Cao, Lili Mou
ICLR1
2022 An Empirical Study on the Overlapping Problem of Open-Domain Dialogue Datasets
abstract
Open-domain dialogue systems aim to converse with humans through text, and dialogue research has heavily relied on benchmark datasets. In this work, we observe the overlapping problem in DailyDialog and OpenSubtitles, two popular open-domain dialogue benchmark datasets. Our systematic analysis then shows that such overlapping can be exploited to obtain fake state-of-the-art performance. Finally, we address this issue by cleaning these datasets and setting up a proper data processing procedure for future research.
Yuqiao Wen, Guoqing Luo, Lili Mou
LREC1