Research map / Optimization / Nonconvex and smooth optimization
Sparse Learning with Stochastic Composite Optimization
Weizhong Zhang, Lijun Zhang, Zhongming Jin, Rong Jin, Deng Cai, Xuelong Li, Ronghua Liang, Xiaofei He
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
- Estimate Sequences for Stochastic Composite Optimization: Variance Reduction, Acceleration, and Robustness to Noise (JMLR 2020 · similarity 0.91)
- Optimal Stochastic and Online Learning with Individual Iterates (NeurIPS 2019 · similarity 0.90)
- An Effective Hard Thresholding Method Based on Stochastic Variance Reduction for Nonconvex Sparse Learning (AAAI 2020 · similarity 0.89)
- High-Probability Convergence for Composite and Distributed Stochastic Minimization and Variational Inequalities with Heavy-Tailed Noise (ICML 2024 · similarity 0.88)
- An Iterative Min-Min Optimization Method for Sparse Bayesian Learning (ICML 2024 · similarity 0.88)
- Non-convex Stochastic Composite Optimization with Polyak Momentum (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.
