mlsanityData to 14 Oct 2026

RUBRIC: Realism--Utility Balanced Ranking for Imbalanced Classification

arXiv 2607.09816 ↗First posted 10 Jul 2026cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

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 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/τ). 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 λ and the selection budget K further characterize performance trade-offs oriented toward ranking quality.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 8 of its 38 references that are in the map. First posted on arXiv 10 Jul 2026.

Builds on

8 of 38 references.

References · 8

  1. 2018Learning Models with Uniform Performance via Distributionally Robust Optimizationcited by 335
  2. 2018BAGAN: Data Augmentation with Balancing GANcited by 90
  3. 2017Oversampling for Imbalanced Learning Based on K-Means and SMOTEcited by 38
  4. 2024MT2ST: Adaptive Multi-Task to Single-Task Learningcited by 16
  5. 2026MKA: Memory-Keyed Attention for Efficient Long-Context Reasoningcited by 6
  6. 2025HSGM: Hierarchical Segment-Graph Memory for Scalable Long-Text Semanticscited by 5
  7. 2025SemToken: Semantic-Aware Tokenization for Efficient Long-Context Language Modelingcited by 3
  8. 2025Boundary-Aware Adversarial Filtering for Reliable Diagnosis under Extreme Class Imbalancecited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.