A coordinate descent MM algorithm for fast computation of sparse logistic PCA

DOI10.1016/J.CSDA.2013.01.001zbMATH Open1348.65031OpenAlexW1966715760MaRDI QIDQ333734FDOQ333734

Authors: Seokho Lee, Jianhua Z. Huang 

Publication date: 31 October 2016

Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.csda.2013.01.001

Recommendations

• A coordinate descent algorithm for sparse positive definite matrix estimation
• Penalized principal logistic regression for sparse sufficient dimension reduction
• Sparse logistic principal components analysis for binary data
• Sparse Multinomial Logistic Regression via Approximate Message Passing
• A fast hybrid algorithm for large-scale \(l_{1}\)-regularized logistic regression
• Block coordinate descent algorithms for large-scale sparse multiclass classification
• A multilevel framework for sparse optimization with application to inverse covariance estimation and logistic regression
• Alternating direction method of multipliers for sparse principal component analysis
• Nonconvex Sparse Logistic Regression With Weakly Convex Regularization

zbMATH Keywords

penalized maximum likelihoodprincipal component analysisbinary dataMM algorithmcoordinate descent algorithm

Mathematics Subject Classification ID

Factor analysis and principal components; correspondence analysis (62H25)

Cited In (5)

• Sparse exponential family principal component analysis
• Sparse principal component regression with adaptive loading
• Sparse logistic functional principal component analysis for binary data
• OLS with multiple high dimensional category variables
• Sparse logistic principal components analysis for binary data

This page was built for publication: A coordinate descent MM algorithm for fast computation of sparse logistic PCA

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q333734)