Jian Zhao
Author directoryOther people with similar names: Jian Zhao, Jian Zhao
Unverified author pages with similar names: Jian Zhao
2026
Understanding Training Data Attribution in RLVR: From the Perspective of Causal Inference
Chi Zhang | Jian Zhao | Wei Wang | Kai Wang | Yao Zhao | Xuelong Li
Findings of the Association for Computational Linguistics: EMNLP 2026
Chi Zhang | Jian Zhao | Wei Wang | Kai Wang | Yao Zhao | Xuelong Li
Findings of the Association for Computational Linguistics: EMNLP 2026
Training data attribution is increasingly used to filter, reweight, and prioritize rollouts in reinforcement learning with verifiable rewards (RLVR). However, these interventions often assume that individual samples, transitions, or trajectories can be attributed independently of the other data used in the same update. We show that this assumption is not merely a property of the attribution estimator, but a structural property of the training objective. We recast training data attribution as individual treatment effect estimation and use the Stable Unit Treatment Value Assumption (SUTVA) to determine when a proposed attribution unit is well-defined. This yields a simple criterion that attribution is only valid at the level where the algorithm assigns a stable contribution to that unit. Applying this criterion to RLVR, we show that the PPO objective admits trajectory-level attribution, whereas naive trajectory-only attribution is not well-defined for GRPO unless peer context is modeled. Experimental results support this distinction and provide preliminary evidence for group-level attribution under GRPO.
The Mark Fades: Adaptive Evolutionary Paraphrase-based Attack against LLM Watermarks
Yusheng Zhao | Jian Zhao | Tianle Zhang | Feng Wei | Xuelong Li
Findings of the Association for Computational Linguistics: ACL 2026
Yusheng Zhao | Jian Zhao | Tianle Zhang | Feng Wei | Xuelong Li
Findings of the Association for Computational Linguistics: ACL 2026
While LLM watermarking is essential for machine- generated content identification, existing paraphrase-based attacks struggle to balance watermark removal efficacy with text quality. We propose TSAPA, a training-free evolutionary framework that models watermark removal as a constrained multi-objective optimization problem. By leveraging genetic algorithms to navigate the Pareto front, TSAPA utilizes a Pseudo-Log-Likelihood (PLL)-guided mutation to precisely target and modify watermark-carrying tokens. Experiments on Qwen3 series (1.7B/8B/32B) across multiple watermark schemes show that TSAPA achieves over 90% attack success rate (ASR) while maintaining high text semantic fidelity, significantly outperforming baselines methods. This work exposes critical vulnerabilities in current watermarks and provides a new perspective for robust evaluation.
TraceProbe: An Execution-Based Benchmark for Diagnosing Safety Failures in LLM Agents
Yuxiang He | Jian Zhao | Yufei Liu | Yuchen Yuan | Xuelong Li
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Yuxiang He | Jian Zhao | Yufei Liu | Yuchen Yuan | Xuelong Li
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Large language model (LLM) agents increasingly act through files, tools, memory, retrieved content, and other agents, which can trigger safety failures during execution. Existing benchmarks mostly focus on endpoint outcome evaluation or model-assisted moderation of pre-constructed trajectories, leaving limited evidence about where risks enter and how they propagate. To address this issue, we introduce TraceProbe, an execution-based benchmark for agent safety diagnosis. TraceProbe places agents in executable sandbox scenarios, scores endpoint and latent rule violations based on normalized traces and structured evidence, and replays recorded tool actions for step-level risk localization. Our benchmark contains 155 scenarios across three risk-source categories: non-adversarial failures, internal authority compromise, and external attacks. Across 12 contemporary LLMs, the mean attack success rate (ASR) is 0.347, indicating substantial residual risk, especially under internal authority compromise. Our analysis also demonstrates that endpoint-safe runs can contain unsafe intermediate actions, and the actual execution paths of agents may differ from the intended hazards of the testing scenarios. The TraceProbe benchmark and our findings support a more actionable form of agent safety evaluation: beyond assessing ASR or final outcomes, evaluators can also ask what went wrong, where it occurred, and where an intervention could be placed.
Visual Attention Reasoning via Hierarchical Search and Self-Verification
Wei Cai | Jian Zhao | Yuchen Yuan | Tianle Zhang | Ming Zhu | Haichuan Tang | Xuelong Li
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Wei Cai | Jian Zhao | Yuchen Yuan | Tianle Zhang | Ming Zhu | Haichuan Tang | Xuelong Li
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Multimodal Large Language Models (MLLMs) frequently hallucinate due to their reliance on fragile, linear reasoning and weak visual grounding. We propose Visual Attention Reasoning (VAR), a reinforcement learning framework that reformulates reasoning as a hierarchical search with self-verification. VAR enforces traceable evidence grounding by generating explicit bounding boxes, guided by a novel reward function combining geometric precision and semantic sufficiency. Furthermore, it replaces linear Chain-of-Thought with a tree-search policy capable of backtracking to correct logical errors. Theoretical analysis validates the framework’s reliability, and extensive experiments demonstrate that VAR significantly outperforms state-of-the-art methods on complex hallucination and safety benchmarks.