Research map / Learning theory and algorithms / Matrix and tensor methods
Towards Nonlinear Sparse AUC Maximization via Compositional Stochastic Hard Thresholding
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.
Closest papers by meaning
- Fast Stochastic AUC Maximization with $O(1/n)$-Convergence Rate (ICML 2018 · similarity 0.91)
- Stochastic Proximal Algorithms for AUC Maximization (ICML 2018 · similarity 0.89)
- An Effective Hard Thresholding Method Based on Stochastic Variance Reduction for Nonconvex Sparse Learning (AAAI 2020 · similarity 0.88)
- Stochastic AUC Maximization with Deep Neural Networks (ICLR 2020 · similarity 0.88)
- Asymptotically Unbiased Instance-wise Regularized Partial AUC Optimization: Theory and Algorithm (NeurIPS 2022 · similarity 0.88)
- A Federated Stochastic Multi-level Compositional Minimax Algorithm for Deep AUC Maximization (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.