paper-with-me

홈 › Papers

GradEscape: A Gradient-Based Evader Against AI-Generated Text Detectors

2025-06-09 · Wenlong Meng, Shuguo Fan, Chengkun Wei, Min Chen, Yuwei Li, Yuanchao Zhang, Zhikun Zhang, Wenzhi Chen

In this paper, we introduce GradEscape, the first gradient-based evader designed to attack AI-generated text (AIGT) detectors. GradEscape overcomes the undifferentiable computation problem, caused by the discrete nature of text, by introducing a novel approach to construct weighted embeddings for the detector input. It then updates the evader model parameters using feedback from victim detectors, achieving high attack success with minimal text modification. To address the issue of tokenizer mismatch between the evader and the detector, we introduce a warm-started evader method, enabling GradEscape to adapt to detectors across any language model architecture. Moreover, we employ novel tokenizer inference and model extraction techniques, facilitating effective evasion even in query-only access. We evaluate GradEscape on four datasets and three widely-used language models, benchmarking it against four state-of-the-art AIGT evaders. Experimental results demonstrate that GradEscape outperforms existing evaders in various scenarios, including with an 11B paraphrase model, while utilizing only 139M parameters. We have successfully applied GradEscape to two real-world commercial AIGT detectors. Our analysis reveals that the primary vulnerability stems from disparity in text expression styles within the training data. We also propose a potential defense strategy to mitigate the threat of AIGT evaders. We open-source our GradEscape for developing more robust AIGT detectors.

📄 PDF Abstract BibTeX arXiv:2506.08188

Code (0)

등록된 구현이 없습니다.

Tasks

BenchmarkingModel extraction

Similar Papers 제목 키워드 기반

Encirclement Guaranteed Finite-Time Capture against Unknown Evader Strategies

2026-03-16 · Dinesh Patra, Prajakta Surve, Ashish R. Hota, Shaunak D. Bopardikar arxiv

We consider a pursuit-evasion scenario involving a group of pursuers and a single evader in a two-dimensional unbounded environment. The pursuers aim to capture the evader in finite time while ensuring the evader remains…

Cooperative Evasion by Translating Targets with Variable Speeds

2021-06-19 · Shivam Bajaj, Eloy Garcia, Shaunak D. Bopardikar

We consider a problem of cooperative evasion between a single pursuer and multiple evaders in which the evaders are constrained to move in the positive Y direction. The evaders are slower than the vehicle and can choose …

Multiplayer Homicidal Chauffeur Reach-Avoid Games: A Pursuit Enclosure Function Approach

2023-11-04 · Rui Yan, Xiaoming Duan, Rui Zou, Xin He 외

This paper presents a multiplayer Homicidal Chauffeur reach-avoid differential game, which involves Dubins-car pursuers and simple-motion evaders. The goal of the pursuers is to cooperatively protect a planar convex regi…

ERP

Evader-Agnostic Team-Based Pursuit Strategies in Partially-Observable Environments

2025-11-08 · Addison Kalanther, Daniel Bostwick, Chinmay Maheshwari, Shankar Sastry arxiv

We consider a scenario where a team of two unmanned aerial vehicles (UAVs) pursue an evader UAV within an urban environment. Each agent has a limited view of their environment where buildings can occlude their field-of-v…

Reinforcement Learning

Pursuit Winning Strategies for Reach-Avoid Games with Polygonal Obstacles

2024-03-10 · Rui Yan, Shuai Mi, Xiaoming Duan, Jintao Chen 외

This paper studies a multiplayer reach-avoid differential game in the presence of general polygonal obstacles that block the players' motions. The pursuers cooperate to protect a convex region from the evaders who try to…