atlas

Research map / Large language models / Language, safety and interpretability

DETree: DEtecting Human-AI Collaborative Texts via Tree-Structured Hierarchical Representation Learning

NeurIPS 2025 · Large language models › Language, safety and interpretability · approach: Zero-shot machine-text detection · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes DETree, which models human-AI collaborative text generation processes as a Hierarchical Affinity Tree trained with a tree-structured contrastive loss on RoBERTa-large, plus a new hybrid-text benchmark RealBench, with retrieval-based few-shot adaptation for OOD detection.

Problem

Detecting AI-involved text produced by diverse human-AI collaborative processes (AI-edited human text, human-edited AI text, multi-LLM refinement) is poorly handled by binary or flat multi-class detectors, which generalize poorly to new LLMs and out-of-distribution domains.

Approach

Build a hierarchical affinity tree over generation-source categories from the inter-class similarity matrix (agglomerative clustering plus silhouette-based subtree reorganization with predefined human/AI priors), then train the encoder with a tree-structured contrastive loss that makes closer tree relatives more similar than distant ones; at inference use K-means-compressed kNN retrieval with few-

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Add the prior1 structure, placing hybrid texts under AI-generated content (ablation)DETree · Supervised averageF1: 97.49 -> 97.75Helped
Place hybrid texts under human-written texts instead of using prior1 (ablation)DETree · Supervised averageF1: 97.75 -> 96.03Hurt
Remove Tree-Structured Contrastive Loss (ablation)DETree · Supervised averageF1: 97.75 -> 96.32Hurt
Set the maximum HAT depth to 6 rather than 3 (ablation)DETree · MAGEF1: 96.48 -> 96.96Helped
Increase maximum HAT depth from 6 to 9 (ablation)DETree · MAGEF1: 96.96 -> 96.84Hurt
Add target-domain support samples to rebuild the retrieval databaseDETree · OOD benchmarksAUROC: +15.55 on MAGE-Paraphrase; +7.94 on DetectRL; +10.39/+15.01 on BeemoHelped
Use a 10K-representative compressed RealBench retrieval databaseDETree · RealBench database compressiondetection accuracyHelped
Train with adversarial samplesDETree · Attack-augmented MAGE test setTPR@5% FPRHelped
Train using only 10% of the full category set (ablation)DETree · MAGETPR@5% FPR: within 3%Hurt

Surprising findings

Limitations

Experimental setup

Datasets: MAGE M4 TuringBench OUTFOX RAID RealBench

Benchmarks: MAGE M4 TuringBench DetectRL Beemo HART RAID

Metrics: F1 AvgRec AUC-ROC AUROC TPR@5% FPR

Baselines: Fast-DetectGPT Binoculars Glimpse HART UAR SCL MAGE T5-Sentinel DeTeCTive RADAR RoBERTa-Base

Builds on: supervised contrastive learning agglomerative hierarchical clustering HART Fast-DetectGPT

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy