Papers by Jie Ying
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. |
A Confidence-based Partial Label Learning Model for Crowd-Annotated Named Entity Recognition (2023.findings-acl)
Copied to clipboard
Limao Xiong, Jie Zhou, Qunxi Zhu, Xiao Wang, Yuanbin Wu, Qi Zhang, Tao Gui, Xuanjing Huang, Jin Ma, Ying Shan
| Challenge: | Existing models for named entity recognition (NER) are based on large-scale labeled datasets, which always obtain using crowdsourcing. |
| Approach: | They propose a CONfidence-based partial Label Learning method to integrate prior and posterior confidences for crowd-annotated named entity recognition models. |
| Outcome: | The proposed model improves on real-world and synthetic datasets compared with baselines. |
HetGCoT: Heterogeneous Graph-Enhanced Chain-of-Thought LLM Reasoning for Academic Question Answering (2025.findings-emnlp)
Copied to clipboard
| Challenge: | graph neural networks capture structured graph information, but lack integration at the reasoning level. |
| Approach: | They propose a framework that leverages graph structural information to reason interpretable academic QA results. |
| Outcome: | The proposed framework outperforms sota baselines on OpenAlex and DBLP datasets. |
Target-oriented Fine-tuning for Zero-Resource Named Entity Recognition (2021.findings-acl)
Copied to clipboard
| Challenge: | Named entity recognition (NER) is one of the fundamental tasks in natural language processing. |
| Approach: | They propose four practical guidelines to guide knowledge transfer and task finetuning . they propose a framework to exploit data from three aspects in a unified training manner . |
| Outcome: | The proposed framework improves on six benchmarks and shows that it is state-of-the-art in five languages. |
LLM-Guided Semantic Bootstrapping for Interpretable Text Classification with Tsetlin Machines (2026.findings-acl)
Copied to clipboard
| Challenge: | Pretrained language models (PLMs) provide strong semantic representations but are costly and opaque. |
| Approach: | They propose a framework that transfers pretrained language models into symbolic form and integrates them into symbolic models. |
| Outcome: | The proposed framework improves interpretability and accuracy across multiple text classification tasks while remaining fully symbolic and efficient. |
Knowledge-to-Verification: Exploring RLVR for LLMs in Knowledge-Intensive Domains (2026.acl-long)
Copied to clipboard
Zhonghang Yuan, Zhefan Wang, Fang Hu, Zihong Chen, Jinzhe Li, Gang Li, Jie Ying, Huanjun Kong, Songyang Zhang, Nanqing Dong
| Challenge: | Recent large language models (LLMs) have demonstrated remarkable progress in reasoning, but their applications on knowledge-intensive domains have not been explored due to the scarcity of high-quality verifiable data. |
| Approach: | They propose a framework that extends reinforcement learning with verifiable rewards (RLVR) to knowledge-intensive domains through automated verififiability data synthesis while enabling verification of the LLM's reasoning process. |
| Outcome: | Extensive experiments show that the proposed framework enhances the reasoning of large language models in knowledge-intensive domains without significantly compromising the model’s general capabilities. |
ROGRAG: A Robustly Optimized GraphRAG Framework (2025.acl-demo)
Copied to clipboard
| Challenge: | Existing pipelines for large language models struggle with specialized or emerging topics which are rarely seen in the training corpus. |
| Approach: | They propose a multi-stage retrieval mechanism that integrates dual-level with logic form retrieval methods to improve retrieval robustness without increasing computational cost. |
| Outcome: | The proposed framework outperforms Qwen2.5-7B-Instruct and outperformed mainstream methods on seedbench and significantly improves the performance of each component. |
SeedBench: A Multi-task Benchmark for Evaluating Large Language Models in Seed Science (2025.acl-long)
Copied to clipboard
Jie Ying, Zihong Chen, Zhefan Wang, Wanli Jiang, Chenyang Wang, Zhonghang Yuan, Haoyang Su, Huanjun Kong, Fan Yang, Nanqing Dong
| Challenge: | Seed science is essential for modern agriculture, but its application in seed science remains limited due to a shortage of experts and limited availability of online resources. |
| Approach: | They evaluate 26 leading large language models and compare them against a set of benchmarks . they find that there is a gap between the power of LLMs and real-world seed science problems . |
| Outcome: | The new seed benchmark highlights the gap between the power of large language models and real-world seed science problems. |
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. |
Neural-DINF: A Neural Network based Framework for Measuring Document Influence (2020.acl-main)
Copied to clipboard
| Challenge: | Existing methods to measure scholarly impact of documents without citations only consider word frequency change. |
| Approach: | They propose a neural network framework that measures document influence without citations by using word frequency changes and word semantic shifts. |
| Outcome: | The proposed model outperforms existing models on document influence evaluation without citations. |