SyncAI.news, a Varaisys broadcasting
RUBRIC: Realism--Utility Balanced Ranking for Imbalanced Classification
YY

Yanxuan Yu, Dong Liu, Shu Wang, Wenxiao Zhao, Eric Jiang, Chang Liu, Jinxi Yu, Hui Pan, Renata Borovica-Gajic, Ben Lengerich

· 1 min read

ResearcharXiv cs.LG

RUBRIC: Realism--Utility Balanced Ranking for Imbalanced Classification

arXiv:2607.09816v4 Announce Type: replace Abstract: Class imbalance poses a fundamental challenge in risk-sensitive applications such as fraud detection and medical diagnosis, where minority-class samples are scarce yet critical for accurate classification. Existing oversampling methods generate synthetic samples to rebalance class distributions; however, they often produce large numbers of low-quality candidates that distort decision boundaries or introduce artifacts, leading to overfitting and degraded generalization. In this work, we introduce \textbf{RUBRIC}, a generator-agnostic filtering framework that formulates synthetic sample selection as a quality-over-quantity optimization problem. RUBRIC ranks candidates using a realism-utility trade-off: realism is estimated via a neural density-ratio discriminator from each candidate's resemblance to real minority samples, while utility captures proximity to the decision boundary through a concave, margin-based scoring function $g_-(t)=-\log(1+e^{-t/\tau})$. The discriminator uses the same architecture and training protocol on every benchmark and is fit independently to that dataset's real minority class versus its synthetic pool. We show that, under mild regularity conditions, the proposed filtering framework monotonically tightens the generalization bound for margin-based classifiers by jointly reducing distribution shift and suppressing near-negative tail contributions. Through extensive experiments on standard public imbalanced-classification benchmarks, we demonstrate that RUBRIC boosts minority-class recall while preserving overall discriminative ability across multiple data generators. Sensitivity analyses in $\lambda$ and the selection budget $K$ further characterize performance trade-offs oriented toward ranking quality.

Original source

This story was published by arXiv cs.LG and written by Yanxuan Yu, Dong Liu, Shu Wang, Wenxiao Zhao, Eric Jiang, Chang Liu, Jinxi Yu, Hui Pan, Renata Borovica-Gajic, Ben Lengerich. SyncAI.news shows a preview; the complete article is on the publisher's site.

Read the full story on arxiv.org

Similar News