Robust and sparse multinomial regression in high dimensions
From MaRDI portal
Abstract: A robust and sparse estimator for multinomial regression is proposed for high dimensional data. Robustness of the estimator is achieved by trimming the observations, and sparsity of the estimator is obtained by the elastic net penalty, which is a mixture of and penalties. From this point of view, the proposed estimator is an extension of the enet-LTS estimator citep{Kurnaz18} for linear and logistic regression to the multinomial regression setting. After introducing an algorithm for its computation, a simulation study is conducted to show the performance in comparison to the non-robust version of the multinomial regression estimator. Some real data examples underline the usefulness of this robust estimator.
Cites work
- Applied multivariate statistical analysis.
- Fast and robust discriminant analysis
- scientific article; zbMATH DE number 194744 (Why is no real title available?)
- Penalized discriminant analysis
- Robust and sparse multigroup classification by the optimal scoring approach
- Sparse least trimmed squares regression for analyzing high-dimensional large data sets
Cited in
(5)- Sparse consistency and smoothing for multinomial data
- Robust Coordinate Descent Algorithm Robust Solution Path for High-dimensional Sparse Regression Modeling
- Robustness in sparse high-dimensional linear models: relative efficiency and robust approximate message passing
- Efficient Robbins–Monro procedure for multivariate binary data
- Debiased transfer learning estimation and inference for multinomial regression
This page was built for publication: Robust and sparse multinomial regression in high dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6170400)