English

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

Machine Learning 2026-01-21 v2 Computer Vision and Pattern Recognition

Abstract

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.

Keywords

Cite

@article{arxiv.2507.20447,
  title  = {WEEP: A Differentiable Nonconvex Sparse Regularizer via Weakly-Convex Envelope},
  author = {Takanobu Furuhashi and Hidekata Hontani and Qibin Zhao and Tatsuya Yokota},
  journal= {arXiv preprint arXiv:2507.20447},
  year   = {2026}
}

Comments

5 pages, 5 figures, 1 tables. Accepted at ICASSP 2026

R2 v1 2026-07-01T04:21:21.925Z