Papers by Yuning Mao

26 papers
Towards a Unified Multi-Dimensional Evaluator for Text Generation (2022.emnlp-main)

Copied to clipboard

Challenge: Existing evaluation frameworks for natural language generation are dominated by similarity-based metrics.
Approach: They propose a multi-dimensional evaluator for natural language generation that integrates multiple dimensions into one evaluer.
Outcome: The proposed evaluator improves on three typical NLG tasks and improves with external knowledge.
MART: Improving LLM Safety with Multi-round Automatic Red-Teaming (2024.naacl-long)

Copied to clipboard

Challenge: Existing red-teaming methods for large language models often discover safety risks without addressing them.
Approach: They propose a multi-round automatic red-teaming method that incorporates both adversarial prompt writing and safe response generation.
Outcome: The proposed method significantly increases red-teaming scalability and the safety of the target LLM.
Facet-Aware Evaluation for Extractive Summarization (2020.acl-main)

Copied to clipboard

Challenge: lexical overlap is a common evaluation metric for extractive summarization, but recent studies reveal its limitations.
Approach: They propose a facet-aware evaluation setup for better assessment of information coverage in extractive summaries.
Outcome: The proposed evaluation setup improves human correlation with extractive summarization datasets and improves comparative analysis.
Eider: Empowering Document-level Relation Extraction with Efficient Evidence Extraction and Inference-stage Fusion (2022.findings-acl)

Copied to clipboard

Challenge: Document-level relation extraction (DocRE) aims to extract semantic relations among entity pairs in a document.
Approach: They propose an evidence-enhanced framework that empowers document-level relation extraction (DocRE) Eider efficiently extracts evidence and effectively fuses extracted evidence in inference.
Outcome: The proposed framework outperforms state-of-the-art methods on three benchmark datasets.
Residual Prompt Tuning: improving prompt tuning with residual reparameterization (2023.findings-acl)

Copied to clipboard

Challenge: Prompt tuning is one of the most parameter-efficient approaches for parameter-effective tuning of pre-trained language models.
Approach: They propose to reparameterize soft prompt embeddings using a shallow network with a residual connection and use it to tune prompt embeds P.
Outcome: The proposed method outperforms prompt tuning on SuperGLUE, T5-Base and BERT-Bass models and can reduce the prompt length by 10 times without hurting performance.
CiteSum: Citation Text-guided Scientific Extreme Summarization and Domain Adaptation with Limited Supervision (2022.emnlp-main)

Copied to clipboard

Challenge: Scientific extreme summarization (TLDR) aims to form ultra-short summaries of scientific papers . previous attempts failed to scale up due to heavy human annotation and domain expertise .
Approach: They propose a method to automatically extract TLDR summaries from scientific papers . they propose 'citeSum' with no human annotation, which is 30 times larger than SciTLDR .
Outcome: The proposed approach outperforms most fully-supervised methods on SciTLDR without fine-tuning and achieves state-of-the-art results with only 128 examples.
Generating Hashtags for Short-form Videos with Guided Signals (2023.acl-long)

Copied to clipboard

Challenge: Short-form video hashtag recommendation (SVHR) is a classification or ranking problem that selects hashtags from a set of limited candidates.
Approach: They propose a short-form video hashtag recommendation task that better represents how hashtags are created naturally by retrieving relevant hashtags from a large-scale hashtag pool as extra guidance signals.
Outcome: The proposed model outperforms strong classification baselines on two short-form video datasets and the guidance signals boost the performance by 8.11 and 2.17 absolute ROUGE-1 scores on average.
Hierarchical Text Classification with Reinforced Label Assignment (D19-1)

Copied to clipboard

Challenge: Existing hierarchical text classification methods make local decisions regarding labels or ignore hierarchy information during inference.
Approach: They propose to learn a Label Assignment Policy via deep reinforcement learning to determine where to place an object and when to stop the assignment process.
Outcome: The proposed method outperforms state-of-the-art methods on five datasets and four base models and achieves an average improvement of 33.4% over flat classifiers.
XLM-V: Overcoming the Vocabulary Bottleneck in Multilingual Masked Language Models (2023.emnlp-main)

Copied to clipboard

