High-dimensional regression and classification under a class of convex loss functions
From MaRDI portal
Recommendations
- Estimation and selection via absolute penalized convex minimization and its multistage adaptive applications
- High-dimensional generalized linear models and the lasso
- Penalized Bregman divergence for large-dimensional regression and classification
- Weighted Lasso estimates for sparse logistic regression: non-asymptotic properties with measurement errors
- Penalized composite quasi-likelihood for ultrahigh dimensional variable selection
Cited in
(11)- Convex models of high dimensional discrete data
- Weighted Lasso estimates for sparse logistic regression: non-asymptotic properties with measurement errors
- High-dimension multilabel problems: convex or nonconvex relaxation?
- Classification with Gaussians and convex loss
- Covariance-regularized regression and classification for high dimensional problems
- Analysis to Neyman-Pearson classification with convex loss function
- The statistical analysis of the combined loss of LS, LAD in high-dimension
- scientific article; zbMATH DE number 7626737 (Why is no real title available?)
- Modified Cheeger and ratio cut methods using the Ginzburg–Landau functional for classification of high-dimensional data
- Estimation and selection via absolute penalized convex minimization and its multistage adaptive applications
- High dimensional binary classification under label shift: phase transition and regularization
This page was built for publication: High-dimensional regression and classification under a class of convex loss functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897181)
