A Unified Framework for Constructing Nonconvex Regularizations

06/11/2021
by   Zhiyong Zhou, et al.
5

Over the past decades, many individual nonconvex methods have been proposed to achieve better sparse recovery performance in various scenarios. However, how to construct a valid nonconvex regularization function remains open in practice. In this paper, we fill in this gap by presenting a unified framework for constructing the nonconvex regularization based on the probability density function. Meanwhile, a new nonconvex sparse recovery method constructed via the Weibull distribution is studied.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/25/2011

A General Theory of Concave Regularization for High Dimensional Sparse Estimation Problems

Concave regularization methods provide natural procedures for sparse rec...
research
08/16/2018

Nonconvex Regularization Based Sparse and Low-Rank Recovery in Signal Processing, Statistics, and Machine Learning

In the past decade, sparse and low-rank recovery have drawn much attenti...
research
12/17/2014

Support recovery without incoherence: A case for nonconvex regularization

We demonstrate that the primal-dual witness proof method may be used to ...
research
06/20/2013

Optimal computational and statistical rates of convergence for sparse nonconvex learning problems

We provide theoretical analysis of the statistical and computational pro...
research
07/22/2020

Learnable Descent Algorithm for Nonsmooth Nonconvex Image Reconstruction

We propose a general learning based framework for solving nonsmooth and ...
research
11/11/2021

Nonconvex flexible sparsity regularization: theory and monotone numerical schemes

Flexible sparsity regularization means stably approximating sparse solut...
research
06/29/2021

Towards a Unified Theory of Light Spanners I: Fast (Yet Optimal) Constructions

Seminal works on light spanners over the years provide spanners with opt...

Please sign up or login with your details

Forgot password? Click here to reset