mlsanityData to 14 Oct 2026

A Generalized Unbiased Risk Estimator for Learning with Augmented Classes

arXiv 2306.06894 ↗First posted 12 Jun 2023cs.LG cs.CVcited by 2

Not on the map. Why?

Abstract (arXiv)

In contrast to the standard learning paradigm where all classes can be observed in training data, learning with augmented classes (LAC) tackles the problem where augmented classes unobserved in the training data may emerge in the test phase. Previous research showed that given unlabeled data, an unbiased risk estimator (URE) can be derived, which can be minimized for LAC with theoretical guarantees. However, this URE is only restricted to the specific type of one-versus-rest loss functions for multi-class classification, making it not flexible enough when the loss needs to be changed with the dataset in practice. In this paper, we propose a generalized URE that can be equipped with arbitrary loss functions while maintaining the theoretical guarantees, given unlabeled data for LAC. To alleviate the issue of negative empirical risk commonly encountered by previous studies, we further propose a novel risk-penalty regularization term. Experiments demonstrate the effectiveness of our proposed method.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 17 of its 39 references that are in the map. First posted on arXiv 12 Jun 2023.

Builds on

17 of 39 references.

References · 17

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
  3. 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
  4. 2018Generalized Cross Entropy Loss for Training Deep Neural Networks with Noisy Labelscited by 997
  5. 2015Towards Open Set Deep Networkscited by 538
  6. 2018Deep Learning for Classical Japanese Literaturecited by 422
  7. 2018Recent Advances in Open Set Recognition: A Surveycited by 310
  8. 2020Few-Shot Class-Incremental Learningcited by 251
  9. 2017Positive-Unlabeled Learning with Non-Negative Risk Estimatorcited by 219
  10. 2016A vector-contraction inequality for Rademacher complexitiescited by 142
  11. 2015The Extreme Value Machinecited by 78
  12. 2016Mixture Proportion Estimation via Kernel Embedding of Distributionscited by 67
5 more
  1. 2018Classification from Pairwise Similarity and Unlabeled Datacited by 36
  2. 2019Mitigating Overfitting in Supervised Classification from Two Unlabeled Datasets: A Consistent Risk Correction Approachcited by 29
  3. 2020Pointwise Binary Classification with Pairwise Confidence Comparisonscited by 20
  4. 2019An Unbiased Risk Estimator for Learning with Augmented Classescited by 13
  5. 2017Distribution-Free One-Pass Learningcited by 10

Built on by

Cited by year

Citing papers per year: 2024: 1; 2025: 1.

2 papers.