Papers by Zhiyuan Sun
Recyclable Tuning for Continual Pre-training (2023.findings-acl)
Copied to clipboard
Yujia Qin, Cheng Qian, Xu Han, Yankai Lin, Huadong Wang, Ruobing Xie, Zhiyuan Liu, Maosong Sun, Jie Zhou
| Challenge: | Continual pre-training is the paradigm where pre-trained language models acquire fresh knowledge and gradually get upgraded. |
| Approach: | They propose to use adapted weights to recycle old PLMs for continual pre-training . they propose to combine initialization and distillation methods to achieve better performance . |
| Outcome: | The proposed method improves the convergence and performance of the upgraded PLM. |
Automatic Label Sequence Generation for Prompting Sequence-to-sequence Models (2022.coling-1)
Copied to clipboard
| Challenge: | Prompting has shown to be sample efficient compared to fine-tuning with pre-trained models. |
| Approach: | They propose a fully automatic prompting method that uses natural language prompts on sequence-to-sequence models and a beam search method to generate a large amount of label sequence candidates. |
| Outcome: | The proposed method significantly outperforms other no-manual-design methods on single label words and generates large amount of label sequence candidates. |
Knowledgeable Prompt-tuning: Incorporating Knowledge into Prompt Verbalizer for Text Classification (2022.acl-long)
Copied to clipboard
| Challenge: | Recent studies suggest that pre-trained language models have gained rich knowledge during pre-training. |
| Approach: | They propose to tune pre-trained language models with task-specific prompts to improve and stabilize prompttuning. |
| Outcome: | Extensive experiments on zero and few-shot text classification tasks show that prompt-tuning improves and stabilizes prompttun-ing. |
SHARP: Unlocking Interactive Hallucination via Stance Transfer in Role-Playing LLMs (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing studies on social interactions neglect hallucination while struggling with poor generalizability and implicit character fidelity judgments. |
| Approach: | They propose a generalizable and explicit paradigm for uncovering interactive patterns of Large Language Models across diverse worldviews by defining interactive hallucination through stance transfer and SHARP, a benchmark built by extracting relations from commonsense knowledge graphs. |
| Outcome: | The proposed paradigm is generalizable and explicit and demonstrates its effectiveness and stability. |
Sparse Low-rank Adaptation of Pre-trained Language Models (2023.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for fine-tuning pre-trained large language models in a parameter-efficient manner are gaining traction within the research community. |
| Approach: | They propose a method of low-rank adaptation that enables dynamic adjustments to the intrinsic rank during the adaptation process. |
| Outcome: | The proposed approach outperforms the current method with a fixed and unalterable intrinsic rank and a low-rank adaptation process. |
Denoising Distantly Supervised Open-Domain Question Answering (P18-1)
Copied to clipboard
| Challenge: | Existing DS-QA models ignore rich information contained in other paragraphs and are noisy . Existing systems rely on pre-identified relevant texts, which do not always exist in real-world QA scenarios. |
| Approach: | They propose a model which uses a paragraph selector to filter out noisy paragraphs and a reader to extract the correct answer from denoised paragraphs. |
| Outcome: | The proposed model can capture useful information from noisy data and achieve significant improvements on open domain question answering. |
From Adversarial Arms Race to Model-centric Evaluation: Motivating a Unified Automatic Robustness Evaluation Framework (2023.findings-acl)
Copied to clipboard
Yangyi Chen, Hongcheng Gao, Ganqu Cui, Lifan Yuan, Dehan Kong, Hanlu Wu, Ning Shi, Bo Yuan, Longtao Huang, Hui Xue, Zhiyuan Liu, Maosong Sun, Heng Ji
| Challenge: | Existing models of robustness evaluation are incomprehensive, impractical, and invalid . |
| Approach: | They propose a framework for automatic robustness evaluation that shifts towards model-centric evaluation to further exploit the advantages of adversarial attacks. |
| Outcome: | The proposed framework is based on a model-centric evaluation protocol and a robustness evaluation protocol. |
Fine-mixing: Mitigating Backdoors in Fine-tuned Language Models (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods for defending NLP models against backdoors have ignored the clean weights of PLMs. |
| Approach: | They exploit pre-trained weights to mitigate backdoors in fine-tuned NLP models . they use a fine-mixing technique and an Embedding Purification technique to do the same . |
| Outcome: | The proposed method outperforms baseline mitigation methods on three single-sentence sentiment classification tasks and two sentence-pair classification tasks. |
RAGEval: Scenario Specific RAG Evaluation Dataset Generation Framework (2025.acl-long)
Copied to clipboard
Kunlun Zhu, Yifan Luo, Dingling Xu, Yukun Yan, Zhenghao Liu, Shi Yu, Ruobing Wang, Shuo Wang, Yishan Li, Nan Zhang, Xu Han, Zhiyuan Liu, Maosong Sun
| Challenge: | Existing evaluation metrics for RAG systems are lacking due to high costs of data construction and lack of factual accuracy. |
| Approach: | They propose a framework to evaluate RAG systems in specialized scenarios . they propose three new metrics to evaluate LLM-generated responses . |
| Outcome: | The proposed framework outperforms zero-shot and one-shot methods in terms of clarity, safety, conformity, and richness of generated samples. |
TritonBench: Benchmarking Large Language Model Capabilities for Generating Triton Operators (2025.findings-acl)
Copied to clipboard
Jianling Li, ShangZhan Li, Zhenye Gao, Qi Shi, Yuxuan Li, Zefan Wang, Jiacheng Huang, WangHaojie WangHaojie, Jianrong Wang, Xu Han, Zhiyuan Liu, Maosong Sun
| Challenge: | Triton is a high-level Python-like programming language for building efficient GPU kernels. |
| Approach: | They propose a TritonBench benchmark that provides a comprehensive evaluation of Tritonic operators on widely deployed GPUs. |
| Outcome: | The proposed benchmarks show that current LLMs struggle to generate efficient Triton operators on widely deployed GPUs aligned with industry applications. |
RepoAgent: An LLM-Powered Open-Source Framework for Repository-level Code Documentation Generation (2024.emnlp-demo)
Copied to clipboard
Qinyu Luo, Yining Ye, Shihao Liang, Zhong Zhang, Yujia Qin, Yaxi Lu, Yesai Wu, Xin Cong, Yankai Lin, Yingli Zhang, Xiaoyin Che, Zhiyuan Liu, Maosong Sun
| Challenge: | Xia et al., 2018) demonstrate that a large language model can generate and maintain high-quality code documentation. |
| Approach: | They propose a large language model powered open-source framework for generating, maintaining, and updating code documentation. |
| Outcome: | The proposed framework generates high-quality documentation for the entire project. |
Fine-grained Fact Verification with Kernel Graph Attention Network (2020.acl-main)
Copied to clipboard
| Challenge: | Existing methods for fact verification are based on dot-product attentions, but kernel-based attentions focus more on relevant evidence sentences and meaningful clues in the evidence graph. |
| Approach: | They propose a kernel-based attention network which conducts more fine-grained fact verification with kernel-basic attentions. |
| Outcome: | The proposed task achieves a 70.38% FEVER score and significantly outperforms existing fact verification models on FEVER, a large-scale benchmark for fact verification. |
Coreferential Reasoning Learning for Language Representation (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing language representation models cannot explicitly handle coreference, which is essential to the coherent understanding of the whole discourse. |
| Approach: | They propose a language representation model that captures coreferential relations in context. |
| Outcome: | The proposed model can achieve significant improvements on downstream NLP tasks while maintaining comparable performance to baseline models on other common NLP task. |
On LLM-Based Scientific Inductive Reasoning Beyond Equations (2025.emnlp-main)
Copied to clipboard
Brian S. Lin, Jiaxin Yuan, Zihan Zhou, Shouli Wang, Shuo Wang, Cunliang Kong, Qi Shi, Yuxuan Li, Liner Yang, Zhiyuan Liu, Maosong Sun
| Challenge: | Existing research on inductive reasoning models emphasizes rule design without grounding them in specific scenarios. |
| Approach: | They propose to use LLMs to learn underlying patterns from limited examples in entirely new environments. |
| Outcome: | The proposed benchmark evaluates the inductive reasoning abilities of large language models in scientific settings. |
OpenPrompt: An Open-source Framework for Prompt-learning (2022.acl-demo)
Copied to clipboard
| Challenge: | Prompt-learning is a new paradigm in natural language processing, adapting pre-trained language models to cloze-style prediction, autoregressive modeling, or sequence to sequence generation. |
| Approach: | They propose a framework for prompt-learning that integrates pre-trained language models with a unified framework. |
| Outcome: | The proposed framework is easy to use and flexible enough to integrate with other frameworks. |
Diffusion Theory as a Scalpel: Detecting and Purifying Poisonous Dimensions in Pre-trained Language Models Caused by Backdoor or Bias (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing methods to fine-tune pre-trained language models (PLMs) are not safe, since the fine-uning process is invisible to the user. |
| Approach: | They propose a technique to study the dynamic process of fine-tuning for finding poisonous dimensions using diffusion theory. |
| Outcome: | The proposed approach can detect poisonous dimensions with abnormal dynamics, purify them and fine-tune them on a clean dataset. |
Exploring Mode Connectivity for Pre-trained Language Models (2022.emnlp-main)
Copied to clipboard
| Challenge: | Recent years have witnessed the prevalent application of pre-trained language models (PLMs) in NLP. From the perspective of parameter space, PLMs provide generic initialization, starting from which high-performance minima could be found. |
| Approach: | They investigate the geometric connections of different minima through the lens of mode connectivity, which measures whether two minima can be connected with a low-loss path. |
| Outcome: | The proposed model can be used to find low-loss paths between two minima, and to understand how their mode connectivity affects their task knowledge. |
Knowledge Inheritance for Pre-trained Language Models (2022.naacl-main)
Copied to clipboard
Yujia Qin, Yankai Lin, Jing Yi, Jiajie Zhang, Xu Han, Zhengyan Zhang, Yusheng Su, Zhiyuan Liu, Peng Li, Maosong Sun, Jie Zhou
| Challenge: | Existing large-scale pre-trained language models are mainly trained from scratch individually, ignoring that many well-taught PLMs are available. |
| Approach: | They propose a pre-training framework called knowledge inheritance and propose auxiliary supervision to efficiently learn larger PLMs. |
| Outcome: | The proposed framework can be used to train large-scale language models with huge parameters and a large dataset can be adapted to domain adaptation and knowledge transfer. |
Enhancing Agent Learning through World Dynamics Modeling (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods assume that large language models have a complete understanding of their environment, overlooking potential gaps in their grasp of actual world dynamics. |
| Approach: | They propose a framework that discovers world dynamics from a small number of demonstrations, verifies the correctness of these dynamics, and evolves new, advanced dynamics tailored to the current situation. |
| Outcome: | The proposed framework discovers, verifies, and evolves world dynamics from a small number of demonstrations, and compares the automatically generated dynamics with human-annotated world dynamics. |
Pass off Fish Eyes for Pearls: Attacking Model Selection of Pre-trained Models (2022.acl-long)
Copied to clipboard
| Challenge: | Existing feature-based model selection methods are vulnerable to fine-tuning and are not reliable indicators for the PTM’s transferability. |
| Approach: | They propose feature-based model selection methods which assess PTMs’ transferability to a specific task in a fast way without fine-tuning. |
| Outcome: | The proposed methods can make FMS mistakenly judge transferability of models and can be combined with the backdoor attack to misguide the FMS to select poisoned models. |
Seq1F1B: Efficient Sequence-Level Pipeline Parallelism for Large Language Model Training (2025.naacl-long)
Copied to clipboard
| Challenge: | Current PP methods face severe bottlenecks, including pipeline bubbles and memory footprint. |
| Approach: | They propose a sequence-level one-forward-one-backward (1F1B) PP method for training LLMs on long sequences with high throughput and memory efficiency. |
| Outcome: | The proposed method achieves 1.14X training throughput with half memory footprint compared to baseline methods . it trains an LLM with 30B parameters on sequences up to 64k tokens using 64X NVIDIA A100 GPUs . |
LoRA-Flow: Dynamic LoRA Fusion for Large Language Models in Generative Tasks (2024.acl-long)
Copied to clipboard
| Challenge: | LoRA-Flow uses lightweight modules to customize large language models for downstream tasks . previous work on LoRA combination relied on task-level weights for each involved LoRA . |
| Approach: | They propose a LoRA-Flow approach that uses dynamic weights to adjust the impact of different LoRAs. |
| Outcome: | The proposed method outperforms baselines with task-level weights on six generative tasks. |
More Data, More Relations, More Context and More Openness: A Review and Outlook for Relation Extraction (2020.aacl-main)
Copied to clipboard
Xu Han, Tianyu Gao, Yankai Lin, Hao Peng, Yaoliang Yang, Chaojun Xiao, Zhiyuan Liu, Peng Li, Jie Zhou, Maosong Sun
| Challenge: | Existing methods for extracting relational facts from text have been successful . but with explosion of Web text, human knowledge is increasing drastically . |
| Approach: | They propose to improve relation extraction methods to extract relational facts from text . they analyze existing methods and show promising directions towards more powerful RE . |
| Outcome: | The proposed methods can extract relational facts from text, but they are still lacking in the current field. |
Tell Me More! Towards Implicit User Intention Understanding of Language Model Driven Agents (2024.acl-long)
Copied to clipboard
Cheng Qian, Bingxiang He, Zhong Zhuang, Jia Deng, Yujia Qin, Xin Cong, Zhong Zhang, Jie Zhou, Yankai Lin, Zhiyuan Liu, Maosong Sun
| Challenge: | Current language model-driven agents lack mechanisms for effective user participation, which is crucial given the vagueness commonly found in user instructions. |
| Approach: | They propose a benchmark to inspect users’ implicit intentions through explicit queries and a model expert as the upstream in agent design to enhance user-agent interaction. |
| Outcome: | The proposed approach excels at identifying vague user tasks, recovering and summarizing critical missing information, setting precise and necessary agent execution goals, and minimizing redundant tool usage, thus boosting overall efficiency. |
Explicit Memory Learning with Expectation Maximization (2024.emnlp-main)
Copied to clipboard
| Challenge: | Large Language Models lack reliable learning mechanisms for updating information across interactions. |
| Approach: | They propose a framework that enhances explicit memory updates via the Expectation-Maximization algorithm. |
| Outcome: | The proposed framework outperforms existing methods without memory or with static external memory on streaming inference tasks. |
Textual Backdoor Attacks Can Be More Harmful via Two Simple Tricks (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing textual backdoor attacks are vulnerable to backdoors . researchers add extra training task to distinguish poisoned and clean data . |
| Approach: | They propose two tricks that make existing backdoor attacks much more harmful . first trick is to add an extra task to distinguish poisoned and clean data . second trick is using all the clean training data rather than the original clean data. |
| Outcome: | The proposed tricks can significantly improve attack performance in three tough situations including clean data fine-tuning, low-poisoning-rate, and label-consistent attacks. |
MinerU2.5: A Decoupled Vision-Language Model for Efficient High-Resolution Document Parsing (2026.acl-industry)
Copied to clipboard
Junbo Niu, Zheng Liu, Zhuangcheng Gu, Bin Wang, Linke Ouyang, Zhiyuan Zhao, Tao Chu, Tianyao He, Fan Wu, Qintong Zhang, Zhenjiang Jin, Guang Liang, Rui Zhang, Wenzheng Zhang, Yuan Qu, Zhifei Ren, Yuefeng Sun, Zirui Tang, Boyu Niu, Yuanhong Zheng, Dongsheng Ma, Ziyang Miao, Hejun Dong, Siyi Qian, Junyuan Zhang, Fangdong Wang, Jingzhou Chen, Xiaomeng Zhao, Liqun Wei, Wei Li, Shasha Wang, RuiLiang Xu, Yuanyuan Cao, Lu Chen, Qianqian Wu, Huaiyu Gu, Lindong Lu, Dechen Lin, null Shenguanlin, Xuanhe Zhou, Linfeng Zhang, Yuhang Zang, Xiaoyi Dong, Jiaqi Wang, Bo Zhang, Lei Bai, Pei Chu, Weijia Li, Jiang Wu, Lijun Wu, Zhenxiang Li, Guangyu Wang, Zhongying Tu, Chao Xu, Kai Chen, Bowen Zhou, Dahua Lin, Wentao Zhang, Conghui He
| Challenge: | Document images are characterized by higher resolutions, denser content, and more complex structural layouts. |
| Approach: | They propose a 1.2B-parameter document parsing vision-language model that decouples layout analysis from local content recognition. |
| Outcome: | The proposed model surpasses general-purpose and domain-specific models on multiple benchmarks while maintaining significantly lower computational overhead. |
LLM×MapReduce-V3: Enabling Interactive In-Depth Survey Generation through a MCP-Driven Hierarchically Modular Agent System (2025.emnlp-demos)
Copied to clipboard
Yu Chao, Siyu Lin, Xiaorong Wang, Zhu Zhang, Zihan Zhou, Haoyu Wang, Shuo Wang, Jie Zhou, Zhiyuan Liu, Maosong Sun
| Challenge: | Generating high-quality long-form survey articles poses significant challenges to AI Agent systems. |
| Approach: | They propose a hierarchically modular agent system for long-form survey generation . they use atomic models to implement skeleton initialization, digest construction, and skelet refinement . human evaluations demonstrate system surpasses representative baselines . |
| Outcome: | The proposed system surpasses representative baselines in both content depth and length, highlighting the strength of MCP-based modular planning. |
Why Should Adversarial Perturbations be Imperceptible? Rethink the Research Paradigm in Adversarial NLP (2022.emnlp-main)
Copied to clipboard
| Challenge: | Textual adversarial samples are often misrepresented in research on security, evaluation, explainability, and data augmentation. |
| Approach: | They propose to use adversarial samples to evaluate their methods on security tasks to demonstrate the real-world concerns rather than developing impractical methods. |
| Outcome: | The proposed method has higher practical value than the current benchmark. |
Adversarial Training for Weakly Supervised Event Detection (N19-1)
Copied to clipboard
| Challenge: | Detecting and identifying events is an important subtask of event extraction. |
| Approach: | They build a large event-related candidate set with good coverage and apply an adversarial training mechanism to iteratively identify informative instances from the candidate set and filter out those noisy ones. |
| Outcome: | The proposed method significantly outperforms the state-of-the-art methods on two real-world datasets. |
KACC: A Multi-task Benchmark for Knowledge Abstraction, Concretization and Completion (2021.findings-acl)
Copied to clipboard
| Challenge: | Existing studies focus on partial aspects of knowledge abstraction, concretization, and completion (KACC). |
| Approach: | They propose a unified knowledge graph benchmark to improve existing benchmarks . they collect new datasets that contain larger concept graphs and cross-view links . |
| Outcome: | The proposed benchmark improves existing benchmarks in terms of dataset scale, task coverage, and difficulty. |
OpenDelta: A Plug-and-play Library for Parameter-efficient Adaptation of Pre-trained Models (2023.acl-demo)
Copied to clipboard
| Challenge: | Existing implementations that modify the code of the backbone PTMs and hard-code specific delta tuning methods for each PTM have limited the practicality and flexibility of delta tuning. |
| Approach: | They propose an open-source library that provides a plug-and-play implementation of delta tuning methods for pre-trained models. |
| Outcome: | The proposed methods eliminate the need to modify the backbone PTMs’ code, making OpenDelta compatible with different, even novel PTM. |
Meta-Information Guided Meta-Learning for Few-Shot Relation Classification (2020.coling-main)
Copied to clipboard
| Challenge: | Existing meta-learning models rely on implicit instance statistics and are unreliability and weak interpretability. |
| Approach: | They propose a meta-information guided meta-learning framework that uses semantics to guide meta- learning . experimental results demonstrate the effectiveness of the proposed framework . |
| Outcome: | The proposed framework can establish connections between instance-based information and semantic-based data, enabling faster initialization and adaptation. |
PersLLM: A Personified Training Approach for Large Language Models (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Large language models exhibit human-like intelligence, enabling them to simulate human behavior and support various applications that require both humanized communication and extensive knowledge reserves. |
| Approach: | They propose a framework for better data construction and model tuning to unlock the potential of LLM personification by using Chain-of-Thought prompting and anti-induction. |
| Outcome: | The proposed framework improves data construction and model tuning for insufficient data usage and rigid behavior patterns. |
Optima: Optimizing Effectiveness and Efficiency for LLM-Based Multi-Agent System (2025.findings-acl)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have emerged as powerful tools for a wide range of tasks, from * Equal Contribution. |
| Approach: | They propose a framework that enhances communication efficiency and task effectiveness in LLM-based multi-agent systems through training. |
| Outcome: | The proposed framework improves communication efficiency and task effectiveness on multi-agent tasks with 2.8x performance gain with less than 10% tokens on tasks requiring heavy information exchange. |
Adapting Open Domain Fact Extraction and Verification to COVID-FACT through In-Domain Language Modeling (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods to verify scientifically false online information are limited by the lack of training data in the scientific domain. |
| Approach: | They propose an in-domain language modeling method for fact extraction and verification systems . they use SCIFACT to extract scientifically false online information . |
| Outcome: | The proposed method improves accuracy 30% on SCIFACT dataset . state-of-the-art model achieves only 46.6% precision, which is hard to be trusted for users. |
ChartCoder: Advancing Multimodal Large Language Model for Chart-to-Code Generation (2025.acl-long)
Copied to clipboard
| Challenge: | Existing open-source MLLMs fail to fully capture dense information embedded in charts . current models still face significant challenges in understanding and analyzing visual tasks such as captioning and question answering. |
| Approach: | They propose a chart-to-code MLLM which leverages Code LLMs as the language backbone to enhance the executability of the generated code. |
| Outcome: | The proposed model surpasses existing open-source models on chart-to-code benchmarks with only 7B parameters and provides lossless representations that contain all critical details. |
AgentCPM-GUI: Building Mobile-Use Agents with Reinforcement Fine-Tuning (2025.emnlp-demos)
Copied to clipboard
Zhong Zhang, Yaxi Lu, Yikun Fu, Yupeng Huo, Shenzhi Yang, Yesai Wu, Han Si, Xin Cong, Haotian Chen, Yankai Lin, Xie Xie, Wei Zhou, Wang Xu, Zhou Su, Zhongwu Zhai, Xiaoming Liu, null Meiyudong, Jianming Xu, Hongyan Tian, Chongyi Wang, Chi Chen, Yuan Yao, Zhiyuan Liu, Maosong Sun
| Challenge: | Large language model agents have enabled GUI-based automation, but their deployment is limited by noisy data, poor generalization, and lack of support for non-English GUIs. |
| Approach: | They propose an 8B-parameter GUI agent built for robust and efficient on-device GUI interaction. |
| Outcome: | The proposed GUI agent achieves promising performance on five public benchmarks and proposed Chinese benchmark CAGUI. |
KBAlign: Efficient Self Adaptation on Specific Textual Knowledge Bases (2025.findings-emnlp)
Copied to clipboard
Zheni Zeng, Yuxuan Chen, Shi Yu, Ruobing Wang, Yukun Yan, Zhenghao Liu, Shuo Wang, Xu Han, Zhiyuan Liu, Maosong Sun
| Challenge: | Existing methods for retrieval-augmented generation (RAG) are limited and fine-tuning incurs prohibitive costs of external signals. |
| Approach: | They propose a self-supervised framework that enhances RAG systems through efficient model adaptation. |
| Outcome: | The proposed framework achieves 90% of the performance gain obtained through GPT-4-supervised adaptation while relying entirely on self-annotation of much smaller models. |
Judge as A Judge: Improving the Evaluation of Retrieval-Augmented Generation through the Judge-Consistency of Large Language Models (2025.findings-acl)
Copied to clipboard
Shuliang Liu, Xinze Li, Zhenghao Liu, Yukun Yan, Cheng Yang, Zheni Zeng, Zhiyuan Liu, Maosong Sun, Ge Yu
| Challenge: | Existing evaluation metrics cannot fairly evaluate the outputs of RAG models during training and evaluation. |
| Approach: | They propose a method which prompts LLMs to generate different judgments based on various combinations of judgment dimensions and utilizes the judge-consistency to evaluate these judgments. |
| Outcome: | The proposed method generates more accurate evaluations for RAG models across different RAG model and datasets. |
Turn Waste into Worth: Rectifying Top-k Router of MoE (2024.emnlp-main)
Copied to clipboard
Zhiyuan Zeng, Qipeng Guo, Zhaoye Fei, Zhangyue Yin, Yunhua Zhou, Linyang Li, Tianxiang Sun, Hang Yan, Dahua Lin, Xipeng Qiu
| Challenge: | Top-k router suffers from redundancy computation and memory costs due to unbalanced routing . some experts are overflow, where exceeding tokens are dropped, while others are empty, which are padded with zeros, negatively impacting model performance. |
| Approach: | They propose a top-k router that is unbalanced and uses a multi-gPU system to handle dropped tokens and padding. |
| Outcome: | The proposed model surpasses the top-1 router by 4.7% in terms of performance . the top-k router suffers from redundancy computation and memory costs . |
Controllable Preference Optimization: Toward Controllable Multi-Objective Alignment (2024.emnlp-main)
Copied to clipboard
Yiju Guo, Ganqu Cui, Lifan Yuan, Ning Ding, Zexu Sun, Bowen Sun, Huimin Chen, Ruobing Xie, Jie Zhou, Yankai Lin, Zhiyuan Liu, Maosong Sun
| Challenge: | Existing algorithms for achieving optimal alignment are mostly unidirectional . a recent study suggests that large language models can be ground with evident preferences . |
| Approach: | They propose to ground large language models with evident preferences . they propose to use controllable preference optimization to specify different objectives . |
| Outcome: | The proposed models can provide responses that match various preferences among the ”3H” desiderata. |
APB: Accelerating Distributed Long-Context Inference by Passing Compressed Context Blocks across GPUs (2025.acl-long)
Copied to clipboard
Yuxiang Huang, Mingye Li, Xu Han, Chaojun Xiao, Weilin Zhao, Sun Ao, Hao Zhou, Jie Zhou, Zhiyuan Liu, Maosong Sun
| Challenge: | Long-context inference is crucial for advancing large language models, but its prefill speed remains a bottleneck. |
| Approach: | They propose an efficient long-context inference framework that leverages multi-host approximate attention to enhance prefill speed. |
| Outcome: | The proposed framework achieves speedups of 9.2, 4.2, and 1.6 without any degradation in performance. |
Turn the Combination Lock: Learnable Textual Backdoor Attacks via Word Substitution (2021.acl-long)
Copied to clipboard
| Challenge: | Recent studies show that neural natural language processing models are vulnerable to backdoor attacks. |
| Approach: | They propose to inject neural models with backdoors activated by word substitution . their results raise a serious alarm to the security of NLP models, they argue . |
| Outcome: | The proposed backdoors are activated by a learnable combination of word substitution and exhibit higher invisibility than previous methods. |
Deciphering Digital Detectives: Understanding LLM Behaviors and Capabilities in Multi-Agent Mystery Games (2024.findings-acl)
Copied to clipboard
| Challenge: | In this study, we explore the application of Large Language Models (LLMs) in Jubensha, a Chinese detective role-playing game and a novel area in Artificial Intelligence (AI) driven gaming. |
| Approach: | They propose to use large language models to foster AI agent development in Jubensha, a Chinese detective role-playing game. |
| Outcome: | The proposed framework enables AI agents to engage in Jubensha games autonomously. |
GEAR: Graph-based Evidence Aggregating and Reasoning for Fact Verification (P19-1)
Copied to clipboard
| Challenge: | Existing methods to extract information from evidence are unable to grasp relational and logical information among the evidence. |
| Approach: | They propose a graph-based evidence aggregating and reasoning framework to integrate evidence from multiple pieces of evidence. |
| Outcome: | The proposed framework achieves significant performance improvements on a large-scale benchmark dataset. |
Prompt Tuning for Discriminative Pre-trained Language Models (2022.findings-acl)
Copied to clipboard
Yuan Yao, Bowen Dong, Ao Zhang, Zhengyan Zhang, Ruobing Xie, Zhiyuan Liu, Leyu Lin, Maosong Sun, Jianyong Wang
| Challenge: | Recent studies have shown promising results of prompt tuning in stimulating pre-trained language models (PLMs) for natural language processing tasks. |
| Approach: | They propose a prompt tuning framework that reformulates NLP tasks into a discriminative language modeling problem. |
| Outcome: | The proposed framework improves on text classification and question answering tasks and prevents unstable tuning problems in low-resource settings. |
Word-level Textual Adversarial Attacking as Combinatorial Optimization (2020.acl-main)
Copied to clipboard
| Challenge: | Existing word-level attack models are far from perfect because of unsuitable search space reduction methods and inefficient optimization algorithms. |
| Approach: | They propose a novel adversarial adversarialist model that incorporates word substitution and particle swarm optimization to solve two problems separately. |
| Outcome: | The proposed model achieves much higher success rates and crafts more high-quality adversarial examples as compared to baseline methods. |
Sub-Character Tokenization for Chinese Pretrained Language Models (2023.tacl-1)
Copied to clipboard
Chenglei Si, Zhengyan Zhang, Yingfa Chen, Fanchao Qi, Xiaozhi Wang, Zhiyuan Liu, Yasheng Wang, Qun Liu, Maosong Sun
| Challenge: | Existing tokenization methods for Chinese PLMs treat each character as an indivisible token, but ignore the unique feature of the writing system where additional linguistic information exists below the character level. |
| Approach: | They propose to encode Chinese characters into short sequences and construct Chinese vocabulary based on the encoded text. |
| Outcome: | The proposed tokenizers can tokenize inputs into much shorter sequences, improving computational efficiency. |
PEVL: Position-enhanced Pre-training and Prompt Tuning for Vision-language Models (2022.emnlp-main)
Copied to clipboard
| Challenge: | Recent advances on self-supervised learning have led to powerful vision-language pre-training models that achieve state-of-the-art performance on a wide range of cross-modal tasks. |
| Approach: | They propose a vision-language pre-training framework that reformulates discretized object positions and language in a unified language modeling framework. |
| Outcome: | The proposed model improves performance on position-sensitive vision-language (VL) tasks and also improves on position insensitive tasks. |
Enhancing Long-Chain Reasoning Distillation through Error-Aware Self-Reflection (2026.findings-acl)
Copied to clipboard
Zhuoyang Wu, Xinze Li, Zhenghao Liu, Yukun Yan, Zhiyuan Liu, Minghe Yu, Cheng Yang, Yu Gu, Ge Yu, Maosong Sun
| Challenge: | Existing studies treat SLMs as student models and use long-form Chains-of-Thought (CoTs) as supervision signals for Supervised Fine-Tuning (SFT). Existing research focuses on distilling reasoning ability from LLMs to enhance the mathematical reasoning performance of small-scale models. |
| Approach: | They propose a framework that refines teacher CoTs through an error-aware reflection process to enable the student model to construct more tailored teacher Cots. |
| Outcome: | Experiments on multiple mathematical reasoning benchmarks show that ORION improves performance by more than 2% over all baselines. |
Beyond Natural Language: LLMs Leveraging Alternative Formats for Enhanced Reasoning and Communication (2024.findings-emnlp)
Copied to clipboard
Weize Chen, Chenfei Yuan, Jiarui Yuan, Yusheng Su, Chen Qian, Cheng Yang, Ruobing Xie, Zhiyuan Liu, Maosong Sun
| Challenge: | Natural language (NL) has long been the predominant format for human cognition and communication, but its utility in LLMs has not been thoroughly examined. |
| Approach: | They propose to allow LLMs to choose the most suitable format before reasoning or communicating, and to automate the selection process. |
| Outcome: | The proposed format improves reasoning efficiency and reduces token usage while maintaining communicative effectiveness. |
OpenNRE: An Open and Extensible Toolkit for Neural Relation Extraction (D19-3)
Copied to clipboard
| Challenge: | OpenNRE provides a framework to implement neural relation extraction (RE) . the toolkit provides various functional modules based on TensorFlow and PyTorch . |
| Approach: | OpenNRE is an open-source framework to implement neural relation extraction models. they also release an online system to meet real-time extraction without any training and deployment. |
| Outcome: | OpenNRE provides a framework to implement neural models for relation extraction (RE) the toolkit also includes an online system to meet real-time extraction without training and deployment . |
Stochastic Bridges as Effective Regularizers for Parameter-Efficient Tuning (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for tuning pre-trained language models ignore the running cost and only optimize the terminal cost. |
| Approach: | They propose to use stochastic bridges to regularize intermediate states and use regularization as running cost of PETs. |
| Outcome: | The proposed methods can be used to tune large pre-trained language models . they can be compared to full-parameter fine-tuning by tuning a small number of parameters . |
READIN: A Chinese Multi-Task Benchmark with Realistic and Diverse Input Noises (2023.acl-long)
Copied to clipboard
| Challenge: | Existing benchmarks for Chinese inputs often lack a realistic representation of real-world noises. |
| Approach: | They construct a Chinese multi-task benchmark with REalistic and Diverse input noises . they use pinyin input and speech input to recruit speakers from diverse dialects based on their inputs - a feature that is important for Chinese NLP benchmarks if it is implemented in real-world applications. |
| Outcome: | The proposed benchmarks are based on four different tasks and are designed to maximize diversity. |
ONION: A Simple and Effective Defense Against Textual Backdoor Attacks (2021.emnlp-main)
Copied to clipboard
| Challenge: | Backdoor attacks can manipulate the output of deep neural networks and possess high insidiousness. |
| Approach: | They propose a textual backdoor defense based on outlier word detection that can handle all the textual attacks. |
| Outcome: | The proposed method can handle all the textual backdoor attack situations. |
Fusing Highly Specialized Language Models for Comprehensive Expertise (2025.acl-long)
Copied to clipboard
Ning Ding, Yulin Chen, Ganqu Cui, Xingtai Lv, Weilin Zhao, Kaiyan Zhang, Ruobing Xie, Bowen Zhou, Zhiyuan Liu, Maosong Sun
| Challenge: | Existing models that focus on language, programming code, and mathematical symbols are not able to achieve mastery of all three domains simultaneously. |
| Approach: | They propose to fuse highly-specialized models that are already sufficiently trained on different domains to achieve a highly-specific model. |
| Outcome: | The proposed model could achieve mastery of the three crucial domains simultaneously. |
Reduce Catastrophic Forgetting of Dense Retrieval Training with Teleportation Negatives (2022.emnlp-main)
Copied to clipboard
| Challenge: | Recent research shows strong empirical advantages of dense retrieval in various information access scenarios, such as openQA. |
| Approach: | They propose a method which accumulates momentum negatives from past iterations and approximates future iteration with lookahead negatives as "teleportations" on web search and OpenQA, ANCE-Tele outperforms previous state-of-the-art systems of similar size and eliminates the dependency on sparse retrieval negatives. |
| Outcome: | The proposed method outperforms previous state-of-the-art systems on web search and OpenQA and is competitive among systems with significantly more parameters. |
Ouroboros: Generating Longer Drafts Phrase by Phrase for Faster Speculative Decoding (2024.emnlp-main)
Copied to clipboard
Weilin Zhao, Yuxiang Huang, Xu Han, Wang Xu, Chaojun Xiao, Xinrong Zhang, Yewei Fang, Kaihuo Zhang, Zhiyuan Liu, Maosong Sun
| Challenge: | Speculative decoding is a widely used method that accelerates the generation process of large language models (LLMs) drafting efficiency has become a bottleneck in the final speedup of speculative drafting, therefore generating longer drafts at less cost can lead to better speedup. |
| Approach: | They propose a method that uses existing model to drafting and target LLM to verify draft in a low-cost parallel manner. |
| Outcome: | The proposed method can achieve speedups of up to 2.4 over speculative decoding and 3.9 over vanilla decoding without fine-tuning draft and target models. |
Emergent Modularity in Pre-trained Transformers (2023.findings-acl)
Copied to clipboard
Zhengyan Zhang, Zhiyuan Zeng, Yankai Lin, Chaojun Xiao, Xiaozhi Wang, Xu Han, Zhiyuan Liu, Ruobing Xie, Maosong Sun, Jie Zhou
| Challenge: | Existing studies on pre-trained Transformers show that they learn fine-grained neuron functions. |
| Approach: | They examine the presence of modularity in pre-trained Transformers . they focus on Mixture-of-Experts, a promising candidate for modularity . |
| Outcome: | The proposed structure stabilizes at the early stage, which is faster than neuron stabilization. |
Going “Deeper”: Structured Sememe Prediction via Transformer with Tree Attention (2022.findings-acl)
Copied to clipboard
| Challenge: | Existing studies ignore hierarchical structures of sememes in sememe-based semantic description systems. |
| Approach: | They propose a structured sememe prediction problem to predict a sememes tree with hierarchical structures rather than a set of sememas. |
| Outcome: | The proposed model outperforms baseline models and shows its effectiveness . it predicts a sememe tree with hierarchical structures rather than a set of sememes . |
Decoder Tuning: Efficient Language Understanding as Decoding (2023.acl-long)
Copied to clipboard
| Challenge: | Existing approaches to adapt pre-trained models with parameters frozen are based on input-side adaptation, which requires thousands of API queries. |
| Approach: | They propose to train a model-as-a-service (MaaS) setting to provide only the inference APIs for users . they argue that input-side adaptation could be arduous due to the lack of gradient signals . |
| Outcome: | The proposed model outperforms state-of-the-art algorithms with a 200x speed-up. |
FewRel: A Large-Scale Supervised Few-Shot Relation Classification Dataset with State-of-the-Art Evaluation (D18-1)
Copied to clipboard
| Challenge: | Empirical results show that even the most competitive few-shot learning models struggle on this task, especially as compared with humans. |
| Approach: | They propose a Few-Shot Relation Classification Dataset consisting of 70, 000 sentences on 100 relations derived from Wikipedia and annotated by crowdworkers. |
| Outcome: | The proposed methods perform well on the most competitive few-shot learning models, especially as compared with humans. |
Be Careful about Poisoned Word Embeddings: Exploring the Vulnerability of the Embedding Layers in NLP Models (2021.naacl-main)
Copied to clipboard
| Challenge: | Recent studies reveal a security threat to natural language processing models, called the Backdoor Attack. |
| Approach: | They propose to hack a model by modifying one single word embedding vector without sacrificing accuracy on clean samples. |
| Outcome: | The proposed method is more efficient and stealthier on sentiment analysis and sentence-pair classification tasks. |
Automatic Construction of Sememe Knowledge Bases via Dictionaries (2021.findings-acl)
Copied to clipboard
| Challenge: | Sememe knowledge bases (SKBs) are used to analyze natural language processing. |
| Approach: | They propose a method to build sememe knowledge bases from an existing dictionary . they propose to use existing dictionaries to build an English and a French SKB . |
| Outcome: | The proposed method is superior to HowNet, the most widely used SKB that takes decades to build manually. |
Adversarial Multi-lingual Neural Relation Extraction (C18-1)
Copied to clipboard
| Challenge: | Existing models cannot capture consistency and diversity of relation patterns in different languages. |
| Approach: | They propose an adversarial multi-lingual neural relation extraction model which considers consistency and diversity among languages. |
| Outcome: | The proposed model outperforms the state-of-the-art models on real-world datasets. |
Reasoning in Flux: Enhancing Large Language Models Reasoning through Uncertainty-aware Adaptive Guidance (2024.acl-long)
Copied to clipboard
Zhangyue Yin, Qiushi Sun, Qipeng Guo, Zhiyuan Zeng, Xiaonan Li, Junqi Dai, Qinyuan Cheng, Xuanjing Huang, Xipeng Qiu
| Challenge: | Extensive experiments across various reasoning tasks demonstrate that UAG not only enhances the reasoning abilities of LLMs but consistently outperforms several strong baselines with minimal computational overhead. |
| Approach: | They propose an approach to guide LLMs onto an accurate and reliable trajectory by identifying and adjusting uncertainty signals within each step of the reasoning chain. |
| Outcome: | The proposed approach outperforms strong baselines and outperformed strong models with minimal computational overhead. |
DeepNote: Note-Centric Deep Retrieval-Augmented Generation (2025.findings-emnlp)
Copied to clipboard
Ruobing Wang, Qingfei Zhao, Yukun Yan, Daren Zha, Yuxuan Chen, Shi Yu, Zhenghao Liu, Yixuan Wang, Shuo Wang, Xu Han, Zhiyuan Liu, Maosong Sun
| Challenge: | . - (EN) |
| Approach: | . - (EN) |
| Outcome: | . - (EN) |
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. |
Incorporating Chinese Characters of Words for Lexical Sememe Prediction (P18-1)
Copied to clipboard
| Challenge: | Existing methods of lexical sememe prediction rely on external context information of words to represent meaning. |
| Approach: | They propose a character-enhanced sememe prediction framework for Chinese language that takes advantage of internal character information and external context information. |
| Outcome: | The proposed framework outperforms state-of-the-art methods on a Chinese sememe knowledge base and maintains robust performance even for low-frequency words. |
Exploring the Impact of Model Scaling on Parameter-Efficient Tuning (2023.emnlp-main)
Copied to clipboard
Yusheng Su, Chi-Min Chan, Jiali Cheng, Yujia Qin, Yankai Lin, Shengding Hu, Zonghan Yang, Ning Ding, Xingzhi Sun, Guotong Xie, Zhiyuan Liu, Maosong Sun
| Challenge: | Parameter-efficient tuning (PET) methods can drive large pre-trained language models by training only minimal parameters. |
| Approach: | They propose a parameter-efficient tuning method that is compatible with a tunable module and uses a random number generator to optimize fewer table parameters. |
| Outcome: | The proposed method is compatible with a tunable module and tested on 11 NLP tasks. |
BMInf: An Efficient Toolkit for Big Model Inference and Tuning (2022.acl-demo)
Copied to clipboard
Xu Han, Guoyang Zeng, Weilin Zhao, Zhiyuan Liu, Zhengyan Zhang, Jie Zhou, Jun Zhang, Jia Chao, Maosong Sun
| Challenge: | Recent years, pre-trained language models (PLMs) have achieved promising results on various NLP tasks. |
| Approach: | They propose an open-source toolkit for big model inference and tuning which can support big model tuning at extremely low computation cost. |
| Outcome: | The proposed toolkit can support big model inference and tuning at extremely low computation cost. |
APB-V: Accelerating Long-Video Understanding via Sequence-Parallelism-aware Approximate Attention (2026.acl-long)
Copied to clipboard
Yuxiang Huang, Mingye Li, Xu Han, Chaojun Xiao, Weilin Zhao, Ao Sun, Ziqi Yuan, Hao Zhou, Fandong Meng, Zhiyuan Liu
| Challenge: | Existing methods for long-video inference use compression or sparse attention . existing methods restrict LMMs from handling longer, more complex videos . |
| Approach: | They propose a sequence-parallel framework with optimized attention that accelerates long-video inference across multiple GPUs. |
| Outcome: | The proposed framework delivers speedups of 12.72x, 1.70x, and 1.18x over FlashAttn, ZigZagRing, and APB without significant performance loss. |
FewRel 2.0: Towards More Challenging Few-Shot Relation Classification (D19-1)
Copied to clipboard
| Challenge: | Few-shot domain adaptation and NOTA detection are two real-world challenges for few-shot relation classification models. |
| Approach: | They propose a task to investigate two aspects of few-shot relation classification models . they build upon the FewRel dataset by adding a new test set in a different domain . |
| Outcome: | The proposed task can evaluate few-shot domain adaptation and few- shot none-of-the-above detection on a new domain and NOTA relation choice. |
Enhancing Byzantine-Resistant Aggregations with Client Embedding (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Existing Byzantine-resistant aggregations detect poisonous clients but cannot defend against backdoor injection by malicious attackers in natural language tasks. |
| Approach: | They propose to embed client parameters to enhance Byzantine-resistant aggregations. |
| Outcome: | The proposed client embeddings detect poisonous clients and discard them . the proposed algorithms can't defend against backdoor injection by malicious attackers in natural language tasks . |
Cross-lingual Lexical Sememe Prediction (D18-1)
Copied to clipboard
| Challenge: | Sememes are defined as the minimum semantic units of human languages . but most languages do not have sememe-based linguistic knowledge bases . a new framework is proposed to predict sememes for words in other languages based on semems . |
| Approach: | They propose a framework to model correlations between sememes and multi-lingual words in low-dimensional semantic space for sememe prediction. |
| Outcome: | The proposed model improves on baseline methods on real-world datasets. |
Cross-Lingual Contrastive Learning for Fine-Grained Entity Typing for Low-Resource Languages (2022.acl-long)
Copied to clipboard
| Challenge: | Experimental results show that by applying our framework, we can easily learn effective FGET models for low-resource languages. |
| Approach: | They propose a cross-lingual contrastive learning framework to learn FGET models for low-resource languages. |
| Outcome: | The proposed framework can learn effective FGET models for low-resource languages even without human-labeled data. |
Open Hierarchical Relation Extraction (2021.naacl-main)
Copied to clipboard
| Challenge: | Existing OpenRE methods cast different relation types in isolation without considering their hierarchical dependency. |
| Approach: | They propose a framework to establish bidirectional connections between OpenRE and relation hierarchies by integrating hierarchy information into relation representations. |
| Outcome: | The proposed framework outperforms state-of-the-art models on relation clustering and hierarchy expansion. |
ClueAnchor: Clue-Anchored Knowledge Reasoning Exploration and Optimization for Retrieval-Augmented Generation (2025.findings-emnlp)
Copied to clipboard
Hao Chen, Yukun Yan, Sen Mei, Wanxiang Che, Zhenghao Liu, Qi Shi, Xinze Li, Yuchun Fan, Pengcheng Huang, Qiushi Xiong, Zhiyuan Liu, Maosong Sun
| Challenge: | Existing RAG systems often underutilize the retrieved documents, authors say . they fail to extract and integrate key clues needed to support faithful and interpretable reasoning . |
| Approach: | a new framework extracts key clues from retrieved content and generates multiple reasoning paths . the framework optimizes the model by selecting the most appropriate reasoning path . |
| Outcome: | Experiments show that ClueAnchor outperforms baseline RAG frameworks in completeness and robustness. |
FR-Spec: Accelerating Large-Vocabulary Language Models via Frequency-Ranked Speculative Sampling (2025.acl-long)
Copied to clipboard
Weilin Zhao, Tengyu Pan, Xu Han, Yudi Zhang, Sun Ao, Yuxiang Huang, Kaihuo Zhang, Weilun Zhao, Yuxuan Li, Jie Zhou, Hao Zhou, Jianyong Wang, Maosong Sun, Zhiyuan Liu
| Challenge: | Speculative sampling is an efficient way to accelerate the auto-regressive generation process of large language models. |
| Approach: | They propose a frequency-ranked speculative sampling framework that optimizes draft candidate selection through vocabulary space compression. |
| Outcome: | Experiments show that FR-Spec reduces LM Head computation overhead by 75% while ensuring the equivalence of the final output distribution. |
Dynamic and Generalizable Process Reward Modeling (2025.acl-long)
Copied to clipboard
| Challenge: | Existing Process Reward Models lack cross-domain generalization and focus on feedback results. |
| Approach: | They propose a process reward model that uses a reward tree to capture and store fine-grained, multi-dimensional reward criteria. |
| Outcome: | The proposed model performs on prevailing benchmarks and out-of-distribution scenarios. |
Dim-Krum: Backdoor-Resistant Federated Learning for NLP with Dimension-wise Krum-Based Aggregation (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods to reduce backdoor risk of federated learning are validated in the CV field. |
| Approach: | They propose a federated aggregation algorithm that detects errors determined by backdoor strengths for NLP attacks. |
| Outcome: | The proposed method is hard to defend against than CV, and the results validate it. |
Train No Evil: Selective Masking for Task-Guided Pre-Training (2020.emnlp-main)
Copied to clipboard
| Challenge: | Pre-trained language models can't capture domain-specific and task-specific patterns because of the task-agnostic pre-training stage. |
| Approach: | They propose a task-guided pre-training stage with selective masking between general pre-train and fine-tuning to learn domain-specific patterns. |
| Outcome: | The proposed method can achieve comparable or even better performance with less than 50% of computation cost. |
AutoReproduce: Automatic AI Experiment Reproduction with Paper Lineage (2026.acl-long)
Copied to clipboard
Xuanle Zhao, Zilin Sang, Yuxuan Li, Qi Shi, Weilun Zhao, Shuo Wang, Duzhen Zhang, Xu Han, Zhiyuan Liu, Maosong Sun
| Challenge: | Efficient reproduction of research papers requires deep domain expertise. |
| Approach: | They propose a framework that systematically mines implicit knowledge from the cited literature to reproduce experimental code in a complete, end-to-end manner. |
| Outcome: | The proposed framework surpasses baselines across all metrics and reproduces experimental code in a complete, end-to-end manner. |
MoEfication: Transformer Feed-forward Layers are Mixtures of Experts (2022.findings-acl)
Copied to clipboard
| Challenge: | Recent work has shown that feed-forward networks (FFNs) in pre-trained Transformers are a key component, storing various linguistic and factual knowledge. |
| Approach: | They propose to convert a model into its MoE version with the same parameters and build expert routers to decide which experts will be used for each input. |
| Outcome: | The proposed model can use 10% to 30% of FFN parameters while maintaining over 95% original performance. |
OpenAttack: An Open-source Textual Adversarial Attack Toolkit (2021.acl-demo)
Copied to clipboard
Guoyang Zeng, Fanchao Qi, Qianrui Zhou, Tingji Zhang, Zixian Ma, Bairu Hou, Yuan Zang, Zhiyuan Liu, Maosong Sun
| Challenge: | Various attack models are distinct and implemented with different programming frameworks and settings, which hinders quick utilization and fair comparison of attack models. |
| Approach: | They propose an open-source textual adversarial attack toolkit to solve these issues by combining 15 typical attack models into one toolkit. |
| Outcome: | The proposed toolkit supports all attack types, multilinguality, and parallel processing. |
Robust and Scalable Model Editing for Large Language Models (2024.lrec-main)
Copied to clipboard
Yingfa Chen, Zhengyan Zhang, Xu Han, Chaojun Xiao, Zhiyuan Liu, Chen Chen, Kuai Li, Tao Yang, Maosong Sun
| Challenge: | Existing methods that ignore contextual knowledge fail to reliably fall back to parametric knowledge when presented with irrelevant context. |
| Approach: | They propose to use contextual knowledge to update and correct LLMs' knowledge by in-context editing instead of retraining. |
| Outcome: | The proposed method outperforms current state-of-the-art methods by a large margin on a dataset that contains irrelevant questions. |
Open Relation Extraction: Relational Knowledge Transfer from Supervised Data to Unsupervised Data (D19-1)
Copied to clipboard
| Challenge: | Existing methods to extract relational facts from open domain corpora are time-consuming and human-intensive. |
| Approach: | They propose a framework to learn similarity metrics of relations from labeled data . they propose to transfer relational knowledge to identify novel relations in unlabeled data. |
| Outcome: | Experiments on two real-world datasets show that the proposed framework improves compared with state-of-the-art methods. |
Parameter-efficient Weight Ensembling Facilitates Task-level Knowledge Transfer (2023.acl-short)
Copied to clipboard
| Challenge: | Recent studies show that large pre-trained language models can be adapted to particular tasks in a parameter-efficient manner. |
| Approach: | They propose to use lightweight parameters to transfer them between tasks to obtain similarity between tasks. |
| Outcome: | The proposed methods show an improvement of 5%8% over baselines and could largely facilitate task-level knowledge transfer. |
AgentRM: Enhancing Agent Generalization with Reward Modeling (2025.acl-long)
Copied to clipboard
Yu Xia, Jingru Fan, Weize Chen, Siyu Yan, Xin Cong, Zhong Zhang, Yaxi Lu, Yankai Lin, Zhiyuan Liu, Maosong Sun
| Challenge: | Existing LLM-based agents have strong performance on held-in tasks, but their generalizability to unseen tasks remains poor. |
| Approach: | They propose a reward-based generalizable reward model to guide the policy model for effective test-time search. |
| Outcome: | The proposed agentRM outperforms existing agents on held-in tasks by 8.8 points on average. |
The Right Time Matters: Data Arrangement Affects Zero-Shot Generalization in Instruction Tuning (2025.findings-acl)
Copied to clipboard
Bingxiang He, Ning Ding, Cheng Qian, Jia Deng, Ganqu Cui, Lifan Yuan, Haiwen Hong, Huan-ang Gao, Longtao Huang, Hui Xue, Huimin Chen, Zhiyuan Liu, Maosong Sun
| Challenge: | Existing work on instruction tuning has focused on task level, without considering that tasks are artificially defined and, to LLMs, merely consist of tokens and representations. |
| Approach: | They propose a training data arrangement framework that allows for continual learning and loss reduction. |
| Outcome: | The proposed framework promotes continual learning and loss reduction on unseen tasks. |
Few-Shot Text Ranking with Meta Adapted Synthetic Weak Supervision (2021.acl-long)
Copied to clipboard
Si Sun, Yingzhuo Qian, Zhenghao Liu, Chenyan Xiong, Kaitao Zhang, Jie Bao, Zhiyuan Liu, Paul Bennett
| Challenge: | Neural information retrieval models have shown advanced results in many ranking scenarios where massive relevance labels or clickthrough data are available. |
| Approach: | They propose a domain adaptive learning method that generalizes Neu-IR models from label-rich source domains to few-shot target domains. |
| Outcome: | The proposed method improves the few-shot ranking accuracy of Neu-IR models on three TREC benchmarks in the web, news, and biomedical domains. |
On Transferability of Prompt Tuning for Natural Language Processing (2022.naacl-main)
Copied to clipboard
Yusheng Su, Xiaozhi Wang, Yujia Qin, Chi-Min Chan, Yankai Lin, Huadong Wang, Kaiyue Wen, Zhiyuan Liu, Peng Li, Juanzi Li, Lei Hou, Maosong Sun, Jie Zhou
| Challenge: | Pre-trained language models (PLMs) can achieve comparable performance to full-parameter fine-tuning by tuning a few soft prompts, but require much more training time than fine-timing. |
| Approach: | They empirically investigate the transferability of soft prompts across different downstream tasks and PLMs to determine what decides prompt transferability. |
| Outcome: | The proposed method can achieve comparable performance to full-parameter fine-tuning by tuning a few soft prompts, but requires much more training time than fine-timing. |
QuoteR: A Benchmark of Quote Recommendation for Writing (2022.acl-long)
Copied to clipboard
| Challenge: | Existing methods to recommend quotes are evaluated on unpublished datasets . |
| Approach: | They propose to build a dataset that is open and contains three parts including English, standard Chinese and classical Chinese. |
| Outcome: | The proposed model outperforms existing methods on all three parts of QuoteR. |
Plug-and-Play Knowledge Injection for Pre-trained Language Models (2023.acl-long)
Copied to clipboard
Zhengyan Zhang, Zhiyuan Zeng, Yankai Lin, Huadong Wang, Deming Ye, Chaojun Xiao, Xu Han, Zhiyuan Liu, Peng Li, Maosong Sun, Jie Zhou
| Challenge: | Existing knowledge injection methods are not suitable for enhancing pre-trained language models with external knowledge bases. |
| Approach: | They propose a plug-and-play knowledge injection method where knowledge bases are injected into frozen existing downstream models by a knowledge plugin. |
| Outcome: | The proposed method improves the performance of knowledge injection on knowledge-driven tasks while keeping model parameters frozen. |
Sememe Prediction for BabelNet Synsets using Multilingual and Multimodal Information (2022.findings-acl)
Copied to clipboard
| Challenge: | Existing sememe KBs only cover a few languages, which hinders the wide utilization of sememes. |
| Approach: | They propose to build a multilingual sememe KB based on a dictionary called BabelNet . they use multilingual synonyms, multilingual glosses and images to encode sememes . |
| Outcome: | The proposed model outperforms previous methods in terms of MAP and F1 scores. |
FPT: Improving Prompt Tuning Efficiency via Progressive Training (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Recent prompt tuning (PT) has gained increasing attention as a parameter-efficient way of tuning pre-trained language models (PLMs). |
| Approach: | They propose a prompt tuning algorithm that uses a small-scale partial PLM and progressively expands its depth and width until the full-model size. |
| Outcome: | The proposed method could save over 30% of training computations while achieving comparable performance. |
OlympiadBench: A Challenging Benchmark for Promoting AGI with Olympiad-Level Bilingual Multimodal Scientific Problems (2024.acl-long)
Copied to clipboard
Chaoqun He, Renjie Luo, Yuzhuo Bai, Shengding Hu, Zhen Thai, Junhao Shen, Jinyi Hu, Xu Han, Yujie Huang, Yuxiang Zhang, Jie Liu, Lei Qi, Zhiyuan Liu, Maosong Sun
| Challenge: | Large Language Models (LLMs) and Large Multimodal Models have exceeded general human capabilities in various tasks. |
| Approach: | They present an Olympiad-level bilingual multimodal scientific benchmark featuring 8,476 problems from Olympiad level mathematics and physics competitions. |
| Outcome: | The best performing model, GPT-4V, attains an average score of 17.97% on OlympiadBench, with a mere 10.74% in physics, highlighting the benchmark rigor and the intricacy of physical reasoning. |
Entity-Duet Neural Ranking: Understanding the Role of Knowledge Graph Semantics in Neural Information Retrieval (P18-1)
Copied to clipboard
| Challenge: | Entity-oriented search and neural-IR push the boundary of search engines from two different aspects. |
| Approach: | They propose an Entity-Duet Neural Ranking Model which integrates knowledge graphs into neural search systems. |
| Outcome: | The proposed model improves generalization ability of neural ranking models on a commercial search log. |
Legal Judgment Prediction via Topological Learning (D18-1)
Copied to clipboard
| Challenge: | Existing studies focus on a specific subtask of judgment prediction and ignore the dependencies among subtasks. |
| Approach: | They propose a topological multi-task learning framework that incorporates multiple subtasks and DAG dependencies into judgment prediction. |
| Outcome: | The proposed model improves on baselines on all judgment prediction tasks. |
A Simple but Effective Pluggable Entity Lookup Table for Pre-trained Language Models (2022.acl-short)
Copied to clipboard
| Challenge: | Existing pre-trained language models cannot recall factual knowledge of entities exhibited in large-scale corpora, especially those rare entities. |
| Approach: | They propose to build a pluggable Entity Lookup Table (PELT) on demand by aggregating the entity’s output representations of multiple occurrences in the corpora. |
| Outcome: | The proposed model can transfer entity knowledge from out-of-domain corpora into PLMs with different architectures. |
GA-SAM: Gradient-Strength based Adaptive Sharpness-Aware Minimization for Improved Generalization (2022.emnlp-main)
Copied to clipboard
| Challenge: | Recent studies show flat minima tend to imply better generalization abilities . however, it has some difficulty implying SAM to some natural language tasks . |
| Approach: | They propose a flatness-aware minimization algorithm that can be applied to natural language tasks . they propose to use parameter corruptions to explain why flat minima generalize better . |
| Outcome: | The proposed algorithm can generalize better for flat minima that are robust against corruptions or perturbations. |
BMCook: A Task-agnostic Compression Toolkit for Big Models (2022.emnlp-demos)
Copied to clipboard
Zhengyan Zhang, Baitao Gong, Yingfa Chen, Xu Han, Guoyang Zeng, Weilin Zhao, Yanxu Chen, Zhiyuan Liu, Maosong Sun
| Challenge: | Existing efforts to compress medium-sized models for specific tasks have limited results. |
| Approach: | They propose a task-agnostic compression toolkit for big models that implements quantization, pruning, distillation and MoEfication methods. |
| Outcome: | The proposed tool improves performance on a model with 3 billion parameters by 12x . it also outperforms the original model on three typical NLP benchmarks. |
ARISE: An Adaptive Resolution-Aware Metric for Test-Time Scaling Evaluation in Large Reasoning Models (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing evaluation methods for test-time scaling are limited. |
| Approach: | They propose an adaptive resolution-aware scaling evaluation metric specifically designed to assess the test-time scaling effectiveness of large reasoning models. |
| Outcome: | The proposed metric provides a reliable and fine-grained measurement of test-time scaling capabilities, revealing significant variations in scaling efficiency across models. |
XQA: A Cross-lingual Open-domain Question Answering Dataset (P19-1)
Copied to clipboard
| Challenge: | Open-domain question answering aims to answer questions through text retrieval and reading comprehension . but, the success of these models relies on a massive volume of training data, which is not available in other languages . a new dataset aims at investigating cross-lingual OpenQA . |
| Approach: | They propose to use a dataset for cross-lingual OpenQA research to test models . they use XQA dataset to train models with large volumes of labeled data . |
| Outcome: | The proposed model achieves best results in almost all target languages while the performance is lower than that of English. |
Boosting Inference Efficiency: Unleashing the Power of Parameter-Shared Pre-trained Language Models (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Parameter-shared pre-trained language models (PLMs) have emerged as a successful approach in resource-constrained environments. |
| Approach: | They propose a method to enhance the inference efficiency of parameter-shared PLMs by pre-training models that can achieve even greater acceleration. |
| Outcome: | The proposed method improves inference efficiency on autoregressive and autoencoding models. |
Cost-Optimal Grouped-Query Attention for Long-Context Modeling (2025.emnlp-main)
Copied to clipboard
Yingfa Chen, Yutong Wu, Chenyang Song, Zhen Leng Thai, Xingyu Shen, Xu Han, Zhiyuan Liu, Maosong Sun
| Challenge: | Current GQA configurations overlook how context length influences inference cost . |
| Approach: | They propose a recipe for deriving cost-optimal GQA configurations that decouple the total head size from the hidden size and allow more flexible control over attention FLOPs. |
| Outcome: | The proposed configurations reduce memory usage and FLOPs by more than 50% compared to Llama-3's GQA, with *no degradation in model capabilities*. |
Graph Neural Networks with Generated Parameters for Relation Extraction (P19-1)
Copied to clipboard
| Challenge: | Existing graph neural networks can only process multi-hop relational reasoning on pre-defined graphs and cannot be directly applied in natural language relational reasoning. |
| Approach: | They propose a graph neural network with generated parameters using natural language sentences as inputs. |
| Outcome: | The proposed model can process relational reasoning on graphs and in natural language processing tasks. |
Hidden Killer: Invisible Textual Backdoor Attacks with Syntactic Trigger (2021.acl-long)
Copied to clipboard
| Challenge: | Existing methods for textual backdoor attacks insert additional contents into normal samples as triggers, causing detection and blocking of backdoors. |
| Approach: | They propose to use syntactic structure as trigger in textual backdoor attacks . they propose to achieve similar attack performance but have higher invisibility . |
| Outcome: | The proposed method achieves almost 100% success rate but has higher invisibility and stronger resistance to defenses than the insertion-based methods. |
ReflectRM: Boosting Generative Reward Models via Self-Reflection within a Unified Judgment Framework (2026.acl-long)
Copied to clipboard
Kai Qin, Liangxin Liu, Yu Liang, Longzheng Wang, null Wangyan, Zhang Yueyang, Long Xia, Zhiyuan Sun, Houde Liu, Daiting Shi
| Challenge: | Existing methods for generating reward models focus on outcome-level supervision, neglecting analytical process quality, which constrains their potential. |
| Approach: | They propose a novel reward model that leverages self-reflection to assess analytical quality and enhance preference modeling. |
| Outcome: | The proposed model improves performance on four benchmarks and significantly mitigates positional bias. |
Mind the Style of Text! Adversarial and Backdoor Attacks Based on Text Style Transfer (2021.emnlp-main)
Copied to clipboard
| Challenge: | Experimental results show that popular NLP models are vulnerable to both adversarial and backdoor attacks based on text style transfer. |
| Approach: | They propose to conduct adversarial and backdoor attacks based on text style transfer . the authors propose to use text style to alter the style of a sentence . |
| Outcome: | The proposed methods show that popular models are vulnerable to both attacks based on text style transfer . the results show that the proposed methods perform better than baselines in many aspects . |
GUICourse: From General Vision Language Model to Versatile GUI Agent (2025.acl-long)
Copied to clipboard
Wentong Chen, Junbo Cui, Jinyi Hu, Yujia Qin, Junjie Fang, Yue Zhao, Chongyi Wang, Jun Liu, Guirong Chen, Yupeng Huo, Yuan Yao, Yankai Lin, Zhiyuan Liu, Maosong Sun
| Challenge: | Graphical User Interfaces (GUIs) are a pivotal medium for human-computer interaction. |
| Approach: | They propose a series of datasets for training visual-based GUI agents using general VLMs. |
| Outcome: | The proposed GUICourse datasets show that even a small-sized GUI agent performs better on GUI tasks. |
StableToolBench: Towards Stable Large-Scale Benchmarking on Tool Learning of Large Language Models (2024.findings-acl)
Copied to clipboard
Zhicheng Guo, Sijie Cheng, Hao Wang, Shihao Liang, Yujia Qin, Peng Li, Zhiyuan Liu, Maosong Sun, Yang Liu
| Challenge: | Large Language Models (LLMs) have witnessed remarkable advancements in recent years, prompting the exploration of tool learning. |
| Approach: | They propose a virtual API server and stable evaluation system to assess the stability of large-scale real-time APIs. |
| Outcome: | The proposed benchmarks demonstrate the stability of the proposed system and its caching system. |
DecorateLM: Data Engineering through Corpus Rating, Tagging, and Editing with Language Models (2024.emnlp-main)
Copied to clipboard
Ranchi Zhao, Zhen Thai, Yifan Zhang, Shengding Hu, Jie Zhou, Yunqi Ba, Jie Cai, Zhiyuan Liu, Maosong Sun
| Challenge: | Large Language Models (LLMs) are pre-trained on vast datasets composed of billions of tokens harvested from diverse text sources. |
| Approach: | They propose a data engineering method to refine the pretraining corpus through data rating, tagging and editing. |
| Outcome: | The proposed method improves the quality of the pretraining corpus by enhancing 100 billion tokens of the training corpus. |
SWE-Mutation: Can LLMs Generate Reliable Test Suites in Software Engineering? (2026.findings-acl)
Copied to clipboard
Yuxuan Sun, Yuze Zhao, Yufeng Wang, Yao Du, Zhiyuan Ma, Jinbo Wang, Mengdi Zhang, Kai Zhang, Zhenya Huang
| Challenge: | Evaluating software engineering capabilities is a core component of large language models (LLMs). |
| Approach: | They propose a benchmark to evaluate LLM-generated test suites that introduces mutated solutions that attempt to "fool" them. |
| Outcome: | The proposed test suites are based on 2,636 mutated variants derived from 800 original instances and include a multilingual subset spanning nine programming languages. |
Pretrain-KGE: Learning Knowledge Representation from Pretrained Language Models (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Existing knowledge graph embedding models suffer from limited knowledge representation due to sparse and noisy dataset annotations. |
| Approach: | They propose to use pretrained language models to enhance knowledge representation by leveraging world knowledge from pretrained models. |
| Outcome: | Extensive experiments show that the proposed framework can improve results over existing models. |
Neural Network Surgery: Injecting Data Patterns into Pre-trained Models with Minimal Instance-wise Side Effects (2021.naacl-main)
Copied to clipboard
| Challenge: | Existing neural network tuning methods cause instance-wise side effects . et al., 2018: a new approach to perform neural network surgery . |
| Approach: | They propose to perform neural network surgery by only changing 10-5 parameters . they propose to use a dynamic selecting method to achieve the best overall performance . |
| Outcome: | The proposed method achieves the best overall performance and induces fewer instance-wise side effects by changing only 10-5 of the parameters. |
WebCPM: Interactive Web Search for Chinese Long-form Question Answering (2023.acl-long)
Copied to clipboard
Yujia Qin, Zihan Cai, Dian Jin, Lan Yan, Shihao Liang, Kunlun Zhu, Yankai Lin, Xu Han, Ning Ding, Huadong Wang, Ruobing Xie, Fanchao Qi, Zhiyuan Liu, Maosong Sun, Jie Zhou
| Challenge: | Long-form question answering requires two procedures: information retrieval and information synthesis. |
| Approach: | They propose a Chinese long-form question answering dataset called WebCPM . the dataset is based on a web search interface that engages with a search engine in real time . |
| Outcome: | The proposed dataset generates answers that are no worse than human-written ones . the dataset is the first Chinese LFQA dataset . |
Expose Backdoors on the Way: A Feature-Based Efficient Defense against Textual Backdoor Attacks (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Existing online backdoor defense methods for NLP models focus on anomalies at input or output level, causing fragility to adaptive attacks and high computational cost. |
| Approach: | They propose a feature-based online defense method to detect poisoned samples . they use a distance-based anomaly score to distinguish poisones from clean samples based on feature-level regularization . |
| Outcome: | The proposed method outperforms existing methods in sentiment analysis and offense detection tasks. |
ConsistRM: Improving Generative Reward Models via Consistency-Aware Self-Training (2026.acl-long)
Copied to clipboard
Yu Liang, Liangxin Liu, Longzheng Wang, null Wangyan, Zhang Yueyang, Long Xia, Zhiyuan Sun, Daiting Shi
| Challenge: | ConsistRM is a self-training framework that enables effective and stable GRM training without human annotations. |
| Approach: | They propose a self-training framework that enables effective and stable GRM training without human annotations. |
| Outcome: | The proposed framework outperforms vanilla Reinforcement Fine-Tuning (RFT) by 1.5% on five benchmark datasets. |
LEVEN: A Large-Scale Chinese Legal Event Detection Dataset (2022.findings-acl)
Copied to clipboard
Feng Yao, Chaojun Xiao, Xiaozhi Wang, Zhiyuan Liu, Lei Hou, Cunchao Tu, Juanzi Li, Yun Liu, Weixing Shen, Maosong Sun
| Challenge: | Existing legal event detection datasets only cover incomprehensive event types and have limited annotated data. |
| Approach: | They present a large-scale Chinese legal event detection dataset . they use legal events as side information to promote downstream applications . |
| Outcome: | The proposed method improves 2.2 points precision in low-resource judgment prediction and 1.5 points precision for unsupervised case retrieval. |
Manual Evaluation Matters: Reviewing Test Protocols of Distantly Supervised Relation Extraction (2021.findings-acl)
Copied to clipboard
Tianyu Gao, Xu Han, Yuzhuo Bai, Keyue Qiu, Zhiyu Xie, Yankai Lin, Zhiyuan Liu, Peng Li, Maosong Sun, Jie Zhou
| Challenge: | Distantly supervised relation extraction (RE) has attracted much attention in the past few years . previous methods to evaluate models manually or directly on autolabeled data have produced inaccurate evaluations . |
| Approach: | They propose to use distant supervision to generate large-scale autolabeled data . they build manually-annotated test sets for two DS-RE datasets and evaluate models . |
| Outcome: | The proposed method produces 53% wrong labels at the entity pair level in the popular NYT10 dataset. |
Experiential Co-Learning of Software-Developing Agents (2024.acl-long)
Copied to clipboard
Chen Qian, Yufan Dang, Jiahao Li, Wei Liu, Zihao Xie, YiFei Wang, Weize Chen, Cheng Yang, Xin Cong, Xiaoyin Che, Zhiyuan Liu, Maosong Sun
| Challenge: | Recent advances in large language models (LLMs) have brought significant changes to various domains, especially through autonomous agents. |
| Approach: | They propose a framework that lets agents learn shortcuts from their past tasks and use them for future task execution. |
| Outcome: | The proposed framework enables agents to tackle unseen software-developing tasks more effectively. |
Beat LLMs at Their Own Game: Zero-Shot LLM-Generated Text Detection via Querying ChatGPT (2023.emnlp-main)
Copied to clipboard
Biru Zhu, Lifan Yuan, Ganqu Cui, Yangyi Chen, Chong Fu, Bingxiang He, Yangdong Deng, Zhiyuan Liu, Maosong Sun, Ming Gu
| Challenge: | Large language models (LLMs) are capable of performing tasks but are likely to be misused. |
| Approach: | They propose a zero-shot black-box method to detect LLM-generated texts . they revise the text to be detected using the ChatGPT model . |
| Outcome: | The proposed method can detect LLM-generated texts with a zero-shot black-box model . it is based on intuition that the model will make fewer revisions to LLMs than to human-written texts . |
Beyond the Turn-Based Game: Enabling Real-Time Conversations with Duplex Models (2024.emnlp-main)
Copied to clipboard
Xinrong Zhang, Yingfa Chen, Shengding Hu, Xu Han, Zihang Xu, Yuanwei Xu, Weilin Zhao, Maosong Sun, Zhiyuan Liu
| Challenge: | Large language models (LLMs) are increasingly permeating daily lives and require real-time interactions that mirror human conversations. |
| Approach: | They propose to use time-division-multiplexing to process queries and responses pseudo-simultaneously. |
| Outcome: | The proposed model can listen to users while generating output and adjust to provide instant feedback. |
AutoFigure-Edit: Generating Editable Scientific Illustrations via Reference-Guided Styling (2026.acl-demo)
Copied to clipboard
Zhen Lin, Qiujie Xie, Minjun Zhu, Shichen Li, QiYao Sun, Enhao Gu, Yiran Ding, Ke Sun, Fang Guo, Panzhong Lu, Zhiyuan Ning, Yixuan Weng, Yue Zhang
| Challenge: | Existing automated systems for scientific illustrations are limited in editability, stylistic controllability, and efficiency. |
| Approach: | They propose an end-to-end system that generates fully editable scientific illustrations from long-form scientific text while enabling flexible style adaptation through user-provided reference images. |
| Outcome: | The proposed system generates fully editable scientific illustrations from long-form scientific texts while enabling flexible style adaptation through user-provided reference images. |
UltraEval: A Lightweight Platform for Flexible and Comprehensive Evaluation for LLMs (2024.acl-demos)
Copied to clipboard
Chaoqun He, Renjie Luo, Shengding Hu, Ranchi Zhao, Jie Zhou, Hanghao Wu, Jiajie Zhang, Xu Han, Zhiyuan Liu, Maosong Sun
| Challenge: | Existing evaluation platforms are complex and poorly modularized, hindering seamless incorporation into researcher’s workflows. |
| Approach: | They propose a lightweight evaluation framework characterized by lightweight, comprehensiveness, modularity, and efficiency that integrates models, data, and metrics into a unified evaluation workflow. |
| Outcome: | The proposed evaluation framework is lightweight, comprehensive, modular, and efficient. |
Quantifying Similarity between Relations with Fact Distribution (P19-1)
Copied to clipboard
| Challenge: | a conceptually simple and effective method to quantify the similarity between relations is presented . identifying relations is a crucial problem for several information extraction tasks. |
| Approach: | They propose a method to quantify the similarity between relations in knowledge bases . they use a neural network to parameterize conditional probability distributions over entity pairs . |
| Outcome: | The proposed method significantly correlates with human judgments, the authors show . it could be incorporated into negative sampling and softmax classification to alleviate these mistakes. |
Fully Hyperbolic Neural Networks (2022.acl-long)
Copied to clipboard
| Challenge: | Existing hyperbolic neural networks encode features in the hyperbolical space yet formalize most of their operations in the tangent space. |
| Approach: | They propose a fully hyperbolic framework to build hyperbolical networks based on the Lorentz model by adapting Lorentzer transformations to formalize essential operations of neural networks. |
| Outcome: | The proposed framework has better performance on four NLP tasks compared with existing hyperbolic models . |
Enhancing Legal Case Retrieval via Scaling High-quality Synthetic Query-Candidate Pairs (2024.emnlp-main)
Copied to clipboard
| Challenge: | Existing studies focus on case-to-case retrieval using lengthy queries, which does not match real-world scenarios. |
| Approach: | They propose a method to construct query-candidate pairs and build the largest LCR dataset to date, LEAD. |
| Outcome: | Experimental results show that the method can provide ample training signals for LCR models. |
Variator: Accelerating Pre-trained Models with Plug-and-Play Compression Modules (2023.findings-emnlp)
Copied to clipboard
Chaojun Xiao, Yuqi Luo, Wenbin Zhang, Pengle Zhang, Xu Han, Yankai Lin, Zhengyan Zhang, Ruobing Xie, Zhiyuan Liu, Maosong Sun, Jie Zhou
| Challenge: | Large language models (LLMs) have been successful on NLP tasks but require huge parameter sizes and computational resources. |
| Approach: | They propose a parameter-efficient acceleration method that enhances computational efficiency through plug-and-play compression plugins. |
| Outcome: | The proposed method saves 53% computational costs using only 0.9% additional parameters with a performance drop of less than 2%. |
Denoising Relation Extraction from Document-level Distant Supervision (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods to generate auto-labeled sentences for relation extraction (RE) are difficult to extend to document-level relation extraction as noise from DS may be even multiplied in documents. |
| Approach: | They propose a pre-trained model which de-emphasizes noisy DS data via multiple pre-training tasks. |
| Outcome: | The proposed model can capture useful information from noisy data and achieve promising results on the large-scale DocRE benchmark. |
HMEAE: Hierarchical Modular Event Argument Extraction (D19-1)
Copied to clipboard
| Challenge: | Existing event extraction methods classify each argument role independently, ignoring conceptual correlations between different argument roles. |
| Approach: | They propose a Hierarchical Modular Event Argument Extraction model to provide inductive bias from the concept hierarchy of event argument roles. |
| Outcome: | The proposed model outperforms existing methods on real-world datasets and shows that it leverages useful knowledge from the concept hierarchy. |
Won’t Get Fooled Again: Answering Questions with False Premises (2023.acl-long)
Copied to clipboard
| Challenge: | Pre-trained language models (PLMs) are often easily deceived by tricky questions such as “How many eyes does the sun have?” . |
| Approach: | They annotate a FalseQA dataset containing 2365 human-written FPQs and find that PLMs are capable of discriminating FPqs by fine-tuning on moderate numbers. |
| Outcome: | The proposed model can discriminate on FPQs by fine-tuning on moderate numbers of examples and generate reasonable explanations for false premise questions. |
Learning to Generate Structured Output with Schema Reinforcement Learning (2025.acl-long)
Copied to clipboard
Yaxi Lu, Haolun Li, Xin Cong, Zhong Zhang, Yesai Wu, Yankai Lin, Zhiyuan Liu, Fangming Liu, Maosong Sun
| Challenge: | Recent advances in large language models have facilitated the development of intelligent applications like automatic web search (Qin et al., 2023) Several methods exist for generating JSON strings from LLMs, including Prompting but often miss certain schemas. |
| Approach: | They propose to use 40K different JSON schemas to assess models' ability to generate valid JSON outputs. |
| Outcome: | The proposed model improves both in generating JSON outputs and downstream tasks. |
Fine-Grained Legal Argument-Pair Extraction via Coarse-Grained Pre-training (2024.lrec-main)
Copied to clipboard
| Challenge: | Current methods conceptualize LAE as a supervised sentence-pair classification problem and necessitate extensive manual annotations. |
| Approach: | They propose a model that focuses on fine-grained alignment of argument pairs building upon coarse-grain complaint-defense pairs. |
| Outcome: | The proposed model outperforms baseline models by 3.7 and 2.4 points on average. |
ERICA: Improving Entity and Relation Understanding for Pre-trained Language Models via Contrastive Learning (2021.acl-long)
Copied to clipboard
Yujia Qin, Yankai Lin, Ryuichi Takanobu, Zhiyuan Liu, Peng Li, Heng Ji, Minlie Huang, Maosong Sun, Jie Zhou
| Challenge: | Existing pre-training objectives do not explicitly model relational facts in text . Experimental results show that ERICA can improve typical PLMs on several language understanding tasks, including relation extraction, entity typing and question answering. |
| Approach: | They propose a contrastive learning framework ERICA to obtain a deep understanding of entities and relations in text. |
| Outcome: | The proposed framework can improve PLMs on several language understanding tasks, especially under low-resource settings. |
CodRED: A Cross-Document Relation Extraction Dataset for Acquiring Knowledge in the Wild (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing relation extraction methods focus on extracting relational facts between entity pairs within single sentences or documents. |
| Approach: | They present a problem of cross-document relation extraction (CRE) using human annotations. |
| Outcome: | The proposed dataset is the first human-annotated cross-document RE dataset . it shows that it is challenging to existing RE methods including strong BERT-based models. |
WantWords: An Open-source Online Reverse Dictionary System (2020.emnlp-demos)
Copied to clipboard
| Challenge: | Existing reverse dictionary systems only support English reverse dictionary queries . a reverse dictionary can help people who can't remember a word from memory . |
| Approach: | They propose an online reverse dictionary system that outperforms other reverse dictionary systems . it supports Chinese and English-Chinese as well as Chinese-English cross-lingual reverse dictionary queries . |
| Outcome: | The proposed reverse dictionary outperforms other reverse dictionary systems on performance . it supports Chinese and English-Chinese as well as Chinese-English queries . |
UltraLink: An Open-Source Knowledge-Enhanced Multilingual Supervised Fine-tuning Dataset (2024.acl-long)
Copied to clipboard
Haoyu Wang, Shuo Wang, Yukun Yan, Xujia Wang, Zhiyu Yang, Yuzhuang Xu, Zhenghao Liu, Liner Yang, Ning Ding, Xu Han, Zhiyuan Liu, Maosong Sun
| Challenge: | Open-source large language models (LLMs) have gained strength across diverse fields, but the majority of studies focus on English. |
| Approach: | They propose a knowledge-grounded data augmentation approach to elicit more language-specific knowledge of LLMs by enhancing their ability to serve users from different countries. |
| Outcome: | The proposed method can prune the language-agnostic supervised fine-tuning dataset without any performance degradation. |
DebugBench: Evaluating Debugging Capability of Large Language Models (2024.findings-acl)
Copied to clipboard
Runchu Tian, Yining Ye, Yujia Qin, Xin Cong, Yankai Lin, Yinxu Pan, Yesai Wu, Hui Haotian, Liu Weichuan, Zhiyuan Liu, Maosong Sun
| Challenge: | Large language models (LLMs) have demonstrated exceptional coding capabilities, but their debugging capabilities remain relatively unexplored. |
| Approach: | They propose a debugging benchmark consisting of 4,253 LLMs with four major bug categories and 18 minor types in C++, Java, and Python. |
| Outcome: | The proposed benchmark covers four major bug categories and 18 minor types in C++, Java, and Python. |
Hierarchical Relation Extraction with Coarse-to-Fine Grained Attention (D18-1)
Copied to clipboard
| Challenge: | Existing methods for relation extraction use knowledge graphs to automatically label training data . but, it suffers from the wrong labeling problem because not all sentences containing two entities can express their relations in KGs . |
| Approach: | They propose a distant supervision approach to automatically label training instances . they integrate hierarchical information of relations into distantly supervised relation extraction . |
| Outcome: | The proposed model outperforms baseline models on a large-scale dataset. |
Enhancing Chat Language Models by Scaling High-quality Instructional Conversations (2023.emnlp-main)
Copied to clipboard
| Challenge: | a recent study validates the effectiveness of chat language models by fine-tuning instruction data. |
| Approach: | They propose to use a large-scale dataset of instructional conversations to fine-tune a conversational model on instruction data. |
| Outcome: | The proposed model outperforms open-source models in key metrics including scale, average length, diversity, coherence, etc. |
Migician: Revealing the Magic of Free-Form Multi-Image Grounding in Multimodal Large Language Models (2025.findings-acl)
Copied to clipboard
You Li, Heyu Huang, Chi Chen, Kaiyu Huang, Chao Huang, Zonghao Guo, Zhiyuan Liu, Jinan Xu, Yuhua Li, Ruixuan Li, Maosong Sun
| Challenge: | Existing MLLMs still struggle to achieve precise grounding in multi-image scenarios. |
| Approach: | They propose a Chain-of-Thought framework that integrates single-image grounding with multi-image comprehension to address this challenge. |
| Outcome: | The proposed model outperforms existing models in multi-image grounding tasks by 24.94% and surpasses larger 70B models. |
Language Modeling with Sparse Product of Sememe Experts (D18-1)
Copied to clipboard
| Challenge: | Existing language modeling methods rely on large-scale text data to learn the sequential patterns of words. |
| Approach: | They propose to use sememes to represent the implicit semantics behind words for language modeling . they propose to employ sememe-driven language models to fine-grained semem-level semantics . |
| Outcome: | Experiments on language modeling and the downstream application of headline generation show the effectiveness of SDLM. |
Try to Substitute: An Unsupervised Chinese Word Sense Disambiguation Method Based on HowNet (2020.coling-main)
Copied to clipboard
| Challenge: | Existing unsupervised methods for word sense disambiguation cannot work for HowNet-based WSD because of its uniqueness. |
| Approach: | They propose a method which exploits the masked language model task of pre-trained language models to conduct word sense disambiguation using a lexical knowledge base as the sense inventory. |
| Outcome: | The proposed method achieves significantly better performance than baseline methods. |
Continual Relation Learning via Episodic Memory Activation and Reconsolidation (2020.acl-main)
Copied to clipboard
| Challenge: | Existing methods to learn incessantly emerging novel relations are overfitting the few memorized examples of old relations, causing confusion among existing relations. |
| Approach: | They introduce episodic memory activation and reconsolidation (EMAR) to continual relation learning. |
| Outcome: | The proposed method outperforms state-of-the-art models in catastrophic forgetting old relations. |
Multi-Modal Multi-Granularity Tokenizer for Chu Bamboo Slips (2025.coling-main)
Copied to clipboard
| Challenge: | Using a multi-modal multi-granularity tokenizer, we analyze ancient Chinese scripts . a large proportion of the characters in ancient Chinese are rare or undeciphered . |
| Approach: | They propose a multi-modal multi-granularity tokenizer specifically designed for ancient Chinese scripts. |
| Outcome: | The proposed tokenizer improves on the part-of-speech tagging task on the Chu bamboo slip script. |
OpenKE: An Open Toolkit for Knowledge Embedding (D18-2)
Copied to clipboard
| Challenge: | Existing knowledge embedding tools are available for embeddable knowledge graphs. |
| Approach: | They propose a unified framework and various fundamental models to embed knowledge graphs into a continuous low-dimensional space. |
| Outcome: | The toolkit and pre-trained embeddings are available on http://openke.thunlp.org/. |
Put It Back: Entity Typing with Language Model Enhancement (D18-1)
Copied to clipboard
| Challenge: | Existing Entity typing models suffer from noisy labels due to distant supervision . |
| Approach: | They propose to enhance existing entity typing models with language model enhancement to measure compatibility between context sentences and labels. |
| Outcome: | The proposed model significantly outperforms the state-of-the-art model on benchmark datasets and is available on github. |
Large Language Models Are Still Misled by Simple Bias Ensembles (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing benchmarks for large language models are constrained to datasets where each sample is manually injected with only one type of bias. |
| Approach: | They propose a multi-bias benchmark where each sample contains multiple types of biases. |
| Outcome: | The proposed benchmark shows that existing LLMs and debiasing methods perform poorly on this benchmark, highlighting the challenge of eliminating compounded biases. |
StateX: Enhancing RNN Recall via Post-training State Expansion (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing studies show that RNNs with large recurrent states are expensive to train . however, the ability to recall contextual information from long contexts is underperforms them in certain aspects. |
| Approach: | They propose a framework that expands the states of pre-trained RNNs by scaling them up to 1.3B . they use a recurrent architecture that compresses contextual information into a fixedsize state . |
| Outcome: | Experiments on models with up to 1.3B parameters show that StateX expands state sizes without incurring high post-training costs or compromising other capabilities. |
Building an Ellipsis-aware Chinese Dependency Treebank for Web Text (L18-1)
Copied to clipboard
| Challenge: | ellipsis is a common linguistic phenomenon that some words are left out as they are understood from the context, especially in oral utterance. |
| Approach: | They propose to use a Chinese dependency treebank to facilitate the parsing of web text . they propose to restore omissions and reserve contexts in the web text to improve dependency parsers . |
| Outcome: | The proposed framework enables the parsing of web text from online microblogs. |
Different Tunes Played with Equal Skill: Exploring a Unified Optimization Subspace for Parameter-Efficient Tuning (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Existing delta tuning algorithms freeze most of the parameters and only optimize minimal adaptive parameters. |
| Approach: | They propose to decompose DETs into a unified optimization subspace and conduct optimization within the subspace. |
| Outcome: | The proposed DETs achieve comparable performance to the original DET and can be transferred to another DET with non-trivial performance. |
ELLE: Efficient Lifelong Pre-training for Emerging Data (2022.findings-acl)
Copied to clipboard
| Challenge: | Existing pre-trained language models are typically trained with static data, ignoring that streaming data of various sources may continuously grow. |
| Approach: | They propose to use function preserved model expansion to expand existing PLM's width and depth to improve efficiency of knowledge acquisition. |
| Outcome: | The proposed model improves pre-training efficiency and performance over existing models on BERT and GPT. |
Better Robustness by More Coverage: Adversarial and Mixup Data Augmentation for Robust Finetuning (2021.findings-acl)
Copied to clipboard
| Challenge: | Pretrained language models perform poorly under adversarial attacks due to the large search space. |
| Approach: | They propose a method to cover a much larger proportion of the attack search space by adding textual adversarial examples during training. |
| Outcome: | The proposed method covers a much larger proportion of the attack search space. |
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. |
Learning from Context or Names? An Empirical Study on Neural Relation Extraction (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing datasets may leak shallow heuristics via entity mentions, thus contributing to the high performance on RE benchmarks. |
| Approach: | They propose an entity-masked contrastive framework for relation extraction to gain a deeper understanding on textual context and type information while avoiding rote memorization of entities. |
| Outcome: | The proposed framework improves the effectiveness and robustness of neural models in different RE scenarios. |
Few-Shot Charge Prediction with Discriminative Legal Attributes (C18-1)
Copied to clipboard
| Challenge: | Existing works on charge prediction perform well on high-frequency charges but are not capable of predicting few-shot charges with limited cases. |
| Approach: | They propose an attribute-attentive charge prediction model to infer attributes and charges simultaneously . they propose to use discriminative attributes as the internal mapping between fact descriptions and charges . |
| Outcome: | The proposed model outperforms baseline models on real-world datasets by more than 50% . the proposed model can predict the attributes and charges simultaneously . |
Plug-and-Play Document Modules for Pre-trained Models (2023.acl-long)
Copied to clipboard
Chaojun Xiao, Zhengyan Zhang, Xu Han, Chi-Min Chan, Yankai Lin, Zhiyuan Liu, Xiangyang Li, Zhonghua Li, Zhao Cao, Maosong Sun
| Challenge: | Large-scale pre-trained models have been widely adopted for document-oriented NLP tasks, such as question answering. |
| Approach: | They propose to decouple document encoding from downstream tasks by introducing a document plugin into the backbone of a PTM. |
| Outcome: | The proposed model can encode documents once and for all across different scenarios. |
ERNIE: Enhanced Language Representation with Informative Entities (P19-1)
Copied to clipboard
| Challenge: | Existing pre-trained language models rarely consider incorporating knowledge graphs (KGs) Existing models capture rich semantic patterns from plain text and can be fine-tuned to improve performance of NLP tasks. |
| Approach: | They propose to incorporate knowledge graphs into pre-trained language models to enhance language representation with external knowledge. |
| Outcome: | The proposed model can take full advantage of lexical, syntactic, and knowledge information simultaneously. |
How Does NLP Benefit Legal System: A Summary of Legal Artificial Intelligence (2020.acl-main)
Copied to clipboard
| Challenge: | Legal Artificial Intelligence (LegalAI) focuses on applying artificial intelligence to help legal tasks. |
| Approach: | They introduce the history, current state, and future directions of research in LegalAI . they illustrate the tasks from the perspectives of legal professionals and NLP researchers . |
| Outcome: | The proposed system can reduce heavy and redundant work for legal professionals . it can also provide a reliable reference to those who are not familiar with the legal domain . |
Aggregation of Reasoning: A Hierarchical Framework for Enhancing Answer Selection in Large Language Models (2024.lrec-main)
Copied to clipboard
Zhangyue Yin, Qiushi Sun, Qipeng Guo, Zhiyuan Zeng, Xiaonan Li, Tianxiang Sun, Cheng Chang, Qinyuan Cheng, Ding Wang, Xiaofeng Mou, Xipeng Qiu, Xuanjing Huang
| Challenge: | Recent advances in Chain-of-Thought prompting have facilitated significant breakthroughs for Large Language Models (LLMs) in complex reasoning tasks. |
| Approach: | They propose a hierarchical reasoning aggregation framework to address this problem . they propose dynamic sampling to adjust the number of reasoning chains . |
| Outcome: | The proposed framework outperforms existing ensemble methods on complex reasoning tasks. |
Modeling Semantic Compositionality with Sememe Knowledge (P19-1)
Copied to clipboard
| Challenge: | Semantic compositionality (SC) is defined as the phenomenon that the meaning of a complex linguistic unit can be composed of the meanings of its constituents. |
| Approach: | They propose to incorporate sememes into SC models and employ them in learning multiword expressions. |
| Outcome: | The proposed models achieve significant performance boost compared to baseline methods without sememe knowledge. |
OPEx: A Component-Wise Analysis of LLM-Centric Agents in Embodied Instruction Following (2024.acl-long)
Copied to clipboard
| Challenge: | Embodied Instruction Following (EIF) is a crucial task in embodied learning . however, there is n'a unified understanding regarding the impact of various components on task performance . |
| Approach: | They propose a framework that delineates the core components essential for embodied learning tasks . they integrate a multi-agent design into the Planner component of their LLM-centric architecture . |
| Outcome: | OPEx delineates the core components essential for solving embodied learning tasks . integrating a multi-agent design into the Planner component of the LLM-centric architecture further elevates performance. |
IsOBS: An Information System for Oracle Bone Script (2020.emnlp-demos)
Copied to clipboard
| Challenge: | Oracle bone script (OBS) documents are the oldest continuously-used writing system in the world and are important for linguistic and historical research. |
| Approach: | They construct an information system for OBS to symbolize, serialize, and store OBS data at the character-level using efficient databases and retrieval modules. |
| Outcome: | The proposed system symbolizes, serializes, and stores OBS data at the character-level, based on efficient databases and retrieval modules. |
Enhancing Open-Domain Task-Solving Capability of LLMs via Autonomous Tool Integration from GitHub (2025.acl-long)
Copied to clipboard
Bohan Lyu, Xin Cong, Heyang Yu, Pan Yang, Cheng Qian, Zihe Wang, Yujia Qin, Yining Ye, Yaxi Lu, Chen Qian, Zhong Zhang, Yukun Yan, Yankai Lin, Zhiyuan Liu, Maosong Sun
| Challenge: | Existing approaches lack flexibility to address diverse and ever-evolving user queries in open domains. |
| Approach: | They propose to evaluate LLMs on open-domain knowledge that requires tools to solve diverse and ever-evolving user queries. |
| Outcome: | The proposed system outperforms baselines in the open domain task-solving benchmark. |
ProSparse: Introducing and Enhancing Intrinsic Activation Sparsity within Large Language Models (2025.coling-main)
Copied to clipboard
Chenyang Song, Xu Han, Zhengyan Zhang, Shengding Hu, Xiyu Shi, Kuai Li, Chen Chen, Zhiyuan Liu, Guangli Li, Tao Yang, Maosong Sun
| Challenge: | Activation sparsity is a promising paradigm for accelerating model inference . few large language models achieve high activation spar and comparable performance . |
| Approach: | They propose a method to achieve activation sparsity and acceleration in large language models . they introduce ReLU activation and adopt progressive sparse regularization . |
| Outcome: | The proposed method achieves high activation sparsity and comparable model performance. |
DocRED: A Large-Scale Document-Level Relation Extraction Dataset (P19-1)
Copied to clipboard
Yuan Yao, Deming Ye, Peng Li, Xu Han, Yankai Lin, Zhenghao Liu, Zhiyuan Liu, Lixin Huang, Jie Zhou, Maosong Sun
| Challenge: | Existing relation extraction methods focus on extracting intra-sentence relations for single entities. |
| Approach: | They propose a relation extraction dataset from Wikipedia and Wikidata with three features . document-level relation extraction is a task to identify relational facts between entities . |
| Outcome: | The proposed dataset is the largest human-annotated dataset for document-level RE from plain text. |
Rethinking Skip Connection with Layer Normalization (2020.coling-main)
Copied to clipboard
| Challenge: | Existing methods to solve the optimization problem of deep neural networks are not linear, but can be used as a modulating mechanism between the input and output. |
| Approach: | They propose to use skip connection to adjust the scale of the input and output to improve the performance. |
| Outcome: | The proposed approach improves performance and convergence of deep neural networks and can be applied to machine translation and image classification datasets. |
LEGENT: Open Platform for Embodied Agents (2024.acl-demos)
Copied to clipboard
Zhili Cheng, Zhitong Wang, Jinyi Hu, Shengding Hu, An Liu, Yuge Tu, Pengkai Li, Lei Shi, Zhiyuan Liu, Maosong Sun
| Challenge: | Existing integrations of large language models and large multimodal models are limited . Existing platforms for developing embodied agents are limited and limited based on open-source software. |
| Approach: | They propose an open platform for developing embodied agents using LLMs and LMMs. |
| Outcome: | The proposed platform surpasses GPT-4V in embodied tasks with its model training on LEGENT data. |