CoChat
Sign Up
Cited by 7Imbalanced Data Classification TechniquesStochastic Gradient Optimization TechniquesMachine Learning and Data Classification

Fast Stochastic Recursive Momentum Methods for Imbalanced Data Mining

Wu, Xidong, Huang, Feihu, Huang, Heng·2022·2022 IEEE International Conference on Data Mining (ICDM)
DOI 10.1109/icdm54844.2022.00068
Open this paper in CoChat — free account

Abstract

Standard deep learning models have been mainly designed for balanced data mining tasks and use accuracy to evaluate the classifier. However, in many real-world applications, the distribution of data is skewed. If the standard models, which are designed to optimize the accuracy, are applied to the imbalanced data, the prediction performance could be poor because the model bias towards the majority class. To address the imbalanced data mining problem, areas under precision-recall curves (AUPRC) was proposed as a good measure to evaluate the performance of prediction models on imbalanced data sets, and shows excellent capability in identifying the models with high predictive power. To improve the performance of models, researchers recently design methods to directly optimize AUPRC for imbalanced data mining. However, these approaches suffer from a high iteration complexity and efficient methods are desired. In this paper, we propose a faster stochastic method (i.e., ROAP) for maximizing the AURPC based on the momentum-based variance reduced technique. Our new method is based on the maximization of non-parametric averaged precision (AP), which is a popular unbiased point estimator of AUPRC, and the optimization objective in this paper can be converted into a sum of dependent compositional functions, where the inner functions rely on random variables of both inner and outer levels. Compared to previous methods, our ROAP algorithm can achieve a lower iteration complexity of $O(\epsilon^{-3})$ for finding an ϵ-stationary solution. Furthermore, we extend our method to an adaptive version (i.e., AROAP) with the same iteration complexity of $O(\epsilon^{-3})$. To the best of our knowledge, this paper is the first work showing that the variance reduction method can be incorporated into maximizing the AURPC for efficient data mining on imbalanced datasets. Finally, we conduct extensive experiments on various imbalanced data sets with different models to demonstrate the efficiency of our new algorithms.

Integrity signals

Registry

Crossref · 10.1109/icdm54844.2022.00068

Cites

31 of 31 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • AUPRC is a commonly used metric to evaluate model performance on datasets with imbalanced labels.

    “Since the metric of AUPRC is a commonly used metric to evaluate model performance on datasets with imbalanced labels56,57, we calculate the AUPRC of the two models and compare their differences.”

    From Probabilistic medical predictions of large language models (2024) · cites this paper as [56]

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Related

Authors
Wu, X., Huang, F., & Huang, H.
Affiliations
University of Pittsburgh (US)
ORCID
Venue
2022 IEEE International Conference on Data Mining (ICDM)
Publisher
IEEE
Published
2022-11
Pages
578-587
ISSN
1550-4786 (ISSN-L)
DOI
10.1109/icdm54844.2022.00068
OpenAlex
W4318812304
Cited by
7
References
31
Citations by year
2026: 1 · 2025: 1 · 2024: 2 · 2023: 3
FWCI
0.83
Type
conference paper
Language
en
Open access
closed
Licence
Locations
Proceedings (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Imbalanced Data Classification Techniques
  • Physical Sciences › Computer Science › Artificial Intelligence › Stochastic Gradient Optimization Techniques
  • Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Data Classification
Keywords
stochastic optimization, momentum methods, variance reduction, iteration complexity, adaptive optimization, compositional functions

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review