Papers by Peng Fu

35 papers
Generation-Augmented Retrieval: Rethinking the Role of Large Language Models in Zero-Shot Relation Extraction (2025.findings-emnlp)

Copied to clipboard

Challenge: Recent advances in Relation Extraction (RE) emphasize Zero-Shot methodologies, aiming to recognize unseen relations between entities with no annotated data.
Approach: They propose a plug-in retrieval adjuster that allows rapid fine-tuning without accessing LLMs’ parameters.
Outcome: The proposed model demonstrates comparable performance on multiple benchmarks.
LIFTED: Multimodal Clinical Trial Outcome Prediction via Large Language Models and Mixture-of-Experts (2025.findings-emnlp)

Copied to clipboard

Challenge: Clinical trials are costly and pivotal processes that require substantial expenses . a new approach to integrate multimodal data for clinical outcome prediction is needed .
Approach: a proposed framework transforms modality-specific data into natural language descriptions . a sparse Mixture-of-Experts mechanism then identifies shared patterns across modalities .
Outcome: a proposed framework outperforms baseline methods in predicting clinical trial outcomes . it transforms modality-specific data into natural language descriptions, encoded via unified encoders .
A Lexicon-Based Graph Neural Network for Chinese NER (D19-1)

Copied to clipboard

Challenge: Chinese named entity recognition models are vulnerable to word ambiguities due to the lack of global semantics and chain structure.
Approach: They propose a lexicon-based graph neural network with global semantics to solve word ambiguities in Chinese named entity recognition (NER) Lexicons are used to construct the graph and provide word-level features.
Outcome: The proposed model improves on four NER datasets on Chinese characters, potential words, and the whole-sentence semantics.
Enhancing Hyperbole and Metaphor Detection with Their Bidirectional Dynamic Interaction and Emotion Knowledge (2025.acl-long)

Copied to clipboard

Challenge: Existing methods for hyperbole and metaphor detection focus on superficial text features, ignoring the associations of hyperbola and metaphor . Existing frameworks focus on identifying superficial text, focusing on superficial features .
Approach: They propose an emotion-guided hyperbole and metaphor detection framework based on bidirectional dynamic interaction.
Outcome: The proposed framework outperforms baseline methods on four datasets.
DLTKG: Denoising Logic-based Temporal Knowledge Graph Reasoning (2025.findings-emnlp)

Copied to clipboard

Challenge: Current approaches to temporal knowledge representation face limited generalization to unseen facts and insufficient interpretability of reasoning processes.
Approach: They propose a framework that uses a denoising diffusion process to complete reasoning tasks . they propose introducing a noise source and historical conditionguiding mechanism to improve interpretability .
Outcome: The proposed framework outperforms state-of-the-art methods on three benchmark datasets.
Light-PEFT: Lightening Parameter-Efficient Fine-Tuning via Early Pruning (2024.findings-acl)

Copied to clipboard

Challenge: Existing methods for fine-tuning large language models are inefficient and redundant . a light-PEFT framework can be used to prune redundant parameters during training .
Approach: They propose a parameter-efficient fine-tuning framework that freezes most parameters of the foundation model and finetuns only a small number of parameters.
Outcome: The proposed framework achieves training and inference speedup, reduces memory usage, and maintains comparable performance and plug-and-play feature of PEFT.
Not All Modalities at Once: Dynamic Dropout and Bidirectional Fusion for Robust Multi-modal Knowledge Graph Completion (2026.findings-acl)

Copied to clipboard

Challenge: Existing MKGC methods train with all modalities available, implicitly assuming consistent complementarity . however, this often induces modality dependence and modality competition under heterogeneous noise, which can hinder robust multi-modal fusion and limit overall performance.
Approach: They propose a framework to infer missing links in multimodal knowledge graphs by leveraging structured triples together with auxiliary modalities such as text and images.
Outcome: The proposed framework outperforms baselines and achieves new state-of-the-art results.
FCGEC: Fine-Grained Corpus for Chinese Grammatical Error Correction (2022.findings-emnlp)

Copied to clipboard

Challenge: grammatical error correction (GEC) is a complex task that requires high-quality data from native speakers.
Approach: They propose a human-annotated corpus to detect, identify and correct grammatical errors in Chinese examinations.
Outcome: The proposed model outperforms other models in low-resource settings, but there is a significant gap between the models and humans that encourages future models to bridge it.
GeoDRL: A Self-Learning Framework for Geometry Problem Solving using Reinforcement Learning in Deductive Reasoning (2023.findings-acl)

