On generic chaining and the smallest singular value of random matrices with heavy tails
Shahar Mendelson, Grigoris Paouris
Introduction
The main goal of this article is to obtain a non-asymptotic version of the Bai-Yin Theorem on the largest and smallest singular values of certain random matrices. The Bai-Yin theorem asserts the following:
Let be an random matrix with independent entries, distributed according to a random variable , for which
If and the aspect ratio converges to , then
almost surely, where and denote the largest and smallest singular value of .
Also, without the fourth moment assumption, is almost surely unbounded.
The main result of this article is a quantitative version of the Bai-Yin Theorem.
We will focus on the following questions:
Observe that the two questions are very similar. For example, it is straightforward to verify that if is isotropic, then both parts can be resolved by estimating the supremum of the empirical process
And, in view of the second part of Question 1.2, we will be especially interested in the case , that is, while keeping the aspect ratio constant.
To formulate the moment assumption we will use here, recall that for , the Orlicz norm of random variable is defined by
and there are obvious extensions for . It is standard to verify that for every , is equivalent to .
For , a symmetric measure satisfies a -small diameter, moment assumption with constants and , if a random vector distributed according to satisfies that
satisfies a small diameter moment assumption if the norm replaces the one in (1.2).
One should note that with very few exceptions, both parts of Assumption 1.3 are needed if one wishes to address Question 1.2.
and are constants that depend only on .
It is straightforward to verify that this bound is optimal by considering the uniform measure on the set of coordinate vectors , which results in the coupon-collector problem. Thus, given , one requires at least random points to ensure that the sample covariance matrix -approximates the true covariance. Of course, does not lead to a nontrivial estimate in the second part of Question 1.2, i.e. if the aspect ratio and , and in particular, (1.3) can not yield a Bai-Yin type of bound. Any hope of getting the desired bounds in Question (1.2) requires additional assumptions on .
Unfortunately, when one has a weaker moment estimate than a one, the situation becomes considerably more difficult. The complexity of the set one has to control remains the same, but the individual concentration deteriorates, because N^{-1}\sum\bigl{<}X_{i},x\bigr{>}^{2} does not exhibit a strong enough concentration around its mean to balance the concentration-complexity tradeoff at the level of . Therefore, with a weaker moment assumption than a one, a combination of individual tail bounds and a “global” assumption, like the small diameter information, is required in both parts of Question 1.2.
Partial results in the isotropic, log-concave case have been obtain by Bourgain , yielding an estimate on the covariance operator for , which was improved by Rudelson to . Subsequent improvements were for unconditional convex bodies in and for general log-concave measures in . Finally, the optimal estimate of was obtained for an unconditional, log-concave measures by Aubrun , and for an arbitrary log-concave measure in Adamczak et al. , where the following result was proved:
There exist absolute constants and for which the following holds. If is an isotropic, log-concave measure, then with probability at least ,
Naturally, Question 1.2 becomes even harder when one assumes that linear functionals have heavy tails, because sums of independent random variable exhibit very limited concentration – far below the level required for the proof of Theorem 1.4. Recently, Vershynin proved the following remarkable fact:
For every , and constants and , there exist constants and that depend on , and for which the following holds.
If satisfies a -small diameter, moment assumption with constants and , then for every , with probability at least ,
In particular, if is isotropic then
Moreover, very recently Strivastava and Vershynin , obtained the following result:
If are independent random vectors distributed according to then for every ,
Moreover, only under a -moment assumption,
It should be noted that the boundedness assumption in Theorem 1.6 is satisfied by a vector with independent components , if for , and thus both parts may be used in the i.i.d situation. However, for any , ( being the power in the Bai-Yin Theorem).
Our main result gives a version of Theorem 1.5 for an unconditional measure with “heavy tails”.
Theorem A. Let be an unconditional measure that satisfies the -small diameter, moment assumption with constants and for some .
1. For every and , there exist constants , and that depend on , , , and , such that, for every , with probability at least ,
2. For every , if and , there exist constants and that depend on , , , and , such that, for every , with probability at least ,
In both cases, for every , with probability at least , provided that . Moreover, if is isotropic and , then
for an arbitrary class of functions – not even for H_{T}=\{\bigl{<}t,\cdot\bigr{>}:t\in T\} when is not the sphere or close to the sphere in some sense.
The proof of Theorem A does just that, since it is based on a bound on (1.4) in terms of a certain notion of “complexity” of the class . It is not tailored to the case , nor does it relay on the fact that the indexing class consists of linear functionals. Rather, the proof is based on a chaining scheme which is much more general than the applications that will be presented here.
The second application we chose to present as an illustration of the potential this empirical processes based method has, is the following.
and thus is weakly dominated by .
Moreover, the results of show that if is centrally symmetric and is isotropic and -subgaussian, then
Theorem B has many standard applications, leading to embedding results of a similar nature to the Johnson-Lindenstrauss Lemma and to “low ” estimates that hold for unconditional, log-concave ensembles. Deriving these and other outcomes from Theorem B is standard and will not be presented here. One should also note that a log-concave Chevet type inequality, i.e., upper estimates on the operator norm for finite dimensional normed spaces and has recently been established in .
Preliminaries
Throughout, all absolute constants are positive numbers, denoted by and their value may change from line to line. denote constants whose value will remain unchanged. By we mean that there are absolute constants and such that , and by that . (resp. ) denotes that the constants depend only on .
Next, let us turn to the complexity parameters that motivated our method of analysis – Talagrand’s -functionals.
For a metric space , an admissible sequence of is a collection of subsets of , , such that for every , and . For , define the functional by
where the infimum is taken with respect to all admissible sequences of . For an admissible sequence we denote by a nearest point to in with respect to the metric .
One should note that our chaining approach is based on a slightly less restrictive definition, giving one more freedom; for example, the cardinality of the sets will not necessarily be , the metric may change with , etc. (see Section 3).
When considered for a set , has close connections with properties of the canonical gaussian process indexed by , and we refer the reader to for detailed expositions on these connections. One can show that under mild measurability assumptions, if is a centered gaussian process indexed by a set , then
Decomposition of sets
Let be an increasing function which will be chosen according to additional information one will have on the given class. Examples that one should have in mind are , resulting from a bound on the diameter of , or for and in the right range, arising from an moment assumption.
1. .
2. For every and every ,
3. If then for every and every
and if then for every and every ,
Although this definition seems artificial at first glance, we will show that it captures the geometry of a typical coordinate projection .
To formulate the estimate on the Bernoulli process, set
For and , let
As will become clearer, the most important of the parameters is
which, under the standard choice of and for , corresponds to .
Before presenting the proof, let us consider the two main examples which will interest us, namely, the families for any and for any (and for selected appropriately).
In both cases and for any , . If and , , and since , then for or ,
with the constant depending either on or on and as above.
On the other hand, if and then
Next, since increases exponentially, then for
and the constant in (3.1) depends on or on and respectively. In particular, if and , then
Finally, one has to control . Note that if or , then
and if and then
We thus arrive to a more compact formulation of Theorem 3.2 in the cases we will be interested in.
For any or , with probability at least ,
with a constant that depends on or on and respectively.
Also, if and , then with probability at least ,
Let , and since
one has to control increments of the form .
Observe that if then with probability ,
Next, if we will decompose the vectors one has to control according to the size of their coordinates, because, with probability ,
Consider the following two cases. If then
Therefore, summing the three terms over ,
then splitting each to as above,
Recall that and that . Given , then applying (3) for and summing over , it follows that is bounded by the desired quantity with probability at least .
Coordinate projections of Function classes
The aim of this section is to show that under very mild assumptions, empirical processes have well behaved coordinate projections in the sense of Definition 3.1. A first result in this direction was established in , in which the main observation, formulated in the language of Section 3, was that if and for , then for the choice of , , and , the set has a good decomposition with high probability. Hence, the Bernoulli process indexed by satisfies the following:
There exist absolute constants , and for which the following holds. If is a class of functions, then for every , with -probability at least , satisfies that
with probability at least with respect to the Bernoulli random variables.
Theorem 4.1 is rather restricted because the -based complexity parameter seems too strong in many situations, as does the assumption that is a bounded subset of . Here, we will try to impose as few assumptions as possible on .
Let be a class of functions on . For every we will define three events in the product space , which will be denoted by , and . On the event , the random set will be well behaved for the right choice of functionals and . We will then study cases in which the event has high probability.
For as above, set to be the first integer for which .
For an admissible sequence and a sequence of functionals , let be the event for which, for every , the following holds:
2. for every , .
Formally, to define the set , first fix a random variable , an integer and . For every let , set
and without loss of generality, we will assume that the infimum is attained.
where is a suitable chosen absolute constant.
The motivation for this definition is the following observation, showing that with high probability, the “tail” of a sum of i.i.d random variables can be controlled using .
Proof. Since then for ,
where the last inequality is evident by a change of variables.
We will also need the following “global” counterpart of the functional .
Given a class of functions , an integer and , set
Clearly, for every and every , .
The final set, is very close in nature to . It is needed to control the coordinates of “very small” increments – when , if such an integer exists.
If , let be the event on which for every , every and ,
If set .
It turns out that on the event , the set is indeed well behaved. Let
with the infimum is taken with respect to all -admissible sequences. From here on we will assume that is an almost optimal -admissible sequence.
There exists absolute constants and for which the following holds. Let be functionals, and for set . For every , on the event , for every and ,
where if and otherwise.
and the claim is evident from the definition of the function and the set .
If, on the other hand, then and the assertion follows from the definition of .
The second part of (1) follows from the definition of .
and thus, for every and every ,
For Lemma 4.8 to have any meaning, one has to identify the functionals , and in the cases one is interested in. Our next goal is to study the functions and under various tail assumptions on functions in , and naturally, the two families of tail estimates we will be interested in are when has a bounded diameter in or in for .
If , then for every , . Thus, for and every ,
Hence, if , then
Using the same argument, if then and for any , . If , and then
Combining these observations with the estimates of Lemma 4.8 and noting that if then , one reaches the following corollary.
Let be a sequence of functionals and for let . If is bounded in for , then on , for every and every
A similar bound holds when is bounded in .
We will begin by showing that is a large set, almost regardless of any assumptions on , an observation that is based on the same idea as Lemma 4.4.
There exist absolute constants and such that, for every and , .
Since is always large, and since will behave in a very similar way when , the crucial point in the construction of a good decomposition of is a correct choice of and estimates on .
The functionals capture the geometry of , and thus have to be selected according to the information one has on the class. We will present two examples of such choices, each leading to one of our two main results. The first one will be based on “global” structure like metric entropy, while the second uses accurate estimates on each “chain”.
Let be an absolute constant to be fixed later, set for , and put
Note that as long as , i.e., if - which we will assume is the case, since our main interest in when .
For every , and there exist constants and that depend only on , and for which the following holds. There is an -admissible sequence of , for which, if , then and
Indeed, by the unconditionality of , has the same distribution as . Hence, for every
If then for every , . Moreover, for , .
for a suitable absolute constant , proving the first part.
For the second part, note that . By the first part, , while a standard volumetric estimate shows that .
Next, let us define the sets . If , let be a maximal separated subset of relative to the norm and of cardinality . If , let be a maximal separated subset of with respect to the norm, and of cardinality . Given a vector , we will define the functions as follows. If , is a best approximation of in . For one combines approximation and dimension reduction. Set to satisfy that (and without loss of generality we will assume that such an integer exists). If , let be the set of the largest coordinates of , and put to be the best approximation of the coordinate projection in , and so on.
There exists an absolute constant such that for every , if (i.e., if ), then \|\bigl{<}\Delta_{s}t,\cdot\bigr{>}\|_{\psi_{2}}\leq c2^{-2^{s+s_{1}}/n}, and if then \|\bigl{<}\Delta_{s}t,\cdot\bigr{>}\|_{\psi_{2}}\leq c2^{-(s+s_{1})/2}M_{2^{s+s_{1}}}.
Proof. First consider . Note that \|\bigl{<}\Delta_{s}t,\cdot\bigr{>}\|_{\psi_{2}}\leq\|\bigl{<}t-\pi_{s}t,\cdot\bigr{>}\|_{\psi_{2}}+\|\bigl{<}t-\pi_{s-1}t,\cdot\bigr{>}\|_{\psi_{2}}\leq\varepsilon_{s}+\varepsilon_{s-1}, and by the covering numbers estimate from Lemma 5.3, in that range .
In the range , , where consists of the smallest coordinates of for some , and is an -approximation of the largest coordinates of . Therefore, \|\bigl{<}\Delta_{s}t,\cdot\bigr{>}\|_{\psi_{2}}\leq\|\bigl{<}w,\cdot\bigr{>}\|_{\psi_{2}}+\varepsilon_{s-1}. Recall that for every such , is a union of balls of dimension , then
Proof of Theorem 5.2. Observe that , and thus, by a standard application of Bernstein’s inequality, for every integer ,
Also, with probability at least , if then
Using Lemma 5.4 and summing the probability estimates, it is evident that with probability at least , the following holds: if then
and if and then
Note that if for , then
There exist absolute constants , and and that depend on , for which the following holds. If is as above and , then has an -admissible sequence for which, for , with probability at least , for every and every ,
For every , , , and , there exist constants , , and which depend on , , , and , and an absolute constant for which the following holds. If is as above, and , then for every , with -probability at least , satisfies that
with probability at least relative to the Bernoulli random variables.
Turning to the case , recall that for , . Assume that is as above and satisfies the -small diameter assumption for . Then, for (i.e. if ),
Let , and . If and are as above, , and , then with probability at least , satisfies that
with probability at least relative to the Bernoulli random variables.
In particular, taking , then for every such satisfying that , and any ,
2 Unconditional log-concave measures
We will now present a different way of bounding (and if needed) by estimating the moments of the increments , and selecting the functionals accordingly.
In light of Theorem B, we will assume that is a bounded subset of (although what we do here can be extended to other moment assumptions), and thus one may control using for and which will be selected later.
There exist absolute constants , and for which the following holds. For , with probability at least , for every and every , .
Next, one has to control the moments appearing in Lemma 5.8, which is based on the following result, due to Latała .
Let be independent, distributed according to a nonnegative random variable . Then for every ,
If is a random variable, for every set
The -norms are a local version of the norm, and clearly . Using those norms one may obtain a more compact expression for the required moments.
There exist an absolute constant such that for every , every and every ,
There exist absolute constants and for which the following holds. If, for ,
then .
Next, assume that , and thus one has to bound .
There exists absolute constants , and such that, for every , with probability at least , for every and every ,
and a similar bound holds for .
Proof. Recall that for a fixed and every , . Let and observe that if , then and
Since the cardinality of the set is at most , (5.6) holds uniformly with probability at least for . Therefore, on that event, for every and every ,
An identical argument holds for .
Therefore, the event has high probability, leading to the following decomposition result.
There exist absolute constants and for which the following holds. For every , with probability at least , for every and every ,
where if and otherwise.
Note that , and thus one may take . If and for , then for an almost optimal admissible sequence,
Although this estimate leads to an alternative proof of Theorem 4.1, it is not sharp enough to prove Theorem B, as the latter requires more accurate bounds on .
From here on we will assume that and that for . If , set .
There exist absolute constants and for which the following holds. If is an isotropic, unconditional log-concave measure, H_{T}=\{\bigl{<}t,\cdot\bigr{>}:t\in T\} and is an admissible sequence of , then for every ,
where is an isotropic image of .
The moments of every linear functional \bigl{<}t,\cdot\bigr{>} relative to the volume measure of an isotropic position of are well known : namely, for ,
Note that for an almost optimal admissible sequence,
There exist absolute constants , , and for which the following holds. For every , With -probability at least , the set satisfies that
with probability at least with respect to the Bernoulli random variables.
3 Proofs of Theorems A and B
The final step we need for the proofs of Theorem A and Theorem B is a version of the Ginè-Zinn symmetrization Theorem (see, e.g. ), which enables one to pass from the Bernoulli process indexed by random coordinate projections of a class of functions, to the empirical process indexed by the class.
Let be a class of functions which is bounded in and consider the empirical process indexed by . If and then and the same holds if and .
Proof. The first part of the claim follows from an application of Chebyshev’s inequality, and is omitted. For the second part, fix , set , and since then
Moreover, for , . Hence, a truncation argument shows that without loss of generality we may assume that . Applying the estimate for the largest two coordinates of and (5.7) for the rest, it follows that
showing that it suffices to take as claimed.
Since is well within our range, one may complete the proofs of Theorem A and Theorem B.
Proof of Theorem A. For , let for , and . If set for and . Then,
Proof of the quantitative Bai-Yin Theorem.
Hence, the final step in the proof of our version of the Bai-Yin Theorem is to show that if for , there is some for which has a large measure.
For every and , there exist constants and that depend on and for which the following holds. If , and are independent copies of , then
Proof. If then , and for every , . Therefore, if and then
Combining Lemma 5.21 with Theorem A concludes the proof of the quantitative Bai-Yin Theorem.
Proof of Theorem B. If , with probability at least with respect to the Bernoulli random variables,
Since is a “legal” choice in the Giné-Zinn symmetrization theorem, the proof is concluded.