Precise error rates for computationally efficient testing
From MaRDI portal
Cites work
- A CLT for a band matrix model
- A CLT for the LSS of large-dimensional sample covariance matrices with diverging spikes
- A nearly tight sum-of-squares lower bound for the planted clique problem
- Asymptotic power of sphericity tests for high-dimensional data
- Asymptotics of sample eigenstructure for a large dimensional spiked covariance model
- Central limit theorem for linear spectral statistics of block-Wigner-type matrices
- Central limit theorems for eigenvalues in a spiked population model
- CLT for linear spectral statistics of large-dimensional sample covariance matrices.
- CLT for linear spectral statistics of Wigner matrices
- Computational barriers to estimation from low-degree polynomials
- Computationally efficient sparse clustering
- Disordered systems insights on computational hardness
- Efficient Bayesian estimation from few samples: community detection and related problems
- Eigenvalues of large sample covariance matrices of spiked population models
- Estimation of low-rank matrices via approximate message passing
- Finite sample approximation results for principal component analysis: A matrix perturbation approach
- Fluctuations of the free energy of the spherical Sherrington-Kirkpatrick model
- Fluctuations of the free energy of the spherical Sherrington-Kirkpatrick model with ferromagnetic interaction
- Fundamental limits of detection in the spiked Wigner model
- HIGH DIMENSIONAL ESTIMATION VIA SUM-OF-SQUARES PROOFS
- scientific article; zbMATH DE number 7650426 (Why is no real title available?)
- Information-Theoretic Bounds and Phase Transitions in Clustering, Sparse PCA, and Submatrix Localization
- Is it easier to count communities than find them?
- Iterative reconstruction of rank-one matrices in noise
- Large Cliques Elude the Metropolis Process
- Large deviations for the largest eigenvalue of rank one deformations of Gaussian ensembles
- Limits of local algorithms over sparse random graphs
- Low-degree hardness of random optimization problems
- Notes on computational hardness of hypothesis testing: predictions using the low-degree likelihood ratio
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- On finite rank deformations of Wigner matrices
- On the distribution of the largest eigenvalue in principal components analysis
- On the Limitation of Spectral Methods: From the Gaussian Hidden Clique Problem to Rank One Perturbations of Gaussian Tensors
- Optimality and sub-optimality of PCA. I: Spiked random matrix models
- Phase transition of the largest eigenvalue for nonnull complex sample covariance matrices
- Precise error rates for computationally efficient testing
- Signal detection in high dimension: the multispiked case
- Some rigorous results on the Sherrington-Kirkpatrick spin glass model.
- Statistical algorithms and a lower bound for detecting planted cliques
- Subexponential-time algorithms for sparse PCA
- Testing Statistical Hypotheses
- The Dynamics of Message Passing on Dense Graphs, with Applications to Compressed Sensing
- The eigenvalues and eigenvectors of finite, low rank perturbations of large random matrices
- The largest eigenvalue of rank one deformation of large Wigner matrices
- The largest eigenvalue of small rank perturbations of Hermitian random matrices
- The largest eigenvalues of finite rank deformation of large Wigner matrices: Convergence and nonuniversality of the fluctuations
- The power of sum-of-squares for detecting hidden structures
- Weak Detection in the Spiked Wigner Model
Cited in
(2)
This page was built for publication: Precise error rates for computationally efficient testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6974370)
