Sparse non Gaussian component analysis by semidefinite programming
From MaRDI portal
Publication:374189
DOI10.1007/S10994-013-5331-1zbMath1273.68297arXiv1106.0321OpenAlexW2027136216WikidataQ57392889 ScholiaQ57392889MaRDI QIDQ374189
Arkadi Nemirovski, Elmar Diederichs, Vladimir Spokoiny, Anatoli B. Juditsky
Publication date: 22 October 2013
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1106.0321
Factor analysis and principal components; correspondence analysis (62H25) Semidefinite programming (90C22) Learning and adaptive systems in artificial intelligence (68T05)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Smooth minimization of non-smooth functions
- Large-scale semidefinite programming via a saddle point mirror-prox algorithm
- Dual extrapolation and its applications to solving variational inequalities and related problems
- A new algorithm of non-Gaussian component analysis with radial kernel functions
- Some properties of invariant sets of a flow
- Weak convergence and empirical processes. With applications to statistics
- Asymptotics of graphical projection pursuit
- Lectures on Modern Convex Optimization
- Likelihood-Based Estimation of Multidimensional Langevin Models and Its Application to Biomolecular Dynamics
- Matrix Analysis
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- 10.1162/153244303322753616
- All of Nonparametric Statistics
- A Direct Formulation for Sparse PCA Using Semidefinite Programming
- The elements of statistical learning. Data mining, inference, and prediction
This page was built for publication: Sparse non Gaussian component analysis by semidefinite programming
