AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

Balanced Self-Paced Learning for AUC Maximization

AAAI 2022 · Optimization › Nonconvex and smooth optimization · approach: Coordinate and Adam convergence analysis · 5 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (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 changedWhereMeasuredEffect
Add self-paced sample weighting to the kernel-based AUC methodBSPAUC (kernel) · Original benchmark datasetsAUCHelped
Add self-paced sample weighting to the deep AUC methodBSPAUC (deep) · Original benchmark datasetsAUCHelped
Use BSPAUC instead of existing AUC maximization baselinesBSPAUC · Noisy benchmark datasets (label flipping and poison injection, 10%–30%)AUCHelped
Increase the maximum pace parameter λ∞ (ablation)BSPAUC (deep) · Datasets with 20% injected poison samplesAUCMixed
Increase the balance regularization weight μ (ablation)BSPAUC · Datasets with 20% injected poison samplesAbsolute proportion difference (APD)Helped
Add balanced self-paced regularization to balance selected positive and negative proportions (ablation)BSPAUC · AUC maximization with imbalanced classesAUCHelped
Exclude high-loss samples by assigning them zero weight during self-paced trainingBSPAUC · Noisy benchmark datasetsAUCHelped

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy