Zhijing Jin, Punya Pandey, ∈ {0
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Supervised fine-tuning (SFT) is the standard approach for binary classification tasks such as toxicity detection, factuality verification, and causal inference. However, SFT often performs poorly in real-world settings with label noise, class imbalance, or sparse supervision. We introduce BINARYPPO, an offline reinforcement learning large language model (LLM) framework that reformulates binary classification as a reward maximization problem. Our method leverages a variant of Proximal Policy Optimization (PPO) with a confidence-weighted reward function that penalizes uncertain or incorrect predictions, enabling the model to learn robust decision policies from static datasets without online interaction. Across eight domain-specific benchmarks and multiple models with differing architectures, BINARYPPO improves accuracy by 40-60 percentage points, reaching up to 99%, substantially outperforming supervised baselines. We provide an in-depth analysis of the role of reward shaping, advantage scaling, and policy stability in enabling this improvement. Overall, we demonstrate that confidence-based reward design provides a robust alternative to SFT for binary classification. 1
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2602.02708")
get_code_for_paper("2602.02708")
have("2602.02708")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2602.02708.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2602.02708)
Connect an agent — have() is free.