Research map / Optimization / Nonconvex and smooth optimization
Algorithm-Dependent Generalization of AUPRC Optimization: Theory and Algorithm
Peisong Wen, Qianqian Xu, Zhiyong Yang, Yuan He, Qingming Huang
Read the paperCheck your idea against 137,217 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.
Closest papers by meaning
- Exploring the Algorithm-Dependent Generalization of AUPRC Optimization with List Stability (NeurIPS 2022 · similarity 0.97)
- Stochastic Optimization of Areas Under Precision-Recall Curves with Provable Convergence (NeurIPS 2021 · similarity 0.90)
- Fast Stochastic AUC Maximization with $O(1/n)$-Convergence Rate (ICML 2018 · similarity 0.89)
- Sharper Generalization Bounds for Learning with Gradient-dominated Objective Functions (ICLR 2021 · similarity 0.87)
- Towards Nonlinear Sparse AUC Maximization via Compositional Stochastic Hard Thresholding (AAAI 2026 · similarity 0.87)
- Pairwise AUC Optimization Needs Corrective Power: A Unified View (NeurIPS 2026 · similarity 0.86)
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.
