High-dimensional linear regression via implicit regularization
From MaRDI portal
Cited in
(11)- Quickly Finding the Best Linear Model in High Dimensions via Projected Gradient Descent
- Covariance-regularized regression and classification for high dimensional problems
- L 0 -regularized high-dimensional sparse multiplicative models
- Computationally efficient and statistically optimal robust high-dimensional linear regression
- High-dimensional Linear Regression for Dependent Data with Applications to Nowcasting
- Understanding Implicit Regularization in Over-Parameterized Single Index Model
- Exact recovery in the double sparse model: sufficient and necessary signal conditions
- High-Dimensional Linear Regression via Implicit Regularization
- Regularization after retention in ultrahigh dimensional linear regression models
- COMBSS: best subset selection via continuous optimization
- Kurdyka-Łojasiewicz exponent via Hadamard parametrization
This page was built for publication: High-dimensional linear regression via implicit regularization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5872848)