Jiateng Liu
Author directory2026
CUADebug: Diagnosing and Repairing Computer-Use Agent Failures
Weijia Zhang | Kunlun Zhu | Zeyi Liu | Yinting Chen | Tianyi Ma | Jiateng Liu | Jiaxun Zhang | Bingxuan Li | Pan Lu | Xiangru Tang | Heng Ji | Jiaxuan You
Findings of the Association for Computational Linguistics: EMNLP 2026
Weijia Zhang | Kunlun Zhu | Zeyi Liu | Yinting Chen | Tianyi Ma | Jiateng Liu | Jiaxun Zhang | Bingxuan Li | Pan Lu | Xiangru Tang | Heng Ji | Jiaxuan You
Findings of the Association for Computational Linguistics: EMNLP 2026
Computer-use agents (CUAs) interact with graphical interfaces through screenshots and low-level mouse and keyboard actions, yet the causal error may precede the terminal failure. We present **CUADebug**, a framework for localizing root causes in CUA trajectories and guiding re-execution. **CUADebug** includes a five-category, 30-subtype taxonomy; CUAErrorBench, a benchmark of 204 failed OSWorld trajectories with human root-cause annotations; and CUADebugger, a ReAct-style agent for root-cause analysis (RCA). CUADebugger iteratively selects trajectory steps, inspects paired before/after screenshots and action traces, and submits a structured diagnosis containing the causal step, taxonomy label, grounded evidence, and correction. CUADebugger performs RCA without per-trajectory human intervention; human annotations are used to evaluate RCA predictions and, in controlled re-rollout comparisons, to fix restart points. Task reasoning and control is the largest annotated failure category (110/204). CUADebugger improves L2 and Tag+Step Exact across three debugger backbones on the Claude-agent split; with Gemini 2.5 Pro, Tag+Step Exact rises from 11.1% to 19.4%. Single re-execution improves failure recovery from 13.89% to 29.86% (overall 61.77% to 68.14%); controlled continual re-execution improves it from 12.50% to 25.69% (overall 61.22% to 66.48%). Project page: cuadebug.github.io
EMCompress: Video-LLMs with Endomorphic Multimodal Compression
Zheyu Fan | Jiateng Liu | Yuji Zhang | Zihan Wang | Yi R. Fung | Manling Li | Heng Ji
Findings of the Association for Computational Linguistics: ACL 2026
Zheyu Fan | Jiateng Liu | Yuji Zhang | Zihan Wang | Yi R. Fung | Manling Li | Heng Ji
Findings of the Association for Computational Linguistics: ACL 2026
Video-LLMs face a fundamental tension in long-video reasoning: static, sparse frame sampling either dilutes evidence across task-irrelevant segments at significant cost or misses fine-grained temporal semantics altogether. We propose a novel, cognitively-inspired task — Endomorphic Multimodal Compression (EMC) — as a structurally-constrained sufficient-statistic problem for VideoQA, and formulate it as an endomorphic transformation F_EMC : (V, Q) → (v, q) that compresses the multimodal input while preserving answer invariance across reasonable downstream models. The endomorphic form keeps the compressed output in the downstream pipeline’s native task space — a structural mirror of the filter-then-reason mechanism in the cognitive literature motivating EMC — distinguishing it from latent-code compression (IB / VIB) and making the formulation extensible to other multimodal settings. Under the Markov chain A → (V, Q) → (v, q), EMC realizes the classical sufficiency condition I((v, q); A) = I((V, Q); A) in its VideoQA-natural form. As a modular front-end, EMC plugs into both Video Instruction Tuning and Video Question Answering pipelines. We release the first dedicated benchmark and propose ReSimplifyIt, an EMC baseline surpassing prior methods by 0.40 F-1 with competitive query rewriting. Integrating EMC yields relative gains of 7.33% in training and 33.7% in inference for video-language understanding.
PlanBench-XL: Evaluating Long-Horizon Planning of LLM Tool-Use Agents in Large-Scale Tool Ecosystems
Jiayu Liu | Qihan Lin | Cheng Qian | Rui Wang | Emre Can Acikgoz | Xiaocheng Yang | Qing Zong | Jiateng Liu | Zhenhailong Wang | Xiusi Chen | Heng Ji | Dilek Hakkani-Tür
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Jiayu Liu | Qihan Lin | Cheng Qian | Rui Wang | Emre Can Acikgoz | Xiaocheng Yang | Qing Zong | Jiateng Liu | Zhenhailong Wang | Xiusi Chen | Heng Ji | Dilek Hakkani-Tür
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
LLM agents increasingly operate in large tool ecosystems, where real-world tasks require discovering relevant tools, inferring implicit sub-goals, and adapting to dynamic environments over long horizons. However, existing benchmarks rarely evaluate planning under retrieval-limited tool visibility. To address this gap, we introduce PlanBench-XL, an interactive benchmark of 327 retail tasks over 1,665 tools that tests whether agents can iteratively retrieve usable tools, invoke them to uncover intermediate evidence for subsequent calls toward the final goal. PlanBench-XL further features an optional blocking mechanism that simulates real-world unpredictability through missing, failing, or distracting tool functions, forcing agents to detect disrupted paths and adapt at runtime. Experiments on ten leading LLMs show that massive-tool planning remains challenging: while GPT-5.4 achieves 51.90% accuracy in block-free settings, it collapses to 11.36% under the most severe blocking condition. Further analysis shows that agents are especially vulnerable when failures lack explicit error signals or when recovery requires longer alternative tool-use paths. These results establish PlanBench-XL as a testbed for diagnosing agentic planning failures and highlight the need for robust adaptive planning in long-horizon tasks with large, imperfect tool environments.
Analyzing and Internalizing Complex Policy Documents for LLM Agents
Jiateng Liu | Zhenhailong Wang | Xiaojiang Huang | Yingjie Li | Xiang Li | Chenlei Guo | Xing Fan | Ruhi Sarikaya | Heng Ji
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Jiateng Liu | Zhenhailong Wang | Xiaojiang Huang | Yingjie Li | Xiang Li | Chenlei Guo | Xing Fan | Ruhi Sarikaya | Heng Ji
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Large language model agents rely on in-context policy documents encoding diverse business rules. As businesses scale, these documents grow, creating substantial computational overhead and motivating internalization methods that embed policy into model priors. Prior work focuses on generic prompts, but we find agentic policies span multiple complexity levels and demand heavier reasoning, posing greater challenges. We introduce an agentic benchmark generator with Controllable Complexity in agent policy across four levels, enabling systematic evaluation of agents under increasing complexity and providing a testbed for policy internalization. Our analysis shows that workflow-governing policy specifications are the hardest to reason over, and that SFT on gold trajectories with chain-of-thought is data-hungry and struggles at high complexity. We propose Category-Aware Policy Continued Pretraining, an automated pipeline that analyzes policies, extracts key specifications, categorizes them into factual, behavioral, and conditional types, and isolates those driving workflow complexity. This enables targeted “therapy” by synthesizing specialized training data for each type and improving internalization via an autoregressive pretraining loss. Extensive experiments show our synthetic data and objective consistently improve performance. Combined with SFT, our method outperforms the baseline across different settings, especially in data-sparse and high-complexity regimes, with gains up to 41% and 22% on Qwen-3-32B. Overall, we achieve 97.3% prompt reduction on our benchmark, and on 𝜏-Bench we further improve performance while reducing prompt requirements with very limited SFT data.
2025
ISACL: Internal State Analyzer for Copyrighted Training Data Leakage
Guangwei Zhang | Qisheng Su | Jiateng Liu | Cheng Qian | Yanzhou Pan | Yanjie Fu | Denghui Zhang
Findings of the Association for Computational Linguistics: EMNLP 2025
Guangwei Zhang | Qisheng Su | Jiateng Liu | Cheng Qian | Yanzhou Pan | Yanjie Fu | Denghui Zhang
Findings of the Association for Computational Linguistics: EMNLP 2025
Large Language Models (LLMs) have revolutionized Natural Language Processing (NLP) but pose risks of inadvertently exposing copyrighted or proprietary data, especially when such data is used for training but not intended for distribution. Traditional methods address these leaks only after content is generated, which can lead to the exposure of sensitive information. This study introduces a proactive approach: examining LLMs’ internal states before text generation to detect potential leaks. By using a curated dataset of copyrighted materials, we trained a neural network classifier to identify risks, allowing for early intervention by stopping the generation process or altering outputs to prevent disclosure. Integrated with a Retrieval-Augmented Generation (RAG) system, this framework ensures adherence to copyright and licensing requirements while enhancing data privacy and ethical standards. Our results show that analyzing internal states effectively mitigates the risk of copyrighted data leakage, offering a scalable solution that fits smoothly into AI workflows, ensuring compliance with copyright regulations while maintaining high-quality text generation. Large Language Models (LLMs) have revolutionized Natural Language Processing (NLP) but pose risks of inadvertently exposing copyrighted or proprietary data, especially when such data is used for training but not intended for distribution. Traditional methods address these leaks only after content is generated, which can lead to the exposure of sensitive information. This study introduces a proactive approach: examining LLMs’ internal states before text generation to detect potential leaks. By using a curated dataset of copyrighted materials, we trained a neural network classifier to identify risks, allowing for early intervention by stopping the generation process or altering outputs to prevent disclosure. Integrated with a Retrieval-Augmented Generation (RAG) system, this framework ensures adherence to copyright and licensing requirements while enhancing data privacy and ethical standards. Our results show that analyzing internal states effectively mitigates the risk of copyrighted data leakage, offering a scalable solution that fits smoothly into AI workflows, ensuring compliance with copyright regulations while maintaining high-quality text generation. Our code can be found here: (https://anonymous.4open.science/r/Internal-states-leakage-9D6E).
The Law of Knowledge Overshadowing: Towards Understanding, Predicting and Preventing LLM Hallucination
Yuji Zhang | Sha Li | Cheng Qian | Jiateng Liu | Pengfei Yu | Chi Han | Yi R. Fung | Kathleen McKeown | ChengXiang Zhai | Manling Li | Heng Ji
Findings of the Association for Computational Linguistics: ACL 2025
Yuji Zhang | Sha Li | Cheng Qian | Jiateng Liu | Pengfei Yu | Chi Han | Yi R. Fung | Kathleen McKeown | ChengXiang Zhai | Manling Li | Heng Ji
Findings of the Association for Computational Linguistics: ACL 2025
Hallucination is a persistent challenge in large language models (LLMs), where even with rigorous quality control, models often generate distorted facts. This paradox, in which error generation continues despite high-quality training data, calls for a deeper understanding of the underlying LLM mechanisms. To address it, we propose a novel concept: knowledge overshadowing, where model’s dominant knowledge can obscure less prominent knowledge during text generation, causing the model to fabricate inaccurate details. Building on this idea, we introduce a novel framework to quantify factual hallucinations by modeling knowledge overshadowing. Central to our approach is the log-linear law, which predicts that the rate of factual hallucination increases linearly with the logarithmic scale of (1) Knowledge Popularity, (2) Knowledge Length, and (3) Model Size. The law provides a means to preemptively quantify hallucinations, offering foresight into their occurrence even before model training or inference. Built on overshadowing effect, we propose a new decoding strategy CoDa, to mitigate hallucinations, which notably enhance model factuality on Overshadow (27.9%), MemoTrap (13.1%) and NQ-Swap (18.3%). Our findings not only deepen understandings of the underlying mechanisms behind hallucinations but also provide actionable insights for developing more predictable and controllable language models.
The Law of Knowledge Overshadowing: Towards Understanding, Predicting, and Preventing LLM Hallucination
Yuji Zhang | Sha Li | Cheng Qian | Jiateng Liu | Pengfei Yu | Chi Han | Yi R. Fung | Kathleen McKeown | ChengXiang Zhai | Manling Li | Heng Ji
Proceedings of the Eighth Fact Extraction and VERification Workshop (FEVER)
Yuji Zhang | Sha Li | Cheng Qian | Jiateng Liu | Pengfei Yu | Chi Han | Yi R. Fung | Kathleen McKeown | ChengXiang Zhai | Manling Li | Heng Ji
Proceedings of the Eighth Fact Extraction and VERification Workshop (FEVER)
Hallucination is a persistent challenge in large language models (LLMs), where even with rigorous quality control, models often generate distorted facts. This paradox, in which error generation continues despite high-quality training data, calls for a deeper understanding of the underlying LLM mechanisms. To address it, we propose a novel concept: knowledge overshadowing, where model’s dominant knowledge can obscure less prominent knowledge during text generation, causing the model to fabricate inaccurate details. Building on this idea, we introduce a novel framework to quantify factual hallucinations by modeling knowledge overshadowing. Central to our approach is the log-linear law, which predicts that the rate of factual hallucination increases linearly with the logarithmic scale of (1) Knowledge Popularity, (2) Knowledge Length, and (3) Model Size. The law provides a means to preemptively quantify hallucinations, offering foresight into their occurrence even before model training or inference. Built on the overshadowing effect, we propose a new decoding strategy CoDA, to mitigate hallucinations, which notably enhances model factuality on Overshadow (27.9%), MemoTrap (13.1%) and NQ-Swap (18.3%). Our findings not only deepen understandings of the underlying mechanisms behind hallucinations but also provide actionable insights for developing more predictable and controllable language models.
Rescorla-Wagner Steering of LLMs for Undesired Behaviors over Disproportionate Inappropriate Context
Rushi Wang | Jiateng Liu | Cheng Qian | Yifan Shen | Yanzhou Pan | Zhaozhuo Xu | Ahmed Abbasi | Heng Ji | Denghui Zhang
Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing
Rushi Wang | Jiateng Liu | Cheng Qian | Yifan Shen | Yanzhou Pan | Zhaozhuo Xu | Ahmed Abbasi | Heng Ji | Denghui Zhang
Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing
Incorporating external context can significantly enhance the response quality of Large Language Models (LLMs). However, real-world contexts often mix relevant information with disproportionate inappropriate content, posing reliability risks. How do LLMs process and prioritize mixed context? To study this, we introduce the Poisoned Context Testbed, pairing queries with real-world contexts containing relevant and inappropriate content. Inspired by associative learning in animals, we adapt the Rescorla-Wagner (RW) model from neuroscience to quantify how competing contextual signals influence LLM outputs. Our adapted model reveals a consistent behavioral pattern: LLMs exhibit a strong tendency to incorporate information that is less prevalent in the context. This susceptibility is harmful in real-world settings, where small amounts of inappropriate content can substantially degrade response quality. Empirical evaluations on our testbed further confirm this vulnerability. To tackle this, we introduce RW-Steering, a two-stage finetuning-based approach that enables the model to internally identify and ignore inappropriate signals. Unlike prior methods that rely on extensive supervision across diverse context mixtures, RW-Steering generalizes robustly across varying proportions of inappropriate content. Experiments show that our best fine-tuned model improves response quality by 39.8% and reverses the undesirable behavior curve, establishing RW-Steering as a robust, generalizable solution for improving LLM safety in real-world use.
PropaInsight: Toward Deeper Understanding of Propaganda in Terms of Techniques, Appeals, and Intent
Jiateng Liu | Lin Ai | Zizhou Liu | Payam Karisani | Zheng Hui | Yi Fung | Preslav Nakov | Julia Hirschberg | Heng Ji
Proceedings of the 31st International Conference on Computational Linguistics
Jiateng Liu | Lin Ai | Zizhou Liu | Payam Karisani | Zheng Hui | Yi Fung | Preslav Nakov | Julia Hirschberg | Heng Ji
Proceedings of the 31st International Conference on Computational Linguistics
Propaganda plays a critical role in shaping public opinion and fueling disinformation. While existing research primarily focuses on identifying propaganda techniques, it lacks the ability to capture the broader motives and the impacts of such content. To address these challenges, we introduce PropaInsight, a conceptual framework grounded in foundational social science research, which systematically dissects propaganda into techniques, arousal appeals, and underlying intent. PropaInsight offers a more granular understanding of how propaganda operates across different contexts. Additionally, we present PropaGaze, a novel dataset that combines human-annotated data with high-quality synthetic data generated through a meticulously designed pipeline. Our experiments show that off-the-shelf LLMs struggle with propaganda analysis, but PropaGaze significantly improves performance. Fine-tuned Llama-7B-Chat achieves 203.4% higher text span IoU in technique identification and 66.2% higher BertScore in appeal analysis compared to 1-shot GPT-4-Turbo. Moreover, PropaGaze complements limited human-annotated data in data-sparse and cross-domain scenarios, demonstrating its potential for comprehensive and generalizable propaganda analysis.
SYNTHIA: Novel Concept Design with Affordance Composition
Hyeonjeong Ha | Xiaomeng Jin | Jeonghwan Kim | Jiateng Liu | Zhenhailong Wang | Khanh Duy Nguyen | Ansel Blume | Nanyun Peng | Kai-Wei Chang | Heng Ji
Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Hyeonjeong Ha | Xiaomeng Jin | Jeonghwan Kim | Jiateng Liu | Zhenhailong Wang | Khanh Duy Nguyen | Ansel Blume | Nanyun Peng | Kai-Wei Chang | Heng Ji
Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Text-to-image (T2I) models enable rapid concept design, making them widely used in AI-driven design. While recent studies focus on generating semantic and stylistic variations of given design concepts, –the integration of multiple affordances into a single coherent concept–remains largely overlooked. In this paper, we introduce SYNTHIA, a framework for generating novel, functionally coherent designs based on desired affordances. Our approach leverages a hierarchical concept ontology that decomposes concepts into parts and affordances, serving as a crucial building block for functionally coherent design. We also develop a curriculum learning scheme based on our ontology that contrastively fine-tunes T2I models to progressively learn affordance composition while maintaining visual novelty. To elaborate, we (i) gradually increase affordance distance, guiding models from basic concept-affordance association to complex affordance compositions that integrate parts of distinct affordances into a single, coherent form, and (ii) enforce visual novelty by employing contrastive objectives to push learned representations away from existing concepts. Experimental results show that SYNTHIA outperforms state-of-the-art T2I models, demonstrating absolute gains of 25.1% and 14.7% for novelty and functional coherence in human evaluation, respectively.
2024
EVEDIT: Event-based Knowledge Editing for Deterministic Knowledge Propagation
Jiateng Liu | Pengfei Yu | Yuji Zhang | Sha Li | Zixuan Zhang | Ruhi Sarikaya | Kevin Small | Heng Ji
Proceedings of the 2024 Conference on Empirical Methods in Natural Language Processing
Jiateng Liu | Pengfei Yu | Yuji Zhang | Sha Li | Zixuan Zhang | Ruhi Sarikaya | Kevin Small | Heng Ji
Proceedings of the 2024 Conference on Empirical Methods in Natural Language Processing
The dynamic nature of real-world information necessitates knowledge editing (KE) in large language models (LLMs). The edited knowledge should propagate and facilitate the deduction of new information based on existing model knowledge. We term the existing related knowledge in LLM serving as the origination of knowledge propagation as ”deduction anchors”. However, current KE approaches, which only operate on (subject, relation, object) triple. We both theoretically and empirically observe that this simplified setting often leads to uncertainty when determining the deduction anchors, causing low confidence in their answers. To mitigate this issue, we propose a novel task of event-based knowledge editing that pairs facts with event descriptions. This task manifests not only a closer simulation of real-world editing scenarios but also a more logically sound setting, implicitly defining the deduction anchor and enabling LLMs to propagate knowledge confidently. We curate a new benchmark dataset Evedit derived from the CounterFact dataset and validate its superiority in improving model confidence. Moreover, while we observe that the event-based setting is significantly challenging for existing approaches, we propose a novel approach Self-Edit that showcases stronger performance, achieving 55.6% consistency improvement while maintaining the naturalness of generation.
2023
A Language-First Approach for Procedure Planning
Jiateng Liu | Sha Li | Zhenhailong Wang | Manling Li | Heng Ji
Findings of the Association for Computational Linguistics: ACL 2023
Jiateng Liu | Sha Li | Zhenhailong Wang | Manling Li | Heng Ji
Findings of the Association for Computational Linguistics: ACL 2023
Procedure planning, or the ability to predict a series of steps that can achieve a given goal conditioned on the current observation, is critical for building intelligent embodied agents that can assist users in everyday tasks. Encouraged by the recent success of language models (LMs) for zero-shot and few-shot planning, we hypothesize that LMs may be equipped with stronger priors for planning compared to their visual counterparts. To this end, we propose a language-first procedure planning framework with a modularized design: we first align the current and goal observations with corresponding steps and then use a pre-trained LM to predict the intermediate steps. Under this framework, we find that using an image captioning model for alignment can already match state-of-the-art performance and by designing a double retrieval model conditioned over current and goal observations jointly, we can achieve large improvements (19.2%-98.9% relatively higher success rate than state-of-the-art) on both COIN and CrossTask benchmarks. Our work verifies the planning ability of LMs and demonstrates how LMs can serve as a powerful “reasoning engine” even when the input is provided in another modality.
Search
Fix author
Co-authors
- Heng Ji 11
- Cheng Qian 5
- Yi R. Fung 4
- Manling Li 4
- Sha Li 4
- Zhenhailong Wang 4
- Yuji Zhang 4
- Pengfei Yu 3
- Chi Han 2
- Kathleen McKeown 2
- Yanzhou Pan 2
- Ruhi Sarikaya 2
- ChengXiang Zhai 2
- Denghui Zhang 2
- Ahmed Abbasi 1
- Emre Can Acikgoz 1
- Lin Ai 1
- Ansel Blume 1
- Kai-Wei Chang 1
- Xiusi Chen 1
- Yinting Chen 1
- Xing Fan 1
- Zheyu Fan 1
- Yanjie Fu 1
- Chenlei Guo 1
- Hyeonjeong Ha 1
- Dilek Hakkani-Tur 1
- Julia Hirschberg 1
- Xiaojiang Huang 1
- Zheng Hui 1
- Xiaomeng Jin 1
- Payam Karisani 1
- Jeonghwan Kim 1
- Bingxuan Li 1
- Xiang Li 1
- Yingjie Li 1
- Qihan Lin 1
- Jiayu Liu 1
- Zeyi Liu 1
- Zizhou Liu 1
- Pan Lu 1
- Tianyi Ma 1
- Preslav Nakov 1
- Khanh Duy Nguyen 1
- Nanyun Peng 1
- Yifan Shen 1
- Kevin Small 1
- Qisheng Su 1
- Xiangru Tang 1
- Rui Wang 1
- Rushi Wang 1
- Zihan Wang 1
- Zhaozhuo Xu 1
- Xiaocheng Yang 1
- Jiaxuan You 1
- Guangwei Zhang 1
- Jiaxun Zhang 1
- Weijia Zhang 1
- Zixuan Zhang 1
- Kunlun Zhu 1
- Qing Zong 1