Imbalanced Classification under Capacity Constraints

• URL: http://arxiv.org/abs/2605.03289v1
• Date: Tue, 05 May 2026 02:21:01 GMT
• Title: Imbalanced Classification under Capacity Constraints
• Abstract summary: Class of primary interest is underrepresented in classification settings, leading to imbalanced data problems.<n>We propose a framework that explicitly controls the rate of positive predictions.<n>We show that incorporating capacity constraints leads to substantial improvements over classical approaches.
• Score: 0.5156484100374058
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In many classification settings, the class of primary interest is underrepresented, leading to imbalanced data problems that arise in applications such as rare disease detection and fraud identification. In these contexts, identifying a potential positive instance typically triggers costly follow-up actions, such as medical imaging or detailed transaction inspection, which are subject to limited operational capacity. Motivated by this setting, we consider classification problems where data may arrive sequentially and decisions must be made under constraints on the number of instances that can be selected for further analysis. We propose a classification framework that explicitly controls the rate of positive predictions, enforcing a user-defined bound on the proportion of observations classified as belonging to the minority class while maximizing detection performance. The approach can be implemented using standard learning methods and naturally extends to online settings, where decisions are taken in real time. We show that incorporating capacity constraints leads to substantial improvements over classical approaches, including resampling techniques such as SMOTE, which do not directly control the selection rate.

Related papers

• Primal--Dual Alternating Neural Learning for Timely Classification with Performance Guarantees [3.6411102933459163]
  Timely risk classification is essential in many clinical monitoring settings.<n>Most existing statistical and machine-learning methods offer limited control over key operating characteristics.<n>We propose a multi-objective optimization framework targeting these three criteria.
  arXiv  Detail & Related papers  (2026-08-24T16:44:46Z)
• Explicit Uncertainty Modeling for Active CLIP Adaptation with Dual Prompt Tuning [51.99383151474742]
  We propose a robust uncertainty modeling framework for active CLIP adaptation based on dual-prompt tuning.<n>We show that our method consistently outperforms existing active learning methods under the same annotation budget.
  arXiv  Detail & Related papers  (2026-02-04T09:01:55Z)
• Set to Be Fair: Demographic Parity Constraints for Set-Valued Classification [5.085064777896467]
  We address the problem of set-valued classification under demographic parity and expected size constraints.<n>We propose two complementary strategies: an oracle-based method that minimizes classification risk while satisfying both constraints, and a computationally efficient proxy that prioritizes constraint satisfaction.
  arXiv  Detail & Related papers  (2025-10-06T15:36:45Z)
• Probing Network Decisions: Capturing Uncertainties and Unveiling Vulnerabilities Without Label Information [19.50321703079894]
  We present a novel framework to uncover the weakness of the classifier via counterfactual examples.<n>We test the performance of our prober's misclassification detection and verify its effectiveness on the image classification benchmark datasets.
  arXiv  Detail & Related papers  (2025-03-12T05:05:58Z)
• Ask for More Than Bayes Optimal: A Theory of Indecisions for Classification [0.8283940114367678]
  We provide a complete characterization of the minimax risk in selective classification.<n>We propose a finite-sample calibration method with non-asymptotic guarantees.<n>Experiments on Gaussian mixtures and real datasets confirm that small indecision proportions yield substantial accuracy gains.
  arXiv  Detail & Related papers  (2024-12-17T11:25:51Z)
• When Does Confidence-Based Cascade Deferral Suffice? [69.28314307469381]
  Cascades are a classical strategy to enable inference cost to vary adaptively across samples. A deferral rule determines whether to invoke the next classifier in the sequence, or to terminate prediction. Despite being oblivious to the structure of the cascade, confidence-based deferral often works remarkably well in practice.
  arXiv  Detail & Related papers  (2023-07-06T04:13:57Z)
• Open-Set Likelihood Maximization for Few-Shot Learning [36.97433312193586]
  We tackle the Few-Shot Open-Set Recognition (FSOSR) problem, i.e. classifying instances among a set of classes for which we only have a few labeled samples. We explore the popular transductive setting, which leverages the unlabelled query instances at inference. Motivated by the observation that existing transductive methods perform poorly in open-set scenarios, we propose a generalization of the maximum likelihood principle.
  arXiv  Detail & Related papers  (2023-01-20T01:56:19Z)
• Benchmarking common uncertainty estimation methods with histopathological images under domain shift and label noise [62.997667081978825]
  In high-risk environments, deep learning models need to be able to judge their uncertainty and reject inputs when there is a significant chance of misclassification. We conduct a rigorous evaluation of the most commonly used uncertainty and robustness methods for the classification of Whole Slide Images. We observe that ensembles of methods generally lead to better uncertainty estimates as well as an increased robustness towards domain shifts and label noise.
  arXiv  Detail & Related papers  (2023-01-03T11:34:36Z)
• Mitigating Algorithmic Bias with Limited Annotations [65.060639928772]
  When sensitive attributes are not disclosed or available, it is needed to manually annotate a small part of the training data to mitigate bias. We propose Active Penalization Of Discrimination (APOD), an interactive framework to guide the limited annotations towards maximally eliminating the effect of algorithmic bias. APOD shows comparable performance to fully annotated bias mitigation, which demonstrates that APOD could benefit real-world applications when sensitive information is limited.
  arXiv  Detail & Related papers  (2022-07-20T16:31:19Z)
• Tradeoffs in Streaming Binary Classification under Limited Inspection Resources [14.178224954581069]
  We consider an imbalanced binary classification problem, where events arrive sequentially and only a limited number of suspicious events can be inspected. We analytically characterize the tradeoff between the minority-class detection rate and the inspection capacity. We implement the selection methods on a real public fraud detection dataset and compare the empirical results with analytical bounds.
  arXiv  Detail & Related papers  (2021-10-05T23:23:11Z)
• When in Doubt: Improving Classification Performance with Alternating Normalization [57.39356691967766]
  We introduce Classification with Alternating Normalization (CAN), a non-parametric post-processing step for classification. CAN improves classification accuracy for challenging examples by re-adjusting their predicted class probability distribution. We empirically demonstrate its effectiveness across a diverse set of classification tasks.
  arXiv  Detail & Related papers  (2021-09-28T02:55:42Z)
• MCDAL: Maximum Classifier Discrepancy for Active Learning [74.73133545019877]
  Recent state-of-the-art active learning methods have mostly leveraged Generative Adversarial Networks (GAN) for sample acquisition. We propose in this paper a novel active learning framework that we call Maximum Discrepancy for Active Learning (MCDAL) In particular, we utilize two auxiliary classification layers that learn tighter decision boundaries by maximizing the discrepancies among them.
  arXiv  Detail & Related papers  (2021-07-23T06:57:08Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.