Spectral Methods for Data Science: A Statistical Perspective
From MaRDI portal
classification and predictionclusteringcollaborative filtering and recommender systemsinformation theory and statisticslearning and statistical methodsmetasearchoperations researchpattern recognition and learningrank aggregation and data fusionsignal reconstructionsparse representationsspectral methodsstatistical learning theorystatistical/machine learning
Recommendations
Cited in
(66)- Generative modeling via tree tensor network states
- Generative modeling via tensor train sketching
- Robust Recovery of Low-Rank Matrices and Low-Tubal-Rank Tensors from Noisy Sketches
- Fast gradient method for low-rank matrix estimation
- Self-supervised Metric Learning in Multi-View Data: A Downstream Task Perspective
- Learning low-dimensional nonlinear structures from high-dimensional noisy data: an integral operator approach
- Robust high-dimensional tuning free multiple testing
- Finding mixed memberships in categorical data
- Statistical ranking with dynamic covariates
- Robust two-way dimension reduction by Grassmannian barycenter
- Partial recovery and weak consistency in the non-uniform hypergraph stochastic block model
- Learning from similar linear representations: adaptivity, minimaxity, and robustness
- Structured matrix learning under arbitrary entrywise dependence and estimation of Markov transition kernel
- Spectral estimators for structured generalized linear models via approximate message passing
- Randomized spectral clustering for large-scale multi-layer networks
- Mixed membership estimation for categorical data with weighted responses
- Higher-order entrywise eigenvectors analysis of low-rank random matrices: bias correction, Edgeworth expansion and bootstrap
- Efficient estimation of the central mean subspace via smoothed gradient outer products
- Testing sufficiency for transfer learning
- Asymptotic limits of spiked eigenvalues and eigenvectors of signal-plus-noise matrices with weak signals and heteroskedastic noise
- Uniform error bound for PCA matrix denoising
- Network-adjusted covariates for community detection
- Deflated HeteroPCA: overcoming the curse of ill-conditioning in heteroskedastic PCA
- A spectral method for identifiable grade of membership analysis with binary responses
- Optimal spectral recovery of a planted vector in a subspace
- Analysis of singular subspaces under random perturbations
- Spectrum-aware debiasing: a modern inference framework with applications to principal components regression
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Discussion of: ``Statistical exploration of the manifold hypothesis
- Reply to the discussion of: ``Statistical exploration of the manifold hypothesis
- The power of preconditioning in overparameterized low-rank matrix sensing
- Data denoising with self-consistency, variance maximization, and the Kantorovich dominance
- Testing for latent structure via the Wilcoxon-Wigner random matrix of normalized rank statistics
- Fast eigenvalue finders for data with graph symmetries
- Detection and estimation of vertexwise latent position shifts across networks
- Regularized spectral clustering in overlapping networks
- Residual-based Chebyshev filtered subspace iteration for Hermitian eigenvalue problems tolerant to inexact matrix-vector products
This page was built for publication: Spectral Methods for Data Science: A Statistical Perspective
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5015834)
