Penalized least square in sparse setting with convex penalty and non Gaussian errors
From MaRDI portal
Publication:2154605
DOI10.1007/s10473-021-0624-0OpenAlexW3169388839MaRDI QIDQ2154605
Tomoko Matsui, Nourddine Azzaoui, Guillaume Le Mailloux, Doualeh Abdillahi-Ali, Arnaud Guillin
Publication date: 20 July 2022
Published in: Acta Mathematica Scientia. Series B. (English Edition) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10473-021-0624-0
Related Items (1)
Cites Work
- Unnamed Item
- Estimation and testing under sparsity. École d'Été de Probabilités de Saint-Flour XLV -- 2015
- The geometry of least squares in the 21st century
- Statistics for high-dimensional data. Methods, theory and applications.
- Oracle inequalities and optimal inference under group sparsity
- Bounds on the prediction error of penalized least squares estimators with convex penalty
- Slope meets Lasso: improved oracle bounds and optimality
- Simultaneous analysis of Lasso and Dantzig selector
- Bounding the Smallest Singular Value of a Random Matrix Without Concentration
- Towards the study of least squares estimators with convex penalty
- Sparse Regularization via Convex Analysis
- On the Poincaré Constant of Log-Concave Measures
- A unified framework for high-dimensional analysis of \(M\)-estimators with decomposable regularizers
This page was built for publication: Penalized least square in sparse setting with convex penalty and non Gaussian errors
