classical results in asymptotic statistics show that the fisher information matrix controls the difficulty of estimating a statistical model from observed data. in this work, we introduce a companion measure of robustness of an estimation problem: the radius of statistical efficiency (rse) is the size of the smallest perturbation to the problem data that renders the fisher information matrix singular. we compute rse up to numerical constants for a variety of test bed problems, including principal component analysis, generalized linear models, phase retrieval, bilinear sensing, and matrix completion. in all cases, the rse quantifies the compatibility between the covariance of the population data and the latent model parameter. interestingly, we observe a precise reciprocal relationship between rse and the intrinsic complexity/sensitivity of the problem instance, paralleling the classical eckart–young theorem in numerical analysis.