Error estimation and adaptive tuning for unregularized robust M-estimator
From MaRDI portal
Cites work
- A modern maximum-likelihood theory for high-dimensional logistic regression
- A New Principle for Tuning-Free Huber Regression
- Adaptive Huber Regression
- Asymptotic normality of robust M-estimators with convex penalty
- Concentration inequalities. A nonasymptotic theory of independence
- Debiasing convex regularized estimators and interval estimation in linear models
- Estimation of the mean of a multivariate normal distribution
- Fluctuations of eigenvalues and second order Poincaré inequalities
- Fundamental barriers to high-dimensional regression with convex penalties
- High dimensional robust M-estimation: asymptotic variance via approximate message passing
- On robust regression with high-dimensional predictors
- On the impact of predictor geometry on the performance on high-dimensional ridge-regularized generalized robust regression estimators
- Out-of-sample error estimate for robust M-estimators with convex penalty
- Precise Error Analysis of Regularized <inline-formula> <tex-math notation="LaTeX">$M$ </tex-math> </inline-formula>-Estimators in High Dimensions
- Robust Estimation of a Location Parameter
- Robust regression through the Huber's criterion and adaptive lasso penalty
- Robust statistics. Theory and methods (with R)
- Scale calibration for high-dimensional robust regression
- Second-order Stein: SURE for SURE and other applications in high-dimensional inference
- The distribution of the Lasso: uniform control over sparse balls and adaptive parameter tuning
- The LASSO Risk for Gaussian Matrices
- The Lasso with general Gaussian designs with applications to hypothesis testing
Cited in
(3)
This page was built for publication: Error estimation and adaptive tuning for unregularized robust M-estimator
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6982684)