Papers by Jianwen Zhang
Relation Discovery with Out-of-Relation Knowledge Base as Supervision (N19-1)
Copied to clipboard
| Challenge: | Existing methods to extract relations from text corpus without annotated data are violated by up to 31%. |
| Approach: | They propose to use out-of-relation knowledge bases to supervise the discovery of unseen relations where relations to discover from the text corpus and those in knowledge bases are not overlapped. |
| Outcome: | The proposed method improves the state-of-the-art relation discovery performance by a large margin. |
LongCLI-Bench: A Preliminary Benchmark and Study for Long-horizon Agentic Programming in Command-Line Interfaces (2026.findings-acl)
Copied to clipboard
Yukang Feng, Jianwen Sun, Zelai Yang, Jiaxin Ai, Chuanhao Li, Zizhen Li, Fanrui Zhang, Kang He, Rui Ma, Jifan Lin, Jie Sun, Yang Xiao, Sizhuo Zhou, Wenxiao Wu, Yiming Liu, Pengfei Liu, Shenglin Zhang, Kaipeng Zhang
| Challenge: | Existing benchmarks for agentic programming in long-horizon command-line interface tasks are limited by short task horizons, data contamination from GitHub scraping, and a lack of fine-grained evaluation metrics. |
| Approach: | They propose a benchmark to evaluate agentic capabilities across long-horizon command-line interface tasks. |
| Outcome: | The proposed benchmarks cover four engineering categories: from scratch, feature addition, bug fixing, and refactoring. |
DEL-ToM: Inference-Time Scaling for Theory-of-Mind Reasoning via Dynamic Epistemic Logic (2025.emnlp-main)
Copied to clipboard
| Challenge: | Theory-of-Mind (ToM) tasks pose a unique challenge for large language models (LLMs), which often lack the capability for dynamic logical reasoning. |
| Approach: | They propose a framework that decomposes ToM tasks into a sequence of belief updates grounded in Dynamic Epistemic Logic (DEL) they use data generated automatically via a DEL simulator to train a verifier, which is called the Process Belief Model (PBM). |
| Outcome: | The proposed framework improves verifiable ToM reasoning through inference-time scaling rather than architectural changes. |
MeepleLM: A Virtual Playtester Simulating Diverse Subjective Experiences (2026.acl-long)
Copied to clipboard
Zizhen Li, Chuanhao Li, Yibin Wang, Jianwen Sun, Yukang Feng, Jiaxin Ai, Fanrui Zhang, Mingzhu Sun, Yifei Huang, Kaipeng Zhang
| Challenge: | Recent advances in large language models have expanded the role of board games as creative co-designers . however, current systems lack the capacity to offer constructive critique grounded in the emergent user experience . |
| Approach: | They propose a large language model that internalizes persona-specific reasoning patterns to accurately simulate the subjective feedback of diverse player archetypes. |
| Outcome: | The proposed model outperforms commercial models in community alignment and critique quality. |
InMind: Evaluating LLMs in Capturing and Applying Individual Human Reasoning Styles (2025.emnlp-main)
Copied to clipboard
Zizhen Li, Chuanhao Li, Yibin Wang, Qi Chen, Diping Song, Yukang Feng, Jianwen Sun, Jiaxin Ai, Fanrui Zhang, Mingzhu Sun, Kaipeng Zhang
| Challenge: | Recent large language models (LLMs) have demonstrated strong reasoning abilities across complex mathematical and scientific domains. |
| Approach: | They propose a framework to assess whether LLMs can capture and apply personalized reasoning styles in social deduction games. |
| Outcome: | The proposed framework evaluates LLMs on the game Avalon and shows that they can capture and apply individualized reasoning styles. |
Teaching Your Models to Understand Code via Focal Preference Alignment (2025.emnlp-main)
Copied to clipboard
Jie Wu, Haoling Li, Xin Zhang, Xiao Liu, Yangyu Huang, Jianwen Luo, Yizhen Zhang, Zuchao Li, Ruihang Chu, Yujiu Yang, Scarlett Li
| Challenge: | Existing methods for supervised fine-tuning focus on unit test feedback to construct preference pairs. |
| Approach: | They propose a preference alignment framework that mimics human iterative debugging to refine Code LLMs. |
| Outcome: | Experiments show that Preference Learning improves on BigCodeBench and BigCodeBind tasks. |
DA-Code: Agent Data Science Code Generation Benchmark for Large Language Models (2024.emnlp-main)
Copied to clipboard
Yiming Huang, Jianwen Luo, Yan Yu, Yitong Zhang, Fangyu Lei, Yifan Wei, Shizhu He, Lifu Huang, Xiao Liu, Jun Zhao, Kang Liu
| Challenge: | DA-Code is a code generation benchmark designed to assess LLMs on agent-based data science tasks. |
| Approach: | They propose a code generation benchmark specifically designed for LLMs on agent-based data science tasks. |
| Outcome: | The benchmark performs better than existing frameworks, but lacks accuracy . it is based on real-world data, and includes examples that cover a wide range of tasks . |
ReviewGrounder: Improving Review Substantiveness with Rubric-Guided, Tool-Integrated Agents (2026.acl-long)
Copied to clipboard
Zhuofeng Li, Yi Lu, Dongfu Jiang, Haoxiang Zhang, Yuyang Bai, Chuan Li, Yu Wang, Shuiwang Ji, Jianwen Xie, Yu Zhang
| Challenge: | Rapid rise in AI conference submissions has driven increasing exploration of large language models (LLMs) for peer review support. |
| Approach: | They propose a peer review benchmarking tool based on paper-specific rubrics and a rubric-guided framework that decomposes reviewing into drafting and grounding stages. |
| Outcome: | The proposed framework outperforms baselines with stronger/larger backbones in both alignment with human judgments and rubric-based review quality across 8 dimensions. |