Skip to content
View original post on X: Rohan Paul
Published
65/100

Google DeepMind and UPenn build AI-text detector with readable, auditable features

AIResearchers from Google DeepMind and the University of Pennsylvania trained sparse autoencoders on a Gemma-2-2B detector, labeled its features, and kept only those whose labels predicted behavior well. The resulting detector scored 96.8 F1 in-domain against 98.0 for the black box, and 92.2 F1 on unseen data against 75.2 for the black box.
Rohan PaulVerified on X
@rohanpaul_ai
View on X

New Google DeepMind + UPenn paper shows that an AI-text detector can explain its verdicts with readable writing features and still match a black-box detector.

suggests that anyone deploying AI-text detectors should be able to read and remove the specific cues a detector relies on.

The best AI-text detectors are black-box classifiers, yet they flag student essays and peer reviews. Readable stylometric detectors exist but trail them by wide margins.

They trained sparse autoencoders on a Gemma-2-2B detector's internals to split its activity into features, then had an LLM label each one. They kept only features whose labels predicted their behavior well and fed those into a simple classifier.

With only well-labeled features, the detector kept 96.8 F1 in-domain, close to the black box's 98.0. On unseen test data, a version built on base-model features scored 92.2 F1 against 75.2 for the black box.

If your detector's decisions affect people, build it on labeled features so reviewers can see and drop cues they consider unfair.

Source details

Rohan Paul · x.comPublished · added here

Original title: New Google DeepMind + UPenn paper shows that an AI-text detector can explain its verdicts with readable writing features and still match ...