Research map / Optimization / Nonconvex and smooth optimization
Stochastic Regularized Majorization-Minimization with weakly convex and multi-convex surrogates
Hanbaek Lyu
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
- Relaxed Majorization-Minimization for Non-Smooth and Non-Convex Optimization (AAAI 2016 · similarity 0.90)
- Simple Stochastic Gradient Methods for Non-Smooth Non-Convex Regularized Optimization (ICML 2019 · similarity 0.89)
- Generalized Majorization-Minimization (ICML 2019 · similarity 0.89)
- Stochastic Proximal Methods for Non-Smooth Non-Convex Constrained Sparse Optimization (JMLR 2021 · similarity 0.89)
- Stochastic Optimization with Arbitrary Recurrent Data Sampling (ICML 2024 · similarity 0.88)
- High-probability complexity bounds for stochastic non-convex minimax optimization (NeurIPS 2024 · similarity 0.88)
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.
