Non-convex penalized multitask regression using data depth-based penalties
From MaRDI portal
Cites work
- A fast unified algorithm for solving group-lasso penalize learning problems
- An error bound for L₁-norm support vector machine coefficients in ultra-high dimension
- Calibrating nonconvex penalized regression in ultra-high dimension
- Clustering and classification based on the L\(_{1}\) data depth
- Depth weighted scatter estimators
- Envelope models for parsimonious and efficient multivariate linear regression
- General notions of statistical depth function.
- scientific article; zbMATH DE number 3541764 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- Ideal spatial adaptation by wavelet shrinkage
- Indirect multivariate response linear regression
- Multivariate sparse group Lasso for the multivariate multiple linear regression with an arbitrary group structure
- Nearly unbiased variable selection under minimax concave penalty
- On a notion of data depth based on random simplices
- On the Stahel-Donoho estimator and depth-weighted means of multivariate data.
- One-step Local Quasi-likelihood Estimation
- One-step sparse estimates in nonconcave penalized likelihood models
- Projection-based depth functions and associated medians
- Regularization of Wavelet Approximations
- Regularized \(M\)-estimators with nonconvexity: statistical and algorithmic theory for local optima
- Robustness and Complex Data Structures
- Simultaneous Support Recovery in High Dimensions: Benefits and Perils of Block $\ell _{1}/\ell _{\infty} $-Regularization
- Sparse group Lasso and high dimensional multinomial classification
- Statistics for high-dimensional data. Methods, theory and applications.
- Support union recovery in high-dimensional multivariate regression
- The Adaptive Lasso and Its Oracle Properties
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
This page was built for publication: Non-convex penalized multitask regression using data depth-based penalties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6541446)