Research map / Learning theory and algorithms / Matrix and tensor methods
A General Efficient Hyperparameter-Free Algorithm for Convolutional Sparse Learning
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
- Revisiting Sparse Convolutional Model for Visual Recognition (NeurIPS 2022 · similarity 0.89)
- Accelerating Sparse Convolution with Column Vector-Wise Sparsity (NeurIPS 2022 · similarity 0.88)
- Global Minimizers of $\ell^p$-Regularized Objectives Yield the Sparsest ReLU Neural Networks (NeurIPS 2025 · similarity 0.87)
- A Single-Step, Sharpness-Aware Minimization is All You Need to Achieve Efficient and Accurate Sparse Training (NeurIPS 2024 · similarity 0.87)
- Sparse Cocktail: Every Sparse Pattern Every Sparse Ratio All At Once (ICML 2024 · similarity 0.86)
- Dynamic Sparse Training with Structured Sparsity (ICLR 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.