On generic chaining and the smallest singular value of random matrices with heavy tails
We present a very general chaining method which allows one to control the supremum of the empirical process suph∈H|N-1∑i=1Nh2(Xi)-Eh2| in rather general situations. We use this method to establish two main results. First, a quantitative (non-asymptoti
|Collections||ANU Research Publications|
|Source:||Journal of Functional Analysis|
|01_Mendelson_On_generic_chaining_and_the_2012.pdf||306.75 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.