Papers by Jie Zou
LLMs Assist NLP Researchers: Critique Paper (Meta-)Reviewing (2024.emnlp-main)
Copied to clipboard
Jiangshu Du, Yibo Wang, Wenting Zhao, Zhongfen Deng, Shuaiqi Liu, Renze Lou, Henry Zou, Pranav Narayanan Venkit, Nan Zhang, Mukund Srinath, Haoran Zhang, Vipul Gupta, Yinghui Li, Tao Li, Fei Wang, Qin Liu, Tianlin Liu, Pengzhi Gao, Congying Xia, Chen Xing, Cheng Jiayang, Zhaowei Wang, Ying Su, Raj Shah, Ruohao Guo, Jing Gu, Haoran Li, Kangda Wei, Zihao Wang, Lu Cheng, Surangika Ranathunga, Meng Fang, Jie Fu, Fei Liu, Ruihong Huang, Eduardo Blanco, Yixin Cao, Rui Zhang, Philip Yu, Wenpeng Yin
| Challenge: | a comparative analysis of paper (meta-)reviews by large language models (LLMs) aims to identify and distinguish LLMs from human activities . |
| Approach: | They present a comparative analysis to identify and distinguish LLM activities from human activities. |
| Outcome: | The proposed analysis aims to improve recognition of instances when someone implicitly uses LLMs for reviewing activities. |
OEE-CFC: A Dataset for Open Event Extraction from Chinese Financial Commentary (2024.findings-emnlp)
Copied to clipboard
Qizhi Wan, Changxuan Wan, Rong Hu, Dexi Liu, Xu Wenwu, Kang Xu, Zou Meihua, Liu Tao, Jie Yang, Zhenwei Xiong
| Challenge: | Existing corpora with unconventional entities serving as event arguments lack rich multi-events and shared arguments. |
| Approach: | They develop an open event template that includes 21 event argument roles and an open corpus supporting open event extraction. |
| Outcome: | The proposed corpus includes 17,469 events, 44,221 arguments, 3,644 complex arguments, and 5,898 shared arguments. |
Task-Aware LLM Routing with Multi-Level Task-Profile-Guided Data Synthesis for Cold-Start Scenarios (2026.acl-long)
Copied to clipboard
| Challenge: | Existing routers generalize poorly in cold-start scenarios where in-domain training data is unavailable. |
| Approach: | They propose a task-type–aware router approach that models query-conditioned cost and performance via latent task-like variables with prior regularization derived from the synthesized task taxonomy. |
| Outcome: | The proposed framework improves performance and cost under cold-start and in-domain settings and enables efficient routing. |
Making Pre-trained Language Models Better Learn Few-Shot Spoken Language Understanding in More Practical Scenarios (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing few-shot Spoken Language Understanding models need to be trained on a set of data-rich source domains and adapt to the target domain with a few examples. |
| Approach: | They propose a scenario where only a pre-trained language model and a few labeled examples are used to train few-shot SLU models. |
| Outcome: | The proposed model outperforms existing models on few-shot settings by reducing the number of slot labels and reducing training complexity. |
Rejection-to-Acceptance Transition: Model Editing-Based Jailbreak Backdoor Injection Not Limited to Few Output Tokens (2026.findings-acl)
Copied to clipboard
Shiji Yang, Min Cai, Hao Xiong, Congyao Mei, Haodong Zou, Shicheng Tan, Jie Chen, Fulan Qian, Shu Zhao
| Challenge: | Existing methods for jailbreaking LLMs are implemented by binding backdoors to predefined phrases as first few output tokens, inducing the LLM’s next-token prediction to produce continuous responses. |
| Approach: | They propose a model editing-based jailbreak backdoor attack that hijacks LLM representations into a acceptance domain rather than binding to a few output tokens. |
| Outcome: | The proposed model editing method outperforms existing methods, showing stronger jailbreak capabilities across LLMs and datasets. |
Lightweight LLM Agent Memory with Small Language Models (2026.acl-long)
Copied to clipboard
Jiaquan Zhang, Chaoning Zhang, Shuxu Chen, Zhenzhen Huang, Pengcheng Zheng, Zhicheng Wang, Ping Guo, Fan Mo, Sung-Ho Bae, Jie Zou, Jiwei Wei, Yang Yang
| Challenge: | Existing external memory systems for LLMs have low online overhead but are unstable in accumulating latency over long interactions. |
| Approach: | They propose a lightweight memory system for better agent memory driven by Small Language Models . lightmem modularizes memory retrieval, writing, and long-term consolidation . they show consistent gains across model scales and high efficiency . |
| Outcome: | The proposed system improves agent memory but has low latency and low online overhead . it separates online processing from offline consolidation to enable efficient memory invocation . the proposed system achieves an average F1 improvement of 2.5 over A-MEM on LoCoMo . |
Execution as Verification: Fine-Grained Self-Correcting Reasoning for Complex KBQA (2026.acl-long)
Copied to clipboard
| Challenge: | Existing knowledge base question answering methods are limited by syntactic constraints and are prone to structural deviations that render queries unexecutable. |
| Approach: | They propose a framework that reframes semantic parsing as an iterative reasoning process driven by execution feedback. |
| Outcome: | The proposed method achieves significant improvements in query executability and answer accuracy on the WebQSP and CWQ datasets. |
CompTab: A Comprehensive Benchmark for Real-World TableQA with Complex Reasoning and Irregular Tables (2026.acl-long)
Copied to clipboard
Zhen Yang, Wei Du, Jie Wang, Wenze Zhou, Xiangfeng Meng, Zhengyang Wang, Suping Sun, Ziwei Du, Haodong Zou, Jie Chen, Yongbin Liu, Shicheng Tan, Jiahao Ying, Shu Zhao
| Challenge: | Existing benchmarks focus on well-structured tables and fail to reflect irregular structures and complex reasoning commonly encountered in real-world scenarios. |
| Approach: | They propose a benchmark to evaluate TableQA under complex reasoning and irregular table conditions. |
| Outcome: | The proposed framework improves generalization and realism of large language models under complex and irregular table conditions. |
Thinking Beyond the Local: Multi-View Instructed Adaptive Reasoning in KG-Enhanced LLMs (2026.findings-eacl)
Copied to clipboard
| Challenge: | Existing methods for large language models adopt query-driven iterative reasoning from a local perspective, limiting efficiency and accuracy for complex multi-hop tasks. |
| Approach: | They propose a multi-view instructed adaptive reasoning of LLM on Knowledge Graphs that allows LLMs to plan, evaluate, and adapt reasoning paths from a global perspective. |
| Outcome: | The proposed model overcomes the limitations of local exploration by enabling LLMs to plan, evaluate, and adapt reasoning paths from a global perspective. |