scientific article; zbMATH DE number 7370563
From MaRDI portal
Publication:4998937
Recommendations
- Minimax sparse principal subspace estimation in high dimensions
- Subspace perspective on canonical correlation analysis: dimension reduction and minimax rates
- Rate-optimal perturbation bounds for singular subspaces with applications to high-dimensional statistics
- Sparse PCA: optimal rates and adaptive estimation
- Optimal subspaces and constrained principal component analysis
- scientific article; zbMATH DE number 3940477
- Nearly optimal stochastic approximation for online principal subspace estimation
- On a computationally scalable sparse formulation of the multidimensional and nonstationary maximum entropy principle
- Von Neumann entropy penalization and low-rank matrix estimation
- Efficient Minimax Estimation of a Class of High-Dimensional Sparse Precision Matrices
Cites work
- 10.1162/153244303321897690
- A lower bound on the error in nonparametric regression type problems
- A penalized matrix decomposition, with applications to sparse principal components and canonical correlation analysis
- Adaptive model selection using empirical complexities
- Aggregation via empirical risk minimization
- Angular synchronization by eigenvectors and semidefinite programming
- Asymptotics of empirical eigenstructure for high dimensional spiked covariance
- Asymptotics of sample eigenstructure for a large dimensional spiked covariance model
- Central limit theorems for eigenvalues in a spiked population model
- Concentration inequalities and model selection. Ecole d'Eté de Probabilités de Saint-Flour XXXIII -- 2003.
- Eigenvalues of large sample covariance matrices of spiked population models
- Empirical entropy, minimax regret and minimax risk
- Entrywise eigenvector analysis of random matrices with low expected rank
- Generalized power method for sparse principal component analysis
- Geometric inference for general high-dimensional linear inverse problems
- High-dimensional probability. An introduction with applications in data science
- scientific article; zbMATH DE number 2089354 (Why is no real title available?)
- scientific article; zbMATH DE number 1302567 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Influential features PCA for high dimensional clustering
- Information-theoretic determination of minimax rates of convergence
- Introduction to nonparametric estimation
- Iterative reconstruction of rank-one matrices in noise
- Local Rademacher complexities and oracle inequalities in risk minimization. (2004 IMS Medallion Lecture). (With discussions and rejoinder)
- Minimax bounds for sparse PCA with noisy high-dimensional data
- Minimax nonparametric classification .I. Rates of convergence
- Minimax Rates of Entropy Estimation on Large Alphabets via Best Polynomial Approximation
- Minimax Rates of Estimation for High-Dimensional Linear Regression Over \ell_q-Balls
- Minimax risk of matrix denoising by singular value thresholding
- Minimax risks for sparse regressions: ultra-high dimensional phenomenons
- Minimax sparse principal subspace estimation in high dimensions
- Mutual information, metric entropy and cumulative relative entropy risk
- Non-Negative Principal Component Analysis: Message Passing Algorithms and Sharp Asymptotics
- Nonconvex phase synchronization
- On decoupling, series expansions, and tail behavior of chaos processes
- On the distribution of the largest eigenvalue in principal components analysis
- Optimal estimation and rank detection for sparse spiked covariance matrices
- Optimal shrinkage of eigenvalues in the spiked covariance model
- Optimal solutions for sparse principal component analysis
- Optimality and sub-optimality of PCA. I: Spiked random matrix models
- Partial recovery bounds for clustering with the relaxed K-means
- Phase transitions for high dimensional clustering and related problems
- Phase transitions in semidefinite relaxations
- Probability in Banach spaces. Isoperimetry and processes
- Projections onto convex sets on the sphere
- Rate Optimal Denoising of Simultaneously Sparse and Low Rank Matrices
- Rate-optimal perturbation bounds for singular subspaces with applications to high-dimensional statistics
- Selecting the number of principal components: estimation of the true rank of a noisy matrix
- Singular vector and singular subspace distribution for the matrix denoising model
- Sparse PCA: optimal rates and adaptive estimation
- Sparse principal component analysis and iterative thresholding
- Sparse principal component analysis via regularized low rank matrix approximation
- Suprema of chaos processes and the restricted isometry property
- The projected power method: an efficient algorithm for joint alignment from pairwise differences
- Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
- Tightness of the maximum likelihood semidefinite relaxation for angular synchronization
- Truncated power method for sparse eigenvalue problems
- Upper and lower bounds for stochastic processes. Modern methods and classical problems
Cited in
(5)- Lower bounds for invariant statistical models with applications to principal component analysis
- Perturbation upper bounds for singular subspaces with a kind of heteroskedastic noise and its application in clustering
- Van Trees inequality, group equivariance, and estimation of principal subspaces
- Optimal Structured Principal Subspace Estimation: Metric Entropy and Minimax Rates
- Leave-one-out singular subspace perturbation analysis for spectral clustering
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4998937)
