Research map / Optimization / Nonconvex and smooth optimization
Multi-block Min-max Bilevel Optimization with Applications in Multi-task Deep AUC Maximization
Quanqi Hu, YONGJIAN ZHONG, 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 |
|---|---|---|---|
| Use compositional training instead of directly optimizing the multi-task min-max AUC loss | Multi-task deep AUC maximization · CIFAR100 | AUC: 0.9044 (0.0015) -> 0.9272 (0.0014) | Improved |
| Use compositional training instead of directly optimizing the multi-task min-max AUC loss | Multi-task deep AUC maximization · CheXpert | AUC: 0.8084( 0.1455) -> 0.8198(0.1495) | Improved |
| Use compositional training instead of directly optimizing the multi-task min-max AUC loss | Multi-task deep AUC maximization · CelebA | AUC: 0.9062 (0.0042) -> 0.9192 (0.0004) | Improved |
| Use compositional training instead of directly optimizing the multi-task min-max AUC loss | Multi-task deep AUC maximization · ogbg-molpcba | AUC: 0.7793(0.0028) -> 0.8406(0.0044) | Improved |
| Use the proposed multi-task bilevel method instead of SOPA-s | Multi-task deep partial AUC maximization · CIFAR100 | partial AUC (FPR≤0.1): 0.9251 (0.0003) -> 0.9262 (0.0005) | Improved |
| Use the proposed multi-task bilevel method instead of SOPA-s | Multi-task deep partial AUC maximization · CelebA | partial AUC (FPR≤0.1): 0.8336 (0.0001) -> 0.8360 (0.0003) | Improved |
| Use the proposed multi-task bilevel method instead of SOPA-s | Multi-task deep partial AUC maximization · CheXpert | partial AUC (FPR≤0.1): 0.6682 (0.0156) -> 0.6827 (0.0183) | Improved |
| Use the proposed multi-task bilevel method instead of SOPA-s | Multi-task deep partial AUC maximization · ogbg-molpcba | partial AUC (FPR≤0.1): 0.7290 (0.0019) -> 0.7374 (0.0015) | Improved |
| Increase the data-sample batch size (ablation) | Proposed multi-task deep AUC and partial AUC methods · Multi-task AUC and partial AUC training | convergence speed | Improved |
| Increase the task-sample batch size (ablation) | Proposed multi-task deep AUC and partial AUC methods · Multi-task AUC and partial AUC training | convergence speed | Improved |
Closest papers by meaning
- First-Order Minimax Bilevel Optimization (NeurIPS 2024 · similarity 0.92)
- Penalty-Based First-Order Methods for Bilevel Optimization with Minimax and Constrained Lower-Level Problems (NeurIPS 2026 · similarity 0.89)
- TSP: A Two-Sided Smoothed Primal-Dual Method for Nonconvex Bilevel Optimization (ICML 2025 · similarity 0.88)
- Conditional Gradient Methods with Standard LMO for Stochastic Simple Bilevel Optimization (NeurIPS 2025 · similarity 0.88)
- A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness (ICML 2024 · similarity 0.87)
- On The Complexity of First-Order Methods in Stochastic Bilevel Optimization (ICML 2024 · similarity 0.87)
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.
