Precise error rates for computationally efficient testing (Q6974370)

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

Precise error rates for computationally efficient testing

scientific article; zbMATH DE number 8050054

Language	Label	Description	Also known as
default for all languages	No label defined
English	Precise error rates for computationally efficient testing	scientific article; zbMATH DE number 8050054

Statements

instance of

scholarly article

0 references

title

Precise error rates for computationally efficient testing (English)

0 references

0 references

0 references

The Annals of Statistics

0 references

publication date

6 June 2025

0 references

full work available at URL

https://projecteuclid.org/journals/annals-of-statistics/volume-53/issue-2/Precise-error-rates-for-computationally-efficient-testing/10.1214/25-AOS2490.full

0 references

zbMATH Keywords

hypothesis testing

0 references

spiked Wigner model

0 references

low-degree likelihood ratio

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Some rigorous results on the Sherrington-Kirkpatrick spin glass model.

0 references

A CLT for a band matrix model

0 references

CLT for linear spectral statistics of Wigner matrices

0 references

Central limit theorems for eigenvalues in a spiked population model

0 references

CLT for linear spectral statistics of large-dimensional sample covariance matrices.

0 references

Phase transition of the largest eigenvalue for nonnull complex sample covariance matrices

0 references

Fluctuations of the free energy of the spherical Sherrington-Kirkpatrick model

0 references

Fluctuations of the free energy of the spherical Sherrington-Kirkpatrick model with ferromagnetic interaction

0 references

Eigenvalues of large sample covariance matrices of spiked population models

0 references

Q5875785

0 references

Information-Theoretic Bounds and Phase Transitions in Clustering, Sparse PCA, and Submatrix Localization

0 references

A nearly tight sum-of-squares lower bound for the planted clique problem

0 references

The Dynamics of Message Passing on Dense Graphs, with Applications to Compressed Sensing

0 references

The eigenvalues and eigenvectors of finite, low rank perturbations of large random matrices

0 references

On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines

0 references

The largest eigenvalues of finite rank deformation of large Wigner matrices: Convergence and nonuniversality of the fluctuations

0 references

Weak Detection in the Spiked Wigner Model

0 references

Subexponential-time algorithms for sparse PCA

0 references

Fundamental limits of detection in the spiked Wigner model

0 references

Statistical algorithms and a lower bound for detecting planted cliques

0 references

The largest eigenvalue of rank one deformation of large Wigner matrices

0 references

Iterative reconstruction of rank-one matrices in noise

0 references

Low-degree hardness of random optimization problems

0 references

Disordered systems insights on computational hardness

0 references

Limits of local algorithms over sparse random graphs

0 references

The power of sum-of-squares for detecting hidden structures

0 references

Efficient Bayesian estimation from few samples: community detection and related problems

0 references

Large Cliques Elude the Metropolis Process

0 references

On the distribution of the largest eigenvalue in principal components analysis

0 references

Notes on computational hardness of hypothesis testing: predictions using the low-degree likelihood ratio

0 references

Testing Statistical Hypotheses

0 references

A CLT for the LSS of large-dimensional sample covariance matrices with diverging spikes

0 references

Computationally efficient sparse clustering

0 references

Large deviations for the largest eigenvalue of rank one deformations of Gaussian ensembles

0 references

Precise error rates for computationally efficient testing

0 references

On the Limitation of Spectral Methods: From the Gaussian Hidden Clique Problem to Rank One Perturbations of Gaussian Tensors

0 references

Estimation of low-rank matrices via approximate message passing

0 references

Finite sample approximation results for principal component analysis: A matrix perturbation approach

0 references

Asymptotic power of sphericity tests for high-dimensional data

0 references

Signal detection in high dimension: the multispiked case

0 references

Asymptotics of sample eigenstructure for a large dimensional spiked covariance model

0 references

The largest eigenvalue of small rank perturbations of Hermitian random matrices

0 references

Optimality and sub-optimality of PCA. I: Spiked random matrix models

0 references

On finite rank deformations of Wigner matrices

0 references

HIGH DIMENSIONAL ESTIMATION VIA SUM-OF-SQUARES PROOFS

0 references

Is it easier to count communities than find them?

0 references

Computational barriers to estimation from low-degree polynomials

0 references

Central limit theorem for linear spectral statistics of block-Wigner-type matrices

0 references

Identifiers

zbMATH Open document ID

1566.62169

0 references

DOI

10.1214/25-AOS2490

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Precise error rates for computationally efficient testing