Papers by Yujun Zhou
GraphCache: Message Passing as Caching for Sentence-Level Relation Extraction (2022.findings-naacl)
Copied to clipboard
| Challenge: | Existing work only encodes entity types and textual context within individual instances, which limits the performance of sentence-level relation extraction (RE). |
| Approach: | They propose a module that aggregates the features from sentences to learn global representations of properties and augments local features within individual sentences. |
| Outcome: | The proposed module can learn global representations of properties from sentences and augment local features within individual sentences. |
GENUINE: Graph Enhanced Multi-level Uncertainty Estimation for Large Language Models (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods for estimation of uncertainty overlook semantic dependencies, authors say . genUINE: Graph ENhanced mUlti-level uncertainty Estimation for Large Language Models leverages dependency parse trees and hierarchical graph pooling . |
| Approach: | They propose a graph-enhanced mUlti-level uncertaINty estimation framework that leverages dependency parse trees and hierarchical graph pooling to refine uncertainty quantification. |
| Outcome: | The proposed framework achieves higher AUROC and lower calibration errors than existing methods. |
SCVQ: Sparse-Compensated Vector Quantization for Large Language Models (2026.acl-long)
Copied to clipboard
| Challenge: | Existing vector quantization methods incur inference overhead due to massive codebook storage and intensive index lookups. |
| Approach: | They propose a framework for vector quantization that incorporates a salience-aware weighted K-means clustering scheme with symmetry constraints to reduce codebook size and indexing costs. |
| Outcome: | The proposed framework achieves a perplexity of 5.78 on WikiText-2 for LLaMA-2-7B at 2-bit quantization while delivering a 1.4 speedup over existing baselines. |
SceMQA: A Scientific College Entrance Level Multimodal Question Answering Benchmark (2024.acl-short)
Copied to clipboard
Zhenwen Liang, Kehan Guo, Gang Liu, Taicheng Guo, Yujun Zhou, Tianyu Yang, Jiajun Jiao, Renjie Pi, Jipeng Zhang, Xiangliang Zhang
| Challenge: | SceMQA focuses on core science subjects including Mathematics, Physics, Chemistry, and Biology. |
| Approach: | They propose to use SceMQA to evaluate multimodal question answering at college entrance level. |
| Outcome: | The proposed model provides specific knowledge points for each problem and detailed explanations for each answer. |
From Implicit Graph Encoding to Explicit Evidence: A Training-Free LLM Framework for Temporal Knowledge Graph Reasoning (2026.findings-acl)
Copied to clipboard
Guo Tang, Ke Cheng, Huiming Fan, Heng Chang, Wenxiang Zheng, Xianhao Ou, Junjia Xiang, Ming Liu, Yujun Zhou, Li Lanyu, Bing Qin
| Challenge: | Existing Large Language Models (LLMs) struggle with implicit modality alignment and suboptimal graph linearization. |
| Approach: | They propose a training-free, test-time adaptive framework that reframes TKG prediction as explicit evidence-driven reasoning. |
| Outcome: | ExE-LLM outperforms fully trained graph neural networks on four benchmarks . it achieves SOTA performance in inductive settings, significantly outperforming fully trained neural networks . |
Should We Rely on Entity Mentions for Relation Extraction? Debiasing Relation Extraction with Counterfactual Analysis (2022.naacl-main)
Copied to clipboard
Yiwei Wang, Muhao Chen, Wenxuan Zhou, Yujun Cai, Yuxuan Liang, Dayiheng Liu, Baosong Yang, Juncheng Liu, Bryan Hooi
| Challenge: | Existing studies rely on entity information for sentence-level relation extraction (RE) but this can leak superficial and spurious clues of relations. |
| Approach: | They propose to use entity mentions to extract relations from textual context . they use a causal graph to model dependencies between variables in RE models . |
| Outcome: | The proposed method yields significant gains on both effectiveness and generalization for RE. |
Too Correct to Learn: Reinforcement Learning on Saturated Reasoning Data (2026.acl-short)
Copied to clipboard
| Challenge: | Strong base models saturate benchmarks, resulting in weaker performance, a paradox . a new approach to Reinforcement Learning (RL) is needed to improve performance . |
| Approach: | They propose a method that uses constrained uniform top-k sampling to flatten the local optimization landscape by sampling uniformly from constrained high-confidence candidates. |
| Outcome: | Experiments show that the proposed approach prevents policy degeneration and boosts out-of-domain generalization. |
Beyond Single-Value Metrics: Evaluating and Enhancing LLM Unlearning with Cognitive Diagnosis (2025.findings-acl)
Copied to clipboard
Yicheng Lang, Kehan Guo, Yue Huang, Yujun Zhou, Haomin Zhuang, Tianyu Yang, Yao Su, Xiangliang Zhang
| Challenge: | Large Language Models (LLMs) have been used to remove harmful knowledge and undesirable capabilities. |
| Approach: | They propose a framework that leverages Cognitive Diagnosis Modeling to evaluate LLM unlearning. |
| Outcome: | The proposed framework enhances evaluation and facilitates removal of harmful abilities. |
Your Reasoning Model is Secretly a Reward Model - Optimization-Free Verification from Experience (2026.acl-long)
Copied to clipboard
| Challenge: | Existing verifiers operate on the surface text or on confidence proxies derived from token probabilities, which can be brittle. |
| Approach: | They propose a training-free, non-parametric verifier that summarizes each reasoning trace by an activation delta and compares it to two class centroids computed from labeled experience. |
| Outcome: | The proposed model improves selection and reranking on large and less-calibrated models. |
Save the Good Prefix: Precise Error Penalization via Process-Supervised RL to Enhance LLM Reasoning (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing reinforcement learning methods rely on sparse outcome rewards, which fail to credit correct intermediate steps in partially successful solutions. |
| Approach: | They propose a process reward model that rewards correct steps only when they detect errors . they propose VPPO, which rewards the correct prefix and an erroneous suffix . |
| Outcome: | a new approach outperforms sparse-reward RL and prior PRM-guided baselines on Pass@1 and Pass@K . a process reward model (PRM) outperformed sparser-rebound RL on multiple reasoning benchmarks . |
PolicyLLM: Towards Excellent Comprehension of Public Policy for Large Language Models (2026.findings-acl)
Copied to clipboard
Han Bao, Penghao Zhang, Yue Huang, Zhengqing Yuan, Yanchi Ru, SU Rui, Yujun Zhou, Xiangqi Wang, Kehan Guo, Nitesh V Chawla, Yanfang Ye, Xiangliang Zhang
| Challenge: | Large Language Models (LLMs) are increasingly integrated into real-world decision-making, but their ability to comprehend and reason about policy-related content remains underexplored. |
| Approach: | They propose a bilingual benchmark evaluating policy comprehension comprising 21K cases across a broad spectrum of policy areas. |
| Outcome: | The proposed model shows stronger performance on application-oriented policy tasks than on memorization or conceptual understanding, and yields the highest accuracy on structured reasoning tasks. |
CHAMP: A Competition-level Dataset for Fine-Grained Analyses of LLMs’ Mathematical Reasoning Capabilities (2024.findings-acl)
Copied to clipboard
| Challenge: | Recent large language models have shown indications of mathematical reasoning ability on competition-level problems. |
| Approach: | They propose a benchmark dataset to enable such analyses using large language models. |
| Outcome: | The proposed model performs better with concepts and hints than with the best model, but it is difficult to verify. |
Dissecting Logical Reasoning in LLMs: A Fine-Grained Evaluation and Supervision Study (2025.findings-emnlp)
Copied to clipboard
Yujun Zhou, Jiayi Ye, Zipeng Ling, Yufei Han, Yue Huang, Haomin Zhuang, Zhenwen Liang, Kehan Guo, Taicheng Guo, Xiangqi Wang, Xiangliang Zhang
| Challenge: | Existing benchmarks that rely on final-answer accuracy fail to capture the quality of the reasoning process. |
| Approach: | They propose a fine-grained evaluation framework that assesses logical reasoning across three dimensions: overall accuracy, stepwise soundness, and representation-level probing. |
| Outcome: | The proposed framework assesses logical reasoning across three dimensions: overall accuracy, stepwise soundness, and representation-level probing. |
K-GIP: Diagnosing Logical Fractures in Large Vision-Language Models via Verification Scene Graphs and Sequential Pruning (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing benchmarks that treat hallucinations as isolated errors neglect causal dependencies between visual perception and textual reasoning. |
| Approach: | They propose a Knowledge-Guided In-Context Probing framework that constructs a dual-perception ground truth to transform abstract priors into multi-granularity queries. |
| Outcome: | The proposed framework isolates deep reasoning failures from simple perceptual misses. |
Defending Jailbreak Prompts via In-Context Adversarial Game (2024.emnlp-main)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) demonstrate remarkable capabilities across diverse applications, but concerns regarding their security persist. |
| Approach: | They propose an adversarial game that leverages agent learning to extend knowledge to defend against jailbreaks. |
| Outcome: | The proposed game shows that LLMs safeguarded by ICAG exhibit significantly reduced jailbreak success rates across various attack scenarios. |