mlsanityData to 14 Oct 2026

WEEP: A Differentiable Nonconvex Sparse Regularizer via Weakly-Convex Envelope

arXiv 2507.20447 ↗First posted 28 Jul 2025cs.LG cs.CVcited by 1

Not on the map. Why?

Abstract (arXiv)

Sparse regularization is fundamental in signal processing and feature extraction but often relies on non-differentiable penalties, conflicting with gradient-based optimizers. We propose WEEP (Weakly-convex Envelope of Piecewise Penalty), a novel differentiable regularizer derived from the weakly-convex envelope framework. WEEP provides tunable, unbiased sparsity and a simple closed-form proximal operator, while maintaining full differentiability and L-smoothness, ensuring compatibility with both gradient-based and proximal algorithms. This resolves the tradeoff between statistical performance and computational tractability. We demonstrate superior performance compared to established convex and non-convex sparse regularizers on challenging compressive sensing and image denoising tasks.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 21 of its 67 references that are in the map. First posted on arXiv 28 Jul 2025.

Builds on

21 of 67 references.

References · 21

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  3. 2016An overview of gradient descent optimization algorithmscited by 1,033
  4. 2017Learning Sparse Neural Networks through L0 Regularizationcited by 583
  5. 2018Real-world Noisy Image Denoising: A New Benchmarkcited by 74
  6. 2016A survey of sparse representation: algorithms and applicationscited by 58
  7. 2023An Introduction to Bi-level Optimization: Foundations and Applications in Signal Processing and Machine Learningcited by 41
  8. 2020Time-Varying Convex Optimization: Time-Structured Algorithms and Applicationscited by 31
  9. 2018Online Learning with Inexact Proximal Online Gradient Descent Algorithmscited by 22
  10. 2018A Survey on Nonconvex Regularization Based Sparse and Low-Rank Recovery in Signal Processing, Statistics, and Machine Learningcited by 20
  11. 2018Sparse Regularization via Convex Analysiscited by 17
  12. 2021Learning with Gradient Descent and Weakly Convex Lossescited by 16
9 more
  1. 2024Weakly Convex Regularisers for Inverse Problems: Convergence of Critical Points and Primal-Dual Optimisationcited by 14
  2. 2025Deep Weight Factorization: Sparse Learning Through the Lens of Artificial Symmetriescited by 14
  3. 2019Cascaded Channel Estimation for Large Intelligent Metasurface Assisted Massive MIMOcited by 11
  4. 2023Smoothing the Edges: Smooth Optimization for Sparse Regularization using Hadamard Overparametrizationcited by 11
  5. 2020Online Proximal-ADMM For Time-varying Constrained Convex Optimizationcited by 10
  6. 2023Medical Image Segmentation via Sparse Coding Decodercited by 3
  7. 2024Monotone Lipschitz-Gradient Denoiser: Explainability of Operator Regularization Approaches Free From Lipschitz Constant Controlcited by 3
  8. 2023The Proximal Operator of the Piece-wise Exponential Function and Its Application in Compressed Sensingcited by 1
  9. 2024Continuous Relaxation of Discontinuous Shrinkage Operator: Proximal Inclusion and Conversioncited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.