Model card: DeBERTa-ConPara naming, conpara API, links
Browse files
README.md
CHANGED
|
@@ -11,9 +11,9 @@ tags:
|
|
| 11 |
pipeline_tag: text-classification
|
| 12 |
---
|
| 13 |
|
| 14 |
-
#
|
| 15 |
|
| 16 |
-
|
| 17 |
adversarial edits that defeat most detectors: homoglyph substitution, zero-width
|
| 18 |
character insertion, whitespace and typographic attacks.
|
| 19 |
|
|
@@ -21,11 +21,11 @@ It is the system reported in our AACL-IJCNLP 2026 main-conference paper. The
|
|
| 21 |
finding behind it: normalising the **training** corpus deduplicates it — 35.4% of
|
| 22 |
RAID rows collapse into byte-identical copies of their clean siblings, deleting
|
| 23 |
the adversarial supervision — while normalising at **inference** is an effective
|
| 24 |
-
defence.
|
| 25 |
|
| 26 |
- **Architecture:** DeBERTa-v3-large → CLS token → Linear(1024, 512) → GELU →
|
| 27 |
Dropout(0.1) → Linear(512, 2). No feature branch.
|
| 28 |
-
- **Training data:** 1.
|
| 29 |
HC3 Plus, MAGE and M4, grouped by source id.
|
| 30 |
- **Output:** logit margin, `logit[AI] − logit[human]`. Higher is more
|
| 31 |
machine-like. Not a probability.
|
|
@@ -40,9 +40,9 @@ validation split and held fixed: HC3-QA 99.69, HC3-SI 83.50, MAGE 96.23,
|
|
| 40 |
M4 98.27.
|
| 41 |
|
| 42 |
The README of the [GitHub repository](https://github.com/MohamedMady19/deberta-conpara)
|
| 43 |
-
compares
|
| 44 |
-
and states the two caveats those numbers need: MELD scores higher than
|
| 45 |
-
on RAID itself, and HC3/MAGE/M4 are training sources for
|
| 46 |
external data for the other systems.
|
| 47 |
|
| 48 |
## Usage
|
|
@@ -52,9 +52,9 @@ not load through `AutoModelForSequenceClassification`. Use the loader from the
|
|
| 52 |
repository:
|
| 53 |
|
| 54 |
```python
|
| 55 |
-
from src.
|
| 56 |
|
| 57 |
-
det =
|
| 58 |
det.score(["a document to check"]) # logit margin
|
| 59 |
det.predict(["a document to check"]) # bool at the stored threshold
|
| 60 |
```
|
|
@@ -91,7 +91,7 @@ reproducible from `evaluation/`.
|
|
| 91 |
## Citation
|
| 92 |
|
| 93 |
```bibtex
|
| 94 |
-
@inproceedings{
|
| 95 |
title = {Where You Normalise Matters: Unicode Preprocessing and the
|
| 96 |
Robustness of AI-Generated Text Detection},
|
| 97 |
author = {Mady, Mohamed and Li, Yupei and Reschke, Johannes and Schuller, Bj\"orn W.},
|
|
@@ -102,3 +102,9 @@ reproducible from `evaluation/`.
|
|
| 102 |
```
|
| 103 |
|
| 104 |
License: MIT, matching the DeBERTa-v3-large backbone.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 11 |
pipeline_tag: text-classification
|
| 12 |
---
|
| 13 |
|
| 14 |
+
# DeBERTa-ConPara
|
| 15 |
|
| 16 |
+
DeBERTa-ConPara detects machine-generated English text and stays accurate under the
|
| 17 |
adversarial edits that defeat most detectors: homoglyph substitution, zero-width
|
| 18 |
character insertion, whitespace and typographic attacks.
|
| 19 |
|
|
|
|
| 21 |
finding behind it: normalising the **training** corpus deduplicates it — 35.4% of
|
| 22 |
RAID rows collapse into byte-identical copies of their clean siblings, deleting
|
| 23 |
the adversarial supervision — while normalising at **inference** is an effective
|
| 24 |
+
defence. DeBERTa-ConPara trains on raw text and normalises only at inference.
|
| 25 |
|
| 26 |
- **Architecture:** DeBERTa-v3-large → CLS token → Linear(1024, 512) → GELU →
|
| 27 |
Dropout(0.1) → Linear(512, 2). No feature branch.
|
| 28 |
+
- **Training data:** 1.55M documents, leakage-free stratified splits over RAID,
|
| 29 |
HC3 Plus, MAGE and M4, grouped by source id.
|
| 30 |
- **Output:** logit margin, `logit[AI] − logit[human]`. Higher is more
|
| 31 |
machine-like. Not a probability.
|
|
|
|
| 40 |
M4 98.27.
|
| 41 |
|
| 42 |
The README of the [GitHub repository](https://github.com/MohamedMady19/deberta-conpara)
|
| 43 |
+
compares DeBERTa-ConPara with every RAID leaderboard system that publishes a checkpoint,
|
| 44 |
+
and states the two caveats those numbers need: MELD scores higher than DeBERTa-ConPara
|
| 45 |
+
on RAID itself, and HC3/MAGE/M4 are training sources for DeBERTa-ConPara while being
|
| 46 |
external data for the other systems.
|
| 47 |
|
| 48 |
## Usage
|
|
|
|
| 52 |
repository:
|
| 53 |
|
| 54 |
```python
|
| 55 |
+
from src.conpara import ConPara # pip install -r requirements.txt
|
| 56 |
|
| 57 |
+
det = ConPara.from_pretrained() # pulls rawguard.pt from this repo
|
| 58 |
det.score(["a document to check"]) # logit margin
|
| 59 |
det.predict(["a document to check"]) # bool at the stored threshold
|
| 60 |
```
|
|
|
|
| 91 |
## Citation
|
| 92 |
|
| 93 |
```bibtex
|
| 94 |
+
@inproceedings{mady2026conpara,
|
| 95 |
title = {Where You Normalise Matters: Unicode Preprocessing and the
|
| 96 |
Robustness of AI-Generated Text Detection},
|
| 97 |
author = {Mady, Mohamed and Li, Yupei and Reschke, Johannes and Schuller, Bj\"orn W.},
|
|
|
|
| 102 |
```
|
| 103 |
|
| 104 |
License: MIT, matching the DeBERTa-v3-large backbone.
|
| 105 |
+
|
| 106 |
+
## Links
|
| 107 |
+
|
| 108 |
+
- Code and evaluation scripts: https://github.com/MohamedMady19/deberta-conpara
|
| 109 |
+
- Live demo: https://huggingface.co/spaces/mohamedmady/deberta-conpara
|
| 110 |
+
- Paper: "DeBERTa-ConPara: Attack-Aware and Deployment-Realistic Detection of AI-Generated Text", AACL-IJCNLP 2026 (arXiv link to follow)
|