Non-convex penalized multitask regression using data depth-based penalties

@inproceedings{Majumdar2018NonconvexPM,
  title={Non-convex penalized multitask regression using data depth-based penalties},
  author={S. Majumdar and Snigdhansu Chatterjee},
  year={2018}
}
We propose a new class of nonconvex penalty functions, based on data depth functions, for multitask sparse penalized regression. These penalties quantify the relative position of rows of the coefficient matrix from a fixed distribution centered at the origin. We derive the theoretical properties of an approximate one-step sparse estimator of the coefficient matrix using local linear approximation of the penalty function, and provide algorithm for its computation. For orthogonal design and… Expand
Ultrahigh-Dimensional Robust and Efficient Sparse Regression Using Non-Concave Penalized Density Power Divergence
On Weighted Multivariate Sign Functions
D ec 2 01 8 On general notions of depth for regression
On general notions of depth for regression

References

SHOWING 1-10 OF 42 REFERENCES
Regularized M-estimators with nonconvexity: statistical and algorithmic theory for local optima
A Sparse-Group Lasso
CALIBRATING NON-CONVEX PENALIZED REGRESSION IN ULTRA-HIGH DIMENSION.
Adaptive Multi-task Sparse Learning with an Application to fMRI Study
Nearly unbiased variable selection under minimax concave penalty
SUPPORT UNION RECOVERY IN HIGH-DIMENSIONAL MULTIVARIATE REGRESSION
Sparse group lasso and high dimensional multinomial classification
...
1
2
3
4
5
...