Copied to clipboard

Challenge: Existing methods for automated geometry problem solving lack labeled data.
Approach: They propose a framework that integrates logic graph deduction and deep reinforcement learning to optimize geometry reasoning as a Markov Decision Process.
Outcome: The proposed framework improves accuracy and interpretability in the Geometry3K dataset while maintaining correctness.
Unifying Discrete and Continuous Representations for Unsupervised Paraphrase Generation (2023.emnlp-main)

Copied to clipboard

Challenge: Existing unsupervised paraphrase generation methods require large-scale, manually annotated paraphrase datasets, which are labor-intensive to build.
Approach: They propose a self-supervised pseudo-data construction method that generates diverse pseudo-paraphrases in distinct surface structures for a given sentence.
Outcome: The proposed method generates diverse pseudo-paraphrases in distinct surface structures for a given sentence.
Past, Present, and Future: Conversational Emotion Recognition through Structural Modeling of Psychological Knowledge (2021.findings-emnlp)

Copied to clipboard

Challenge: Conversational Emotion Recognition (CER) is a task to predict the emotion of an utterance in the context of a conversation.
Approach: They propose a pSychological-Knowledge-Aware Interaction Graph to model the emotional state of an utterance in the context of a conversation.
Outcome: The proposed method achieves state-of-the-art and competitive performance on four popular CER datasets.
MulDimIF: A Multi-Dimensional Constraint Framework for Evaluating and Improving Instruction Following in Large Language Models (2026.findings-acl)

Copied to clipboard

Challenge: Existing research has focused on constraint categories, offering little guidance for improving instruction following abilities.
Approach: They propose a multi-dimensional constraint framework that allows for instruction following . they construct 9,106 code-verifiable samples and evaluate 18 LLMs .
Outcome: The proposed framework improves instruction following performance without compromising general performance.
Towards Robust Visual Question Answering: Making the Most of Biased Samples via Contrastive Learning (2022.findings-emnlp)

Copied to clipboard

Challenge: Recent studies have shown that biased samples can be brittle for VQA models . however, the improvements on OOD data severely sacrifice the performance on the in-distribution (ID) data.
Approach: They propose a contrastive learning approach that exploits biased samples for unbiased information that contributes to reasoning.
Outcome: The proposed method achieves competitive performance on the OOD dataset while maintaining robustness on the ID dataset.
Revisiting the Knowledge Injection Frameworks (2023.emnlp-main)

Copied to clipboard

Challenge: Injecting unaligned knowledge tuple into large language models achieves comparable (and sometimes better) results than aligned knowledge.
Approach: They propose a technique to inject random knowledge into large language models to improve performance.
Outcome: The proposed technique overcomes the sanity problem and pushes the performance limit.
Distantly Supervised Named Entity Recognition using Positive-Unlabeled Learning (P19-1)

Copied to clipboard

Challenge: Empirical studies on four public NER datasets demonstrate the effectiveness of our proposed method.
Approach: They propose a method to perform named entity recognition using unlabeled data and named entity dictionaries.
Outcome: The proposed method can estimate task loss as if there is fully labeled data.
EffiQA: Efficient Question-Answering with Strategic Multi-Model Collaboration on Knowledge Graphs (2025.coling-main)

Copied to clipboard

Challenge: Existing approaches that integrate LLMs and KGs either underutilize the reasoning abilities of LLM or suffer from prohibitive computational costs due to tight coupling.
Approach: They propose a framework that can strike a balance between performance and efficiency via an iterative paradigm.
Outcome: The proposed framework can strike a balance between performance and efficiency via an iterative paradigm.
TrigReason: Trigger-Based Collaboration between Small and Large Reasoning Models (2026.findings-acl)

Copied to clipboard

Challenge: Large Reasoning Models suffer from high inference latency due to autoregressive reasoning . SpecReason adopts a polling-based design that repeatedly invokes the LRM for verification at every step .
Approach: They propose a trigger-based collaborative reasoning framework that delegates most reasoning to the SRM and activates LRM intervention only when necessary.
Outcome: The proposed framework reduces latency and API cost by 73.3% under edge–cloud conditions.
Learning to Win Lottery Tickets in BERT Transfer via Task-agnostic Mask Training (2022.naacl-main)

