Text Classification
Transformers
Safetensors
English
modernbert
fact-verification
claim-verification
reward-model
llm-as-a-judge
distillation
decomposition
faithfulness
answer-verification
text-embeddings-inference
Instructions to use dipta007/answer-judge-balanced with libraries, inference providers, notebooks, and local apps. Follow these links to get started.
- Libraries
- Transformers
How to use dipta007/answer-judge-balanced with Transformers:
# Use a pipeline as a high-level helper from transformers import pipeline pipe = pipeline("text-classification", model="dipta007/answer-judge-balanced")# Load model directly from transformers import AutoTokenizer, AutoModelForSequenceClassification tokenizer = AutoTokenizer.from_pretrained("dipta007/answer-judge-balanced") model = AutoModelForSequenceClassification.from_pretrained("dipta007/answer-judge-balanced") - Notebooks
- Google Colab
- Kaggle
Add full model card (description, arXiv, citation, usage, training)
#2
by dipta007 - opened
README.md
CHANGED
|
@@ -1,199 +1,129 @@
|
|
| 1 |
---
|
| 2 |
library_name: transformers
|
| 3 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 4 |
---
|
| 5 |
|
| 6 |
-
#
|
| 7 |
|
| 8 |
-
<
|
|
|
|
|
|
|
|
|
|
|
|
|
| 9 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 10 |
|
|
|
|
| 11 |
|
| 12 |
-
|
| 13 |
|
| 14 |
-
##
|
| 15 |
|
| 16 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 17 |
|
| 18 |
-
|
| 19 |
|
| 20 |
-
|
| 21 |
-
- **Funded by [optional]:** [More Information Needed]
|
| 22 |
-
- **Shared by [optional]:** [More Information Needed]
|
| 23 |
-
- **Model type:** [More Information Needed]
|
| 24 |
-
- **Language(s) (NLP):** [More Information Needed]
|
| 25 |
-
- **License:** [More Information Needed]
|
| 26 |
-
- **Finetuned from model [optional]:** [More Information Needed]
|
| 27 |
|
| 28 |
-
###
|
| 29 |
|
| 30 |
-
|
| 31 |
|
| 32 |
-
|
| 33 |
-
|
| 34 |
-
|
|
|
|
|
|
|
| 35 |
|
| 36 |
-
##
|
| 37 |
|
| 38 |
-
|
|
|
|
|
|
|
|
|
|
| 39 |
|
| 40 |
-
##
|
| 41 |
|
| 42 |
-
|
|
|
|
|
|
|
| 43 |
|
| 44 |
-
|
|
|
|
|
|
|
| 45 |
|
| 46 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 47 |
|
| 48 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 49 |
|
| 50 |
-
|
| 51 |
|
| 52 |
-
|
| 53 |
|
| 54 |
-
|
| 55 |
|
| 56 |
-
[
|
| 57 |
|
| 58 |
-
##
|
| 59 |
|
| 60 |
-
|
|
|
|
| 61 |
|
| 62 |
-
|
| 63 |
|
| 64 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 65 |
|
| 66 |
-
|
| 67 |
|
| 68 |
-
|
| 69 |
-
|
| 70 |
-
## How to Get Started with the Model
|
| 71 |
-
|
| 72 |
-
Use the code below to get started with the model.
|
| 73 |
-
|
| 74 |
-
[More Information Needed]
|
| 75 |
-
|
| 76 |
-
## Training Details
|
| 77 |
-
|
| 78 |
-
### Training Data
|
| 79 |
-
|
| 80 |
-
<!-- This should link to a Dataset Card, perhaps with a short stub of information on what the training data is all about as well as documentation related to data pre-processing or additional filtering. -->
|
| 81 |
-
|
| 82 |
-
[More Information Needed]
|
| 83 |
-
|
| 84 |
-
### Training Procedure
|
| 85 |
-
|
| 86 |
-
<!-- This relates heavily to the Technical Specifications. Content here should link to that section when it is relevant to the training procedure. -->
|
| 87 |
-
|
| 88 |
-
#### Preprocessing [optional]
|
| 89 |
-
|
| 90 |
-
[More Information Needed]
|
| 91 |
-
|
| 92 |
-
|
| 93 |
-
#### Training Hyperparameters
|
| 94 |
-
|
| 95 |
-
- **Training regime:** [More Information Needed] <!--fp32, fp16 mixed precision, bf16 mixed precision, bf16 non-mixed precision, fp16 non-mixed precision, fp8 mixed precision -->
|
| 96 |
-
|
| 97 |
-
#### Speeds, Sizes, Times [optional]
|
| 98 |
-
|
| 99 |
-
<!-- This section provides information about throughput, start/end time, checkpoint size if relevant, etc. -->
|
| 100 |
-
|
| 101 |
-
[More Information Needed]
|
| 102 |
-
|
| 103 |
-
## Evaluation
|
| 104 |
-
|
| 105 |
-
<!-- This section describes the evaluation protocols and provides the results. -->
|
| 106 |
-
|
| 107 |
-
### Testing Data, Factors & Metrics
|
| 108 |
-
|
| 109 |
-
#### Testing Data
|
| 110 |
-
|
| 111 |
-
<!-- This should link to a Dataset Card if possible. -->
|
| 112 |
-
|
| 113 |
-
[More Information Needed]
|
| 114 |
-
|
| 115 |
-
#### Factors
|
| 116 |
-
|
| 117 |
-
<!-- These are the things the evaluation is disaggregating by, e.g., subpopulations or domains. -->
|
| 118 |
-
|
| 119 |
-
[More Information Needed]
|
| 120 |
-
|
| 121 |
-
#### Metrics
|
| 122 |
-
|
| 123 |
-
<!-- These are the evaluation metrics being used, ideally with a description of why. -->
|
| 124 |
-
|
| 125 |
-
[More Information Needed]
|
| 126 |
-
|
| 127 |
-
### Results
|
| 128 |
-
|
| 129 |
-
[More Information Needed]
|
| 130 |
-
|
| 131 |
-
#### Summary
|
| 132 |
-
|
| 133 |
-
|
| 134 |
-
|
| 135 |
-
## Model Examination [optional]
|
| 136 |
-
|
| 137 |
-
<!-- Relevant interpretability work for the model goes here -->
|
| 138 |
-
|
| 139 |
-
[More Information Needed]
|
| 140 |
-
|
| 141 |
-
## Environmental Impact
|
| 142 |
-
|
| 143 |
-
<!-- Total emissions (in grams of CO2eq) and additional considerations, such as electricity usage, go here. Edit the suggested text below accordingly -->
|
| 144 |
-
|
| 145 |
-
Carbon emissions can be estimated using the [Machine Learning Impact calculator](https://mlco2.github.io/impact#compute) presented in [Lacoste et al. (2019)](https://arxiv.org/abs/1910.09700).
|
| 146 |
-
|
| 147 |
-
- **Hardware Type:** [More Information Needed]
|
| 148 |
-
- **Hours used:** [More Information Needed]
|
| 149 |
-
- **Cloud Provider:** [More Information Needed]
|
| 150 |
-
- **Compute Region:** [More Information Needed]
|
| 151 |
-
- **Carbon Emitted:** [More Information Needed]
|
| 152 |
-
|
| 153 |
-
## Technical Specifications [optional]
|
| 154 |
-
|
| 155 |
-
### Model Architecture and Objective
|
| 156 |
-
|
| 157 |
-
[More Information Needed]
|
| 158 |
-
|
| 159 |
-
### Compute Infrastructure
|
| 160 |
-
|
| 161 |
-
[More Information Needed]
|
| 162 |
-
|
| 163 |
-
#### Hardware
|
| 164 |
-
|
| 165 |
-
[More Information Needed]
|
| 166 |
-
|
| 167 |
-
#### Software
|
| 168 |
-
|
| 169 |
-
[More Information Needed]
|
| 170 |
-
|
| 171 |
-
## Citation [optional]
|
| 172 |
-
|
| 173 |
-
<!-- If there is a paper or blog post introducing the model, the APA and Bibtex information for that should go in this section. -->
|
| 174 |
-
|
| 175 |
-
**BibTeX:**
|
| 176 |
-
|
| 177 |
-
[More Information Needed]
|
| 178 |
-
|
| 179 |
-
**APA:**
|
| 180 |
-
|
| 181 |
-
[More Information Needed]
|
| 182 |
-
|
| 183 |
-
## Glossary [optional]
|
| 184 |
-
|
| 185 |
-
<!-- If relevant, include terms and calculations in this section that can help readers understand the model or model card. -->
|
| 186 |
-
|
| 187 |
-
[More Information Needed]
|
| 188 |
-
|
| 189 |
-
## More Information [optional]
|
| 190 |
-
|
| 191 |
-
[More Information Needed]
|
| 192 |
-
|
| 193 |
-
## Model Card Authors [optional]
|
| 194 |
-
|
| 195 |
-
[More Information Needed]
|
| 196 |
-
|
| 197 |
-
## Model Card Contact
|
| 198 |
-
|
| 199 |
-
[More Information Needed]
|
|
|
|
| 1 |
---
|
| 2 |
library_name: transformers
|
| 3 |
+
license: apache-2.0
|
| 4 |
+
base_model: answerdotai/ModernBERT-large
|
| 5 |
+
pipeline_tag: text-classification
|
| 6 |
+
language:
|
| 7 |
+
- en
|
| 8 |
+
datasets:
|
| 9 |
+
- dipta007/decomposeRL-tiny-judge
|
| 10 |
+
tags:
|
| 11 |
+
- fact-verification
|
| 12 |
+
- claim-verification
|
| 13 |
+
- reward-model
|
| 14 |
+
- llm-as-a-judge
|
| 15 |
+
- distillation
|
| 16 |
+
- modernbert
|
| 17 |
+
- text-classification
|
| 18 |
+
- decomposition
|
| 19 |
+
- faithfulness
|
| 20 |
+
- answer-verification
|
| 21 |
---
|
| 22 |
|
| 23 |
+
# DecomposeRL Tiny-Judge: Answer Correctness Judge
|
| 24 |
|
| 25 |
+
<p align="center">
|
| 26 |
+
<a href="https://arxiv.org/abs/2605.27858v1">
|
| 27 |
+
<img src="https://img.shields.io/badge/%F0%9F%93%84_Paper-arXiv-b12a00?style=for-the-badge&labelColor=ffb300" alt="Paper">
|
| 28 |
+
</a>
|
| 29 |
+
</p>
|
| 30 |
|
| 31 |
+
[](https://arxiv.org/abs/2605.27858v1)
|
| 32 |
+
[](https://dipta007.github.io/DecomposeRL/)
|
| 33 |
+
[](https://huggingface.co/datasets/dipta007/decomposeRL-tiny-judge)
|
| 34 |
+
[](https://huggingface.co/collections/dipta007/decomposerl)
|
| 35 |
+
[](https://github.com/dipta007/DecomposeRL)
|
| 36 |
|
| 37 |
+
A ModernBERT-large classifier that scores whether an answer is **faithful to the evidence document** (no contradictions, no extrinsic information) — the **answer correctness** sub-signal of DecomposeRL's joint multiplicative quality reward.
|
| 38 |
|
| 39 |
+
It is part of the **DecomposeRL tiny-judge stack** — eight task-specific LoRA classifier heads on a shared `ModernBERT-large` backbone that *distill* a `Qwen3-32B` LLM judge into small, fast reward models. Swapping the 32B judge for this ~400M-parameter stack cuts GRPO judge compute by ~80% (240 → 48 GPU-hours) while retaining ~99% of in-domain accuracy.
|
| 40 |
|
| 41 |
+
## Model Overview
|
| 42 |
|
| 43 |
+
| Property | Value |
|
| 44 |
+
|----------|-------|
|
| 45 |
+
| **Model Type** | `ModernBertForSequenceClassification` (sequence classification) |
|
| 46 |
+
| **Base Model** | `answerdotai/ModernBERT-large` (~400M params) |
|
| 47 |
+
| **Training** | LoRA (r=64, α=128), merged into the base before release |
|
| 48 |
+
| **Labels** | 2-way: `no` / `yes` |
|
| 49 |
+
| **Distilled from** | `Qwen/Qwen3-32B` judge labels |
|
| 50 |
+
| **Dataset / config** | [`dipta007/decomposeRL-tiny-judge`](https://huggingface.co/datasets/dipta007/decomposeRL-tiny-judge) · `answer_correctness` |
|
| 51 |
+
| **Train split** | `train_balanced` (class-balanced); selected on macro-F1 |
|
| 52 |
+
| **Language** | English |
|
| 53 |
|
| 54 |
+
## What it judges
|
| 55 |
|
| 56 |
+
Provides the **answer correctness** sub-signal (`R_corr`) of the joint multiplicative quality reward. For honest abstentions (*"I don't know"*) this factor is dropped so the question is scored on answerability and atomicity alone.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 57 |
|
| 58 |
+
### Input format
|
| 59 |
|
| 60 |
+
Evidence document + sub-question + the policy's answer:
|
| 61 |
|
| 62 |
+
```
|
| 63 |
+
Document: {document}
|
| 64 |
+
Question: {question}
|
| 65 |
+
Answer: {answer}
|
| 66 |
+
```
|
| 67 |
|
| 68 |
+
### Label space
|
| 69 |
|
| 70 |
+
| Label | Name | Meaning |
|
| 71 |
+
|------:|------|---------|
|
| 72 |
+
| `0` | `no` | the answer contradicts the document or adds information not grounded in it |
|
| 73 |
+
| `1` | `yes` | the answer is faithful to the document |
|
| 74 |
|
| 75 |
+
## Quickstart
|
| 76 |
|
| 77 |
+
```python
|
| 78 |
+
import torch
|
| 79 |
+
from transformers import AutoModelForSequenceClassification, AutoTokenizer
|
| 80 |
|
| 81 |
+
repo = "dipta007/answer-judge-balanced"
|
| 82 |
+
tokenizer = AutoTokenizer.from_pretrained(repo)
|
| 83 |
+
model = AutoModelForSequenceClassification.from_pretrained(repo).eval()
|
| 84 |
|
| 85 |
+
text = (
|
| 86 |
+
'Document: ## Managerial career\\n'
|
| 87 |
+
'He brought along Rube Foster and a number of American black players, but the team lost five of its first six games, and White and most of his players were released...\\n'
|
| 88 |
+
'Question: How many of its first six games did the team lose?\\n'
|
| 89 |
+
'Answer: The team won five of its first six games.'
|
| 90 |
+
)
|
| 91 |
|
| 92 |
+
inputs = tokenizer(text, return_tensors="pt", truncation=True, max_length=8192)
|
| 93 |
+
with torch.no_grad():
|
| 94 |
+
logits = model(**inputs).logits
|
| 95 |
+
pred = int(logits.argmax(-1))
|
| 96 |
+
print(pred, model.config.id2label[pred])
|
| 97 |
+
# expected: 0 -> no
|
| 98 |
+
```
|
| 99 |
|
| 100 |
+
## Training Data
|
| 101 |
|
| 102 |
+
Trained on the `answer_correctness` config of [`dipta007/decomposeRL-tiny-judge`](https://huggingface.co/datasets/dipta007/decomposeRL-tiny-judge), whose labels are distilled from `Qwen3-32B` judge calls made during DecomposeRL reward computation. The model is fine-tuned with LoRA on the class-balanced `train_balanced` split, validated on the natural `validation` split, and the best checkpoint is chosen by macro-F1. LoRA adapters are merged into the backbone before release, so the model loads with a plain `from_pretrained` (no PEFT required).
|
| 103 |
|
| 104 |
+
## Role in DecomposeRL
|
| 105 |
|
| 106 |
+
DecomposeRL trains a claim-verification policy with GRPO over a seven-reward ensemble. Five of those rewards are scored by an LLM judge, which dominates training-time GPU cost. The tiny-judge stack replaces that 32B judge with eight small distilled heads so reward scoring runs on the same single GPU as training. See the [paper](https://arxiv.org/abs/2605.27858v1) (tiny-judge ablation) and the [DecomposeRL-7B model](https://huggingface.co/dipta007/decomposeRL-7b) for the full reward design.
|
| 107 |
|
| 108 |
+
## Intended Use
|
| 109 |
|
| 110 |
+
- **In-scope**: serving as a fast reward / scoring model inside the DecomposeRL training loop, or as a standalone classifier for the specific judgment above on claim-decomposition traces.
|
| 111 |
+
- **Out-of-scope**: general-purpose fact-checking, use on inputs that do not follow the input format above, or as a standalone end-to-end claim verifier (use [DecomposeRL-7B](https://huggingface.co/dipta007/decomposeRL-7b) for that).
|
| 112 |
|
| 113 |
+
## Citation
|
| 114 |
|
| 115 |
+
```bibtex
|
| 116 |
+
@article{dipta2025decomposerl,
|
| 117 |
+
title={DecomposeRL: Learning to Ask Useful, Informative, and Diverse Questions for Semi-Supervised, Traceable Claim Verification},
|
| 118 |
+
author={Shubhashis Roy Dipta and Ankur Padia and Francis Ferraro},
|
| 119 |
+
year={2025},
|
| 120 |
+
eprint={2605.27858},
|
| 121 |
+
archivePrefix={arXiv},
|
| 122 |
+
primaryClass={cs.CL},
|
| 123 |
+
url={https://arxiv.org/abs/2605.27858v1},
|
| 124 |
+
}
|
| 125 |
+
```
|
| 126 |
|
| 127 |
+
## License
|
| 128 |
|
| 129 |
+
Released under the Apache 2.0 License.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|