Papers by Wei Ping
Guiding Neural Machine Translation with Semantic Kernels (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Empirical studies show that our approach gains approximately an improvement of 1 BLEU score on most benchmarks over the Transformer baseline. |
| Approach: | They propose to extract several semantic kernels from a source sentence to capture global semantic information. |
| Outcome: | Empirical results show that the proposed approach improves 1 BLEU score on benchmarks . it is also 1.7 times faster than previous works on average at inference time . |
Re-ViLM: Retrieval-Augmented Visual Language Model for Zero and Few-Shot Image Captioning (2023.findings-emnlp)
Copied to clipboard
Zhuolin Yang, Wei Ping, Zihan Liu, Vijay Korthikanti, Weili Nie, De-An Huang, Linxi Fan, Zhiding Yu, Shiyi Lan, Bo Li, Mohammad Shoeybi, Ming-Yu Liu, Yuke Zhu, Bryan Catanzaro, Chaowei Xiao, Anima Anandkumar
| Challenge: | Existing methods for image-to-text generation store all knowledge within parameters, thus requiring computational-expensive fine-tuning. |
| Approach: | They propose a Retrieval-augmented Visual Language Model that stores all the knowledge within parameters and can be used to retrieve it from the external database. |
| Outcome: | The proposed model significantly boosts performance for image-to-text generation tasks with 4x less parameters compared with baseline methods. |
Defending against Insertion-based Textual Backdoor Attacks via Attribution (2023.findings-acl)
Copied to clipboard
| Challenge: | Textual backdoor attacks are vulnerable to backdoors and can be used to infect models trained on poisoned data. |
| Approach: | They propose an efficient attribution-based pipeline to defend against two insertion-based poisoning attacks, BadNL and InSent. |
| Outcome: | The proposed method can generalize sufficiently well in two common attack scenarios, which consistently improves previous methods. |
Structured Pruning for Efficient Generative Pre-trained Language Models (2023.findings-acl)
Copied to clipboard
| Challenge: | Large-scale generative Pre-trained Language Models (PLMs) are limited in their deployment in real-world applications. |
| Approach: | They propose to prune the feed-forward networks of generative pre-trained language models to smaller widths without designing extra operators. |
| Outcome: | The proposed method achieves 1.51x/6.96x inference speedup on GPU/CPU with 67% size reduction. |
Unveiling and Consulting Core Experts in Retrieval-Augmented MoE-based LLMs (2024.emnlp-main)
Copied to clipboard
Xin Zhou, Ping Nie, Yiwen Guo, Haojie Wei, Zhanqiu Zhang, Pasquale Minervini, Ruotian Ma, Tao Gui, Qi Zhang, Xuanjing Huang
| Challenge: | Existing research seeks to enhance RAG performance by retrieving higher-quality documents or designing RAG-specific LLMs, but internal mechanisms that contribute to RAG’s effectiveness remain underexplored. |
| Approach: | They propose to examine the internal mechanisms within the popular Mixture-of-Expert (MoE)-based LLMs and examine their ability to improve RAG by examining expert activations. |
| Outcome: | The proposed method significantly improved the ability of Large Language Models (LLMs) to solve knowledge-intensive tasks. |
Compression of Generative Pre-trained Language Models via Quantization (2022.acl-long)
Copied to clipboard
| Challenge: | Existing methods to compress generative pre-trained language models fail on generative tasks due to homogeneous word embeddings and limited memory. |
| Approach: | They propose a token-level contrastive distillation method to learn distinguishable word embeddings and a module-wise dynamic scaling method to make quantizers adaptive to different modules. |
| Outcome: | The proposed method outperforms the state-of-the-art compression methods on generative PLMs by a clear margin. |
Retrieve-and-Sample: Document-level Event Argument Extraction via Hybrid Retrieval Augmentation (2023.acl-long)
Copied to clipboard
| Challenge: | Recent studies show the effectiveness of retrieval augmentation in many generative NLP tasks. |
| Approach: | They investigate retrieval settings from the input and label distribution views . they further augment document-level EAE with pseudo demonstrations sampled from event semantic regions . |
| Outcome: | The proposed methods can augment document-level EAE with pseudo demonstrations . the methods can be used in generative NLP tasks such as dialogue response generation . |
DEIE: Benchmarking Document-level Event Information Extraction with a Large-scale Chinese News Dataset (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing event-based datasets mainly target sentence-level tasks . current models struggle with "document" annotation, a key feature of the current model . |
| Approach: | They propose a large-scale document-level event information extraction dataset with over 56,000+ events and 242,000+ arguments. |
| Outcome: | The proposed dataset has over 56,000+ events and 242,000+ arguments. |
TAeKD: Teacher Assistant Enhanced Knowledge Distillation for Closed-Source Multilingual Neural Machine Translation (2024.lrec-main)
Copied to clipboard
| Challenge: | Large language models (LLMs) have produced impressive results in the field of Multilingual Neural Machine Translation (MNMT). |
| Approach: | They propose a Teacher Assistant enhanced Knowledge Distillation method to augment knowledge transfer capacity from closed-source MNMT models. |
| Outcome: | The proposed method outperforms the state-of-the-art KD methods on both WMT22 and FLORES-101 test sets. |
AceMath: Advancing Frontier Math Reasoning with Post-Training and Reward Modeling (2025.findings-acl)
Copied to clipboard
| Challenge: | In this paper, we introduce a suite of math models that excel in solving complex math problems. |
| Approach: | They propose a supervised fine-tuning process that achieves competitive performance across general domains, followed by targeted fine- tuning for the math domain using a carefully curated set of prompts and synthetically generated responses. |
| Outcome: | The proposed model outperforms Qwen2.5-Math-72B-Instruct, GPT-4o and Claude-3.5 Sonnet in the math domain. |
CLIO: Role-interactive Multi-event Head Attention Network for Document-level Event Extraction (2022.coling-1)
Copied to clipboard
| Challenge: | Existing methods for document-level event extraction struggle due to two intrinsic challenges: nested arguments and multiple events. |
| Approach: | They propose a role-interactive multi-event head attention network to solve two challenges . they map different events to multiple subspaces and then determine whether the current event exists . |
| Outcome: | The proposed model improves on two widely used DEE datasets on the Internet. |
Evaluating Parameter Efficient Learning for Generation (2022.emnlp-main)
Copied to clipboard
Peng Xu, Mostofa Patwary, Shrimai Prabhumoye, Virginia Adams, Ryan Prenger, Wei Ping, Nayeon Lee, Mohammad Shoeybi, Bryan Catanzaro
| Challenge: | Parameter efficient learning methods (PERMs) are gaining attention for their ability to adapt to a downstream task. |
| Approach: | They propose to use parameter efficient learning methods to improve model adaptation . they compare in-domain evaluations and generalizations to unseen domains and new datasets . |
| Outcome: | The proposed method outperforms finetuning and PERMs in in-domain evaluations. |
Lightweight LLM Agent Memory with Small Language Models (2026.acl-long)
Copied to clipboard
Jiaquan Zhang, Chaoning Zhang, Shuxu Chen, Zhenzhen Huang, Pengcheng Zheng, Zhicheng Wang, Ping Guo, Fan Mo, Sung-Ho Bae, Jie Zou, Jiwei Wei, Yang Yang
| Challenge: | Existing external memory systems for LLMs have low online overhead but are unstable in accumulating latency over long interactions. |
| Approach: | They propose a lightweight memory system for better agent memory driven by Small Language Models . lightmem modularizes memory retrieval, writing, and long-term consolidation . they show consistent gains across model scales and high efficiency . |
| Outcome: | The proposed system improves agent memory but has low latency and low online overhead . it separates online processing from offline consolidation to enable efficient memory invocation . the proposed system achieves an average F1 improvement of 2.5 over A-MEM on LoCoMo . |
From 128K to 4M: Efficient Training of Ultra-Long Context Large Language Models (2026.findings-acl)
Copied to clipboard
| Challenge: | Long-context capabilities are essential for document and video understanding, in-contact learning, and inference-time scaling. |
| Approach: | They propose an efficient training recipe for building ultra-long context LLMs from aligned instruct model, pushing the boundaries of context lengths from 128K to 1M, 2M, and 4M tokens. |
| Outcome: | The proposed model extends the context window while maintaining short context capabilities while maintaining the performance of the existing model. |
Shall We Pretrain Autoregressive Language Models with Retrieval? A Comprehensive Study (2023.emnlp-main)
Copied to clipboard
Boxin Wang, Wei Ping, Peng Xu, Lawrence McAfee, Zihan Liu, Mohammad Shoeybi, Yi Dong, Oleksii Kuchaiev, Bo Li, Chaowei Xiao, Anima Anandkumar, Bryan Catanzaro
| Challenge: | a recent study shows that retrieval-augmented LMs can improve text generation quality and accuracy. |
| Approach: | They propose a model that reproduces RETRO parameters while retrieving a text corpus . they find RETRO outperforms GPT on text generation with less repetition . |
| Outcome: | The proposed model outperforms standard retrieval-augmented GPT and retrieval augmented GTP on text generation and accuracy tasks. |
Multi-Stage Prompting for Knowledgeable Dialogue Generation (2022.findings-acl)
Copied to clipboard
Zihan Liu, Mostofa Patwary, Ryan Prenger, Shrimai Prabhumoye, Wei Ping, Mohammad Shoeybi, Bryan Catanzaro
| Challenge: | Existing knowledge-grounded dialogue systems typically use finetuned versions of a pretrained language model and large-scale knowledge bases. |
| Approach: | They propose a multi-stage prompting approach to generate knowledgeable responses from a single pretrained LM. |
| Outcome: | The proposed model outperforms the state-of-the-art retrieval-based model in terms of knowledge relevance and correctness by 5.8% and 5%, respectively. |
Subtle Signatures, Strong Shields: Advancing Robust and Imperceptible Watermarking in Large Language Models (2024.findings-acl)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have led to an increase in AI-generated text on the Internet, presenting a crucial challenge to differentiate AI-created content from human-written text. |
| Approach: | They propose a novel approach to embed watermarks into LLMs that leverages token prior probabilities to improve detectability and maintain watermark imperceptibility. |
| Outcome: | The proposed method improves detectability and imperceptibility of watermarks by partitioning tokens into two distinct groups based on prior probabilities and employing tailored strategies for each group. |
End-to-End Training of Neural Retrievers for Open-Domain Question Answering (2021.acl-long)
Copied to clipboard
Devendra Sachan, Mostofa Patwary, Mohammad Shoeybi, Neel Kant, Wei Ping, William L. Hamilton, Bryan Catanzaro
| Challenge: | Recent work on training neural retrievers for open-domain question answering (OpenQA) has employed both supervised and unsupervised methods. |
| Approach: | They propose an approach of unsupervised pre-training with the Inverse Cloze Task and masked salient spans followed by supervised finetuning using question-context pairs. |
| Outcome: | The proposed approach outperforms models like REALM and RAG in retrieval accuracy and answer extraction. |
Large Margin Neural Language Model (D18-1)
Copied to clipboard
| Challenge: | Conventionally, neural language models are trained by minimizing perplexity (PPL) on grammatical sentences. |
| Approach: | They propose a large margin criterion for training neural language models by minimizing perplexity on grammatical sentences and propose enlarged margins for task-specific training. |
| Outcome: | The proposed method gains up to 1.1 WER reduction for speech recognition and 1.0 BLEU increase for machine translation. |