Papers by Jianfeng Wu
Towards Robust Few-Shot Relation Classification: Incorporating Relation Description with Agreement (2025.findings-emnlp)
Copied to clipboard
Mengting Hu, Jianfeng Wu, Ming Jiang, Yalan Xie, Zhunheng Wang, Rui Ying, Xiaoyi Liu, Ruixuan Xu, Hang Gao, Renhong Cheng
| Challenge: | Existing approaches to recognize relational relationships with a few support samples are limited for unlimited queries. |
| Approach: | They propose a simple but effective framework that uses relation descriptions as external knowledge to enhance the model’s comprehension of the relation semantics. |
| Outcome: | The proposed framework outperforms strong baselines while being robust against various NOTA rates. |
Simple but Effective Compound Geometric Operations for Temporal Knowledge Graph Completion (2024.acl-long)
Copied to clipboard
Rui Ying, Mengting Hu, Jianfeng Wu, Yalan Xie, Xiaoyi Liu, Zhunheng Wang, Ming Jiang, Hang Gao, Linlin Zhang, Renhong Cheng
| Challenge: | Current methods embed factual knowledge into continuous vector space and apply geometric operations to learn potential patterns in temporal knowledge graphs. |
| Approach: | They propose a temporal knowledge graph completion method that uses two geometric operations to learn missing facts in temporal graphs. |
| Outcome: | The proposed method significantly outperforms existing temporal knowledge graph embedding models. |
ChatSOP: An SOP-Guided MCTS Planning Framework for Controllable LLM Dialogue Agents (2025.acl-long)
Copied to clipboard
Zhigen Li, Jianxiang Peng, Yanmeng Wang, Yong Cao, Tianhao Shen, Minghui Zhang, Linxi Su, Shang Wu, Yihang Wu, YuQian Wang, Ye Wang, Wei Hu, Jianfeng Li, Shaojun Wang, Jing Xiao, Deyi Xiong
| Challenge: | Existing models that use Large Language Models (LLMs) show superior performance in various tasks, but lack of controllability leads to unfocused conversations or task failure. |
| Approach: | They propose a standard operating procedure (SOP) framework to regulate dialogue flow by integrating Chain of Thought reasoning and supervised fine-tuning for SOP prediction. |
| Outcome: | The proposed method achieves a 27.95% improvement in action accuracy compared to baseline models based on GPT-3.5 and also shows notable gains for open-source models. |
Reinforcement Learning on Pre-Training Data (2026.acl-long)
Copied to clipboard
Siheng Li, Kejiao Li, Zenan Xu, Guanhua Huang, Kun Li, Haoyuan Wu, null Wujiajia, Zihao Zheng, Chenchen Zhang, Kun Shi, Xue Gong, Qi Yi, Ruibin Xiong, Tingqiang Xu, Yuhao Jiang, Jianfeng Yan, Yuyuan Zeng, Guanghui Xu, Jinbao Xue, Zhijiang xu, Zheng Fang, Shuai LI, Qibin Liu, Xiaoxue Li, Zhuoyu Li, Yangyu Tao, Fei Gao, Cheng Jiang, Bochao Wang, Kai Liu, Jianchen Zhu, Wai Lam, Bo Zhou, Di Wang
| Challenge: | Recent progress in large language models is driven by scaling of training compute through pre-training with nexttoken prediction (NTP) or post-training (RL) Pre-training using NTP enables models to acquire extensive knowledge and skills from general data, but it suffers from data inefficiency and catastrophic forgetting in continual learning settings. |
| Approach: | They propose to scale training compute through pre-training with next-token prediction (NTP) or post-training by scaling reinforcement learning (RL) to improve learning from general data. |
| Outcome: | Experiments on multiple benchmarks and models show that the proposed approach improves continual pre-training and provides a strong foundation for post-training on Qwen3-8B-Base. |
Density-Aware Prototypical Network for Few-Shot Relation Classification (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing studies treat NOTA as an extra class and treat it the same as known relations. |
| Approach: | They propose a density-aware prototypical network to treat various instances distinctly . they separate known instances and isolate NOTA instances, respectively . their code will be made public after the paper is accepted . |
| Outcome: | The proposed method outperforms strong baselines with robustness towards different NOTA rates. |
SynthAgent: Adapting Web Agents with Synthetic Supervision (2026.acl-long)
Copied to clipboard
Zhaoyang Wang, Yiming Liang, Xuchao Zhang, Qianhui Wu, Siwei Han, Anson Bastos, Rujia Wang, Chetan Bansal, Baolin Peng, Jianfeng Gao, Saravan Rajmohan, Huaxiu Yao
| Challenge: | Existing studies have focused on synthetic supervision but have encountered data quality issues. |
| Approach: | They propose a fully synthetic supervision framework that aims at improving data quality via dual refinement of both tasks and trajectories. |
| Outcome: | The proposed framework outperforms existing methods on standardized benchmarks and shows promising results on a standardized test. |
MirrorCAPTCHA: Wild CAPTCHA, Wild Distribution, Wild Web-based Platform Meet Multimodal LLM Agents (2026.acl-long)
Copied to clipboard
Xiangyu Wu, Yuwei Hu, Tianyu Cui, Yueying Tian, Qing-Guo Chen, Zhao Xu, Weihua Luo, Kaifu Zhang, Yang Yang, Jianfeng Lu
| Challenge: | Existing agent benchmarks fail to evaluate an agent's real-world capacity to handle CAPTCHA . Existing benchmarks ignore this practical challenge, failing to evaluate agents' ability to handle complex visual CAPTchas. |
| Approach: | They propose a benchmark annotated with Weighted Pass Rate and a new metric to measure agent's ability to handle CAPTCHA. |
| Outcome: | The proposed benchmark outperforms current state-of-the-art closed-source models on mirrorCAPTCHA and achieves 9.4% higher average weighted pass rate and 2.13% higher average Completion degree. |
MIND: A Large-scale Dataset for News Recommendation (2020.acl-main)
Copied to clipboard
Fangzhao Wu, Ying Qiao, Jiun-Hung Chen, Chuhan Wu, Tao Qi, Jianxun Lian, Danyang Liu, Xing Xie, Jianfeng Gao, Winnie Wu, Ming Zhou
| Challenge: | Personalized news recommendation is an important technique for personalized news service. |
| Approach: | They propose to build a large-scale news recommendation dataset from Microsoft News . they demonstrate that news recommendation relies on the quality of news content understanding . |
| Outcome: | The proposed dataset contains 1 million users and more than 160k English news articles, each of which has rich textual content such as title, abstract and body. |
NUWA-XL: Diffusion over Diffusion for eXtremely Long Video Generation (2023.acl-long)
Copied to clipboard
Shengming Yin, Chenfei Wu, Huan Yang, Jianfeng Wang, Xiaodong Wang, Minheng Ni, Zhengyuan Yang, Linjie Li, Shuguang Liu, Fan Yang, Jianlong Fu, Ming Gong, Lijuan Wang, Zicheng Liu, Houqiang Li, Nan Duan
| Challenge: | Existing work generates long videos segment by segment sequentially, which is inefficient. |
| Approach: | They propose a Diffusion over Difference architecture for eXtremely Long video generation. |
| Outcome: | The proposed architecture reduces the average inference time from 7.55min to 26s (94.26%) and generates high-quality long videos with both global and local coherence. |
ECoK: Emotional Commonsense Knowledge Graph for Mining Emotional Gold (2024.findings-acl)
Copied to clipboard
Zhunheng Wang, Xiaoyi Liu, Mengting Hu, Rui Ying, Ming Jiang, Jianfeng Wu, Yalan Xie, Hang Gao, Renhong Cheng
| Challenge: | Existing knowledge graphs focus on the representation and reasoning of general factual knowledge, while there are significant deficiencies in the understanding and reasoning for emotional knowledge. |
| Approach: | They propose a commonsense knowledge graph that can be used to represent emotional knowledge by combining theories from psychology, cognitive science, and linguistics. |
| Outcome: | The proposed model surpasses GPT-4-Turbo in the emotion-related tasks. |