The following pages link to (Q5405273):
Displaying 38 items.
- Alternating direction method of multipliers for penalized zero-variance discriminant analysis (Q97537) (← links)
- Projection algorithms for nonconvex minimization with application to sparse principal component analysis (Q312468) (← links)
- Sparse principal component analysis and iterative thresholding (Q355104) (← links)
- Near-optimal stochastic approximation for online principal component estimation (Q681490) (← links)
- An exponential inequality for U-statistics under mixing conditions (Q1745277) (← links)
- Kurdyka-Łojasiewicz property of zero-norm composite functions (Q2026719) (← links)
- A guide for sparse PCA: model comparison and applications (Q2073736) (← links)
- An active-set algorithm for norm constrained quadratic problems (Q2133422) (← links)
- Sparse equisigned PCA: algorithms and performance bounds in the noisy rank-1 setting (Q2286372) (← links)
- Recovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approach (Q2286374) (← links)
- Certifiably optimal sparse principal component analysis (Q2293653) (← links)
- Sparse principal component analysis with missing observations (Q2318671) (← links)
- Sparsistency and agnostic inference in sparse PCA (Q2338928) (← links)
- Compressed vibration modes of elastic bodies (Q2357713) (← links)
- Sparse PCA: optimal rates and adaptive estimation (Q2443213) (← links)
- Estimation of low-rank matrices via approximate message passing (Q2656598) (← links)
- Sparse PCA on fixed-rank matrices (Q2687042) (← links)
- Sparse Manifold Subspace Learning (Q3449321) (← links)
- (Q4558490) (← links)
- A Tight Bound of Hard Thresholding (Q4558539) (← links)
- ECA: High-Dimensional Elliptical Component Analysis in Non-Gaussian Distributions (Q4690955) (← links)
- Boosted sparse nonlinear distance metric learning (Q4970187) (← links)
- Sublinear Column-wise Actions of the Matrix Exponential on Social Networks (Q4985793) (← links)
- (Q4998937) (← links)
- (Q5054600) (← links)
- Dimension Reduction Forests: Local Variable Importance Using Structured Random Forests (Q5057244) (← links)
- Cutting Plane Generation through Sparse Principal Component Analysis (Q5081781) (← links)
- Eigenvectors from Eigenvalues Sparse Principal Component Analysis (Q5084448) (← links)
- Using ℓ1-Relaxation and Integer Programming to Obtain Dual Bounds for Sparse PCA (Q5095184) (← links)
- Fast deflation sparse principal component analysis via subspace projections (Q5107781) (← links)
- (Q5214193) (← links)
- An active-set proximal quasi-Newton algorithm for ℓ<sub>1</sub>-regularized minimization over a sphere constraint (Q5870141) (← links)
- Solving sparse principal component analysis with global support (Q6038649) (← links)
- Provable sample-efficient sparse phase retrieval initialized by truncated power method (Q6162742) (← links)
- A power method for computing the dominant eigenvalue of a dual quaternion Hermitian matrix (Q6569684) (← links)
- Continuous and atlas-free analysis of brain structural connectivity (Q6616322) (← links)
- Sparse Principal Component Analysis Based on Least Trimmed Squares (Q6636568) (← links)
- Slicing-free inverse regression in high-dimensional sufficient dimension reduction (Q6671903) (← links)
