← Search

Lili Mou

32 accepted papers

2026

Cactus: Accelerating Auto-Regressive Decoding with Constrained Acceptance Speculative Sampling

ICLR 2026poster

Speculative sampling (SpS) has been successful in accelerating the decoding throughput of auto-regressive large language models by leveraging smaller draft models. SpS strictly enforces the generated distribution to match that of the verifier LLM. This is unnecessarily restrictive as slight variatio…

Cited by 0SourcecodeScholar
2026

RLFTSim: Realistic and Controllable Multi-Agent Traffic Simulation via Reinforcement Learning Fine-Tuning

CVPR 2026

Supervised open-loop training has been widely adopted for training traffic simulation models; however, it fails to capture the inherently dynamic, multi-agent interactions common in complex driving scenarios. We introduce RLFTSim, a reinforcement-learning-based fine-tuning framework that enhances sc

Cited by 0SourcecodeScholar
2025

EBBS: An Ensemble with Bi-Level Beam Search for Zero-Shot Machine Translation

AAAI 2025technical

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,…

2025

Error Diversity Matters: An Error-Resistant Ensemble Method for Unsupervised Dependency Parsing

AAAI 2025technical

We address unsupervised dependency parsing by building an ensemble of diverse existing models through post hoc aggregation of their output dependency parse structures. We observe that these ensembles often suffer from low robustness against weak ensemble components due to error accumulation. To tack…

2024

A Decoding Algorithm for Length-Control Summarization Based on Directed Acyclic Transformers

EMNLP 2024finding

Length-control summarization aims to condense long texts into a short one within a certain length limit. Previous approaches often use autoregressive (AR) models and treat the length requirement as a soft constraint, which may not always be satisfied. In this study, we propose a novel length-control…

2024

Claim-Centric and Sentiment Guided Graph Attention Network for Rumour Detection

COLING 2024main

Automatic rumour detection has gained attention due to the influence of social media on individuals and its pervasiveness. In this work, we construct a representation that takes into account the claim in the source tweet, considering both the propagation graph and the accompanying text alongside twe…

2024

Ensemble Distillation for Unsupervised Constituency Parsing

ICLR 2024poster

We investigate the unsupervised constituency parsing task, which organizes words and phrases of a sentence into a hierarchical structure without using linguistically annotated data. We observe that existing unsupervised parsers capture different aspects of parsing structures, which can be leveraged…

2024

LLMR: Knowledge Distillation with a Large Language Model-Induced Reward

COLING 2024main

Large language models have become increasingly popular and demonstrated remarkable performance in various natural language processing (NLP) tasks. However, these models are typically computationally expensive and difficult to be deployed in resource-constrained environments. In this paper, we propos…

2024

Tree-Averaging Algorithms for Ensemble-Based Unsupervised Discontinuous Constituency Parsing

ACL 2024long

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 boos…

2024

Zero-Shot Continuous Prompt Transfer: Generalizing Task Semantics Across Language Models

ICLR 2024poster

Prompt tuning in natural language processing (NLP) has become an increasingly popular method for adapting large language models to specific tasks. However, the transferability of these prompts, especially continuous prompts, between different models remains a challenge. In this work, we propose a ze…

2023

An Equal-Size Hard EM Algorithm for Diverse Dialogue Generation

ICLR 2023poster

Open-domain dialogue systems aim to interact with humans through natural language texts in an open-ended fashion. Despite the recent success of super large dialogue systems such as ChatGPT, using medium-to-small-sized dialogue systems remains the common practice as they are more lightweight and acce…

Cited by 11SourcePDFScholar
2023

Weakly Supervised Explainable Phrasal Reasoning with Neural Fuzzy Logic

ICLR 2023poster

Natural language inference (NLI) aims to determine the logical relationship between two sentences, such as Entailment, Contradiction, and Neutral. In recent years, deep learning models have become a prevailing approach to NLI, but they lack interpretability and explainability. In this work, we addre…

2023

f-Divergence Minimization for Sequence-Level Knowledge Distillation

ACL 2023long

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 ever-growing language models. In this work, we propose an FDISTILL framework,…

2022

A Character-Level Length-Control Algorithm for Non-Autoregressive Sentence Summarization

NeurIPS 2022accept