Challenge: Large multilingual models rely on a single vocabulary shared across 100+ languages . this vocabulary bottleneck limits the representational capabilities of multilingual model XLM-R .
Approach: They propose a new approach for scaling to large multilingual vocabularies by de-emphasizing token sharing between languages with little lexical overlap and assigning vocabulary capacity to achieve sufficient coverage for each individual language.
Outcome: The proposed model outperforms XLM-R on all language tasks and is particularly effective on low-resource tasks.
SAIS: Supervising and Augmenting Intermediate Steps for Document-Level Relation Extraction (2022.naacl-main)

Copied to clipboard

Challenge: Existing methods for relation extraction only implicitly learn to model relevant contexts and entity types while being trained for RE.
Approach: They propose to explicitly teach the model to capture relevant contexts and entity types by supervising and augmenting intermediate steps (SAIS) for RE.
Outcome: The proposed method outperforms the runner-up method on three benchmarks by 5.04% . textual contexts and entity types are the major information sources that lead to the success of previous approaches.
M2PT: Multimodal Prompt Tuning for Zero-shot Instruction Learning (2024.emnlp-main)

Copied to clipboard

Challenge: Multimodal Large Language Models (MLLMs) exhibit remarkable performance across a wide range of domains.
Approach: They propose a multimodal prompt tuning approach for efficient instruction tuning of MLLMs.
Outcome: The proposed approach shows superior performance on multimodal evaluation datasets compared to state-of-the-art methods.
Align Documents to Questions: Question-Oriented Document Rewriting for Retrieval-Augmented Generation (2026.findings-acl)

Copied to clipboard

Challenge: Retrieval-Augmented Generation (RAG) enhances the factuality of Large Language Models (LLMs) however, LLMs exhibit a stylistic bias when presented with mixed contexts, revealing a bottleneck in their utility.
Approach: They propose a style-controlled rewriter that aligns retrieved documents with a question-oriented style while preserving facts.
Outcome: The proposed model improves RAG pipelines by 8% with negligible latency overhead.
Improving Model Factuality with Fine-grained Critique-based Evaluator (2025.acl-long)

Copied to clipboard

Challenge: Factuality evaluation aims to detect factual errors produced by language models and guide the development of more factual models.
Approach: They propose a framework that leverages FenCE to improve the factuality of LM generators by constructing training data.
Outcome: The proposed framework improves the factuality of LM generators by enhancing their training data.
Multi-document Summarization with Maximal Marginal Relevance-guided Reinforcement Learning (2020.emnlp-main)

Copied to clipboard

Challenge: Recent studies on single-document summarization (SDS) benefit from advances in neural sequence learning, but they produce unsatisfactory results on multi-document summary (MDS).
Approach: They propose a neural sequence learning method that unifies advanced neural SDS methods and statistical measures used in classical MDS.
Outcome: The proposed method achieves state-of-the-art performance on benchmark MDS datasets.
UniPELT: A Unified Framework for Parameter-Efficient Language Model Tuning (2022.acl-long)

Copied to clipboard

Challenge: Existing methods for parameter-efficient language model tuning (PELT) match the performance of fine-tuning with fewer trainable parameters.
Approach: They propose a framework which integrates different PELT methods as submodules and learns to activate the ones that best suit the current data or task setup via gating mechanism.
Outcome: The proposed framework outperforms fine-tuning methods on the GLUE benchmark and achieves 14% gains over the best individual PELT method.
Learning Collaborative Agents with Rule Guidance for Knowledge Graph Reasoning (2020.emnlp-main)

Copied to clipboard

Challenge: Walk-based models have shown their advantages in knowledge graph reasoning but are limited by their representations and generalizability.
Approach: They propose a walk-based model that leverages high-quality rules generated by symbolic-based methods to provide reward supervision for walk- based agents.
Outcome: Experiments on benchmark datasets show that RuleGuider improves the performance of walk-based models without losing interpretability.
APrompt: Attention Prompt Tuning for Efficient Adaptation of Pre-trained Language Models (2023.emnlp-main)

Copied to clipboard

Challenge: Existing prompt tuning methods only introduce prompts at the input layer, limiting performance and leaving large room for improvement.
Approach: They propose a method that involves tuning a small set of soft prompts for pre-trained language models.
Outcome: The proposed method outperforms state-of-the-art methods with pre-trained models on the SuperGLUE benchmark.
Learning Visually-Grounded Semantics from Contrastive Adversarial Samples (C18-1)

