Pith. sign in

REVIEW 2 cited by

Deep AUC Maximization for Medical Image Classification: Challenges and Opportunities

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2111.02400 v1 pith:DM42XYOL submitted 2021-11-01 cs.LG cs.AIcs.CVeess.IVmath.OC

classification cs.LGcs.AIcs.CVeess.IVmath.OC
keywords classificationimagemedicaldeeplearningchallengesdiscussmaximization
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In this extended abstract, we will present and discuss opportunities and challenges brought about by a new deep learning method by AUC maximization (aka \underline{\bf D}eep \underline{\bf A}UC \underline{\bf M}aximization or {\bf DAM}) for medical image classification. Since AUC (aka area under ROC curve) is a standard performance measure for medical image classification, hence directly optimizing AUC could achieve a better performance for learning a deep neural network than minimizing a traditional loss function (e.g., cross-entropy loss). Recently, there emerges a trend of using deep AUC maximization for large-scale medical image classification. In this paper, we will discuss these recent results by highlighting (i) the advancements brought by stochastic non-convex optimization algorithms for DAM; (ii) the promising results on various medical image classification problems. Then, we will discuss challenges and opportunities of DAM for medical image classification from three perspectives, feature learning, large-scale optimization, and learning trustworthy AI models.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Preserving AUC Fairness in Learning with Noisy Protected Groups

    cs.LG 2025-05 conditional novelty 6.0 of 10

    A distributionally robust AUC-fairness method with TV-distance bounds that preserves group fairness when protected-group labels are noisy.

  2. Simulating the Unseen: Crash Prediction Must Learn from What Did Not Happen

    cs.LG 2025-05 conditional novelty 4.0 of 10

    Crash prediction should learn from near-miss events and synthetic counterfactual scenarios, not just recorded crashes.

Pith tools