Sentence summarization aims at compressing a long sentence into a short one that keeps the main gist, and has extensive real-world applications such as headline generation. In previous work, researchers have developed various approaches to improve the ROUGE score, which is the main evaluation metric…

2022

Document-Level Relation Extraction with Sentences Importance Estimation and Focusing

NAACL 2022long

Document-level relation extraction (DocRE) aims to determine the relation between two entities from a document of multiple sentences. Recent studies typically represent the entire document by sequence- or graph-based models to predict the relations of all entity pairs. However, we find that such a m…

2022

Generalized Equivariance and Preferential Labeling for GNN Node Classification

AAAI 2022technical

Existing graph neural networks (GNNs) largely rely on node embeddings, which represent a node as a vector by its identity, type, or content. However, graphs with unattributed nodes widely exist in real-world applications (e.g., anonymized social networks). Previous GNNs either assign random labels t…

2022

Learning Non-Autoregressive Models from Search for Unsupervised Sentence Summarization

ACL 2022long

Text summarization aims to generate a short summary for an input text. In this work, we propose a Non-Autoregressive Unsupervised Summarization (NAUS) approach, which does not require parallel data for training. Our NAUS first performs edit-based search towards a heuristically defined score, and gen…

2022

Non-autoregressive Translation with Layer-Wise Prediction and Deep Supervision

AAAI 2022technical

How do we perform efficient inference while retaining high translation quality? Existing neural machine translation models, such as Transformer, achieve high performance, but they decode words one by one, which is inefficient. Recent non-autoregressive translation models speed up the inference, but…

2022

Search and Learn: Improving Semantic Coverage for Data-to-Text Generation

AAAI 2022technical

Data-to-text generation systems aim to generate text descriptions based on input data (often represented in the tabular form). A typical system uses huge training samples for learning the correspondence between tables and texts. However, large training sets are expensive to obtain, limiting the appl…

2021

Seq2Emo: A Sequence to Multi-Label Emotion Classification Model

NAACL 2021long

Multi-label emotion classification is an important task in NLP and is essential to many applications. In this work, we propose a sequence-to-emotion (Seq2Emo) approach, which implicitly models emotion correlations in a bi-directional decoder. Experiments on SemEval’18 and GoEmotions datasets show th…

2021

Unsupervised Chunking as Syntactic Structure Induction with a Knowledge-Transfer Approach

EMNLP 2021finding

In this paper, we address unsupervised chunking as a new task of syntactic structure induction, which is helpful for understanding the linguistic structures of human languages as well as processing low-resource languages. We propose a knowledge-transfer approach that heuristically induces chunk labe…

2020

Adversarial Learning on the Latent Space for Diverse Dialog Generation

COLING 2020main

Generating relevant responses in a dialog is challenging, and requires not only proper modeling of context in the conversation, but also being able to generate fluent sentences during inference. In this paper, we propose a two-step framework based on generative adversarial nets for generating condit…

2020

Progressive Memory Banks for Incremental Domain Adaptation

ICLR 2020poster

This paper addresses the problem of incremental domain adaptation (IDA) in natural language processing (NLP). We assume each domain comes one after another, and that we could only access data in the current domain. The goal of IDA is to build a unified model performing well on all the domains that…

Cited by 32SourcecodeScholar
2020

Unsupervised Text Generation by Learning from Search

NeurIPS 2020poster

In this work, we propose TGLS, a novel framework for unsupervised Text Generation by Learning from Search. We start by applying a strong search algorithm (in particular, simulated annealing) towards a heuristically defined objective that (roughly) estimates the quality of sentences. Then, a conditio…

2019

Why Do Neural Dialog Systems Generate Short and Meaningless Replies? a Comparison between Dialog and Translation

ICASSP 2019accepted

This paper addresses the question: In neural dialog systems, why do sequence-to-sequence (Seq2Seq) neural networks generate short and meaningless replies for open-domain response generation? We conjecture that in a dialog system, due to the randomness of spoken language, there may be multiple equall…

Cited by 0SourceScholar
2017

Coupling Distributed and Symbolic Execution for Natural Language Queries

ICML 2017poster

Building neural networks to query a knowledge base (a table) with natural language is an emerging research topic in deep learning. An executor for table querying typically requires multiple steps of execution because queries may have complicated structures. In previous studies, researchers have deve…

Cited by 52SourcePDFScholar