Universality laws for randomized dimension reduction, with applications

DOI10.1093/imaiai/iax011zbMath1473.60031arXiv1511.09433OpenAlexW2963627806MaRDI QIDQ5242850

Joel A. Tropp, Samet Oymak

Publication date: 7 November 2019

Published in: Information and Inference: A Journal of the IMA (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1511.09433

zbMATH Keywords

dimension reductionstochastic geometryinvariance principlelimit theoremuniversalityrandom matrixstatistical estimationsignal reconstructionconvex geometryconic geometryrandom coderandomized numerical linear algebra

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05)

Related Items (14)

Fundamental barriers to high-dimensional regression with convex penalties ⋮ Low-Rank Tucker Approximation of a Tensor from Streaming Data ⋮ Randomized numerical linear algebra: Foundations and algorithms ⋮ Generalized notions of sparsity and restricted isometry property. II: Applications ⋮ The phase transition for the existence of the maximum likelihood estimate in high-dimensional logistic regression ⋮ Bound-constrained global optimization of functions with low effective dimensionality using multiple random embeddings ⋮ Noisy linear inverse problems under convex constraints: exact risk asymptotics in high dimensions ⋮ Universality of regularized regression estimators in high dimensions ⋮ The Lasso with general Gaussian designs with applications to hypothesis testing ⋮ Concentration of the Frobenius Norm of Generalized Matrix Inverses ⋮ The likelihood ratio test in high-dimensional logistic regression is asymptotically a rescaled Chi-square ⋮ An efficient randomized algorithm for computing the approximate Tucker decomposition ⋮ Analysis of sparse recovery algorithms via the replica method ⋮ Local tail statistics of heavy-tailed random matrix ensembles with unitary invariance

This page was built for publication: Universality laws for randomized dimension reduction, with applications