Papers by Xiaodong Wang
Adversarial Domain Adaptation for Machine Reading Comprehension (D19-1)
Copied to clipboard
| Challenge: | Existing models for machine reading comprehension rely on large amounts of human-annotated in-domain data. |
| Approach: | They propose an unsupervised domain adaptation framework for Machine Reading Comprehension where the source domain has a large amount of labeled data, while only unlabeled passages are available in the target domain. |
| Outcome: | The proposed framework can be generalizable to different MRC models and datasets and can be extended to semi-supervised learning. |
Pre-training Multi-task Contrastive Learning Models for Scientific Literature Understanding (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Pre-trained language models (LMs) have shown effectiveness in literature understanding tasks, especially when tuned via contrastive learning. |
| Approach: | They propose a multi-task contrastive learning framework that enables common knowledge sharing across different scientific literature understanding tasks while preventing task-specific skills from interfering with each other. |
| Outcome: | The proposed framework outperforms state-of-the-art pre-trained language models on a comprehensive dataset. |
Self-Taught Agentic Long Context Understanding (2025.acl-long)
Copied to clipboard
Yufan Zhuang, Xiaodong Yu, Jialian Wu, Ximeng Sun, Ze Wang, Jiang Liu, Yusheng Su, Jingbo Shang, Zicheng Liu, Emad Barsoum
| Challenge: | Extensive experiments across seven long-context tasks demonstrate that AgenticLU significantly outperforms state-of-the-art prompting methods and specialized long-consumer LLMs. |
| Approach: | They propose a framework to enhance an LLM's understanding of long-context questions by integrating targeted self-clarification with contextual grounding within an agentic workflow. |
| Outcome: | The proposed framework outperforms state-of-the-art prompting methods and specialized long-context LLMs in seven long-constitut tasks. |
Beyond Token Length: Step Pruner for Efficient and Accurate Reasoning in Large Language Models (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing reinforcement learning methods for large reasoning models suffer from excessive verbosity, known as "overthinking." Existing models penalize generated tokens to promote conciseness, but these methods encounter two challenges: they may develop hacking behavior in later stages of training by discarding reasoning steps. |
| Approach: | They propose a framework that steers large reasoning models toward more efficient reasoning . they prioritize correctness while imposing penalties for redundant steps . |
| Outcome: | The proposed framework reduces token usage by 69.7% on AIME24. |
Multi-hop Reading Comprehension across Multiple Documents by Reasoning over Heterogeneous Graphs (P19-1)
Copied to clipboard
| Challenge: | Existing models to tackle multi-hop reading comprehension (RC) are focusing on a single document or paragraph, but they lack the ability to do reasoning across multiple documents. |
| Approach: | They propose a heterogeneous document-entity graph with different types of nodes and edges to solve multi-hop RC problem. |
| Outcome: | The proposed model can do reasoning over the proposed graph with nodes representation initialized with co-attention and self-attention based context encoders. |
SGG: Learning to Select, Guide, and Generate for Keyphrase Generation (2021.naacl-main)
Copied to clipboard
| Challenge: | Existing keyphrase generation approaches synchronously generate present and absent keyphrases without explicitly distinguishing these two categories. |
| Approach: | They propose to deal with present and absent keyphrases separately with different mechanisms by using a hierarchical neural network with a pointing-based selector and a selection-guided generator. |
| Outcome: | The proposed model outperforms baselines on four keyphrase generation tasks and shows extensibility in natural language generation tasks. |
The Microsoft Toolkit of Multi-Task Deep Neural Networks for Natural Language Understanding (2020.acl-demos)
Copied to clipboard
Xiaodong Liu, Yu Wang, Jianshu Ji, Hao Cheng, Xueyun Zhu, Emmanuel Awa, Pengcheng He, Weizhu Chen, Hoifung Poon, Guihong Cao, Jianfeng Gao
| Challenge: | MT-DNN is an open-source natural language understanding toolkit . it allows researchers and developers to train customized deep learning models . |
| Approach: | They present MT-DNN, an open-source natural language understanding toolkit . it is designed to facilitate rapid customization for a broad spectrum of NLU tasks . MT supports multi-task knowledge distillation, which can substantially compress a deep neural model without significant performance drop. |
| Outcome: | The proposed model can significantly compress a large model without significant performance drop. |
Prompt Space Optimizing Few-shot Reasoning Success with Large Language Models (2024.findings-naacl)
Copied to clipboard
| Challenge: | Prompt engineering is an essential technique for enhancing the abilities of large language models (LLMs) by providing explicit and specific instructions. |
| Approach: | They propose a new approach that uses text embeddings to obtain basis vectors by matrix decomposition and constructs a space for representing all prompts. |
| Outcome: | The proposed approach significantly outperforms state-of-the-art prompt paradigms on ten public reasoning benchmarks. |
E-ConvRec: A Large-Scale Conversational Recommendation Dataset for E-Commerce Customer Service (2022.lrec-1)
Copied to clipboard
Meihuizi Jia, Ruixue Liu, Peiying Wang, Yang Song, Zexi Xi, Haobin Li, Xin Shen, Meng Chen, Jinhui Pang, Xiaodong He
| Challenge: | Recent research has focused on developing conversational recommendation system (CRS), which provides valuable recommendations to users through conversations. |
| Approach: | They construct an authentic Chinese dialogue dataset consisting of over 25k dialogues and 770k utterances, which contains user profile, product knowledge base, and multiple sequential real conversations between users and recommenders. |
| Outcome: | The proposed dataset contains user profile, product knowledge base, and multiple sequential real conversations between users and recommenders. |
M2PA: A Multi-Memory Planning Agent for Open Worlds Inspired by Cognitive Theory (2025.findings-acl)
Copied to clipboard
YanfangZhou YanfangZhou, Xiaodong Li, Yuntao Liu, Yongqiang Zhao, Xintong Wang, Zhenyu Li, Jinlong Tian, Xinhai Xu
| Challenge: | Open-world planning poses a challenge due to complex environments and task diversity . recent work shows that large language models (LLMs) lack the ability to connect to agents' experiences . |
| Approach: | They propose an open-world multi-memory planning agent that combines large language models with human-like multi-mesh systems to leverage their strengths. |
| Outcome: | The proposed agent outperforms state-of-the-art agents on 50 Minecraft tasks in zero-shot learning. |
Agent Laboratory: Using LLM Agents as Research Assistants (2025.findings-emnlp)
Copied to clipboard
Samuel Schmidgall, Yusheng Su, Ze Wang, Ximeng Sun, Jialian Wu, Xiaodong Yu, Jiang Liu, Michael Moor, Zicheng Liu, Emad Barsoum
| Challenge: | Agent Laboratory is an autonomous LLM-based framework that can complete the entire research process. |
| Approach: | Agent Laboratory is an autonomous LLM-based framework that can complete the entire research process. |
| Outcome: | Agent Laboratory is an autonomous LLM-based framework that can complete the entire research process. |
Capturing the Content of a Document through Complex Event Identification (2022.starsem-1)
Copied to clipboard
| Challenge: | Recent work grouped granular events into more general events, called complex events . however, this approach assumes that a given complex event is always described in consecutive sentences . |
| Approach: | They propose a context-augmented representation learning approach that uses contextual information to model pairwise relation between granular events. |
| Outcome: | The proposed approach outperforms baselines on the complex event identification task. |
Stabilizing Efficient Reasoning with Step-Level Advantage Selection (2026.findings-acl)
Copied to clipboard
| Challenge: | Large language models generate long and verbose reasoning traces at inference time . short context post-training alone induces substantial reasoning compression . |
| Approach: | They propose a step-level advantage selection approach that reduces reasoning length by over 30% . they propose to use GRPO without any length-aware objective to train models in a shorter context window . |
| Outcome: | The proposed approach reduces average reasoning length by over 30% while improving Pass@1 accuracy by 3.79 points over the strongest length-aware baseline. |
Deep Reinforcement Learning for NLP (P18-5)
Copied to clipboard
| Challenge: | Many natural language processing tasks can be formulated as deep reinforcement learning (DRL) problems. |
| Approach: | This tutorial provides an introduction to the foundations of deep reinforcement learning . it describes recent advances in designing deep reinforcement for NLP . |
| Outcome: | This tutorial provides an introduction to the foundations of deep reinforcement learning and some practical solutions for NLP tasks. |
Reliable Use of Lemmas via Eligibility Reasoning and Section-Aware Reinforcement Learning (2026.acl-short)
Copied to clipboard
| Challenge: | Recent large language models (LLMs) perform strongly on mathematical benchmarks but often import conclusions without validating assumptions. |
| Approach: | They propose a model that encodes a lemma specification and trains with reinforcement learning and section-aware loss masking to assign penalty to the section responsible for errors. |
| Outcome: | The proposed model performs well on benchmarks but often misapplyes lemmas . the model is able to encode the specification and train with reinforcement learning . |
Fine- and Coarse-Granularity Hybrid Self-Attention for Efficient BERT (2022.acl-long)
Copied to clipboard
| Challenge: | Transformer-based pre-trained models achieve state-of-the-art results, but they can be prohibitively costly. |
| Approach: | They propose a fine- and coarse-granularity hybrid self-attention that shortens the computational sequence length in self- attention by progressively shortening the computational time. |
| Outcome: | The proposed model reduces computation cost by shortening the computational sequence length in self-attention. |
K-PLUG: Knowledge-injected Pre-trained Language Model for Natural Language Understanding and Generation in E-Commerce (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Existing pre-trained language models are not explicitly aware of domain-specific knowledge, which is essential for downstream tasks in many domains, such as tasks in e-commerce scenarios. |
| Approach: | They propose a knowledge-injected pre-trained language model that can be transferred to both natural language understanding and generation tasks. |
| Outcome: | The proposed model significantly outperforms baselines across the board in e-commerce scenarios. |
No, you’re not alone: A better way to find people with similar experiences on Reddit (D19-55)
Copied to clipboard
| Challenge: | a probabilistic clustering algorithm can help users find posts that discuss experiences similar to their own . a recent study shows that probabilistic Clustering can yield a better performance than baseline clustering methods . |
| Approach: | They propose a probabilistic clustering algorithm that can help Reddit users find posts that discuss experiences similar to their own. |
| Outcome: | The proposed algorithm can find posts that discuss experiences similar to their own . it performs better than baseline clustering methods due to high runtime overhead . |
RESIN: A Dockerized Schema-Guided Cross-document Cross-lingual Cross-media Information Extraction and Event Tracking System (2021.naacl-demos)
Copied to clipboard
Haoyang Wen, Ying Lin, Tuan Lai, Xiaoman Pan, Sha Li, Xudong Lin, Ben Zhou, Manling Li, Haoyu Wang, Hongming Zhang, Xiaodong Yu, Alexander Dong, Zhenhailong Wang, Yi Fung, Piyush Mishra, Qing Lyu, Dídac Surís, Brian Chen, Susan Windisch Brown, Martha Palmer, Chris Callison-Burch, Carl Vondrick, Jiawei Han, Dan Roth, Shih-Fu Chang, Heng Ji
| Challenge: | We present a new information extraction system that can construct temporal event graphs from news documents. |
| Approach: | They propose a temporal event graph extraction system that can extract news documents . they extend the system from sentence-level event extraction to cross-document cross-media event extraction . |
| Outcome: | The proposed system can extract temporal event graphs from news documents in multiple languages and multiple data modalities. |
Natural Language to Structured Query Generation via Meta-Learning (N18-2)
Copied to clipboard
| Challenge: | Conventional supervised training is a pervasive paradigm for NLP problems . however, examples of the same problem may vary widely . a few-shot meta-learning scenario is used to learn multiple models . |
| Approach: | They propose a learning protocol that treats each example as a unique pseudo-task . they use a few-shot meta-learning scenario to reduce the original learning problem to a single example . |
| Outcome: | The proposed learning protocol achieves 1.1%–5.4% accuracy gains over non-meta-learning counterparts on a WikiSQL dataset. |
Learning to Decouple Relations: Few-Shot Relation Classification with Entity-Guided Attention and Confusion-Aware Training (2020.coling-main)
Copied to clipboard
| Challenge: | Existing few-shot relation classifiers struggle to distinguish them with few annotated instances due to high co-occurrence of some relations . |
| Approach: | They propose a few-shot relation classification model with two mechanisms to decouple easily-confused relations. |
| Outcome: | The proposed model achieves comparable and even better results to strong baselines in terms of accuracy. |
Original Content Is All You Need! an Empirical Study on Leveraging Answer Summary for WikiHowQA Answer Selection Task (2022.coling-1)
Copied to clipboard
Liang Wen, Juan Li, Houfeng Wang, Yingwei Luo, Xiaolin Wang, Xiaodong Zhang, Zhicong Cheng, Dawei Yin
| Challenge: | Existing answer selection approaches for community question answering lack additional answer summaries due to redundancy and lengthiness issues of crowdsourced answers. |
| Approach: | They constructed a dataset which contains a corresponding reference summary for each original lengthy answer. |
| Outcome: | The proposed model improves the performance of a question and candidate answer on a WikiHowQA dataset. |
Reasoning with Ontology Graph: Toward Type-Constrained Knowledge Graph Question Answering (2026.acl-long)
Copied to clipboard
| Challenge: | Existing knowledge graph question answering methods rely on LLM-induced type systems with inconsistent granularity or perform multi-hop reasoning without explicit target-type constraints. |
| Approach: | They propose a type-constrained knowledge graph question answering framework that reasons over a relation-centric ontology graph. |
| Outcome: | The proposed framework achieves state-of-the-art and produces ontology-grounded reasoning chains with substantial Hit@1 gains. |
Graph Ensemble Learning over Multiple Dependency Trees for Aspect-level Sentiment Classification (2021.naacl-main)
Copied to clipboard
| Challenge: | Recent work on aspect-level sentiment classification has shown that syntactic information is effective in capturing long-range syntaktic relations that are obscure from the surface form. |
| Approach: | They propose a graph ensemble technique that integrates syntactic structures with GNNs to better leverage syntaktic information in the face of parsing errors. |
| Outcome: | The proposed model outperforms models with single dependency tree and beats other models without adding model parameters. |
MatPlotAgent: Method and Evaluation for LLM-Based Agentic Scientific Data Visualization (2024.findings-acl)
Copied to clipboard
Zhiyu Yang, Zihan Zhou, Shuo Wang, Xin Cong, Xu Han, Yukun Yan, Zhenghao Liu, Zhixing Tan, Pengyuan Liu, Dong Yu, Zhiyuan Liu, Xiaodong Shi, Maosong Sun
| Challenge: | Scientific data visualization is an essential process in research, but its use of large language models remains unexplored. |
| Approach: | They propose a model-agnostic LLM agent framework to automate scientific data visualization tasks. |
| Outcome: | The proposed framework improves performance of commercial and open-source models. |
U-CORE: A Unified Deep Cluster-wise Contrastive Framework for Open Relation Extraction (2023.tacl-1)
Copied to clipboard
| Challenge: | Existing methods for Relation Extraction (RE) are limited due to the overlap between predefined and undefined relations. |
| Approach: | They propose a unified framework for both Zero-shot and Unsupervised Relation Extraction tasks by leveraging techniques from Contrastive Learning and Clustering. |
| Outcome: | The proposed framework improves on three well-known datasets showing an average improvement of 7.35% ARI on Zero-shot ORE tasks and 15.24% ARI for Unsupervised ORE. |
Unsupervised Deep Structured Semantic Models for Commonsense Reasoning (N19-1)
Copied to clipboard
| Challenge: | Existing methods for commonsense reasoning rely on human-crafted features and knowledge bases, but unsupervised learning is not feasible due to the lack of labeled training data or comprehensive knowledge bases. |
| Approach: | They propose two unsupervised models based on the Deep Structured Semantic Models framework to tackle two commonsense reasoning tasks: Winograd Schema Challenge (WSC) and Pronoun Disambiguation (PDP). |
| Outcome: | The proposed models capture contextual information in the sentence and co-reference information between pronouns and nouns, and achieve significant improvement over previous state-of-the-art approaches. |
MuGER2: Multi-Granularity Evidence Retrieval and Reasoning for Hybrid Question Answering (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Conventional HQA models retrieve coarse- or fine-grained evidence to reason the answer . however, they neglect a more general scenario requiring reasoning over heterogeneous data to answer a question. |
| Approach: | They propose a multi-granularity evidence retrieval and reasoning approach to answer questions over heterogeneous data using tables and passages linked to table cells. |
| Outcome: | The proposed approach significantly boosts the performance on the HybridQA dataset. |
SWE-QA: Can Language Models Answer Repository-level Code Questions? (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing benchmarks for understanding and reasoning about entire soft-ware repositories focus on small, self-contained code snippets. |
| Approach: | They propose a repository-level code question answering benchmark to facilitate research on automated QA systems in real-world repositories. |
| Outcome: | The proposed benchmarks are designed to facilitate research on automated QA systems in real-world repositories. |
RTFE: A Recursive Temporal Fact Embedding Framework for Temporal Knowledge Graph Completion (2021.naacl-main)
Copied to clipboard
| Challenge: | Existing methods for static knowledge graph embedding (SKGE) ignore the continuity of states of TKGs in time evolution. |
| Approach: | They propose a Recursive Temporal Fact Embedding framework to transplant SKGE models to TKGs and enhance the performance of existing TKGE models. |
| Outcome: | The proposed framework can be used to transplant SKGE models to TKGs and improve existing models for TKG completion. |
RSGT: Relational Structure Guided Temporal Relation Extraction (2022.coling-1)
Copied to clipboard
| Challenge: | Temporal relation extraction (TRE) is crucial for natural language understanding. |
| Approach: | They propose a Temporal Relational Structure Guided Temporal Relations Extraction task to extract relational structure features that can fit for both inter-sentence and intra-sentent relations. |
| Outcome: | The proposed method improves on two well-known datasets, MATRES and TB-Dense, and can be used for clinical diagnosis and summarization. |
EffiQA: Efficient Question-Answering with Strategic Multi-Model Collaboration on Knowledge Graphs (2025.coling-main)
Copied to clipboard
Zixuan Dong, Baoyun Peng, Yufei Wang, Jia Fu, Xiaodong Wang, Xin Zhou, Yongxue Shan, Kangchen Zhu, Weiguo Chen
| Challenge: | Existing approaches that integrate LLMs and KGs either underutilize the reasoning abilities of LLM or suffer from prohibitive computational costs due to tight coupling. |
| Approach: | They propose a framework that can strike a balance between performance and efficiency via an iterative paradigm. |
| Outcome: | The proposed framework can strike a balance between performance and efficiency via an iterative paradigm. |
Transplant Then Regenerate: A New Paradigm for Text Data Augmentation (2025.emnlp-main)
Copied to clipboard
| Challenge: | Data augmentation is a critical technique in deep learning. |
| Approach: | They propose a novel text augmentation paradigm leveraging large language models . they incorporate seed text into a context expanded by LLM and ask it to regenerate a variant based on the expanded context. |
| Outcome: | The proposed model generates high-quality and diverse augmented text with a transplant-then-regenerate approach. |
A Neural Question Answering Model Based on Semi-Structured Tables (C18-1)
Copied to clipboard
| Challenge: | Existing question answering systems rely on raw text and structured knowledge graphs. |
| Approach: | They build an end-to-end system to answer multiple choice questions with semi-structured tables as its knowledge. |
| Outcome: | The proposed system improves on the state-of-the-art question answering system with tabMCQ dataset. |
Orthogonal Relation Transforms with Graph Context Modeling for Knowledge Graph Embedding (2020.acl-main)
Copied to clipboard
| Challenge: | Existing knowledge graph embeddings have improved the knowledge graph link prediction task, but complex relations such as N-to-1, 1-to-N and N- to-N remain challenging to predict. |
| Approach: | They propose to extend RotatE from 2D complex domain to high dimensional space with orthogonal transforms to model relations. |
| Outcome: | The proposed method improves on N-to-1, 1-to-N and N- to-N cases while maintaining the capability for modeling symmetric/anti-symmetric, inverse and compositional relations. |
Building Joint Relationship Attention Network for Image-Text Generation (2022.coling-1)
Copied to clipboard
| Challenge: | et al., 2017) focus on visual features individually, while ignoring relationship information among image features that provides important guidance for generating sentences. |
| Approach: | They propose a joint relationship attention network that explores the relationships among image features. |
| Outcome: | The proposed method achieves state-of-the-art performance on large-scale datasets and on Flickr30k datasets. |
RAT-SQL: Relation-Aware Schema Encoding and Linking for Text-to-SQL Parsers (2020.acl-main)
Copied to clipboard
| Challenge: | Existing semantic parsing models struggle to generalize to unseen database schemas. |
| Approach: | They propose a framework to address schema encoding, schema linking, and feature representation within a text-to-SQL encoder. |
| Outcome: | The proposed framework boosts the match accuracy to 57.2% on the spider dataset, surpassing its best counterparts by 8.7%. |
DRIFT: Transferring Reasoning Priors for Efficient MLLM Fine-Tuning (2026.findings-acl)
Copied to clipboard
Chao Huang, Zeliang Zhang, Jiang Liu, Ximeng Sun, Jialian Wu, Xiaodong Yu, Ze Wang, Chenliang Xu, Emad Barsoum, Zicheng Liu
| Challenge: | Multimodal large language models (MLLMs) have made rapid progress in perception and alignment, but their reasoning ability often lags behind strong text-only LLMs. |
| Approach: | They propose a method that transfers reasoning knowledge in the gradient space while preserving multimodal alignment. |
| Outcome: | Experiments on multimodal reasoning benchmarks show that DRIFT outperforms naive merging and standard SFT. |
RoR: Read-over-Read for Long Document Machine Reading Comprehension (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Existing models for machine reading comprehension are limited to individual chunks due to encoding length constraint. |
| Approach: | They propose a read-over-read method that expands the reading field from chunk to document by predicting regional answers for each chunk. |
| Outcome: | Extensive experiments on QuAC and TriviaQA show that the proposed model performs well for long document reading. |
Multimodal Joint Attribute Prediction and Value Extraction for E-commerce Product (2020.emnlp-main)
Copied to clipboard
| Challenge: | In the real world, product attribute values are incomplete and vary over time, which hinders practical applications. |
| Approach: | They propose a multimodal method to jointly predict product attributes and extract values from product images using multimodal product information. |
| Outcome: | The proposed method can predict product attributes and extract values from product images with the help of product images. |
Text Level Graph Neural Network for Text Classification (D19-1)
Copied to clipboard
| Challenge: | Recent researches have explored graph neural network (GNN) techniques on text classification, but they are faced with the problems of fixed corpus level graph structure which don’t support online testing and high memory consumption. |
| Approach: | They propose a graph neural network model that builds graphs for each input text with global parameters sharing instead of a single graph for the whole corpus. |
| Outcome: | The proposed model outperforms existing models on several text classification datasets even with consuming less memory. |
OPERA: Operation-Pivoted Discrete Reasoning over Text (2022.naacl-main)
Copied to clipboard
Yongwei Zhou, Junwei Bao, Chaoqun Duan, Haipeng Sun, Jiahui Liang, Yifan Wang, Jing Zhao, Youzheng Wu, Xiaodong He, Tiejun Zhao
| Challenge: | Existing methods to predict logical forms ignore the utilization of symbolic operations and lack reasoning ability and interpretability. |
| Approach: | They propose an operation-pivoted discrete reasoning framework that uses symbolic operations as neural modules to facilitate reasoning ability and interpretability. |
| Outcome: | Extensive experiments on DROP and RACENum datasets show the reasoning ability of OPERA. |
Unpaired Sentiment-to-Sentiment Translation: A Cycled Reinforcement Learning Approach (P18-1)
Copied to clipboard
| Challenge: | Existing studies for sentiment-to-sentiment "translation" only change the underlying sentiment and fail to keep the semantic content. |
| Approach: | They propose a cycled reinforcement learning method that combines neutralization module and emotionalization module. |
| Outcome: | The proposed method outperforms state-of-the-art systems on Yelp and Amazon review datasets. |
Learn to Copy from the Copying History: Correlational Copy Network for Abstractive Summarization (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for abstractive summarization use encoder-decoder attention, but this leads to incomplete copying. |
| Approach: | They propose a copying scheme that takes advantage of prior copying distributions and explicitly encourages the model to copy the input word that is relevant to the previously copied one. |
| Outcome: | The proposed scheme achieves state-of-the-art on summarization benchmarks . it takes advantage of prior copying distributions and explicitly encourages copying . |
AdaMix: Mixture-of-Adaptations for Parameter-efficient Model Tuning (2022.emnlp-main)
Copied to clipboard
Yaqing Wang, Sahaj Agarwal, Subhabrata Mukherjee, Xiaodong Liu, Jing Gao, Ahmed Hassan Awadallah, Jianfeng Gao
| Challenge: | Standard fine-tuning of large pre-trained language models requires updating hundreds of millions to billions of parameters and storing a large copy of the PLM weights for every task. |
| Approach: | They propose a parameter-efficient fine-tuning technique where small trainable components are injected into the PLM and updated during fine-uning. |
| Outcome: | The proposed method outperforms SOTA parameter-efficient fine-tuning and full model fine-uning on GLUE development set with RoBERTa-large encoder. |
P3LM: Probabilistically Permuted Prophet Language Modeling for Generative Pre-Training (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Existing autoregressive left-to-right (L2R) models are limited to unidirectional information and constrained on strong local dependencies. |
| Approach: | They propose a probabilistically permuted prophet language model which strengthens the modeling of bidirectional information and long token dependencies for sequence generation. |
| Outcome: | Experiments on GLGE dataset show that P3LM improves on natural language generation tasks. |
NUWA-XL: Diffusion over Diffusion for eXtremely Long Video Generation (2023.acl-long)
Copied to clipboard
Shengming Yin, Chenfei Wu, Huan Yang, Jianfeng Wang, Xiaodong Wang, Minheng Ni, Zhengyuan Yang, Linjie Li, Shuguang Liu, Fan Yang, Jianlong Fu, Ming Gong, Lijuan Wang, Zicheng Liu, Houqiang Li, Nan Duan
| Challenge: | Existing work generates long videos segment by segment sequentially, which is inefficient. |
| Approach: | They propose a Diffusion over Difference architecture for eXtremely Long video generation. |
| Outcome: | The proposed architecture reduces the average inference time from 7.55min to 26s (94.26%) and generates high-quality long videos with both global and local coherence. |
LUNA: Learning Slot-Turn Alignment for Dialogue State Tracking (2022.naacl-main)
Copied to clipboard
| Challenge: | Existing methods exploit the utterances of all dialogue turns to assign value to slots . this can lead to suboptimal results due to information introduced from irrelevant utterrances . |
| Approach: | They propose a SLot-TUrN Alignment enhanced approach to assign slot value . they explicitly align each slot with its most relevant utterance and then predict the corresponding value based on this aligned utteration. |
| Outcome: | The proposed approach achieves state-of-the-art on three multi-domain task-oriented dialogue datasets. |
Stand on The Shoulders of Giants: Building JailExpert from Previous Attack Experience (2025.emnlp-main)
Copied to clipboard
Xi Wang, Songlei Jian, Shasha Li, Xiaopeng Li, Bin Ji, Ma Jun, Xiaodong Liu, Jing Wang, Jianfeng Zhang, Jie Yu, Feilong Bao, null Wangbaosheng
| Challenge: | Existing methods to generate human-aligned content with a “jailbreak prompt” are inefficient and repetitive, causing inefficiency and a lack of experience. |
| Approach: | They propose a framework that integrates past attack experiences to aid current jailbreak attempts. |
| Outcome: | The proposed framework improves both attack effectiveness and efficiency compared to the current black-box jailbreak method. |
LastingBench: Defend Benchmarks Against Knowledge Leakage (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods to detect and safeguard LLMs against knowledge leakage fail to address the long-term challenge of mitigating it. |
| Approach: | They propose a method to reinforce and safeguard existing benchmarks against knowledge leakage by perturbation-based detection and counterfactual rewriting to disrupt memorization while preserving original intent. |
| Outcome: | The proposed method reduces memorization effects in long-context QA benchmarks, providing a more accurate assessment of model reasoning and generalization abilities. |
LIFBench: Evaluating the Instruction Following Performance and Stability of Large Language Models in Long-Context Scenarios (2025.acl-long)
Copied to clipboard
| Challenge: | Existing benchmarks rarely focus on instruction-following in long-context scenarios or stability on different inputs. |
| Approach: | They propose a scalable dataset to evaluate LLMs’ instruction-following capabilities and stability across long contexts. |
| Outcome: | The proposed method evaluates LLMs’ instruction-following capabilities and stability across long contexts. |
Metagent-P: A Neuro-Symbolic Planning Agent with Metacognition for Open Worlds (2025.findings-acl)
Copied to clipboard
YanfangZhou YanfangZhou, Yuntao Liu, Xiaodong Li, Yongqiang Zhao, Xintong Wang, Jinlong Tian, Zhenyu Li, Xinhai Xu
| Challenge: | Recent advances in large language models (LLMs) show promising potential through their world knowledge and language processing capabilities in open-world planning. |
| Approach: | They propose a framework that integrates the world knowledge of large language models, symbolic reasoning capabilities of cognitive architectures, and metacognition to improve experience utilization. |
| Outcome: | The proposed framework outperforms current state-of-the-art methods in Minecraft and reduces the average replanning counts by 34% and exceeds the human success rate by 18.96%. |
GOVERN: Gradient Orientation Vote Ensemble for Multi-Teacher Reinforced Distillation (2024.emnlp-industry)
Copied to clipboard
| Challenge: | Pre-trained language models have achieved remarkable performance in OpenQA, but for practical deployment, knowledge distillation is crucial to maintain high performance while operating under computational constraints. |
| Approach: | They propose an algorithm to perform unsupervised knowledge distillation without the guidance of labels to achieve 99.5% of performance. |
| Outcome: | The proposed algorithm achieves 99.5% of performance in a commercial question-answering system. |
LLM×MapReduce: Simplified Long-Sequence Processing using Large Language Models (2025.acl-long)
Copied to clipboard
Zihan Zhou, Chong Li, Xinyi Chen, Shuo Wang, Yu Chao, Zhili Li, Haoyu Wang, Qi Shi, Zhixing Tan, Xu Han, Xiaodong Shi, Zhiyuan Liu, Maosong Sun
| Challenge: | Existing studies have focused on extending the context length of large language models (LLMs) due to their quadratic computational complexity and a lack of high-quality long training examples, most LLMs are trained with a limited window size. |
| Approach: | They propose a training-free framework that enables large language models to effectively process long texts using a divide-and-conquer strategy for comprehensive document understanding. |
| Outcome: | The proposed framework outperforms open-source and commercial long-context LLMs and is compatible with several models. |
LiST: Lite Prompted Self-training Makes Parameter-efficient Few-shot Learners (2022.findings-naacl)
Copied to clipboard
| Challenge: | LiST is an efficient method for fine-tuning large pre-trained language models in few-shot learning settings. |
| Approach: | They propose a method for efficient fine-tuning of large pre-trained language models in few-shot settings using self-training and meta-learning. |
| Outcome: | The proposed method outperforms GPT-3 in-context learning by 33% on few-shot tasks. |
P2 Law: Scaling Law for Post-Training After Model Pruning (2025.acl-long)
Copied to clipboard
| Challenge: | Pruning has become a widely adopted technique for reducing the hardware requirements of large language models (LLMs). |
| Approach: | They propose to use model pruning techniques to maintain high performance while reducing hardware requirements for large language models (LLMs). |
| Outcome: | The proposed model pruning law can be generalized to larger dataset sizes, larger model sizes, and higher pruning rates, offering valuable insights for resource allocation in pruned LLMs. |