Papers by Lulu Zhao
Seen to Unseen: Exploring Compositional Generalization of Multi-Attribute Controllable Dialogue Generation (2023.acl-long)
Copied to clipboard
| Challenge: | Existing controllable dialogue generation models focus on single attribute and lack generalization capability to out-of-distribution multiple attribute combinations. |
| Approach: | They propose a compositional generalization model that learns from seen attributes and generalizes to unseen combinations. |
| Outcome: | The proposed model can learn from seen attribute values and generalize to unseen combinations. |
Domain-Oriented Prefix-Tuning: Towards Efficient and Generalizable Fine-tuning for Zero-Shot Dialogue Summarization (2022.naacl-main)
Copied to clipboard
| Challenge: | Existing methods for domain adaptation of abstractive dialogue summarization lack generalization ability on new domains. |
| Approach: | They propose a domain-oriented prefix-tuning model that uses a prefix module to alleviate domain entanglement and discrete prompts to guide the model to focus on key contents of dialogues. |
| Outcome: | The proposed model can be generalized to two multi-domain dialogue summarization datasets. |
Revisit Overconfidence for OOD Detection: Reassigned Contrastive Learning with Adaptive Class-dependent Threshold (2022.naacl-main)
Copied to clipboard
Yanan Wu, Keqing He, Yuanmeng Yan, QiXiang Gao, Zhiyuan Zeng, Fujia Zheng, Lulu Zhao, Huixing Jiang, Wei Wu, Weiran Xu
| Challenge: | Existing methods for OOD detection are based on labeled in-domain data . detecting out-of-domain (OOD) or unknown intents is challenging . |
| Approach: | They propose a novel reassigned contrastive learning method to discriminate IND intents for over-confident OOD and an adaptive class-dependent local threshold mechanism to separate similar IND and OOD intents. |
| Outcome: | The proposed method is effective for both aspects of overconfidence issues. |
Give the Truth: Incorporate Semantic Slot into Abstractive Dialogue Summarization (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Abstractive dialogue summarization suffers from a lot of factual errors due to scattered salient elements in multi-speaker information interaction process. |
| Approach: | They propose a slot-driven beam search algorithm to give priority to generating salient elements in a limited length by "filling-in-the-blanks". |
| Outcome: | The proposed algorithm improves the slot-driven beam search algorithm on different types of factual errors and human evaluation further verifies the results. |
Improving Abstractive Dialogue Summarization with Graph Structures and Topic Words (2020.coling-main)
Copied to clipboard
| Challenge: | Existing approaches to summarize textual information are hard to capture long-distance relationships. |
| Approach: | They propose a Topic-word Guided Dialogue Graph Attention network to model the dialogue as an interaction graph according to topic word information. |
| Outcome: | The proposed model outperforms baseline models on two corpus corpus models. |
MoSLD: An Extremely Parameter-Efficient Mixture-of-Shared LoRAs for Multi-Task Learning (2025.coling-main)
Copied to clipboard
| Challenge: | LoRA is a key technique for fine-tuning large pre-trained models, yet its performance in multi-task learning scenarios often falls short. |
| Approach: | They propose a mixture-of-shared-LoRAs model with a dropout strategy . they propose to share the upper projection matrix among different experts . |
| Outcome: | The proposed model exhibits excellent performance in both single-task and multi-task scenarios with robust out-of-domain generalization capabilities. |