Papers by Wenbin Wang
Hierarchical Representation-based Dynamic Reasoning Network for Biomedical Question Answering (2022.coling-1)
Copied to clipboard
Jianguo Mao, Jiyuan Zhang, Zengfeng Zeng, Weihua Peng, Wenbin Jiang, Xiangdong Wang, Hong Liu, Yajuan Lyu
| Challenge: | Existing models of biomedical question answering are limited in their ability to predict answers . a new model improves the performance of existing models, but the code will be released after the paper is published. |
| Approach: | They propose a hierarchical representation-based dynamic reasoning network to solve biomedical problems. |
| Outcome: | The proposed model significantly improves on three mainstream biomedical datasets . the code will be released after the paper is published . |
Multimodal Table Understanding (2024.acl-long)
Copied to clipboard
| Challenge: | Existing approaches to understanding tables rely on textual inputs and table images are difficult to access in real-world scenarios. |
| Approach: | They propose a multimodal table understanding problem where the model needs to generate correct responses to various table-related requests based on the given table image. |
| Outcome: | The proposed model outperforms open-source MLLMs on 23 benchmarks under held-in and held-out settings. |
Mitigating the Alignment Tax of RLHF (2024.emnlp-main)
Copied to clipboard
Yong Lin, Hangyu Lin, Wei Xiong, Shizhe Diao, Jianmeng Liu, Jipeng Zhang, Rui Pan, Haoxiang Wang, Wenbin Hu, Hanning Zhang, Hanze Dong, Renjie Pi, Han Zhao, Nan Jiang, Heng Ji, Yuan Yao, Tong Zhang
| Challenge: | Large Language Models (LLMs) acquire a wide range of abilities during pre-training, but aligning LLMs under Reinforcement Learning with Human Feedback (RLHF) can lead to forgetting pretrained abilities, which is also known as the alignment tax. |
| Approach: | They propose to use a model averaging technique to find the most powerful alignment-forging Pareto front among RLHF algorithms. |
| Outcome: | The proposed method achieves the strongest alignment-forging Pareto front among competing methods. |
DNA: Denoised Neighborhood Aggregation for Fine-grained Category Discovery (2023.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods to learn compact cluster representations from coarsely labeled data are noisy and degrade the quality of learning. |
| Approach: | They propose a framework that encodes semantic structures of data into the embedding space . they retrieve k-nearest neighbors of a query as positive keys to capture similarities . |
| Outcome: | The proposed framework can retrieve more accurate neighbors and outperform state-of-the-art models by a large margin. |
BanditMTL: Bandit-based Multi-task Learning for Text Classification (2021.acl-long)
Copied to clipboard
| Challenge: | Existing methods to regularize task variance are unexplored in multi-task text classification. |
| Approach: | They propose a multi-task learning method based on adversarial multi-armed bandit to regularize the task variance by means of a mirror gradient ascent-descent algorithm. |
| Outcome: | The proposed method achieves state-of-the-art in multi-task text classification. |
Fine-grained Category Discovery under Coarse-grained supervision with Hierarchical Weighted Self-contrastive Learning (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for novel category discovery focus on the scenario where known and novel categories are of the same granularity. |
| Approach: | They propose a novel scenario for fine-grained category discovery under coarse-grain supervision that allows for adapting models to categories of different granularity from known ones. |
| Outcome: | The proposed model can adapt models to categories of different granularity from known ones and reduce labeling cost. |
Chain-of-Thought Reasoning in Tabular Language Models (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing approaches to extend chain-of-thought reasoning into large language models are not viable in the scenario of privatization deployment or limited resources. |
| Approach: | They propose a framework that extends chain-of-thought reasoning into tabular language models . framework coordinates two TaLMs responsible for CoT generation and answer inference . |
| Outcome: | The proposed framework outperforms the state-of-the-art ChatGPT on the TABMWP dataset by 9.55% (82.60%92.15% in accuracy) with less parameters (0.8B). |
Dynamic Multistep Reasoning based on Video Scene Graph for Video Question Answering (2022.naacl-main)
Copied to clipboard
| Challenge: | Existing video QA models lack the capacity for deep video understanding and flexible multistep reasoning. |
| Approach: | They propose a video question answering model which performs dynamic multistep reasoning between questions and videos. |
| Outcome: | The proposed model improves on three widely used video QA datasets and displays better interpretability by backtracing along with the attention mechanisms to the video scene graphs. |
GrandGuard: Taxonomy, Benchmark, and Safeguards for Elderly-Chatbot Interaction Safety (2026.findings-acl)
Copied to clipboard
Changxuan Fan, Xi Yang, Yueyuan Zheng, Bin Zhou, Yuanping Wang, Wenbin Hu, Huihao Jing, Ki Sen Hung, Dazhao Du, Haoran Li, Janet Hui-wen Hsiao, Yangqiu Song
| Challenge: | a survey of older adults shows that many LLMs mishandle elderly-specific contextual risks. |
| Approach: | They propose a framework to assess elderly-specific contextual risks in LLM interactions . they use a taxonomy to identify 50 fine-grained risk types across mental well-being, financial, medical, toxicity, and privacy domains . |
| Outcome: | a new framework assesses elderly-specific contextual risks in LLM interactions . it achieves 96.2% and 90.9% unsafe-prompt detection accuracy, respectively . |
IM-TQA: A Chinese Table Question Answering Dataset with Implicit and Multi-type Table Structures (2023.acl-long)
Copied to clipboard
| Challenge: | Existing benchmarks only evaluate model performance on tables with explicit table structures, which means headers are explicitly annotated and treated as model input during inference. |
| Approach: | They propose a new Table Question Answering (TQA) dataset with implicit and multi-type table structures that requires the model to understand tables without directly available header annotations. |
| Outcome: | The proposed framework outperforms baselines on a dataset with implicit and multi-type table structures and can handle multi-table tables including previously neglected complex tables. |
Exploring the Vulnerability of the Content Moderation Guardrail in Large Language Models via Intent Manipulation (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Prior work has shown that intent detection enhances LLMs’ moderation guardrails, but the robustness of these guardrail mechanisms under malicious manipulations remains under-explored. |
| Approach: | They propose a two-stage intent-based prompt-refinement framework that first transforms harmful inquiries into structured outlines and further reframes them into declarative-style narratives. |
| Outcome: | The proposed framework outperforms several cutting-edge jailbreak methods and evades even advanced Intent Analysis (IA) and Chain-of-Thought (CoT)-based defenses. |
Learning to Conceal Risk: Controllable Multi-turn Red Teaming for LLMs in the Financial Domain (2026.acl-long)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) are increasingly deployed in high-stakes domains such as finance where unsafe behavior can lead to serious regulatory risks. |
| Approach: | They propose a black-box multi-turn risk-concealed redteaming framework that progressively conceals surface-level risk while exploiting regulatory-violating behaviors. |
| Outcome: | Experiments on nine widely used LLMs show that the proposed framework achieves 93.19% average attack success rate (ASR) and improves the average ASR to 95.00%. |
Token-Level Policy Optimization: Linking Group-Level Rewards to Token-Level Aggregation via sequence-level likelihood (2026.acl-long)
Copied to clipboard
| Challenge: | Group Relative Policy Optimization (GRPO) has significantly advanced the reasoning ability of large language models (LLMs). |
| Approach: | They propose a token-level framework that leverages sequence-level likelihood to link group-level rewards with individual tokens via token- level aggregation and introduces a KL-Divergence mask constraint that targets tokens with positive advantages and decreasing entropy to mitigate abrupt policy updates. |
| Outcome: | Experiments show that TEPO achieves state-of-the-art performance on mathematical reasoning benchmarks and reduces convergence time by 50% compared with GRPO/DAPO. |
Generalized Category Discovery with Large Language Models in the Loop (2024.findings-acl)
Copied to clipboard
Wenbin An, Wenkai Shi, Feng Tian, Haonan Lin, QianYing Wang, Yaqiang Wu, Mingxiang Cai, Luyan Wang, Yan Chen, Haiping Zhu, Ping Chen
| Challenge: | Generalized Category Discovery (GCD) is a crucial task that aims to recognize both known and novel categories from a set of unlabeled data. |
| Approach: | They propose a framework that introduces Large Language Models into the training loop to generate category names without human effort. |
| Outcome: | The proposed framework outperforms SOTA models on three benchmark datasets and generates accurate category names for the discovered clusters. |
A Diffusion Weighted Graph Framework for New Intent Discovery (2023.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods to learn from unlabeled data generate noisy supervisory signals . current methods only rely on semantic similarities to generate supervisory signal . |
| Approach: | They propose a weighted DWGF framework to capture semantic similarities and structure relationships in data. |
| Outcome: | The proposed method outperforms state-of-the-art models on evaluation metrics across multiple benchmark datasets. |
DynamicKV: Task-Aware Adaptive KV Cache Compression for Long Context LLMs (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Existing KV cache compression methods enforce a fixed pattern, neglecting task-specific characteristics, which hampers the effective retention of essential information while discarding less important tokens. |
| Approach: | They propose a Task-Aware KV cache mechanism that dynamically adjusts the KV caching size across different layers based on the characteristics of the tasks. |
| Outcome: | The proposed method surpasses state-of-the-art methods by 11% on the LongBench dataset even under extreme compression (0.9%) |
Explainable Question Answering based on Semantic Graph by Global Differentiable Learning and Dynamic Adaptive Reasoning (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing models for multi-hop Question Answering have improved the implicit reasoning ability, but the black box nature of pure neural networks has hindered the construction of explainable intelligent systems. |
| Approach: | They propose a global differentiation strategy to explore optimal reasoning paths from latent probability space and a Dynamic Adaptive Reasoner to enhance generalization of unseen questions. |
| Outcome: | The proposed method achieves 17% improvements in F1-score against BreakRC and shows better interpretability. |
Knowledge-Enhanced Named Entity Disambiguation for Short Text (2020.aacl-main)
Copied to clipboard
| Challenge: | Existing methods for named entity disambiguation are weak for short text . performance of existing methods drops dramatically for short texts . |
| Approach: | They propose a knowledge-enhanced method for named entity disambiguation . they use factual knowledge graph and conceptual knowledge graph to provide additional knowledge . |
| Outcome: | The proposed method achieves significant improvement on a large manually annotated short-text dataset and the state-of-the-art on three standard datasets. |