Copied to clipboard

Challenge: Recent studies show pre-trained language models contain matching subnetworks that have similar transfer learning performance as the original PLM.
Approach: They propose to prune matching subnetworks using magnitude-based pruning . they propose to optimize the subnetwork structure towards the pre-training objectives .
Outcome: The proposed method is more efficient in searching subnetworks and advantageous when fine-tuning within a range of data scarcity.
DIVE into MoE: Diversity-Enhanced Reconstruction of Large Language Models from Dense into Mixture-of-Experts (2025.acl-long)

Copied to clipboard

Challenge: Existing methods for reconstruction of large language models overlook diversity among experts, leading to potential redundancy.
Approach: They propose a pruning-based expert reconstruction method that prunes a specific LLM and retrains it on routers, experts and normalization modules.
Outcome: The proposed method outperforms pruning and MoE reconstruction methods on Llama-style models with open-source training corpora.
Question-Interlocutor Scope Realized Graph Modeling over Key Utterances for Dialogue Reading Comprehension (2023.findings-acl)

Copied to clipboard

Challenge: Compared to standard RC tasks, dialogue reading comprehension (DRC) has raised challenges because of the complex speaker information and noisy dialogue context.
Approach: They propose a new method for dialogue reading comprehension that extracts answers from dialogues by using key-utterances-extracting methods and a Question-Interlocutor Scope Realized Graph.
Outcome: The proposed method achieves state-of-the-art performance against previous works.
RoleLLM: Benchmarking, Eliciting, and Enhancing Role-Playing Abilities of Large Language Models (2024.findings-acl)

Copied to clipboard

Challenge: Large Language Models (LLMs) have paved the way for complex tasks such as role-playing.
Approach: They propose a framework to benchmark, elicit, and enhance role-playing abilities in Large Language Models.
Outcome: The proposed framework improves role-playing abilities with 168,093 samples.
Check It Again:Progressive Visual Question Answering via Visual Entailment (2021.acl-long)

Copied to clipboard

Challenge: Existing approaches to Visual Question Answering (VQA) only address superficial correlations between image and answer.
Approach: They propose a select-and-rerank progressive framework based on Visual Entailment to address this problem.
Outcome: The proposed framework improves on the Visual Question Answering (VQA) task with 7.55% accuracy.
Target Really Matters: Target-aware Contrastive Learning and Consistency Regularization for Few-shot Stance Detection (2022.coling-1)

Copied to clipboard

Challenge: stance detection is a task to identify attitudes from opinions towards certain targets, but it is expensive and time-consuming . stance detector is based on labeled data, but unlabeled data can be collected easier .
Approach: They propose a semi-supervised framework for few-shot stance detection that uses unlabeled data to learn more distinguishable representations for different targets.
Outcome: The proposed framework achieves state-of-the-art performance on multiple benchmark datasets.
Modeling Intra and Inter-modality Incongruity for Multi-Modal Sarcasm Detection (2020.findings-emnlp)

Copied to clipboard

Challenge: Existing methods for sarcasm detection ignore the incongruity character in sarcasm, which is often manifested between modalities or within modalités.
Approach: They propose to capture inter-modality incongruity in a text-based model by using a self-attention mechanism and a co-attention model to model the contradiction within the text.
Outcome: The proposed model achieves state-of-the-art on a public multi-modal sarcasm detection dataset.
A Gradient Control Method for Backdoor Attacks on Parameter-Efficient Tuning (2023.acl-long)

Copied to clipboard

Challenge: Parameter-Efficient Tuning (PET) fine-tunes pre-trained language models for downstream tasks, but a large reduction in the number of attackable parameters will greatly affect the effectiveness of backdoor attacks, resulting in backdoor forgetting.
Approach: They propose a gradient control method to consolidate the attack effect by freezing most parameters of the pre-trained model and fine-tuning only a small number of parameters.
Outcome: The proposed method improves sentiment classification and spam detection, and can be applied to different tasks.
Adapt Once, Thrive with Updates: Transferable Parameter-Efficient Fine-Tuning on Evolving Base Models (2025.acl-long)

Copied to clipboard

