Can We Trust LLM Detectors?
Jivnesh Sandhan, Harshit Jaiswal, Fei Cheng, Yugo Murawaki
TL;DR
The paper addresses the reliability of LLM detectors under realistic distribution shifts and unseen generators. It critiques two dominant paradigms—training-free and supervised detectors—and introduces a supervised contrastive learning framework with a DeBERTa-v3 backbone and the InfoNCE objective to learn discriminative style embeddings and enable few-shot adaptation, incorporating $L_{\mathrm{BCE}}$ and $L_{\mathrm{InfoNCE}}$. Through extensive experiments on RAID, CHEAT, and M4, it shows that while supervised detectors dominate in-domain, all methods suffer under out-of-domain conditions, and training-free methods remain brittle to proxy choices. The findings suggest that universal, domain-agnostic LLM detectors are currently infeasible, though the proposed SCL approach offers improved robustness and practical few-shot adaptation; code is available at $https://github.com/HARSHITJAIS14/DetectAI$.
Abstract
The rapid adoption of LLMs has increased the need for reliable AI text detection, yet existing detectors often fail outside controlled benchmarks. We systematically evaluate 2 dominant paradigms (training-free and supervised) and show that both are brittle under distribution shift, unseen generators, and simple stylistic perturbations. To address these limitations, we propose a supervised contrastive learning (SCL) framework that learns discriminative style embeddings. Experiments show that while supervised detectors excel in-domain, they degrade sharply out-of-domain, and training-free methods remain highly sensitive to proxy choice. Overall, our results expose fundamental challenges in building domain-agnostic detectors. Our code is available at: https://github.com/HARSHITJAIS14/DetectAI
