Kehua Feng
Author directory2026
ChemVA: Bridging Visual and Semantic Gaps in Multimodal LLM Chemical Diagram Reasoning
Mingyang Rao | Kehua Feng | Zhihui Zhu | Jiangzhen Fu | Hao Yu | Keyan Ding | Huajun Chen
Findings of the Association for Computational Linguistics: EMNLP 2026
Mingyang Rao | Kehua Feng | Zhihui Zhu | Jiangzhen Fu | Hao Yu | Keyan Ding | Huajun Chen
Findings of the Association for Computational Linguistics: EMNLP 2026
While Large Language Models (LLMs) have revolutionized scientific text processing, they exhibit a significant capability gap when interpreting chemical reaction diagrams. We identify two bottlenecks restricting current systems: a Visual Deficit, where generic vision encoders struggle to resolve the strict topological connectivity of dense molecular graphs, and a Semantic Disconnect, where standard linear strings (e.g., SMILES), although structurally precise, are often poorly aligned with the chemical semantic abstractions used by LLMs for reasoning. To bridge these gaps, we propose the Chemical Visual Activation (ChemVA) framework, which employs a novel Visual Anchor mechanism to ground functional groups via hybrid-granularity detection, followed by a semantic alignment approach that translates recognized structures into language-accessible chemical representations for downstream LLM reasoning. We evaluate our approach on OCRD-Bench, a newly constructed benchmark spanning recognition, chemical knowledge, and mechanistic reasoning. Experiments show that ChemVA achieves 92.0% structural recognition accuracy. It further delivers a consistent performance gain of approximately 20 percentage points across 9 diverse LLMs, allowing open-weights models to approach strong proprietary systems on complex chemical reasoning tasks.
SAFER: Advancing Safety Alignment via Efficient Ex-Ante Reasoning
Kehua Feng | Keyan Ding | Yuhao Wang | Menghan Li | Fanjunduo Wei | Xinda Wang | Huajun Chen
Findings of the Association for Computational Linguistics: ACL 2026
Kehua Feng | Keyan Ding | Yuhao Wang | Menghan Li | Fanjunduo Wei | Xinda Wang | Huajun Chen
Findings of the Association for Computational Linguistics: ACL 2026
Recent advancements in large language models (LLMs) have accelerated progress toward artificial general intelligence, yet their potential to generate harmful content poses critical safety challenges. Existing alignment methods often struggle to cover diverse safety scenarios and remain vulnerable to adversarial attacks. In this work, we propose SAFER, a framework for Safety Alignment via eFficient Ex-Ante Reasoning. Our approach instantiates structured Ex-Ante reasoning through initial assessment, rule verification, and path calibration, and embeds predefined safety rules to provide transparent and verifiable safety judgments. Specifically, our approach consists of two training stages: (1) supervised fine-tuning with synthetic traces to teach the multi-stage Ex-Ante reasoning, and (2) step-level reasoning preference optimization to jointly enhance safety, utility, and efficiency. Experiments on multiple open-source LLMs demonstrate that SAFER significantly enhances safety performance while maintaining helpfulness and response efficiency.
Learning an Efficient Multi-Turn Dialogue Evaluator from Multiple LLM Judges
Yuqi Tang | Kehua Feng | Yunfeng Wang | Zhiwen Chen | Chengfei lv | Gang Yu | Qiang Zhang | Keyan Ding | Huajun Chen
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Yuqi Tang | Kehua Feng | Yunfeng Wang | Zhiwen Chen | Chengfei lv | Gang Yu | Qiang Zhang | Keyan Ding | Huajun Chen
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Evaluating the conversational abilities of large language models (LLMs) remains a challenging task. Current mainstream approaches primarily rely on the “LLM-as-a-judge" paradigm, where an LLM is prompted to serve as an evaluator to assess dialogue quality. However, such methods often suffer from various biases, which undermine the reliability and consistency of the evaluation results. To mitigate these biases, recent methods employ multiple LLMs as judges and aggregate their judgments to select the optimal assessment. Although effective, this multi-judge approach incurs significant computational overhead during inference. In this paper, we propose an efficient multi-turn dialogue evaluator that captures the collective wisdom of multiple LLM judges by aggregating their preference knowledge into a single model. Our approach preserves the advantages of diverse multi-judge feedback while drastically reducing the evaluation cost, enabling fast and flexible dialogue quality assessment. Extensive experiments on seven single rating and pairwise comparison dialogue evaluation benchmarks demonstrate that our method outperforms existing baselines across diverse scenarios, showcasing its efficiency and robustness.
2025
Enhancing Safe and Controllable Protein Generation via Knowledge Preference Optimization
Yuhao Wang | Keyan Ding | Kehua Feng | Zeyuan Wang | Ming Qin | Xiaotong Li | Qiang Zhang | Huajun Chen
Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Yuhao Wang | Keyan Ding | Kehua Feng | Zeyuan Wang | Ming Qin | Xiaotong Li | Qiang Zhang | Huajun Chen
Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Protein language models have emerged as powerful tools for sequence generation, offering substantial advantages in functional optimization and denovo design. However, these models also present significant risks of generating harmful protein sequences, such as those that enhance viral transmissibility or evade immune responses. These concerns underscore critical biosafety and ethical challenges. To address these issues, we propose a Knowledge-guided Preference Optimization (KPO) framework that integrates prior knowledge via a Protein Safety Knowledge Graph. This framework utilizes an efficient graph pruning strategy to identify preferred sequences and employs reinforcement learning to minimize the risk of generating harmful proteins. Experimental results demonstrate that KPO effectively reduces the likelihood of producing hazardous sequences while maintaining high functionality, offering a robust safety assurance framework for applying generative models in biotechnology.
Sample-Efficient Human Evaluation of Large Language Models via Maximum Discrepancy Competition
Kehua Feng | Keyan Ding | Tan Hongzhi | Kede Ma | Zhihua Wang | Shuangquan Guo | Cheng Yuzhou | Ge Sun | Guozhou Zheng | Qiang Zhang | Huajun Chen
Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Kehua Feng | Keyan Ding | Tan Hongzhi | Kede Ma | Zhihua Wang | Shuangquan Guo | Cheng Yuzhou | Ge Sun | Guozhou Zheng | Qiang Zhang | Huajun Chen
Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
The past years have witnessed a proliferation of large language models (LLMs). Yet, reliable evaluation of LLMs is challenging due to the inaccuracy of standard metrics in human perception of text quality and the inefficiency in sampling informative test examples for human evaluation. This paper presents a sample-efficient human evaluation method for LLMs based on the principle of MAximum Discrepancy (MAD) competition. MAD automatically selects a small set of informative input instructions, each of which maximizes the discrepancy of two LLMs’ reponses, which are subsequently subject to three-alternative forced choice by human subjects. The pairwise comparison results of multiple LLMs are then aggregated into a global ranking using the Elo rating system. We compare eight representative LLMs in terms of four skills: knowledge understanding, mathematical reasoning, writing, and coding. Experimental results show that the proposed method reliably achieves the “golden” ranking of LLMs with a minimum set of input instructions, which in turn reveal their relative strengths and weaknesses, and offers valuable insights for further LLM advancement.
Boosting LLM’s Molecular Structure Elucidation with Knowledge Enhanced Tree Search Reasoning
Xiang Zhuang | Bin Wu | Jiyu Cui | Kehua Feng | Xiaotong Li | Huabin Xing | Keyan Ding | Qiang Zhang | Huajun Chen
Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Xiang Zhuang | Bin Wu | Jiyu Cui | Kehua Feng | Xiaotong Li | Huabin Xing | Keyan Ding | Qiang Zhang | Huajun Chen
Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Molecular structure elucidation involves deducing a molecule’s structure from various types of spectral data, which is crucial in chemical experimental analysis. While large language models (LLMs) have shown remarkable proficiency in analyzing and reasoning through complex tasks, they still encounter substantial challenges in molecular structure elucidation. We identify that these challenges largely stem from LLMs’ limited grasp of specialized chemical knowledge. In this work, we introduce a Knowledge-enhanced reasoning framework for Molecular Structure Elucidation (K-MSE), leveraging Monte Carlo Tree Search for test-time scaling as a plugin. Specifically, we construct an external molecular substructure knowledge base to extend the LLMs’ coverage of the chemical structure space. Furthermore, we design a specialized molecule-spectrum scorer to act as a reward model for the reasoning process, addressing the issue of inaccurate solution evaluation in LLMs. Experimental results show that our approach significantly boosts performance, particularly gaining more than 20% improvement on both GPT-4o-mini and GPT-4o.
Search
Fix author
Co-authors
- Huajun Chen 6
- Keyan Ding 6
- Qiang Zhang 4
- Xiaotong Li 2
- Yuhao Wang 2
- Zhiwen Chen 1
- Jiyu Cui 1
- Jiangzhen Fu 1
- Shuangquan Guo 1
- Tan Hongzhi 1
- Menghan Li 1
- Chengfei Lv 1
- Kede Ma 1
- Ming Qin 1
- Mingyang Rao 1
- Ge Sun 1
- Yuqi Tang 1
- Xinda Wang 1
- Yunfeng Wang 1
- Zeyuan Wang 1
- Zhihua Wang 1
- Fanjunduo Wei 1
- Bin Wu 1
- Huabin Xing 1
- Gang Yu 1
- Hao Yu 1
- Cheng Yuzhou 1
- Guozhou Zheng 1
- Zhihui Zhu 1
- Xiang Zhuang 1