Research map / Optimization / Optimizers
Learning step sizes for unfolded sparse coding
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.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use ISTA with oracle per-iteration step sizes (OISTA) instead of fixed-step ISTA or FISTA | Lasso solver · Toy problem n=10, m=50, lambda=0.5 | convergence rate | Helped |
Closest papers by meaning
- Theoretical Linear Convergence of Unfolded ISTA and Its Practical Weights and Thresholds (NeurIPS 2018 · similarity 0.92)
- Sparse Coding with Gated Learned ISTA (ICLR 2020 · similarity 0.91)
- Random Sparse Lifts: Construction, Analysis and Convergence of finite sparse networks (ICLR 2024 · similarity 0.86)
- A Single-Step, Sharpness-Aware Minimization is All You Need to Achieve Efficient and Accurate Sparse Training (NeurIPS 2024 · similarity 0.86)
- Global Minimizers of $\ell^p$-Regularized Objectives Yield the Sparsest ReLU Neural Networks (NeurIPS 2025 · similarity 0.86)
- Two Sparse Matrices are Better than One: Sparsifying Neural Networks with Double Sparse Factorization (ICLR 2025 · similarity 0.85)
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.