Research map / Optimization / Nonconvex and smooth optimization
Large-scale Optimization of Partial AUC in a Range of False Positive Rates
Yao Yao, Qihang Lin, Tianbao Yang
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| AGD-SBCD instead of SVMpAUC-tight (train) | linear model on CheXpert · CheXpert D1 train | pAUC: 0.6259 -> 0.7005 | Improved |
| AGD-SBCD instead of SVMpAUC-tight (train) | linear model on CheXpert · CheXpert D2 train | pAUC: 0.5860 -> 0.7214 | Improved |
| AGD-SBCD instead of SVMpAUC-tight (train) | linear model on CheXpert · CheXpert D3 train | pAUC: 0.3745 -> 0.4910 | Improved |
| AGD-SBCD instead of SVMpAUC-tight (train) | linear model on CheXpert · CheXpert D4 train | pAUC: 0.3895 -> 0.4616 | Improved |
| AGD-SBCD instead of SVMpAUC-tight (train) | linear model on CheXpert · CheXpert D5 train | pAUC: 0.7267 -> 0.8272 | Improved |
| AGD-SBCD vs DCA and proximal DCA, training convergence | linear model on CheXpert · CheXpert training | training loss and pAUC | Improved |
| AGD-SBCD instead of SVMpAUC-tight (test) | linear model · CheXpert D4 test | pAUC: 0.6521 -> 0.6340 | Hurt |
| AGD-SBCD instead of DCA (test) | linear model · CheXpert D3 test | pAUC: 0.7427 -> 0.8016 | Improved |
| AGD-SBCD instead of MB (test) | DenseNet121 · CheXpert D3 test | pAUC: 0.6339 -> 0.8689 | Improved |
| AGD-SBCD instead of CE (test) | DenseNet121 · CheXpert D1 test | pAUC: 0.6994 -> 0.7535 | Improved |
| AGD-SBCD instead of AUC-M (test) | DenseNet121 · CheXpert D3 test | pAUC: 0.8533 -> 0.8689 | Improved |
| AGD-SBCD instead of AUC-M (test) | DenseNet121 · CheXpert D5 test | pAUC: 0.8504 -> 0.8513 | No clear effect |
Closest papers by meaning
- Optimizing Two-Way Partial AUC With an End-to-End Framework (TPAMI 2022 · similarity 0.92)
- Closing the Approximation Gap of Partial AUC Optimization: A Tale of Two Formulations (TPAMI 2025 · similarity 0.91)
- When All We Need is a Piece of the Pie: A Generic Framework for Optimizing Two-way Partial AUC (ICML 2021 · similarity 0.90)
- Does It Pay to Optimize AUC? (AAAI 2023 · similarity 0.90)
- Interplay of ROC and Precision-Recall AUCs: Theoretical Limits and Practical Implications in Binary Classification (ICML 2024 · similarity 0.86)
- Preserving AUC Fairness in Learning with Noisy Protected Groups (ICML 2025 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