Copied to clipboard

Challenge: Existing frameworks for grounding distributional representations of texts on the visual domain are limited . effective and efficient grounding of distributional embeddings remains challenging .
Approach: They propose to ground distributional representations of texts on the visual domain using visual-semantic embeddings.
Outcome: The proposed model improves on a diverse set of downstream tasks and defends known-type adversarial attacks.
Generation-Augmented Retrieval for Open-Domain Question Answering (2021.acl-long)

Copied to clipboard

Challenge: Existing approaches to answer open-domain questions use sparse representations and sparsity.
Approach: They propose a method which augments a query by generating relevant contexts from heuristically discovered contexts without external supervision.
Outcome: The proposed approach outperforms state-of-the-art dense retrieval methods on natural questions and triviaQA datasets.
Extract, Denoise and Enforce: Evaluating and Improving Concept Preservation for Text-to-Text Generation (2021.emnlp-main)

Copied to clipboard

Challenge: Existing models for text-to-text generation do not explicitly focus on important concepts in the input and output.
Approach: They propose a framework to automatically extract, denoise, and enforce important input concepts as lexical constraints.
Outcome: The proposed framework performs comparably or better than its unconstrained counterpart on automatic metrics and receives better ratings in the human evaluation.
End-to-End Reinforcement Learning for Automatic Taxonomy Induction (P18-1)

Copied to clipboard

Challenge: Existing methods for automating taxonomy induction often divide the problem into two subtasks . a novel end-to-end reinforcement learning approach is proposed to improve the accuracy of such methods.
Approach: They propose an end-to-end reinforcement learning approach to automatic taxonomy induction from a set of terms.
Outcome: The proposed approach outperforms state-of-the-art methods on two public datasets of different domains.
Extrapolating to Unknown Opinions Using LLMs (2025.coling-main)

Copied to clipboard

Challenge: ice cream flavors and climate change are among the topics people hold on various topics.
Approach: They propose to use a large language model to extrapolate from stances to unknown opinions by prompting and fine-tuning data to improve their ability to extrapole from known to unknown stance.
Outcome: The proposed model can extrapolate from opinions on known topics to unknown ones and generate reasoning behind extrapolation.
Unsupervised Multi-Granularity Summarization (2022.findings-emnlp)

Copied to clipboard

Challenge: Experimental results confirm the substantial superiority of GranuSum on multi-granularity summarization over strong baselines.
Approach: They propose to rank events by their salience and annotate a benchmark for GranuSum that contains multiple summaries at different granularities for each document cluster.
Outcome: The proposed framework is capable of producing multi-granular summaries in unsupervised manner over strong baselines.
Knowledge Control for Responsible Generative AI: Bridging Academia, Industry, and Society (2026.acl-tutorials)

Copied to clipboard

Challenge: This tutorial introduces the foundations of post-training knowledge control and showcases recent frontier methods.
Approach: This tutorial introduces the foundations of post-training knowledge control and showcases recent frontier methods.
Outcome: This tutorial introduces the foundations of post-training knowledge control and showcases recent frontier methods . key motivations and failure modes, harmful generation and stereotype reinforcement, are addressed . core methods such as machine unlearning, knowledge editing, and inference-time interventions are also included .
RoAST: Robustifying Language Models via Adversarial Perturbation with Selective Training (2023.findings-emnlp)

Copied to clipboard

Challenge: Several perspectives of robustness for pre-trained language models have been studied independently, but lacking a unified consideration in multiple perspectives.
Approach: They propose a technique to enhance the multi-perspective robustness of LMs by introducing adversarial perturbation while the model parameters are selectively updated upon their relative importance.
Outcome: The proposed technique improves the robustness of LMs by incorporating four perspectives on model robustness.
Reader-Guided Passage Reranking for Open-Domain Question Answering (2021.findings-acl)

Copied to clipboard

Challenge: Current open-domain question answering systems follow a Retriever-Reader architecture . current systems do not use a reranker, which reranked passages based on top predictions of the reader .
Approach: They propose a reader-guIDEd reranking method that reranked passages based on top predictions . they show that RIDER achieves 10 to 20 absolute gains in top-1 retrieval accuracy .
Outcome: The proposed method achieves 10 to 20 gains in top-1 retrieval accuracy and 1 to 4 Exact Match gains without training.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations