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

Yiqun Yao

dblp:186/7879 · DBLP profile ↗
← Back
8ranked-venue papers
5as first author
3since 2021 · last 2026
—ORCID · none

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

Artificial intelligence and machine learning · 7 · 4 first-author · 3 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 first-author

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
Efficient and distributed learning · 40% Language models and text generation · 31% Vision and language · 23%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning › efficient training
efficient pre-training
0.812024
Masked Structural Growth for 2x Faster Language Model Pre-training · ICLR 2024
Natural language and speech › Language models and text generation › large language model training
language model pretraining
0.812024
Masked Structural Growth for 2x Faster Language Model Pre-training · ICLR 2024
Machine learning › Efficient and distributed learning
model compression
0.812024
Masked Structural Growth for 2x Faster Language Model Pre-training · ICLR 2024
Machine learning › Efficient and distributed learning
progressive training
0.812024
Masked Structural Growth for 2x Faster Language Model Pre-training · ICLR 2024
Computer vision › Vision and language
cross-modal interaction
0.312018
Cascaded Mutual Modulation for Visual Reasoning · EMNLP 2018
Computer vision › Vision and language
multimodal fusion
0.312018
Cascaded Mutual Modulation for Visual Reasoning · EMNLP 2018
Computer vision › Vision and language
visual question answering
0.312018
Cascaded Mutual Modulation for Visual Reasoning · EMNLP 2018
Computer vision › Vision and language
visual reasoning
0.312018
Cascaded Mutual Modulation for Visual Reasoning · EMNLP 2018
Machine learning › Learning paradigms
continual learning
0.312026
If an LLM Were a Character, Would It Know Its Own Story? Evaluating Lifelong Learning in LLMs · ACL (1) 2026

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

