Research map / Optimization / Nonconvex and smooth optimization
Efficient Stochastic Gradient 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
- An Effective Hard Thresholding Method Based on Stochastic Variance Reduction for Nonconvex Sparse Learning (AAAI 2020 · similarity 0.93)
- Sample Efficient Stochastic Gradient Iterative Hard Thresholding Method for Stochastic Sparse Linear Regression with Limited Attribute Observation (NeurIPS 2018 · similarity 0.91)
- Fast Iterative Hard Thresholding Methods with Pruning Gradient Computations (NeurIPS 2024 · similarity 0.88)
- High-Probability Convergence for Composite and Distributed Stochastic Minimization and Variational Inequalities with Heavy-Tailed Noise (ICML 2024 · similarity 0.87)
- Smoothing Proximal Gradient Methods for Nonsmooth Sparsity Constrained Optimization: Optimality Conditions and Global Convergence (ICML 2024 · similarity 0.86)
- High-probability complexity bounds for stochastic non-convex minimax optimization (NeurIPS 2024 · similarity 0.86)
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.