Research map / Optimization / Nonconvex and smooth optimization
A Unified Framework for Rank-based Loss Minimization
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
- Minimizing the Maximal Loss: How and Why (ICML 2016 · similarity 0.87)
- Efficient Optimization for Rank-Based Loss Functions (CVPR 2018 · similarity 0.85)
- Learning-Based Low-Rank Approximations (NeurIPS 2019 · similarity 0.85)
- Better generalization with less data using robust gradient descent (ICML 2019 · similarity 0.85)
- Multiclass Loss Geometry Matters for Generalization of Gradient Descent in Separable Classification (NeurIPS 2025 · similarity 0.85)
- A Survey of Learning Criteria Going beyond the Usual Risk (Abstract Reprint) (AAAI 2024 · similarity 0.84)
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.