A selective overview of sparse principal component analysis

H Zou, L Xue - Proceedings of the IEEE, 2018 - ieeexplore.ieee.org
Principal component analysis (PCA) is a widely used technique for dimension reduction,
data processing, and feature extraction. The three tasks are particularly useful and important …

[LLIBRE][B] An introduction to optimization on smooth manifolds

N Boumal - 2023 - books.google.com
Optimization on Riemannian manifolds-the result of smooth geometry and optimization
merging into one elegant modern framework-spans many areas of science and engineering …

From simple structure to sparse components: a review

NT Trendafilov - Computational Statistics, 2014 - Springer
The article begins with a review of the main approaches for interpretation the results from
principal component analysis (PCA) during the last 50–60 years. The simple structure …

[PDF][PDF] Linear dimensionality reduction: Survey, insights, and generalizations

JP Cunningham, Z Ghahramani - The Journal of Machine Learning …, 2015 - jmlr.org
Linear dimensionality reduction methods are a cornerstone of analyzing high dimensional
data, due to their simple geometric interpretations and typically attractive computational …

Large covariance estimation by thresholding principal orthogonal complements

J Fan, Y Liao, M Mincheva - Journal of the Royal Statistical …, 2013 - academic.oup.com
The paper deals with the estimation of a high dimensional covariance with a conditional
sparsity structure and fast diverging eigenvalues. By assuming a sparse error covariance …

[PDF][PDF] Online learning for matrix factorization and sparse coding.

J Mairal, F Bach, J Ponce, G Sapiro - Journal of Machine Learning …, 2010 - jmlr.org
Sparse coding—that is, modelling data vectors as sparse linear combinations of basis
elements—is widely used in machine learning, neuroscience, signal processing, and …

[LLIBRE][B] Statistical foundations of data science

J Fan, R Li, CH Zhang, H Zou - 2020 - taylorfrancis.com
Statistical Foundations of Data Science gives a thorough introduction to commonly used
statistical models, contemporary statistical machine learning techniques and algorithms …

Theory and applications of robust optimization

D Bertsimas, DB Brown, C Caramanis - SIAM review, 2011 - SIAM
In this paper we survey the primary research, both theoretical and applied, in the area of
robust optimization (RO). Our focus is on the computational attractiveness of RO …

Sparse dnns with improved adversarial robustness

Y Guo, C Zhang, C Zhang… - Advances in neural …, 2018 - proceedings.neurips.cc
Deep neural networks (DNNs) are computationally/memory-intensive and vulnerable to
adversarial attacks, making them prohibitive in some real-world applications. By converting …

The computational complexity of the restricted isometry property, the nullspace property, and related concepts in compressed sensing

AM Tillmann, ME Pfetsch - IEEE Transactions on Information …, 2013 - ieeexplore.ieee.org
This paper deals with the computational complexity of conditions which guarantee that the
NP-hard problem of finding the sparsest solution to an underdetermined linear system can …