atlas

Research map / Learning theory and algorithms / Prediction and decision losses

Asymptotically Unbiased Instance-wise Regularized Partial AUC Optimization: Theory and Algorithm

NeurIPS 2022 · Learning theory and algorithms › Prediction and decision losses · approach: Adaptive testing and experiments · 1 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
Use PAUCI instead of the strongest listed baselineOPAUC optimization · CIFAR-10-LT Subset 1OPAUC: 0.7659 -> 0.7721Helped
Use PAUCI instead of the strongest listed baselineOPAUC optimization · CIFAR-100-LT Subset 3OPAUC: 0.8575 -> 0.8492Hurt
Use PAUCI instead of the strongest listed baselineTPAUC optimization · CIFAR-10-LT Subset 1TPAUC: 0.7096 -> 0.7192Helped
Use PAUCI instead of the strongest listed baselineTPAUC optimization · CIFAR-100-LT Subset 3TPAUC: 0.7583 -> 0.7497Hurt
Replace pair-wise PAUC formulation with an instance-wise formulationPAUCI · OPAUC and TPAUCper-iteration time complexity: O(n_+^B n_-^B) -> O(n_+^B + n_-^B)Helped
Use the proposed stochastic minimax solverPAUCI · OPAUC and TPAUCiterations to an ε-stationary point: O(ε^-4) -> O(ε^-3)Helped
Smooth the hinge with softplusPAUCI objective · OPAUC and TPAUCapproximation bias: O(1/κ)Hurt

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