large language model · 1.0feature-wise linear modulation · 0.3end-to-end neural network · 0.3
YearPublicationVenuePosition
2026 If an LLM Were a Character, Would It Know Its Own Story? Evaluating Lifelong Learning in LLMs
abstract
Siqi Fan, Xiusheng Huang, Yiqun Yao, Xuezhi Fang, Kang Liu, Peng Han, Shuo Shang, Aixin Sun, Yequan Wang. Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2026.
Siqi Fan 0001, Xiusheng Huang, Yiqun Yao, Xuezhi Fang, Kang Liu 0001, Peng Han 0005, Shuo Shang, Aixin Sun, Yequan Wang
ACL (1)3
2024 Masked Structural Growth for 2x Faster Language Model Pre-training
abstract
Accelerating large language model pre-training is a critical issue in present research. In this paper, we focus on speeding up pre-training by progressively growing from a small Transformer structure to a large one. There are two main research problems associated with progressive growth: determining the optimal growth schedule, and designing efficient growth operators. In terms of growth schedule, the impact of each single dimension on a schedule’s efficiency is underexplored by existing work. Regarding the growth operators, existing methods rely on the initialization of new weights to inherit knowledge, and achieve only non-strict function preservation, limiting further improvements on training dynamics. To address these issues, we propose Masked Structural Growth (MSG), including (i) growth schedules involving all possible dimensions and (ii) strictly function-preserving growth operators that is independent of the initialization of new weights. Experiments show that MSG is significantly faster than related work: we achieve up to 2.2x speedup in pre-training different types of language models while maintaining comparable or better downstream performances. Code is publicly available at https://github.com/cofe-ai/MSG.
Yiqun Yao, Zheng Zhang 0006, Jing Li 0034, Yequan Wang
ICLR1
2021 MUSER: MUltimodal Stress detection using Emotion Recognition as an Auxiliary Task
abstract
Yiqun Yao, Michalis Papakostas, Mihai Burzo, Mohamed Abouelenien, Rada Mihalcea. Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies. 2021.
Yiqun Yao, Michalis Papakostas, Mihai Burzo, Mohamed Abouelenien, Rada Mihalcea
NAACL-HLT1
2020 MORSE: MultimOdal sentiment analysis for Real-life SEttings
abstract
Multimodal sentiment analysis aims to detect and classify sentiment expressed in multimodal data. Research to date has focused on datasets with a large number of training samples, manual transcriptions, and nearly-balanced sentiment labels. However, data collection in real settings often leads to small datasets with noisy transcriptions and imbalanced label distributions, which are therefore significantly more challenging than in controlled settings. In this work, we introduce MORSE, a domain-specific dataset for MultimOdal sentiment analysis in Real-life SEttings. The dataset consists of 2,787 video clips extracted from 49 interviews with panelists in a product usage study, with each clip annotated for positive, negative, or neutral sentiment. The characteristics of MORSE include noisy transcriptions from raw videos, naturally imbalanced label distribution, and scarcity of minority labels. To address the challenging real-life settings in MORSE, we propose a novel two-step fine-tuning method for multimodal sentiment classification using transfer learning and the Transformer model architecture; our method starts with a pre-trained language model and one step of fine-tuning on the language modality, followed by the second step of joint fine-tuning that incorporates the visual and audio modalities. Experimental results show that while MORSE is challenging for various baseline models such as SVM and Transformer, our two-step fine-tuning method is able to capture the dataset characteristics and effectively address the challenges. Our method outperforms related work that uses both single and multiple modalities in the same transfer learning settings.
Yiqun Yao, Verónica Pérez-Rosas, Mohamed Abouelenien, Mihai Burzo
ICMI1
2019 Concept learning through deep reinforcement learning with memory-augmented neural networks
Jing Shi 0003, Jiaming Xu 0001, Yiqun Yao, Bo Xu 0002
Neural Networks3
2018 Cascaded Mutual Modulation for Visual Reasoning
abstract
Visual reasoning is a special visual question answering problem that is multi-step and compositional by nature, and also requires intensive text-vision interactions.We propose CMM: Cascaded Mutual Modulation as a novel end-to-end visual reasoning model.CMM includes a multi-step comprehension process for both question and image.In each step, we use a Feature-wise Linear Modulation (FiLM) technique to enable textual/visual pipeline to mutually control each other.Experiments show that CMM significantly outperforms most related models, and reach stateof-the-arts on two visual reasoning benchmarks: CLEVR and NLVR, collected from both synthetic and natural languages.Ablation studies confirm that both our multistep framework and our visual-guided language modulation are critical to the task.Our code is available at https://github. com/FlamingHorizon/CMM-VR.
Yiqun Yao, Jiaming Xu 0001, Feng Wang 0023, Bo Xu 0002
EMNLP1
2018 Learning to activate logic rules for textual reasoning
Yiqun Yao, Jiaming Xu 0001, Jing Shi 0003, Bo Xu 0002
Neural Networks1
2016 Hierarchical Memory Networks for Answer Selection on Unknown Words
abstract
Recently, end-to-end memory networks have shown promising results on Question Answering task, which encode the past facts into an explicit memory and perform reasoning ability by making multiple computational steps on the memory. However, memory networks conduct the reasoning on sentence-level memory to output coarse semantic vectors and do not further take any attention mechanism to focus on words, which may lead to the model lose some detail information, especially when the answers are rare or unknown words. In this paper, we propose a novel Hierarchical Memory Networks, dubbed HMN. First, we encode the past facts into sentence-level memory and word-level memory respectively. Then, k-max pooling is exploited following reasoning module on the sentence-level memory to sample the k most relevant sentences to a question and feed these sentences into attention mechanism on the word-level memory to focus the words in the selected sentences. Finally, the prediction is jointly learned over the outputs of the sentence-level reasoning module and the word-level attention mechanism. The experimental results demonstrate that our approach successfully conducts answer selection on unknown words and achieves a better performance than memory networks.
Jiaming Xu 0001, Jing Shi 0003, Yiqun Yao, Suncong Zheng, Bo Xu 0002, Bo Xu 0011
COLING3