Downloads · 30 days
25
21% of all-time downloads
dipta007/question-judge-balanced
question-judge-balanced is a text classification model from dipta007. Use it when you need a label for a piece of text. It is set up for transformers. The card lists the license as apache-2.0.
<p align="center" <a href="https://arxiv.org/abs/2605.27858v1" <img src="https://img.shields.io/badge/%F0%9F%93%84Paper-arXiv-b12a00?style=for-the-badge&labelColor=ffb300" alt="Paper" </a </p
Downloads · 30 days
25
21% of all-time downloads
All-time downloads
119
Public
Parameters
396M
792 MB on disk
Likes
0
Public
Click a slice to open those files.
.safetensors792 MB · 100%
From the Hugging Face model README
A ModernBERT-large classifier that scores whether a generated sub-question is answerable from the evidence document alone — the answerability sub-signal of DecomposeRL's joint multiplicative quality reward.
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.
| Property | Value |
|---|---|
| Model Type | ModernBertForSequenceClassification (sequence classification) |
| Base Model | answerdotai/ModernBERT-large (~400M params) |
| Training | LoRA (r=64, α=128), merged into the base before release |
| Labels | 2-way: no / yes |
| Distilled from | Qwen/Qwen3-32B judge labels |
| Dataset / config | dipta007/decomposeRL-tiny-judge · question_answerable |
| Train split | train_balanced (class-balanced); selected on macro-F1 |
| Language | English |
Provides the answerability sub-signal (R_ans) of the joint multiplicative quality reward. A question that cannot be answered from the document drives the per-question reward toward zero, discouraging the policy from asking questions the evidence cannot support (while still rewarding calibrated "I don't know" abstention).
Evidence document + candidate sub-question:
Document: {document}
Question: {question}
| Label | Name | Meaning |
|---|---|---|
0 | no | the question is not answerable from the document |
1 | yes | the question is fully answerable from the document |
import torch
from transformers import AutoModelForSequenceClassification, AutoTokenizer
repo = "dipta007/question-judge-balanced"
tokenizer = AutoTokenizer.from_pretrained(repo)
model = AutoModelForSequenceClassification.from_pretrained(repo).eval()
text = (
'Document: """A video on Facebook is spinning a conspiracy theory about the effect of the 2019 coronavirus. The nearly 50-minute video plays clips that purportedly show 2019 coronavirus victims..."""\\n'
'Question: Does the video promote conspiracy theories about the coronavirus?'
)
inputs = tokenizer(text, return_tensors="pt", truncation=True, max_length=8192)
with torch.no_grad():
logits = model(**inputs).logits
pred = int(logits.argmax(-1))
print(pred, model.config.id2label[pred])
# expected: 1 -> yes
Trained on the question_answerable config of 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).
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 (tiny-judge ablation) and the DecomposeRL-7B model for the full reward design.
@article{dipta2025decomposerl,
title={DecomposeRL: Learning to Ask Useful, Informative, and Diverse Questions for Semi-Supervised, Traceable Claim Verification},
author={Shubhashis Roy Dipta and Ankur Padia and Francis Ferraro},
year={2025},
eprint={2605.27858},
archivePrefix={arXiv},
primaryClass={cs.CL},
url={https://arxiv.org/abs/2605.27858v1},
}
Released under the Apache 2.0 License.