Papers by Jialong Wu
DINER: Debiasing Aspect-based Sentiment Analysis with Multi-variable Causal Inference (2024.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches to debiase ABSA focus on single-variable causal inference . aspect-based sentiment analysis models are prone to learn spurious correlations from annotation biases . |
| Approach: | They propose a framework based on multivariable causal inference for debiasing ABSA . they propose to model different types of biases based upon different causal intervention methods . |
| Outcome: | The proposed framework tackles different types of biases based on different intervention methods. |
Towards General Agentic Intelligence via Environment Scaling (2026.findings-acl)
Copied to clipboard
Runnan Fang, Shihao Cai, Baixuan Li, Jialong Wu, Guangyu Li, Wenbiao Yin, Xinyu Wang, Xiaobin Wang, Liangcai Su, Zhen Zhang, Shibin Wu, Zhengwei Tao, Yong Jiang, Pengjun Xie, Ningyu Zhang, Fei Huang, Wentao Zhang, Jingren Zhou
| Challenge: | Diverse real-world APIs require precise, robust function-calling intelligence, which needs agents to develop these capabilities through interaction in varied environments. |
| Approach: | They propose a framework that scales up environments to enable agentic intelligence . they use a two-phase agent fine-tuning strategy to first endow agents with basic agentic capabilities, then specializing them for domain-specific contexts. |
| Outcome: | Experiments on -bench, -Bench, and ACEBench show that the model significantly enhances the models’ function-calling capability. |
STAR: Constraint LoRA with Dynamic Active Learning for Data-Efficient Fine-Tuning of Large Language Models (2024.findings-acl)
Copied to clipboard
| Challenge: | Existing studies show that supervised training is still necessary for complex reasoning tasks. |
| Approach: | They propose a method to integrate uncertainty-based active learning and LoRA to effectively integrate the two methods. |
| Outcome: | The proposed approach outperforms baseline models on three reasoning tasks. |
Memp: Exploring Agent Procedural Memory (2026.findings-acl)
Copied to clipboard
Runnan Fang, Yuan Liang, Xiaobin Wang, Jialong Wu, Shuofei Qiao, Pengjun Xie, Fei Huang, Huajun Chen, Ningyu Zhang
| Challenge: | Large Language Models (LLMs) based agents suffer from brittle procedural memory that is manually engineered or entangled in static parameters. |
| Approach: | They propose a procedural-memory repository that distills past agent trajectories into fine-grained, step-by-step instructions and higher-level, script-like abstractions. |
| Outcome: | The proposed repository can be used to improve agents' performance on travelplanner and Alfworld. |
OmniThink: Expanding Knowledge Boundaries in Machine Writing through Thinking (2025.emnlp-main)
Copied to clipboard
Zekun Xi, Wenbiao Yin, Jizhan Fang, Jialong Wu, Runnan Fang, Yong Jiang, Pengjun Xie, Fei Huang, Huajun Chen, Ningyu Zhang
| Challenge: | Recent advances in Large Language Models (LLMs) have demonstrated remarkable progress in machine writing such as open domain long-form generation. |
| Approach: | They propose a slow-thinking machine writing framework that emulates the human-like process of iterative expansion and reflection to improve the knowledge density of generated articles. |
| Outcome: | The proposed framework improves the knowledge density of generated articles without compromising metrics such as coherence and depth. |
AdaRewriter: Unleashing the Power of Prompting-based Conversational Query Reformulation via Test-Time Adaptation (2025.emnlp-main)
Copied to clipboard
| Challenge: | Prompting-based conversational query reformulation has emerged as a powerful approach for conversational search, refining ambiguous user queries into standalone search queries. |
| Approach: | They propose a framework for query reformulation using an outcome-supervised reward model via test-time adaptation. |
| Outcome: | Experiments on five conversational search datasets show that AdaRewriter significantly outperforms the existing methods across most settings. |
EvolveSearch: An Iterative Self-Evolving Search Agent (2025.emnlp-main)
Copied to clipboard
Ding-Chu Zhang, Yida Zhao, Jialong Wu, Liwen Zhang, Baixuan Li, Wenbiao Yin, Yong Jiang, Yu-Feng Li, Kewei Tu, Pengjun Xie, Fei Huang
| Challenge: | Existing approaches to enabling LLM web search proficiency struggle with data production in open-search domains, while supervised fine-tuning struggles with data utilization efficiency. |
| Approach: | They propose an iterative self-evolution framework that combines SFT and RL to enhance agentic web search capabilities without external human-annotated reasoning data. |
| Outcome: | EvolveSearch achieves 4.7% improvement over current state-of-the-art in seven benchmarks . supervised fine-tuning struggles with data production in open-search domains compared with RL . |
SCOPE: Optimizing Key-Value Cache Compression in Long-context Generation (2025.acl-long)
Copied to clipboard
| Challenge: | Excessive compression during the prefill phase impairs comprehension of reasoning tasks . SCOPE is a framework that performs KV cache optimization during the decoding and prefill phases . |
| Approach: | They propose a framework that performs optimization during the prefill and decoding phases . they propose enabling a sliding strategy to select essential heavy hitters for the decoding phase . |
| Outcome: | Experiments show that SCOPE can optimize key-value cache for long-context generation tasks . the framework can preserve essential information while minimizing memory usage and transfer . |
Nested Browser-Use Learning for Agentic Information Seeking (2026.acl-long)
Copied to clipboard
Baixuan Li, Jialong Wu, Wenbiao Yin, Kuan Li, Zhongwang Zhang, Huifeng Yin, Zhengwei Tao, Liwen Zhang, Pengjun Xie, Jingren Zhou, Yong Jiang, Wentao Zhang, Zhiqiang Gao
| Challenge: | Existing information-seeking (IS) agents rely on the web for their information acquisition. |
| Approach: | They propose a browser-action framework that decouples interaction control from page exploration through a nested structure. |
| Outcome: | Empirical results show that NestBrowse offers clear benefits in practice. |
Syntactic and Semantic-driven Learning for Open Information Extraction (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Experimental results show that our approach significantly outperforms the supervised counterparts, and can even achieve competitive performance to supervised state-of-the-art (SoA) model. |
| Approach: | They propose a syntactic and semantic-driven learning approach that can learn open IE models without human-labelled data by leveraging syntakic and semantic knowledge as noisier, higher-level supervision. |
| Outcome: | The proposed approach outperforms supervised counterparts and can achieve competitive performance to supervised state-of-the-art models. |
WebWalker: Benchmarking LLMs in Web Traversal (2025.acl-long)
Copied to clipboard
Jialong Wu, Wenbiao Yin, Yong Jiang, Zhenglin Wang, Zekun Xi, Runnan Fang, Linhai Zhang, Yulan He, Deyu Zhou, Pengjun Xie, Fei Huang
| Challenge: | Large Language Models (LLMs) have demonstrated impressive capabilities across a wide range of natural language processing tasks. |
| Approach: | They propose a benchmark to assess the ability of LLMs to perform web traversal by using an explore-critic paradigm. |
| Outcome: | The proposed framework mimics human-like web navigation through an explore-critic paradigm and demonstrates the effectiveness of RAG combined with WebWalker in real-world scenarios. |
PROPER: A Progressive Learning Framework for Personalized Large Language Models with Group-Level Adaptation (2025.acl-long)
Copied to clipboard
| Challenge: | Personalized large language models (LLMs) aim to tailor outputs to user preferences . however, user data is typically sparse, making it challenging to adapt LLMs to specific user patterns. |
| Approach: | They propose a progressive learning framework that groups users based on preferences and adapts LLMs in stages. |
| Outcome: | The proposed approach outperforms SOTA models across multiple tasks. |
LocAgent: Graph-Guided LLM Agents for Code Localization (2025.acl-long)
Copied to clipboard
Zhaoling Chen, Robert Tang, Gangda Deng, Fang Wu, Jialong Wu, Zhiwei Jiang, Viktor Prasanna, Arman Cohan, Xingyao Wang
| Challenge: | Existing approaches struggle to efficiently navigate complex codebases when identifying relevant code snippets. |
| Approach: | They propose a graph-guided agent framework that addresses code localization through a distributed graph-based agent. |
| Outcome: | The proposed framework improves accuracy on real-world benchmarks and can be used to locate code snippets at a cost of 86%. |
SEED: Accelerating Reasoning Tree Construction via Scheduled Speculative Decoding (2025.coling-main)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have remarkable emergent abilities across various tasks, yet their performance on complex reasoning and planning tasks remains suboptimal. |
| Approach: | They propose a tree-search-based reasoning framework that encourages the exploration of intermediate steps and a round-scheduled strategy to manage draft model dispatching. |
| Outcome: | The proposed framework improves runtime speed and GPU memory management concurrently and handles multiple iterations for thought generation and state evaluation. |
SynWorld: Virtual Scenario Synthesis for Agentic Action Knowledge Refinement (2025.acl-short)
Copied to clipboard
Runnan Fang, Xiaobin Wang, Yuan Liang, Shuofei Qiao, Jialong Wu, Zekun Xi, Ningyu Zhang, Yong Jiang, Pengjun Xie, Fei Huang, Huajun Chen
| Challenge: | Using Large Language Models (LLMs)-based agents can enhance their understanding of environments and tasks. |
| Approach: | They propose a framework that allows agents to synthesize possible scenarios with multi-step action invocation within the action space and perform Monte Carlo Tree Search exploration to refine their action knowledge in the current environment. |
| Outcome: | The proposed framework synthesizes possible scenarios with multi-step action invocation within the action space and performs Monte Carlo Tree Search exploration to refine action knowledge in the current environment. |
AdaCQR: Enhancing Query Reformulation for Conversational Search via Sparse and Dense Retrieval Alignment (2025.coling-main)
Copied to clipboard
| Challenge: | Existing methods to address conversational search challenges are limited by one specific retrieval system. |
| Approach: | They propose a framework to enhance generalizability of information-seeking queries by aligning reformulation models with term-based and semantic retrieval systems. |
| Outcome: | The proposed framework outperforms existing methods in a more efficient framework. |
Locate-and-Focus: Enhancing Terminology Translation in Speech Language Models (2025.acl-long)
Copied to clipboard
Suhang Wu, Jialong Tang, Chengyi Yang, Pei Zhang, Baosong Yang, Junhui Li, Junfeng Yao, Min Zhang, Jinsong Su
| Challenge: | Existing methods for terminology translation struggle with interference from irrelevant noise. |
| Approach: | They propose a Locate-and-Focus method that locates terminologies within utterances to construct translation knowledge by minimizing irrelevant information for ST models. |
| Outcome: | The proposed method locates terminologies within utterances and enhances the success rate of terminology translation while maintaining robust general translation performance. |
Benchmarking Temporal Reasoning and Alignment Across Chinese Dynasties (2026.eacl-short)
Copied to clipboard
| Challenge: | Existing temporal reasoning benchmarks rely on rule-based construction and lack contextual depth . a recent study found existing LLMs struggle with nuanced temporal understanding . |
| Approach: | a benchmark is designed to evaluate LLMs on temporal reasoning in Chinese dynasties. |
| Outcome: | a new benchmark evaluates LLMs on temporal reasoning across Chinese dynasties . it emphasizes cross-entity relationships, pairwise temporal alignment, contextualized and culturally-grounded reasoning . results show existing LLM benchmarks struggle with nuanced temporal understanding . |