Papers by Weiping Li

20 papers
Improving Knowledge Graph Completion with Generative Hard Negative Mining (2023.findings-acl)

Copied to clipboard

Challenge: Existing methods for knowledge graph completion (KGC) use generative methods with a self-information-enhanced training strategy to generate high-quality negatives.
Approach: They propose to leverage a sequence-to-sequence architecture to generate high-quality hard negatives from the same decoding distributions as the anchor.
Outcome: The proposed method produces high-quality negatives with good hardness and diversity on three KGC benchmarks.
SGG-R 3: From Next-Token Prediction to End-to-End Unbiased Scene Graph Generation (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods for scene graph generation lack task-specific structured reasoning and sparse, long-tailed relation distributions.
Approach: They propose a structured reasoning framework that integrates task-specific Chain-of-Thought and reinforcement learning with group sequence policy optimization to achieve unbiased scene graph generation.
Outcome: The proposed framework achieves superior performance on two benchmarks.
Enhancing Neural Models with Vulnerability via Adversarial Attack (2020.coling-main)

Copied to clipboard

Challenge: Existing work on adversarial attack to improve performance of NLSM tasks has not been done.
Approach: They propose a general two-stage training framework to enhance neural models with Vulnerability via adversarial attack.
Outcome: The proposed framework improves neural models with Vulnerability via adversarial attack on NLSM datasets.
From Pseudo-Balancing to True Specialization: Memory-Aware Routing for Mixture-of-Experts (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods to optimize expert-centered load balancing fail to account for pseudo-balance phenomenon . severe knowledge overlap among experts leads to redundant representations and inefficient parameter utilization .
Approach: They propose a method that prioritizes expert utilization over semantic alignment . they use memory-aware routing to ensure expert load balancing is consistent .
Outcome: Experimental results show that MAR improves expert specialization by 35% and accuracy by 2%-25% . MAR matches baseline performance with only half the experts .
MuSe: Multi-Stage Graph Reasoning via Vision-Language Models (2026.acl-long)

Copied to clipboard

Challenge: Graph Neural Networks (GNNs) and graph transformers are inadequate for tasks with limited generalization.
Approach: They propose a multi-stage graph reasoning framework based on vision-language models that incrementally samples and visualizes task-relevant subgraphs.
Outcome: The proposed framework outperforms existing benchmarks in Graph-related tasks.
Towards Order Fairness: Mitigating LLMs Order Sensitivity through Dual Group Advantage Optimization (2026.acl-long)

Copied to clipboard

Challenge: Recent studies attempt to obtain optimal or suboptimal arrangements based on statistical results or using dataset-based search, but these methods increase inference overhead while leaving the model’s inherent order bias unresolved.
Approach: They propose Dual Group Advantage Optimization (DGAO) which aims to improve model accuracy and order stability simultaneously.
Outcome: The proposed method improves model accuracy and order stability while penalizing order-sensitive or incorrect responses.
Parallelism and Generation Order in Masked Diffusion Language Models: Limits Today, Potential Tomorrow (2026.findings-acl)

Copied to clipboard

Challenge: Autoregressive (AR) language models dominate modern natural language processing due to strong likelihood-based training objectives and reliable left-to-right decoding.
Approach: They characterize MDLM behavior along two dimensions: parallelism strength and generation order . authors propose a Generate-then-Edit paradigm that mitigates dependency loss .
Outcome: The proposed model improves on tasks that require "backward information" the Generate-then-Edit paradigm improves parallel decoding efficiency while reducing dependency loss.
RADO: Reasoning Audit-Driven Optimization for Rigorous Reasoning in High-Stakes Domains (2026.acl-long)

Copied to clipboard

Challenge: Current reinforcement learning paradigms rely on outcome-based rewards, overlooking latent logical fallacies in intermediate steps.
Approach: They propose a specialized audit model augmented with external tools to identify local logical ruptures and calibrate reward signals.
Outcome: The proposed framework improves accuracy and logical rigor in high-stakes domains.
Empathetic Dialogue Generation via Sensitive Emotion Recognition and Sensible Knowledge Selection (2022.findings-emnlp)

Copied to clipboard

Challenge: Empathy is a key trait of everyday human conversations.
Approach: They propose a serial encoding and Emotion-Knowledge interaction method for empathetic dialogue generation which is more sensitive to emotion dynamics in conversations.
Outcome: The proposed method outperforms baseline evaluations on the utterance-level annotated EMPATHETICDIALOGUES.
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.
Sibyl: Empowering Empathetic Dialogue Generation in Large Language Models via Sensible and Visionary Commonsense Inference (2025.coling-main)

Copied to clipboard

Challenge: Recent studies have focused on integrating commonsense knowledge into chatbots to enhance their ability to understand and generate dialogue responses.
Approach: They propose a framework that integrates commonsense knowledge into chatbots to enable them to elicit more empathetic responses.
Outcome: The proposed framework enables LLMs to uncover the implicit requirements of the conversation, aiming to elicit more empathetic responses.
Domaino1s: Guiding LLM Reasoning for Explainable Answers in High-Stakes Domains (2025.findings-acl)

Copied to clipboard

Challenge: Existing Large Language Models (LLMs) generate brief answers without reasoning processes and explanations.
Approach: They propose supervised fine-tuning and tree search to enhance LLMs’ reasoning capabilities on domain tasks.
Outcome: The proposed model improves on stock investment recommendation and legal reasoning QA tasks.
Exploiting Hybrid Semantics of Relation Paths for Multi-hop Question Answering over Knowledge Graphs (2022.coling-1)

Copied to clipboard

Challenge: Existing approaches to answer natural language questions on knowledge graphs (KGQA) use large-scale entity-related text corpus or knowledge graph embeddings as auxiliary information to facilitate answer selection.
Approach: They propose to integrate explicit textual information and implicit KG structural features of relation paths into a novel rotate-and-scale entity link prediction framework.
Outcome: The proposed method is superior to existing methods on three KGQA datasets and shows that it can be used to identify answer entities.
Supportiveness-based Knowledge Rewriting for Retrieval-augmented Language Modeling (2025.findings-naacl)

Copied to clipboard

Challenge: Recent advances in large language models (LLMs) have significantly enhanced their performance in various natural language processing tasks.
Approach: They propose a robust and pluggable knowledge rewriter that is optimized for LLM generation by supporting the model's supportiveness.
Outcome: The proposed model can be used to rewrite knowledge in a supervised manner.
KiPT: Knowledge-injected Prompt Tuning for Event Detection (2022.coling-1)

Copied to clipboard

Challenge: Existing prompt-based methods may suffer from low precision because they lack event-related semantic knowledge.
Approach: They propose a Knowledge-injected Prompt Tuning model to improve prompt tuning . event detection aims to detect events from text by identifying and classifying event triggers .
Outcome: The proposed model outperforms baseline models in few-shot scenarios.
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.
TAKE: Topic-shift Aware Knowledge sElection for Dialogue Generation (2022.coling-1)

Copied to clipboard

Challenge: Recent work finds that realizing who holds the initiative can help select knowledge . however, there is a strong semantic transition between two rounds, probably leading to initiative misjudgment .
Approach: They propose a topic-shift Aware Knowledge sElector(TAKE) model which locates relevant parts from dialogue history to improve knowledge selection.
Outcome: The proposed model outperforms baseline models on the WoW.
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.
GuiLoMo: Allocating Experts and Ranks for LoRA-MoE via Bilevel Optimization with GuidedSelection Vectors (2025.findings-emnlp)

Copied to clipboard

Challenge: Low-Rank Adaptation (LoRA) methods are efficient for a large language model with reduced computational costs.
Approach: They propose a layer-wise expert numbers and ranks allocation strategy with GuidedSelection Vectors.
Outcome: The proposed method achieves superior or comparable performance to all baselines on three backbone models.
Multi-level Adaptive Contrastive Learning for Knowledge Internalization in Dialogue Generation (2023.emnlp-main)

Copied to clipboard

Challenge: Existing knowledge-grounded dialogue generation models struggle with dull and repetitive outputs, a problem commonly termed as text degeneration.
Approach: They propose a framework that allows the model to "cheat" the objective by duplicating knowledge segments in a superficial pattern matching based on overlap.
Outcome: The proposed framework can be applied to a WoW dataset and shows that it works across models and decoding strategies.

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