Does $\ell _{p}$ -Minimization Outperform $\ell _{1}$ -Minimization?
From MaRDI portal
Publication:4566536
DOI10.1109/TIT.2017.2717585zbMath1390.94511arXiv1501.03704OpenAlexW2736716203MaRDI QIDQ4566536
Arian Maleki, Haolei Weng, Le Zheng, Teng Long, Xiaodong Wang
Publication date: 27 June 2018
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1501.03704
Related Items (13)
A survey on compressive sensing: classical results and recent advancements ⋮ Sparse high-dimensional regression: exact scalable algorithms and phase transitions ⋮ Computing the degrees of freedom of rank-regularized estimators and cousins ⋮ The finite steps of convergence of the fast thresholding algorithms with \(f\)-feedbacks in compressed sensing ⋮ Neural network for a class of sparse optimization with \(L_0\)-regularization ⋮ Unnamed Item ⋮ Matrix completion with nonconvex regularization: spectral operators and scalable algorithms ⋮ Rotation to sparse loadings using \(L^p\) losses and related inference problems ⋮ Which bridge estimator is the best for variable selection? ⋮ Asymptotic risk and phase transition of \(l_1\)-penalized robust estimator ⋮ Nonlinear frames and sparse reconstructions in Banach spaces ⋮ Overcoming the limitations of phase transition by higher order analysis of regularization techniques ⋮ LASSO risk and phase transition under dependence
This page was built for publication: Does $\ell _{p}$ -Minimization Outperform $\ell _{1}$ -Minimization?
