Papers by Wenqiang Li
Meta-Reflection: A Feedback-Free Reflection Learning Framework (2025.acl-long)
Copied to clipboard
Yaoke Wang, Yun Zhu, XintongBao XintongBao, Wenqiao Zhang, Suyang Dai, Kehan Chen, Wenqiang Li, Gang Huang, Siliang Tang, Yueting Zhuang
| Challenge: | Existing approaches to improve large language models' ability to understand and reason are limited by external feedback. |
| Approach: | They propose a feedback-free reflection mechanism that requires only a single inference pass without external feedback. |
| Outcome: | The proposed method is based on an industrial e-commerce benchmark and public datasets. |
TEaR: Improving LLM-based Machine Translation with Systematic Self-Refinement (2025.findings-naacl)
Copied to clipboard
Zhaopeng Feng, Yan Zhang, Hao Li, Bei Wu, Jiayu Liao, Wenqiang Liu, Jun Lang, Yang Feng, Jian Wu, Zuozhu Liu
| Challenge: | Large Language Models (LLMs) have achieved impressive results in Machine Translation (MT). human evaluations reveal that LLM-generated translations still contain various errors. |
| Approach: | They propose a LLM-based self-refinement framework that feeds error information back into LLMs to facilitate self-finement, leading to enhanced translation quality. |
| Outcome: | The proposed framework outperforms internal refinement and feedback methods while ensuring a robust translation quality baseline. |
Unifying Discrete and Continuous Representations for Unsupervised Paraphrase Generation (2023.emnlp-main)
Copied to clipboard
Mingfeng Xue, Dayiheng Liu, Wenqiang Lei, Jie Fu, Jian Lan, Mei Li, Baosong Yang, Jun Xie, Yidan Zhang, Dezhong Peng, Jiancheng Lv
| 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. |
Test-Time Code-Switching for Cross-lingual Aspect Sentiment Triplet Extraction (2025.naacl-long)
Copied to clipboard
| Challenge: | Aspect Sentiment Triplet Extraction (ASTE) is a thriving research area . current code-switching methods suffer from term boundary detection issues and out-of-dictionary problems. |
| Approach: | They propose a test-time code-switching framework which bridges the gap between bilingual training and monolingual test- time prediction. |
| Outcome: | The proposed framework achieves an average improvement of 3.7% on four cross-lingual datasets. |
PRAM: An End-to-end Prototype-based Representation Alignment Model for Zero-resource Cross-lingual Named Entity Recognition (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing methods to address the named entity recognition problem are limited and lack explicit optimization specific to the task. |
| Approach: | They propose a prototype-based representation alignment model for a cross-lingual named entity recognition task using labeled source language data. |
| Outcome: | The proposed model outperforms existing state-of-the-art methods in some challenging scenarios. |
NL ⇒ Schedule: Evaluate Multitask Scheduling Capability of Large Language Models (2026.acl-long)
Copied to clipboard
| Challenge: | Existing methods for scheduling from natural language descriptions rely on experts with limited scheduling skills and domain knowledge. |
| Approach: | They propose a model to generate a feasible schedule from natural language descriptions. |
| Outcome: | The proposed framework achieves more robust performance than six state-of-the-art LLM+solver methods. |
Adversarial Preference Learning for Robust LLM Alignment (2025.findings-acl)
Copied to clipboard
Yuanfu Wang, Pengyu Wang, Chenyang Xi, Bo Tang, Junyi Zhu, Wenqiang Wei, Chen Chen, Chao Yang, Jingfeng Zhang, Chaochao Lu, Yijun Niu, Keming Mao, Zhiyu Li, Feiyu Xiong, Jie Hu, Mingchuan Yang
| Challenge: | Modern language models rely on Reinforcement Learning from Human Feedback (RLHF) to encourage safe behaviors, but they remain vulnerable to adversarial attacks due to three key limitations: (1) the inefficiency and high cost of human annotation; (2) the vast diversity of potential adversarials; and (3) the risk of feedback bias and reward hacking. |
| Approach: | They propose an iterative adversarial training method that incorporates three key innovations to address these challenges. |
| Outcome: | Experiments on Mistral-7B-Instruct-v0.3 show that the proposed method significantly enhances robustness and reduces harmful outputs from 5.88% to 0.43%. |
Molweni: A Challenge Multiparty Dialogues-based Machine Reading Comprehension Dataset with Discourse Structure (2020.coling-main)
Copied to clipboard
| Challenge: | Multiparty dialog applications such as discourse parsing and meeting summarization are now mainstream research. |
| Approach: | They propose to annotate a machine reading comprehension dataset with discourse structure built over multiparty dialog using a modified Segmented Discourse Representation Theory (SDRT) style. |
| Outcome: | The proposed dataset contributes large-scale discourse dependency annotations in a modified Segmented Discourse Representation Theory (SDRT) style for all of its multiparty dialogs, and achieves only 67.7% F1 on Molweni’s questions, a 20+% significant drop as compared against its SQuAD 2.0 performance. |
METER: Evaluating Multi-Level Contextual Causal Reasoning in Large Language Models (2026.acl-long)
Copied to clipboard
| Challenge: | Existing benchmarks evaluate contextual causal reasoning in fragmented settings, failing to ensure context consistency or cover the full causal hierarchy. |
| Approach: | They use a unified context to benchmark large language models' contextual causal reasoning skills. |
| Outcome: | The proposed benchmarks show that LLMs are susceptible to distraction by irrelevant but factually correct information at lower level of causality. |
GraphOTTER: Evolving LLM-based Graph Reasoning for Complex Table Question Answering (2025.coling-main)
Copied to clipboard
| Challenge: | Existing methods for complex table question answering are often implicit, feeding the entire table into prompts. |
| Approach: | They propose a GraphOTTER that explicitly establishes the reasoning process to pinpoint the correct answers. |
| Outcome: | The proposed method is able to identify the correct answers on two benchmark datasets and two LLM backbones. |