On generic chaining and the smallest singular value of random matrices with heavy tails

From MaRDI portal
(Redirected from Publication:418699)




Abstract: We present a very general chaining method which allows one to control the supremum of the empirical process suphinH|N1sumi=1Nh2(Xi)Eh2| in rather general situations. We use this method to establish two main results. First, a quantitative (non asymptotic) version of the classical Bai-Yin Theorem on the singular values of a random matrix with i.i.d entries that have heavy tails, and second, a sharp estimate on the quadratic empirical process when H=inrt,cdot:tinT, TsubsetRn and mu is an isotropic, unconditional, log-concave measure.



Cites work







This page was built for publication: On generic chaining and the smallest singular value of random matrices with heavy tails

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q418699)