Papers by Simiao Zuo
Towards Consistent Natural-Language Explanations via Explanation-Consistency Finetuning (2025.coling-main)
Copied to clipboard
| Challenge: | Large language models generate convincing, fluent explanations, but they often generate inconsistent explanations on different inputs. |
| Approach: | They propose a method that adapts large language models to generate more consistent explanations on related examples. |
| Outcome: | The proposed method yields a 10.0% relative explanation consistency improvement across a variety of question-answering datasets and generalizes to 7 out-of-distribution datasets not seen during finetuning (+4.5%) |
Task Oriented In-Domain Data Augmentation (2024.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for large language models suffer from two major issues: in-domain data are scarce compared with general domain-agnostic data. |
| Approach: | They propose a task-oriented in-domain data augmentation framework that uses in- domain data selection and task-orientated synthetic passage generation to adapt LLMs to two domains: advertisement and math. |
| Outcome: | The proposed framework improves LLM performance by 8% in the advertisement domain and 7.5% in the math domain. |
Adversarial Regularization as Stackelberg Game: An Unrolled Optimization Approach (2021.emnlp-main)
Copied to clipboard
Simiao Zuo, Chen Liang, Haoming Jiang, Xiaodong Liu, Pengcheng He, Jianfeng Gao, Weizhu Chen, Tuo Zhao
| Challenge: | Existing approaches to adversarial regularization treat adversarials and defending players equally, which is undesirable because only the defending player contributes to the generalization performance. |
| Approach: | They propose a method which formulates adversarial regularization as a Stackelberg game and induces a competition between a leader and a follower. |
| Outcome: | The proposed method outperforms existing adversarial regularization baselines on a set of machine translation and natural language understanding tasks. |
Super Tickets in Pre-Trained Language Models: From Model Compression to Improving Generalization (2021.acl-long)
Copied to clipboard
Chen Liang, Simiao Zuo, Minshuo Chen, Haoming Jiang, Xiaodong Liu, Pengcheng He, Tuo Zhao, Weizhu Chen
| Challenge: | 'lottery tickets' can be trained to match the performance of a full model . subnetwork training can also outperform random sampled subnetworks of the same size . |
| Approach: | They propose to train a subnetwork of 'lottery tickets' to match the full model's performance. |
| Outcome: | The proposed model outperforms subnetworks of the same size in a phase transition phenomenon . the proposed model improves single task fine-tuning by 0.9 points on BERT-base and 1.0 points on GLUE large . |
ARCH: Efficient Adversarial Regularized Training with Caching (2021.findings-emnlp)
Copied to clipboard
Simiao Zuo, Chen Liang, Haoming Jiang, Pengcheng He, Xiaodong Liu, Jianfeng Gao, Weizhu Chen, Tuo Zhao
| Challenge: | Existing approaches to regularize models require generating a perturbation for each sample in each epoch. |
| Approach: | They propose an adversarial regularization method where perturbations are generated and cached once every several epochs. |
| Outcome: | The proposed method significantly eases the computational burden (saves up to 70% of computational time) it produces a notably better (in most of the tasks) or comparable model generalization. |
Fine-Tuning Pre-trained Language Model with Weak Supervision: A Contrastive-Regularized Self-Training Approach (2021.naacl-main)
Copied to clipboard
| Challenge: | Fine-tuned pre-trained language models (LMs) have enormous success in many natural language processing tasks, but they still require excessive labeled data in the fine-tuning stage. |
| Approach: | They propose a framework to enable fine-tuning pre-trained language models with weak supervision without any labeled data. |
| Outcome: | The proposed framework outperforms the strongest baseline and achieves competitive performance with fully-supervised fine-tuning methods. |
MoEBERT: from BERT to Mixture-of-Experts via Importance-Guided Adaptation (2022.naacl-main)
Copied to clipboard
| Challenge: | Existing methods for training pre-trained language models have limited practicality due to latency requirements. |
| Approach: | They propose a method that uses a Mixture-of-Experts structure to increase model capacity and inference speed. |
| Outcome: | The proposed method outperforms existing distillation methods on natural language understanding and question answering tasks. |
Self-Training with Differentiable Teacher (2022.findings-naacl)
Copied to clipboard
| Challenge: | Existing methods for self-training are interpreted as teacher-student frameworks, where the teacher generates pseudo-labels and the student makes predictions. |
| Approach: | They propose a differentiable self-training method that treats teacher-student as a Stackelberg game where a leader is always in a more advantageous position than a follower. |
| Outcome: | The proposed model outperforms existing methods on semi- and weakly-supervised learning tasks on semi and weak supervised tasks. |
Context-Aware Query Rewriting for Improving Users’ Search Experience on E-commerce Websites (2023.acl-industry)
Copied to clipboard
| Challenge: | Existing query rewriting models ignore user history behaviors and consider only the instant search query, which is often a short string offering limited information about the true shopping intent. |
| Approach: | They propose an end-to-end context-aware query rewriting model that takes search context into account and builds a session graph using the history search queries and their contained words. |
| Outcome: | The proposed model outperforms state-of-the-art models under various metrics. |