Large Classification-Risk-Optional Label Acquisition

• URL: http://arxiv.org/abs/2609.06873v1
• Date: Sun, 06 Sep 2026 23:31:55 GMT
• Title: Large Classification-Risk-Optional Label Acquisition
• Abstract summary: We study how a limited labeling budget should be allocated to minimize multiclass zero-one classification risk.<n>We develop a two-stage adaptive procedure that attains the oracle leading-risk criterion under regularity conditions.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We study how a limited labeling budget should be allocated to minimize multiclass zero-one classification risk. We consider parametric classification problems in which features are observed for all sampling units while class labels can be acquired selectively. By combining the Fisher information supplied by an acquired label with the local geometry of multiclass excess risk, we derive an acquisition criterion that minimizes the leading asymptotic coefficient of expected multiclass excess risk. The resulting rule values a label according to how strongly its information is aligned with parameter directions that perturb the active Bayes decision boundary, rather than according to posterior uncertainty or global parameter information alone. We characterize the oracle acquisition design, establish its threshold structure, and derive face-specific and cost-sensitive extensions. An analytic example shows that posterior uncertainty and classification value can produce different, and even reversed, acquisition rankings. We further develop a two-stage adaptive procedure that attains the oracle leading-risk criterion under regularity conditions and provide explicit results for Gaussian discriminant analysis. Three-class QDA experiments illustrate the resulting acquisition geometry, while an application to the six-class Statlog Landsat Satellite data shows that classification-risk acquisition can differ materially from both uncertainty-based acquisition and the complete-classification-information comparator. The adaptive classification-risk design attains lower mean error than this Fisher comparator across the labeling budgets considered, although it does not uniformly outperform entropy or margin sampling and differences among the targeted strategies become small as the labeling budget increases.

Related papers

• Informative Label Missingness in Multiclass Classification Information Geometry and Excess Risk [0.0]
  We develop a general likelihood-based theory for the phenomenon in parametric multiclass classification.<n>An efficient-information decomposition separates information lost through unavailable class memberships from information contributed by the missing-label mechanism.<n>Near missing completely at random, with the marginal missing-label proportion fixed, redistribution of missing labels changes lost class-label information at first order, whereas efficient information from the missingness pattern appears only at second order.
  arXiv  Detail & Related papers  (2026-08-31T10:37:49Z)
• Fairness in multi-class multi-group classification problems via contextial coherent risk measures [0.42970700836450487]
  We propose a new design of fair classifiers for multi-class classification problems in the presence of vector-valued sensitive attributes.<n>We demonstrate the advantages of the proposed framework in comparison to the support-vector machine framework and other methods handling fairness.
  arXiv  Detail & Related papers  (2026-08-31T04:11:21Z)
• Risk-Consistent Multiclass Learning from Random Label-Subset Membership Queries [23.692455958661668]
  This paper proposes a multiclass learn ing framework under random label-subset queries.<n>We derive an unbiased estimator of the target risk under the empirical risk minimization (ERM) framework.<n>To address negative empirical risk and the associated overfitting problem, we introduce corrected risk estimators based on non-negative and absolute-value corrections.
  arXiv  Detail & Related papers  (2026-05-08T08:05:02Z)
• Rethinking Consistent Multi-Label Classification under Inexact Supervision [60.79309683889278]
  In partial multi-label learning, each instance is annotated with a candidate label set, among which only some labels are relevant.<n>In complementary multi-label learning, each instance is annotated with complementary labels indicating the classes to which the instance does not belong.
  arXiv  Detail & Related papers  (2025-10-05T08:30:32Z)
• Stochastic Linear Bandits with Latent Heterogeneity [8.981251210938787]
  We propose a novel latent heterogeneous bandit framework that explicitly models this unobserved heterogeneity in customer responses.<n>Our methodology introduces an innovative algorithm that simultaneously learns latent group memberships and group-specific reward functions.
  arXiv  Detail & Related papers  (2025-02-01T13:02:21Z)
• Learning with Complementary Labels Revisited: The Selected-Completely-at-Random Setting Is More Practical [66.57396042747706]
  Complementary-label learning is a weakly supervised learning problem. We propose a consistent approach that does not rely on the uniform distribution assumption. We find that complementary-label learning can be expressed as a set of negative-unlabeled binary classification problems.
  arXiv  Detail & Related papers  (2023-11-27T02:59:17Z)
• Self-Certifying Classification by Linearized Deep Assignment [65.0100925582087]
  We propose a novel class of deep predictors for classifying metric data on graphs within PAC-Bayes risk certification paradigm. Building on the recent PAC-Bayes literature and data-dependent priors, this approach enables learning posterior distributions on the hypothesis space.
  arXiv  Detail & Related papers  (2022-01-26T19:59:14Z)
• Label Distributionally Robust Losses for Multi-class Classification: Consistency, Robustness and Adaptivity [55.29408396918968]
  We study a family of loss functions named label-distributionally robust (LDR) losses for multi-class classification. Our contributions include both consistency and robustness by establishing top-$k$ consistency of LDR losses for multi-class classification. We propose a new adaptive LDR loss that automatically adapts the individualized temperature parameter to the noise degree of class label of each instance.
  arXiv  Detail & Related papers  (2021-12-30T00:27:30Z)
• Approximate Regions of Attraction in Learning with Decision-Dependent Distributions [11.304363655760513]
  We analyze repeated risk minimization as the trajectories of the gradient flows of performative risk minimization. We provide conditions to characterize the region of attraction for the various equilibria in this setting. We introduce the notion of performative alignment, which provides a geometric condition on the convergence of repeated risk minimization to performative risk minimizers.
  arXiv  Detail & Related papers  (2021-06-30T18:38:08Z)
• Minimax Active Learning [61.729667575374606]
  Active learning aims to develop label-efficient algorithms by querying the most representative samples to be labeled by a human annotator. Current active learning techniques either rely on model uncertainty to select the most uncertain samples or use clustering or reconstruction to choose the most diverse set of unlabeled examples. We develop a semi-supervised minimax entropy-based active learning algorithm that leverages both uncertainty and diversity in an adversarial manner.
  arXiv  Detail & Related papers  (2020-12-18T19:03:40Z)
• Exploiting Sample Uncertainty for Domain Adaptive Person Re-Identification [137.9939571408506]
  We estimate and exploit the credibility of the assigned pseudo-label of each sample to alleviate the influence of noisy labels. Our uncertainty-guided optimization brings significant improvement and achieves the state-of-the-art performance on benchmark datasets.
  arXiv  Detail & Related papers  (2020-12-16T04:09:04Z)

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.