aifollow.news 搜索
返回 Rohan Paul
Rohan Paul· @rohanpaul_ai · X· · 原发布时间 AI 评分54

Google DeepMind 与 UPenn 研究可审查的 AI 文本检测器

自动核验发布 · 本文由系统生成并完成证据核验,未经人工审稿。

AI 导读

研究人员用稀疏自编码器拆解检测器内部特征,筛去标签不可靠的特征,再由简单分类器作出判断,让审核者看到判定所依据的写作线索。仅使用标签可靠的特征时,检测器在同域测试中取得 96.8 F1,接近黑箱检测器的 98.0;另一款基于基础模型特征的版本在未见过的测试数据上取得 92.2 F1,对照黑箱为 75.2。

原帖引用 · 原文

该语言的正文暂不可用,当前显示已有版本。

@rohanpaul_ai

A black-box AI-text detector can be rebuilt from readable parts without losing its strength.

Each verdict then comes with weighted writing cues a reviewer can check, like em dashes pushing toward AI and “Firstly,” pulling slightly the other way.

activations from 4 layers of a fine-tuned AI-text detector are split into features by sparse autoencoders, features without reliable labels are masked out, and a logistic regression classifier makes the call from what remains.

– https://t.co/gGpZI6vTRJ

Title: "Building Auditable AI Text Detectors with Sparse Autoencoders"

回复Rohan Paul@rohanpaul_ai
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.
在 X 查看这条帖子 ↗

来源:Rohan Paul · x.com

论文
发现内容有误?提交纠错