Challenge: Parameter-efficient fine-tuning (PEFT) is a common method for fine- tuning large language models . however, once updated, PEFT modules suffer performance degradation on newer versions .
Approach: They propose a method that enhances the PEFT module by focusing on the task-specific pattern while reducing its dependence on certain knowledge in the base model.
Outcome: Experiments show that PEFT modules can maintain performance on updated models without re-tuning . the proposed approach can be used in real-world applications with large model sizes .
BeamLoRA: Beam-Constraint Low-Rank Adaptation (2025.acl-long)

Copied to clipboard

Challenge: Low-Rank Adaptation (LoRA) is one of the most efficient parameter-efficient fine-tuning methods.
Approach: They propose to conceptualize each LoRA module as a beam where each rank corresponds to a potential sub-solution.
Outcome: The proposed method improves performance on three base models and 12 datasets.
Critic Rule Induction: Improving Temporal Knowledge Graph Forecasting with Generator-Critic Language Models (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods for predicting future facts from time-evolving graphs rely on statistical co-occurrences and extensive path enumeration.
Approach: They propose a Critic-Guided Rule Induction method which treats temporal rules as rule hypotheses to be examined and adopts a decoupled Generation-Discrimination pipeline to induce rules that are high-coverage and high-precision.
Outcome: The proposed method outperforms strong baselines on three benchmarks and achieves state-of-the-art performance.
Frame First, Then Extract: A Frame-Semantic Reasoning Pipeline for Zero-Shot Relation Triplet Extraction (2025.emnlp-main)

Copied to clipboard

Challenge: Existing methods to extract triplets for unseen relations rely on costly fine-tuning and lack structured semantic guidance.
Approach: They propose a framework that adopts a "frame first, then extract" paradigm to extract triplets from unstructured text.
Outcome: The proposed framework achieves competitive zero-shot performance on multiple benchmarks and can be used to enhance existing extraction methods.
Language Prior Is Not the Only Shortcut: A Benchmark for Shortcut Learning in VQA (2022.findings-emnlp)

Copied to clipboard

Challenge: Visual Question Answering (VQA) models are prone to learn the shortcut solution formed by dataset biases rather than the intended solution.
Approach: They propose a dataset that considers varying types of shortcuts by constructing different distribution shifts in multiple OOD test sets.
Outcome: The proposed dataset considers varying types of shortcuts by constructing different distribution shifts in multiple OOD test sets.
TextFlint: Unified Multilingual Robustness Evaluation Toolkit for Natural Language Processing (2021.acl-demo)

Copied to clipboard

Challenge: Existing approaches to textual robustness evaluation focus on slightly modifying the input data, which maintains the original meaning and results in a different prediction.
Approach: They propose a multilingual robustness evaluation toolkit for NLP that integrates universal text transformations, task-specific transformations and adversarial attack.
Outcome: The toolkit includes universal text transformation, task-specific transformation, adversarial attack, subpopulation, and their combinations to provide comprehensive robustness analyses.
Compressing and Debiasing Vision-Language Pre-Trained Models for Visual Question Answering (2023.emnlp-main)

Copied to clipboard

Challenge: Existing studies on VQA models have found that they suffer from dataset biases and inefficient memory footprints.
Approach: They investigate whether a VLP can be compressed and debiased simultaneously by searching sparse and robust subnetworks.
Outcome: The proposed compression and debiasing pipelines outperform the debiased full VLPs on VQA tasks.
Re-Cent: A Relation-Centric Framework for Joint Zero-Shot Relation Triplet Extraction (2025.coling-main)

Copied to clipboard

Challenge: Existing methods to extract triplets from context often decompose into named entity recognition and relation classification, which may introduce error propagation.
Approach: They propose a Relation-centric joint ZSRTE method which leverages unseen relation labels to extract triplets in one go.
Outcome: The proposed method achieves state-of-the-art performance with fewer parameters and does not rely on synthetic data or manual labor.
CBP-Tuning: Efficient Local Customization for Black-box Large Language Models (2025.emnlp-main)

Copied to clipboard

Challenge: Customized black-box prompt tuning is a new approach to customize large language models . however, as models grow, the resources required for training and deployment become increasingly expensive .
Approach: They propose a framework that facilitates efficient local customization while preserving bidirectional privacy.
Outcome: The proposed framework facilitates efficient local customization while preserving bidirectional privacy.

What is GenGO?

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

Information

About
Limitations