Sub-Gaussian mean estimators

Luc Devroye, Matthieu Lerasle, Gabor Lugosi, Roberto I. Oliveira

Introduction

Estimating the mean of a probability distribution P{\rm P} on the real line based on a sample X1n=(X1,…,Xn)X_{1}^{n}=(X_{1},\dots,X_{n}) of nn independent and identically distributed random variables is arguably the most basic problem of statistics. While the standard empirical mean

is the most natural choice, its finite-sample performance is far from optimal when the distribution has a heavy tail.

The central limit theorem guarantees that if the XiX_{i} have a finite second moment, this estimator has Gaussian tails, asymptotically, when n→∞n\to\infty. Indeed,

where μP\mu_{{\rm P}} and σP2>0\sigma^{2}_{{\rm P}}>0 are the mean and variance of P{\rm P} (respectively) and Φ\Phi is the cumulative distribution function of the standard normal distribution. This result is essentially optimal: no estimator can have better-than-Gaussian tails for all distributions in any “reasonable class” (cf. Remark 1 below).

This paper is concerned with a non-asymptotic version of the mean estimation problem. We are interested in large, non-parametric classes of distributions, such as

as well as some other classes introduced in Section 3. Given such a class P\mathcal{P}, we would like to construct sub-Gaussian estimators. These should take an i.i.d. sample X1nX_{1}^{n} from some unknown P∈P{\rm P}\in\mathcal{P} and produce an estimate E^n(X1n)\widehat{E}_{n}(X_{1}^{n}) of μP\mu_{{\rm P}} that satisfies

for some constant L>0L>0 that depends only on P\mathcal{P}. One would like to keep δmin⁡\delta_{\min} as small as possible (say exponentially small in nn).

Of course, when n→∞n\to\infty with δ\delta fixed, (5) is a weaker form of (1) since Φ−1(1−δ/2)≤2ln⁡(2/δ)\Phi^{-1}(1-\delta/2)\leq\sqrt{2\ln(2/\delta)}. The point is that (5) should hold non-asymptotically, for extremely small δ\delta, and uniformly over P∈P{\rm P}\in\mathcal{P}, even for classes P\mathcal{P} containing distributions with heavy tails. The empirical mean cannot satisfy this property unless either P\mathcal{P} contains only sub-Gaussian distributions or δmin\delta_{min} is quite large (cf. Section 2.3.1), so designing sub-Gaussian estimators with the kind of guarantee we look for is a non-trivial task.

In this paper we prove that, for most (but not all) classes P⊂P2\mathcal{P}\subset\mathcal{P}_{2} we consider, there do exist estimators that achieve (5) for all large nn, with δmin⁡≈e−cP n\delta_{\min}\approx e^{-c_{\mathcal{P}}\,n} and a value of LL that does not depend on δ\delta or nn. In each case, cP>0c_{\mathcal{P}}>0 is a constant that depends on the class P\mathcal{P} under consideration, and we also obtain nearly tight bounds on how cPc_{\mathcal{P}} must depend on P\mathcal{P}. (In particular, δmin⁡\delta_{\min} cannot be superexponentially small in nn.) In the specific case of bounded-kurtosis distributions (cf. (4) above), we achieve L≤2+ϵL\leq\sqrt{2}+\epsilon for δmin⁡≈e−o((n/κ)2/3)\delta_{\min}\approx e^{-o\left((n/\kappa)^{2/3}\right)}. This value of LL is nearly optimal by Remark 1 below.

Before this paper, it was known that (5) could be achieved for the whole class P2\mathcal{P}_{2} of distributions with finite second moments, with a weaker notion of estimator that we call δ\delta-dependent estimator, that is, an estimator E^n=E^n,δ\widehat{E}_{n}=\widehat{E}_{n,\delta} that may also depend on the confidence parameter δ\delta. By contrast, the estimators that we introduce here are called multiple-δ\delta estimators: a single estimator works for the whole range of δ∈[δmin⁡,1)\delta\in[\delta_{\min},1). This distinction is made formal in Definition 1 below. By way of comparison, we also prove some results on δ\delta-dependent estimators in the paper. In particular, we show that the distinction is substantial. For instance, there are no multiple-δ\delta sub-Gaussian estimators for the full class P2\mathcal{P}_{2} for any nontrivial range of δmin⁡\delta_{\min}. Interestingly, multiple-δ\delta estimators do exist (with δmin⁡≈e−c n\delta_{\min}\approx e^{-c\,n}) for the class P2σ2\mathcal{P}_{2}^{\sigma^{2}} (corresponding to fixed variance). In fact, this is true when the variance is “known up to constants,” but not otherwise.

This result not only shows that one cannot expect sub-Gaussian confidence intervals for classes that contain distributions of infinite variance but also that in such cases it is impossible to have confidence intervals whose length scales as n−1/2n^{-1/2}.

Weakly sub-Gaussian estimators

Consider the class PBer\mathcal{P}^{\text{Ber}} of all Bernoulli distributions, that is, the class that contains all distributions PP of the form

Perhaps surprisingly, no multiple-δ\delta estimator exists for this class of distributions, even when δmin⁡\delta_{\min} is a constant. (We do not explicitly prove this here but it is easy to deduce it using the techniques of Sections 4.3 and 4.5.) On the other hand, by standard tail bounds for the binomial distribution (e.g., by Hoeffding’s inequality), the standard empirical mean satisfies, for all δ>0\delta>0 and P∈PBerP\in\mathcal{P}^{\text{Ber}},

Of course, this bound has a sub-Gaussian flavor as it resembles (5) except that the confidence bounds do not scale by σP(log⁡(1/δ)/n)1/2\sigma_{{\rm P}}(\log(1/\delta)/n)^{1/2} but rather by a distribution-free constant times (log⁡(1/δ)/n)1/2(\log(1/\delta)/n)^{1/2}.

In general, we may call an estimate weakly sub-Gaussian with respect to the class P\mathcal{P} if there exists a constant σ‾P\overline{\sigma}_{\mathcal{P}} such that for all P∈P{\rm P}\in\mathcal{P},

for some constant L>0L>0. δ\delta-dependent and multiple-δ\delta versions of this definition may be given in analogy to those of sub-Gaussian estimators.

Note that if a class P\mathcal{P} is such that sup⁡P∈PσP<∞\sup_{{\rm P}\in\mathcal{P}}\sigma_{{\rm P}}<\infty, then any sub-Gaussian estimator is weakly sub-Gaussian. However, for classes of distributions without uniformly bounded variance, this is not necessarily the case and the two notions are incomparable.

In this paper we focus on the notion of sub-Gaussian estimators and we do not pursue further the characterization of the existence of weakly sub-Gaussian estimators.

1 Related work

To our knowledge, the explicit distinction between δ\delta-dependent and multiple-δ\delta estimators, and our construction of multiple-δ\delta sub-Gaussian estimators for exponentially small δ\delta, are all new. On the other hand, constructions of δ\delta-dependent estimators are implicit in older work on stochastic optimization of Nemirovsky and Yudin (see also Levin and Hsu ), sampling from large discrete structures by Jerrum, Valiant, and Vazirani , and sketching algorithms, see Alon, Matias, and Szegedy . Recently, there has been a surge of interest in sub-Gaussian estimators, their generalizations to multivariate settings, and their applications in a variety of statistical learning problems where heavy-tailed distributions may be present, see, for example, Catoni , Hsu and Sabato , Brownlees, Joly, and Lugosi , Lerasle and Oliveira , Minsker , Audibert and Catoni , Bubeck, Cesa-Bianchi, and Lugosi . Most of these papers use δ\delta-dependent sub-Gaussian estimators. Catoni’s paper is close in spirit to ours, as it focuses on sub-Gaussian mean estimation as a fundamental problem. That paper presents δ\delta-dependent sub-Gaussian estimators with nearly optimal L=2+o(1)L=\sqrt{2}+o\left(1\right) for a wide range of δ\delta and the classes P2σ2\mathcal{P}_{2}^{\sigma^{2}} and Pkrt≤κ\mathcal{P}_{{\rm krt}\leq\kappa} defined in (3). The δ\delta-dependent sub-Gaussian estimator introduced by may be converted into a multiple-δ\delta estimators with subexponential (instead of sub-Gaussian) tails for P2σ2\mathcal{P}_{2}^{\sigma^{2}} by choosing the single parameter of the estimator appropriately. Loosely speaking, this corresponds to squaring the term ln⁡(1/δ)\ln(1/\delta) in (5). Catoni also obtains multiple-δ\delta estimators for P2\mathcal{P}_{2} with subexponential tails. These ideas are strongly related to Audibert and Catoni’s paper on robust least-squares linear regression .

2 Main proof ideas

The negative results we prove in this paper are minimax lower bounds for simple families of distributions such as scaled Bernoulli distributions (Theorem 3.1), Laplace distributions with fixed scale parameter for δ\delta-dependent (Theorem 4.3), and the Poisson family for multiple-δ\delta estimators (Theorem 4.4). The main point about the latter choices is that it is easy to compare the probabilities of events when one changes the values of the parameter. Interestingly, Catoni’s lower bounds in also follow from a one dimensional family (in that case, Gaussians with fixed variance σ2>0\sigma^{2}>0).

Our constructions of estimators use two main ideas. The first one is that, while one cannot turn δ\delta-dependent into multiple-δ\delta estimators, one can build multiple-δ\delta estimators from the slightly stronger concept of sub-Gaussian confidence intervals. That is, if for each δ>0\delta>0 one can find an empirical confidence interval for μP\mu_{{\rm P}} with “sub-Gaussian length”, one may combine these intervals to produce a single multiple-δ\delta estimator. This general construction is presented in Section 4.2 and is related at a high level to Lepskii’s adaptation method .

Although general, this method of confidence intervals loses constant factors. Our second idea for building estimators, which is specific to the bounded kurtosis case (see Theorem 3.6 below), is to use a data-driven truncation mechanism to make the empirical mean better behaved. By using preliminary estimators of the mean and variance, we truncate the random variables in the sample and obtain a Bennett-type concentration inequality with sharp constant L=2+o(1)L=\sqrt{2}+o\left(1\right). A crucial point in this analysis is to show that our truncation mechanism is fairly insensitive to the preliminary estimators being used.

3 Organization.

The remainder of the paper is organized as follows. Section 2 fixes notation, formally defines our problem, and discusses previous work in light of our definition. Section 3 states our main results. Several general methods that we use throughout the paper are collected in Section 4. Proofs of the main results are given in Sections 5 to 7. Section 8 discusses several open problems.

Preliminaries

denote the integral of ff with respect to XX. Assuming P X2<∞{\rm P}\,X^{2}<\infty, we use the symbols μP=P X\mu_{{\rm P}}={\rm P}\,X and σP2=P X2−μP2\sigma^{2}_{{\rm P}}={\rm P}\,X^{2}-\mu^{2}_{{\rm P}} for the mean and variance of P{\rm P}.

We write P^n\widehat{\rm P}_{n} instead of P^[n]\widehat{\rm P}_{[n]} for simplicity.

2 The sub-Gaussian mean estimation problem

In this section, we begin a more formal discussion of the main problem in this paper. We start with the definition of a sub-Gaussian estimator of the mean.

We also write E^n,δ(⋅)\widehat{E}_{n,\delta}(\cdot) for E^n(⋅,δ)\widehat{E}_{n}(\cdot,\delta).

It transpires from these definitions that multiple-δ\delta estimators are preferable whenever they are available, because they combine good typical behavior with nearly optimal bounds under extremely rare events. By contrast, the need to commit to a δ\delta in advance means that δ\delta-dependent estimators may be too pessimistic when a small δ\delta is desired. The main problem addressed in this paper is the following:

Given a family P\mathcal{P} (or more generally a sequence of families Pn\mathcal{P}_{n}), find the smallest possible sequence δmin⁡=δmin⁡,n\delta_{\min}=\delta_{\min,n} such that multiple-δ\delta LL-sub-Gaussian estimators for (P,n,δmin⁡,n)(\mathcal{P},n,\delta_{\min,n}) (resp. (Pn,n,δmin⁡,n)(\mathcal{P}_{n},n,\delta_{\min,n})) exist for all large nn, and with a constant LL that does not depend on nn.

(optimality of sub-gaussian estimators.) Call a class P\mathcal{P} “reasonable” when it contains all Gaussian distributions with a given variance σ2>0\sigma^{2}>0. Catoni [5, Proposition 6.1] shows that, if δ∈(0,1)\delta\in(0,1), P\mathcal{P} is reasonable and some estimator E^n,δ\widehat{E}_{n,\delta} achieves

then r≥Φ−1(1−δ)r\geq\Phi^{-1}(1-\delta). The same result holds for the lower tail. Since Φ−1(1−δ)∼2ln⁡(1/δ)\Phi^{-1}(1-\delta)\sim\sqrt{2\ln(1/\delta)} for small δ\delta, this means that, for any reasonable class P\mathcal{P}, no constant L<2L<\sqrt{2} is achievable for small δmin⁡\delta_{\min}, and no better dependence on nn or δ\delta is possible. In particular, sub-Gaussian estimators are optimal up to constants, and estimators with L≤2+o(1)L\leq\sqrt{2}+o(1) are “nearly optimal.”

3 Known examples from previous work

In what follows we present some known estimators of the mean and discuss their sub-Gaussian properties (or lack thereof).

For large nn, σ2>0\sigma^{2}>0 fixed and δmin⁡→0\delta_{\min}\to 0, the empirical mean

is not a LL-sub-Gaussian estimator for the class P2σ2\mathcal{P}^{\sigma^{2}}_{2} of all distibutions with variance σ2\sigma^{2}. This is a consequence of [5, Proposition 6.2], which shows that the deviation bound obtained from Chebyshev’s inequality is essentially sharp.

Things change under slightly stronger assumptions. For example, a nonuniform version of the Berry-Esséen theorem ([15, Theorem 14, p. 125]) implies that, for large nn, emp^n\widehat{\sf emp}_{n} is a multiple-δ\delta (2+ϵ)\left(\sqrt{2}+\epsilon\right)-sub-Gaussian estimator for (P3,η,n,δmin⁡,n)(\mathcal{P}_{3,\eta},n,\delta_{\min,n}), where

for some η>1)\eta>1) and δmin⁡,n≫n−1/2(log⁡n)−3/2\delta_{\min,n}\gg n^{-1/2}(\log n)^{-3/2}. Similar results (with worse constants) hold for the class Pkrt≤κ\mathcal{P}_{{\rm krt}\leq\kappa} (cf. (4)) when δmin⁡≫1/n\delta_{\min}\gg 1/n and κ\kappa is bounded [5, Proposition 5.1]. Catoni [5, Proposition 6.3] shows that the sub-Gaussian property breaks down when δmin⁡=o(1/n)\delta_{\min}=o\left(1/n\right). Exponentially small δmin⁡\delta_{\min} can be achieved under much stronger assumptions. For example, Bennett’s inequality implies that emp^n\widehat{\sf emp}_{n} is (2+ϵ)\left(\sqrt{2}+\epsilon\right)-sub-Gaussian for the triple (P∞,η,n,δmin⁡)(\mathcal{P}_{\infty,\eta},n,\delta_{\min}), with δmin⁡=e−ϵ2n/η2\delta_{\min}=e^{-\epsilon^{2}n/\eta^{2}} and

3.2 Median of means

Quite remarkably, as it has been known for some time, one can do much better than the empirical mean in the δ\delta-dependent setting. The so-called median of means construction gives LL-sub-Gaussian estimators E^n,δ\widehat{E}_{n,\delta} (with LL some constant) for any triple (P2,n,e1−n/2)(\mathcal{P}_{2},n,e^{1-n/2}) where n≥6n\geq 6. The basic idea is to partition the data into disjoint blocks, calculate the empirical mean within each block, and finally take the median of them. This construction with a basic performance bound is reviewed in Section 4.1, as it provides a building block and an inspiration for the new constructions in this paper. We emphasize that, as pointed out in the introduction, variants of this result have been known for a long time, see Nemirovsky and Yudin , Levin , Jerrum, Valiant, and Vazirani , and Alon, Matias, and Szegedy . Note that this estimator has good performance even for distributions with infinite variance (see the remark following Theorem 3.1 below).

3.3 Catoni’s estimators

The constant LL obtained by the median-of-means estimator is larger than the optimal value 2\sqrt{2} (see Remark 1). Catoni designs δ\delta-dependent sub-Gaussian estimators with nearly optimal L=2+o(1)L=\sqrt{2}+o(1) for the classes P2σ2\mathcal{P}_{2}^{\sigma^{2}} (known variance) and Pkrt≤κ\mathcal{P}_{{\rm krt}\leq\kappa} (bounded kurtosis). A variant of Catoni’s estimator is a multiple-δ\delta estimator, however with subexponential instead of sub-Gaussian tails (i.e., the ln⁡(1/δ)\sqrt{\ln(1/\delta)} term in (7) appears squared). Both estimators work for exponentially small δ\delta, although the constant in the exponent for Pkrt≤κ\mathcal{P}_{{\rm krt}\leq\kappa} depends on κ\kappa.

Main results

Here we present the main results of the paper. Proofs are deferred to Sections 4 to 7.

Let n>5n>5 be a positive integer, M>0M>0, α∈(0,1]\alpha\in(0,1], and δ∈(2e−n/4,1/2)\delta\in(2e^{-n/4},1/2). Then for any mean estimator E^n\widehat{E}_{n},

The proof is given in Section 4.3. The bound of the theorem is essentially tight. It is shown in Bubeck, Cesa-Bianchi, and Lugosi that for each M>0M>0, α∈(0,1]\alpha\in(0,1], and δ\delta, there exists an estimator E^n(X1n,δ)\widehat{E}_{n}(X_{1}^{n},\delta) such that

The estimator E^n(X1n,δ)\widehat{E}_{n}(X_{1}^{n},\delta) satisfying this bound is the median-of-means estimator with appropriately chosen parameters.

It is an interesting question whether multiple-δ\delta estimators exist with similar performance. Since our primary goal in this paper is the study of sub-Gaussian estimators, we do not pursue the case of infinite variance further.

2 The value of knowing the variance

Given 0<σ1≤σ2<∞0<\sigma_{1}\leq\sigma_{2}<\infty, define the class of distributions with variance between σ12\sigma_{1}^{2} and σ22\sigma_{2}^{2}:

This class interpolates between the classes of distributions with fixed variance P2σ2\mathcal{P}^{\sigma^{2}}_{2} and with completely unknown variance P2\mathcal{P}_{2}. The next theorem is proven in Section 5.

Let 0<σ1<σ2<∞0<\sigma_{1}<\sigma_{2}<\infty and define R=σ2/σ1R=\sigma_{2}/\sigma_{1}.

Letting L(1)=(4e2+4ln⁡2)RL^{(1)}=(4e\sqrt{2+4\ln 2})R and δmin⁡(1)=4e1−n/2\delta^{(1)}_{\min}=4e^{1-n/2}, for every n≥6n\geq 6 there exists a multiple-δ\delta L(1)L^{(1)}-sub-Gaussian estimator for (P2[σ12,σ22],n,δmin⁡(1))(\mathcal{P}_{2}^{[\sigma^{2}_{1},\sigma^{2}_{2}]},n,\delta^{(1)}_{\min}).

For any L≥2L\geq\sqrt{2}, there exist ϕ(2)>0\phi^{(2)}>0 and δmin⁡(2)>0\delta^{(2)}_{\min}>0 such that, when R>ϕ(2)R>\phi^{(2)}, there is no multiple-δ\delta LL-sub-Gaussian estimator for (P2[σ12,σ22],n,δmin⁡(2))(\mathcal{P}_{2}^{[\sigma^{2}_{1},\sigma^{2}_{2}]},n,\delta^{(2)}_{\min}) for any nn.

For any value of R≥1R\geq 1 and L≥2L\geq\sqrt{2}, if we let δmin⁡(3)=e1−5L2n\delta_{\min}^{(3)}=e^{1-5L^{2}n}, there is no δ\delta-dependent LL-sub-Gaussian estimator for (P2[σ12,σ22],n,δmin⁡(3))(\mathcal{P}_{2}^{[\sigma^{2}_{1},\sigma^{2}_{2}]},n,\delta^{(3)}_{\min}) for any nn.

It is instructive to consider this result when nn grows and R=RnR=R_{n} may change with nn. The theorem says that, when sup⁡nRn<∞\sup_{n}R_{n}<\infty, there are multiple-δ\delta LL-sub-Gaussian estimators for all large nn, with exponentially small δmin⁡\delta_{\min} and a constant LL. On the other hand, if Rn→∞R_{n}\to\infty, for any constant LL and all large nn, no multiple-δ\delta LL-sub-Gaussian estimators exist for any sequence δ=δmin⁡,n→0\delta=\delta_{\min,n}\to 0. Finally, the third item says that even when Rn≡1R_{n}\equiv 1, δ\delta-dependent estimators are limited to δmin⁡=e−O(n)\delta_{\min}=e^{-O\left(n\right)}, so the median-of-means estimator is optimal in this sense.

3 Regularity, symmetry and higher moments

Theorem 3.2 shows that finite, but completely unknown variance is too weak an assumption for multiple-δ\delta sub-Gaussian estimation. The following shows that what we call regularity conditions can substitute for knowledge of the variance.

We say that a distribution P∈P2{\rm P}\in\mathcal{P}_{\rm 2} is symmetric around the mean if, given X=dPX=_{d}{\rm P}, 2μP−X=dP2\mu_{{\rm P}}-X=_{d}{\rm P} as well. Clearly, if P{\rm P} has this property, p+(P,j)=p−(P,j)=1/2p_{+}({\rm P},j)=p_{-}({\rm P},j)=1/2 for all jj and thus P∈P2,1−reg{\rm P}\in\mathcal{P}_{{\rm 2},1{\rm-reg}}. In other words, P2,sym⊂P2,1−reg\mathcal{P}_{2,{\rm sym}}\subset\mathcal{P}_{2,1{\rm-reg}} where P2,sym\mathcal{P}_{2,{\rm sym}} is the class of all P∈P2{\rm P}\in\mathcal{P}_{2} that are symmetric around the mean.

Given η≥1\eta\geq 1 and α∈(2,3]\alpha\in(2,3], set

We show in Lemma 6.2 that, for P{\rm P} in this family, min⁡(p+(P,j),p−(P,j))≥1/3\min(p_{+}({\rm P},j),p_{-}({\rm P},j))\geq 1/3 once j≥(Cα η)2αα−2j\geq(C_{\alpha}\,\eta)^{\frac{2\alpha}{\alpha-2}} for a constant CαC_{\alpha} depending only on α\alpha. We deduce

Our main result about kk-regular classes states that sub-Gaussian multiple-δ\delta estimators exist for P2,k−reg\mathcal{P}_{2,k-{\rm reg}} in the sense of the following theorem, proven in Section 6.1.

Let n,kn,k be positive integers with n≥(3+ln⁡4) 124kn\geq(3+\ln 4)\,124k. Set δmin⁡,n,k=4e3−n/(124k)\delta_{\min,n,k}=4e^{3-n/(124k)} and L∗=42 (1+2ln⁡2) (1+62ln⁡(3)) e52L_{*}=4\sqrt{2\,(1+2\ln 2)\,(1+62\ln(3))}\,e^{\frac{5}{2}}. Then there exists a L∗L_{*}-sub-Gaussian multiple-δ\delta estimator for (P2,k−reg,n,δmin⁡,n,k)(\mathcal{P}_{2,k-{\rm reg}},n,\delta_{\min,n,k}).

We also show that the range of δmin⁡=e−O(n/k)\delta_{\min}=e^{-O\left(n/k\right)} in this result is optimal. This follows directly from stronger results that we prove for Examples 3.1 and 3.2. In other words, the general family of estimators designed for kk-regular classes has nearly optimal range of δ\delta for these two smaller classes. The next result, for symmetric distributions, is proven in Section 6.2.

Consider the class P2,sym\mathcal{P}_{2,{\rm sym}} defined in Example 3.1. Then

the estimator obtained in Theorem 3.3 for k=1k=1 is a L∗L_{*}-sub-Gaussian multiple-δ\delta estimator for (P2,sym,n,δmin⁡,n,1)(\mathcal{P}_{2,{\rm sym}},n,\delta_{\min,n,1}) when n≥(3+ln⁡2) 124n\geq(3+\ln 2)\,124;

on the other hand, for any L≥2L\geq\sqrt{2}, no δ\delta-dependent LL-sub-Gaussian estimator can exist for (P2,sym,n,e1−5L2n)(\mathcal{P}_{2,{\rm sym}},n,e^{1-5L^{2}n}).

We also have an analogue result for the class Pα,η\mathcal{P}_{\alpha,\eta}. The proof may be found in Section 6.3.

Fix α∈(2,3]\alpha\in(2,3] and assume η≥31/3 21/6\eta\geq 3^{1/3}\,2^{1/6}. Consider the class Pα,η\mathcal{P}_{\alpha,\eta} defined in Example 3.2. Then there exists some Cα>0C_{\alpha}>0 depending only on α\alpha such that if kα=⌈Cα η(2α)/(α−2)⌉k_{\alpha}=\lceil C_{\alpha}\,\eta^{(2\alpha)/(\alpha-2)}\rceil,

the estimator obtained in Theorem 3.3 for k=kαk=k_{\alpha} is a L∗L_{*}-sub-Gaussian multiple-δ\delta estimator for (Pα,η,n,δmin⁡,n,kα)(\mathcal{P}_{\alpha,\eta},n,\delta_{\min,n,k_{\alpha}}) when n≥(3+ln⁡4) 124kαn\geq(3+\ln 4)\,124k_{\alpha};

finally, for L≥2L\geq\sqrt{2} there is no δ\delta-dependent LL sub-Gaussian estimator for (Pα,η,n,e1−5L2n)(\mathcal{P}_{\alpha,\eta},n,e^{1-5L^{2}n}).

4 Bounded kurtosis and nearly optimal constants

This section shows that multiple-δ\delta sub-Gaussian estimation with nearly optimal constants can be proved when the kurtosis

(when X=dPX=_{d}{\rm P}) is uniformly bounded in the class. (For completeness, we set κP=1\kappa_{{\rm P}}=1 when σP2=0\sigma^{2}_{{\rm P}}=0.) More specifically, we will consider the class Pkrt≤κ\mathcal{P}_{{\rm krt}\leq\kappa} of all distributions P∈P2{\rm P}\in\mathcal{P}_{2} with κP≤κ\kappa_{{\rm P}}\leq\kappa.

To state the result, let bmax⁡b_{\max} be a positive integer to be specified below. Also define

Note that when bmax⁡≪(n/κ)2/3b_{\max}\ll(n/\kappa)^{2/3}, ξ=o(1)\xi=o(1). The main result for classes of distributions with bounded kurtosis is the following. For the proof see Section 7.

Let n≥4n\geq 4, L=2(1+ξ)L=\sqrt{2}(1+\xi), δmin⁡(4)=4ee−2e−bmax⁡\delta_{\min}^{(4)}=\frac{4e}{e-2}e^{-b_{\max}}. There exists an absolute constant CC such that, if κbmax⁡/n≤C\kappa b_{\max}/n\leq C, then there exists a multiple-δ\delta LL-sub-Gaussian estimator for (P4κ,n,δmin⁡(4))(\mathcal{P}_{4}^{\kappa},n,\delta_{\min}^{(4)}).

This result is most interesting in the regime where n→∞n\to\infty, κ=κn\kappa=\kappa_{n} possibly depends on nn and n/κn→∞n/\kappa_{n}\to\infty. In this case, we may take bmax⁡≪(n/κn)2/3b_{\max}\ll(n/\kappa_{n})^{2/3} and obtain multiple-δ\delta (2+o(1))\left(\sqrt{2}+o\left(1\right)\right)-sub-Gaussian estimators (Pkrt≤κ,n,δmin⁡(4))(\mathcal{P}_{{\rm krt}\leq\kappa},n,\delta^{(4)}_{\min}) for δmin⁡(4)≈e−bmax⁡\delta^{(4)}_{\min}\approx e^{-b_{\max}}. Catoni obtained δ\delta-dependent 2+o(1)\sqrt{2}+o\left(1\right)-estimators for a smaller value δmin⁡(5)≈e−n/κ\delta^{(5)}_{\min}\approx e^{-n/\kappa}. In Remark 2 we show how one can obtain a similar range of δ\delta with a multiple-δ\delta estimator, albeit with worse constant LL.

General methods

We collect here some ideas that recur in the remainder of the paper.

Section 4.1 presents an analysis of the median-of-means estimator mentioned in Section 2.3.2 above. We present a proof based on Hsu’s argument .

Section 4.2 presents a “black-box method” of deriving multiple-δ\delta estimators from confidence intervals. The point is that confidence intervals are “δ\delta-dependent objects”, and thus easier to design and analyze.

In Section 4.3 we use scaled Bernoulli distributions to prove the impossibility of designing (weakly) sub-Gaussian estimators for classes with distributions with unbounded variance.

Section 4.4 uses the family of Laplace distributions to lower bound δmin⁡\delta_{\min} for δ\delta-dependent estimators.

Section 4.5 uses the Poisson family to derive lower bounds on δmin⁡\delta_{\min} for multiple-δ\delta estimators.

A combination of the above results will allow us to derive the sharp range for ln⁡(1/δmin⁡)\ln(1/\delta_{\min}) for all families of distributions we consider.

The next result is a well known performance bound for the median-of-means estimator. We include the proof for completeness.

For any n≥4n\geq 4 and L=22 eL=2\sqrt{2}\,e there exists a δ\delta-dependent LL-sub-Gaussian estimators for (P2,n,e1−n/2).(\mathcal{P}_{\rm 2},n,e^{1-n/2}).

(If several ii fit the above description, we take the smallest one.) We need the following Lemma (proven subsequently):

In our case we set L0=e=L/22L_{0}=e=L/2\sqrt{2}. To build our estimator for a given δ∈[e1−n/2,1)\delta\in[e^{1-n/2},1), we first choose

and define the median-of-means estimator by E^n,δ(x1n)=q1/2(yn,δ(x1n)).\widehat{E}_{n,\delta}(x_{1}^{n})=q_{1/2}(y_{n,\delta}(x_{1}^{n})).

We now show that E^n,δ\widehat{E}_{n,\delta} is a sub-Gaussian estimator for the class P2\mathcal{P}_{2}. Let X1n=dP⊗nX_{1}^{n}=_{d}{\rm P}^{\otimes n} for a distribution P∈P2{\rm P}\in\mathcal{P}_{2}. E^n,δ(X1n)\widehat{E}_{n,\delta}(X_{1}^{n}) is the median of random variables

Each YiY_{i} has mean μP\mu_{{\rm P}} and variance σP2/#Bi≤σP2/k\sigma^{2}_{{\rm P}}/\#B_{i}\leq\sigma^{2}_{{\rm P}}/k. Then, using our choice of bb, Lemma 4.1 implies

Now, because b=⌈ln⁡(1/δ)⌉≤n/2b=\lceil\ln(1/\delta)\rceil\leq n/2

and since this works for any P∈P2{\rm P}\in\mathcal{P}_{\rm 2}, the proof is complete. □\Box

Proof of Lemma 4.1: Let I=[μ−2 L0 σ,μ+2 L0σ]I=[\mu-2\,L_{0}\,\sigma,\mu+2\,L_{0}\sigma]. Clearly,

The indicators variables on the right-hand side are all independent, and by Chebyshev’s inequality, for all j∈[b]j\in[b],

since ∑k=⌈b/2⌉b(bk)≤∑k=0b(bk)=2b\sum_{k=\lceil b/2\rceil}^{b}\binom{b}{k}\leq\sum_{k=0}^{b}\binom{b}{k}=2^{b}.

2 The method of confidence intervals for multiple-δ𝛿\delta estimators

In this section we detail how sub-Gaussian confidence intervals may be combined to produce multiple-δ\delta estimators. This will be our main tool in defining all multiple-δ\delta estimators whose existence is claimed in Theorems 3.2 and 3.3. First we need a definition.

The next theorem shows how one can combine sub-Gaussian confidence intervals to obtain a multiple-δ\delta sub-Gaussian mean estimator.

so it makes sense to define the estimator E^n(x1n)\widehat{E}_{n}(x_{1}^{n}) as its midpoint.

We claim that E^n\widehat{E}_{n} is the sub-Gaussian estimator we are looking for. To prove this, we let 2−m≤δ≤12^{-m}\leq\delta\leq 1 and choose the smallest k∈{1,2,…,m+1}k\in\{1,2,\dots,m+1\} with 21−k≤δ2^{1-k}\leq\delta. Assume X1n=dP⊗nX_{1}^{n}=_{d}{\rm P}^{\otimes n} with P∈P{\rm P}\in\mathcal{P}. Then

When ⋂j=kmGj\bigcap_{j=k}^{m}\mathcal{G}_{j} holds, μP∈I^j(X1n)\mu_{{\rm P}}\in\widehat{I}_{j}(X_{1}^{n}) for all k≤j≤m+1k\leq j\leq m+1, so μP∈⋂j=km+1I^j(X1n)\mu_{{\rm P}}\in\bigcap_{j=k}^{m+1}\widehat{I}_{j}(X_{1}^{n}). In particular, ⋂j=kmI^j(X1n)≠∅\bigcap_{j=k}^{m}\widehat{I}_{j}(X_{1}^{n})\neq\emptyset and k^n(X1n)≤k\hat{k}_{n}(X_{1}^{n})\leq k.

Finally, our choice of kk implies 21−k≤δ≤22−k2^{1-k}\leq\delta\leq 2^{2-k}, so, under ⋂j=kmGj\bigcap_{j=k}^{m}\mathcal{G}_{j} we have

with L′=L1+2ln⁡2L^{\prime}=L\sqrt{1+2\ln 2} as in the statement of the theorem.

and since this holds for all P∈P{\rm P}\in\mathcal{P} and all 2−m≤δ≤1/22^{-m}\leq\delta\leq 1/2, the proof is complete. □\Box

3 Scaled Bernoulli distributions and single-δ𝛿\delta estimators

In this subsection we prove Theorem 3.1. In order to do so, we derive a simple minimax lower bound for single-δ\delta estimators for the class Pc,p={P+,P−}\mathcal{P}_{c,p}=\{P_{+},P_{-}\} of distributions that contains two discrete distributions defined by

where p∈p\in and c>0c>0. Note that μP+=pc\mu_{P_{+}}=pc, μP−=−pc\mu_{P_{-}}=-pc and that for any α>0\alpha>0, the (1+α)(1+\alpha)-th central moment of both distributions equals

For i=1,…,ni=1,\ldots,n, let (Xi,Yi)(X_{i},Y_{i}) be independent pairs of real-valued random variables such that

Note that Xi∼LP+X_{i}\stackrel{{\scriptstyle\cal L}}{{\sim}}P_{+} and Yi∼LP−Y_{i}\stackrel{{\scriptstyle\cal L}}{{\sim}}P_{-}. Let δ∈(0,1/2)\delta\in(0,1/2). If δ≥2e−n/4\delta\geq 2e^{-n/4} and p=(2/n)log⁡(2/δ)p=(2/n)\log(2/\delta), then (using 1−p≥exp⁡(−p/(1−p))1-p\geq\exp(-p/(1-p))),

Let E^n,δ\widehat{E}_{n,\delta} be any mean estimator, possibly depending on δ\delta. Then

From (10) we have that cp≥M1/(1+α)(p/2)α/(1+α)cp\geq M^{1/(1+\alpha)}(p/2)^{\alpha/(1+\alpha)} and therefore

Theorem 3.1 simply follows by noting that Pc,p⊂P1+αM\mathcal{P}_{c,p}\subset\mathcal{P}^{M}_{1+\alpha}.

4 Laplace distributions and single-δ𝛿\delta estimators

The next result proves that δ\delta-dependent LL-sub-Gaussian estimators are limited to exponentially small δ\delta even over the one-dimensional family PLa\mathcal{P}_{{\sf La}}.

If n≥3n\geq 3 then, for any constant L≥2L\geq\sqrt{2}, there are no δ\delta-dependent LL-sub-Gaussian estimators for (PLa,n,e1−5L2n)(\mathcal{P}_{{\sf La}},n,e^{1-5L^{2}n}).

Proof: We proceed by contradiction, assuming that there exist LL-sub-Gaussian δ\delta-dependent estimators E^n,δ\widehat{E}_{n,\delta} for (PLa,n,δ)(\mathcal{P}_{{\sf La}},n,\delta) where δ=e1−5L2n\delta=e^{1-5L^{2}n} and arbitrarily large nn. We set

Using the definition of λ\lambda and the fact that μLaλ=λ\mu_{{\sf La}_{\lambda}}=\lambda and σLaλ2=2\sigma^{2}_{{\sf La}_{\lambda}}=2, we see that the right-hand side above is simply

On the other hand, the left-hand side in (11) is

If we use again the definition of λ\lambda, we see that

For L≥2L\geq\sqrt{2}, some simple estimates show that this leads to a contradiction when n≥3n\geq 3. □\Box

5 Poisson distributions and multiple-δ𝛿\delta estimators

We use the family of Poisson distributions for bounding the range of confidence values of multiple-δ\delta estimators. Denote by Poλ{\sf Po}_{\lambda} the Poisson distribution with parameter λ>0\lambda>0. Given 0<λ1≤λ2<∞0<\lambda_{1}\leq\lambda_{2}<\infty, define

Proof: We prove the following stronger result: there exist constants c0,s>0c_{0},s>0 such that, when c≥c0c\geq c_{0}, L≥2L\geq\sqrt{2} and C=⌈s (L2ln⁡L)⌉C=\lceil s\,(L^{2}\ln L)\rceil, there is no multiple-δ\delta sub-Gaussian estimator for

The theorem then follows by taking 2C=ϕ(L)−1=s L2ln⁡L2C=\phi(L)-1=s\,L^{2}\ln L and s0=s2s_{0}=s^{2}.

μPoc/n=σPoc/n2=c/n\mu_{{\sf Po}_{c/n}}=\sigma^{2}_{{\sf Po}_{c/n}}=c/n and μPo(1+2C)c/n=σPo(1+2C)c/n2=(1+2C)c/n\mu_{{\sf Po}_{(1+2C)c/n}}=\sigma^{2}_{{\sf Po}_{(1+2C)c/n}}=(1+2C)c/n.

SX=X1+X2+⋯+Xn=dPocS_{X}=X_{1}+X_{2}+\dots+X_{n}=_{d}{\sf Po}_{c} and SY=Y1+Y2+⋯+Yn=dPo(1+2C) cS_{Y}=Y_{1}+Y_{2}+\dots+Y_{n}=_{d}{\sf Po}_{(1+2C)\,c}.

We apply the sub-Gaussian property for the triple (⋆\star) to δ=1/4(1+2C) c\delta=1/4\sqrt{(1+2C)\,c}. This is possible because, for C=⌈s (L2ln⁡L)⌉C=\lceil s\,(L^{2}\ln L)\rceil with a large enough ss, this value is ≈1/Lsln⁡L c\approx 1/L\sqrt{s\ln L\,c}, which is much larger than the minimum confidence parameter e1−C2 c/L2e^{1-C^{2}\,c/L^{2}} allowed by (⋆\star) (at least if c≥c0c\geq c_{0} with a large enough c0c_{0}). Recalling F0, we obtain

Now F1 implies that the left-hand side is the same if we switch from YY to XX. In particular, by looking at the complementary event we obtain

Since we are taking c≥c0c\geq c_{0} and C≥s L2 ln⁡LC\geq s\,L^{2}\,\ln L, a calculation reveals

Therefore, by taking a large enough c0c_{0} we can ensure that

We now use F0 to rewrite the previous probability as

Since we assumed E^n\widehat{E}_{n} is LL-sub-Gaussian for the triple (⋆\star), we obtain

Comparing the left and right hand sides, and recalling c≥c0c\geq c_{0}, we obtain h(C)≥C2/4L2−1−(ln⁡2/c0)h(C)\geq C^{2}/4L^{2}-1-(\ln 2/c_{0}). This is a contradiction if C≫L2ln⁡LC\gg L^{2}\ln L because h(C)h(C) grows like Cln⁡CC\ln C (cf. F4). This contradiction shows that there does not exist a LL-sub-Gaussian estimator for (⋆)(\star), as desired. □\Box

Degrees of knowledge about the variance

In this section we present the proof of Theorem 3.2. This is mostly a matter of combining the main results in the previous section. Recall that we consider the class

and that R=σ2/σ1R=\sigma_{2}/\sigma_{1}. The three parts of the theorem are proven separately.

whenever X1n=P⊗nX_{1}^{n}={\rm P}^{\otimes n} for some P∈P2{\rm P}\in\mathcal{P}_{{\rm 2}}. We define a confidence interval for each δ\delta via

Clearly, (14) and the fact that σ2≤R σP\sigma_{2}\leq R\,\sigma_{{\rm P}} for all P2[σ12,σ22]\mathcal{P}_{2}^{[\sigma_{1}^{2},\sigma_{2}^{2}]} imply that {I^n,δ}δ∈[e1−n/2,1)\{\widehat{I}_{n,\delta}\}_{\delta\in[e^{1-n/2},1)} is a 42 e R4\sqrt{2}\,{e}\,R-sub-Gaussian confidence interval for (P2[σ12,σ22],n,e1−n/2)(\mathcal{P}^{[\sigma_{1}^{2},\sigma_{2}^{2}]}_{2},n,e^{1-n/2}). Applying Theorem 4.2 gives the desired result.

(Non-existence of multiple-δ\delta estimators when R>ϕ(2)(L)R>\phi^{(2)}(L).) We use Theorem 4.4. By rescaling, we may assume σ12=c0/n\sigma_{1}^{2}=c_{0}/n, where c0c_{0} is the constant appearing in Theorem 4.4. We also set ϕ(2)(L):=ϕ(L)\phi^{(2)}(L):=\sqrt{\phi(L)} for ϕ(L)\phi(L) as in Theorem 4.4. The assumption on RR ensures that PPo[c0/n,ϕ(L) c0/n]⊂P2[σ12,σ22]\mathcal{P}^{[c_{0}/n,\phi(L)\,c_{0}/n]}_{{\sf Po}}\subset\mathcal{P}_{2}^{[\sigma_{1}^{2},\sigma_{2}^{2}]}, so there cannot be a LL-sub-Gaussian estimator when δmin⁡(2)(L)=e1−s (Lln⁡L)2 c0\delta^{(2)}_{\min}(L)=e^{1-s\,(L\ln L)^{2}\,c_{0}}.

(Non-existence of δ\delta-dependent estimators when δmin⁡=e1−5L2n\delta_{\min}=e^{1-5L^{2}n}.) By rescaling, we may assume σ12=2\sigma_{1}^{2}=2. Then the class PLa\mathcal{P}_{{\sf La}} in Theorem 4.3 is contained in P2[σ12,σ22]\mathcal{P}_{2}^{[\sigma_{1}^{2},\sigma_{2}^{2}]}, and the theorem implies the desired result directly.

The regularity condition, symmetry and higher moments

In this section we prove the results described in Section 3.3.

We start with Theorem 3.3, the general positive result on kk-regular classes.

Proof of Theorem 3.3: By Theorem 4.2, it suffices to build a 42 (1+62ln⁡(3)) e524\sqrt{2\,(1+62\ln(3))}\,e^{\frac{5}{2}}-sub-Gaussian confidence interval for (P2,k−reg,n,e3−n/(124)k)(\mathcal{P}_{2,k{\rm-reg}},n,e^{3-n/(124)k}).

To build these intervals, we use an idea related to the proof of Theorem 4.1. Just like in the case of the median-of-means estimator, we divide the data into blocks, but instead of taking the median of the means, we look at the 1/41/4 and 3/43/4-quantiles to build an interval.

The next result (proven subsequently) is an analogue of Lemma 4.1.

and L0=2 e2d+12≤2 e52.L_{0}=2\,e^{2d+\frac{1}{2}}\leq 2\,e^{\frac{5}{2}}.

Now fix δ∈[e3−n/(124k),1)\delta\in[e^{3-n/(124k)},1). We define a confidence interval I^n,δ(⋅)\widehat{I}_{n,\delta}(\cdot) as follows. First set b=⌈62ln⁡(3/δ)⌉b=\lceil 62\ln(3/\delta)\rceil and note that

{I^n,δ(⋅)}δ∈[e3−n/(124k),1)\{\widehat{I}_{n,\delta}(\cdot)\}_{\delta\in[e^{3-n/(124k)},1)} is a 42 (1+62ln⁡(3)) e524\sqrt{2\,(1+62\ln(3))}\,e^{\frac{5}{2}}-sub-Gaussian collection of confidence intervals for (P2,k−reg,n,e3−n/(124k))(\mathcal{P}_{2,k{\rm-reg}},n,e^{3-n/(124k)}).

To see this, we take a distribution P{\rm P} in this family and assume X1n=dP⊗nX_{1}^{n}=_{d}{\rm P}^{\otimes n}. Set s=⌊n/b⌋s=\lfloor n/b\rfloor. Because the blocks BiB_{i} are disjoint and have at least ss elements each, the random variables

all have mean μP\mu_{{\rm P}} and variance ≤σP2/s\leq\sigma_{{\rm P}}^{2}/s. Moreover, using (15),

so the kk-regularity property implies that for all i∈[b]i\in[b],

by the choice of bb and the fact that d≥1/62d\geq 1/62. To finish, we use (15) and the definition of bb to obtain

Plugging this back into (16) and recalling L0≤2e5/2L_{0}\leq 2e^{5/2} implies the desired result.

Proof of Lemma 6.1: Define J=[μ−L0σ,μ+L0σ]J=[\mu-L_{0}\sigma,\mu+L_{0}\sigma]. Assume the following three properties hold.

The number of indices i∈[b]i\in[b] with Yi∈JY_{i}\in J is at least 3b/43b/4.

Then clearly μ∈[q1/4(Y1b),q3/4(Y1b)]\mu\in[q_{1/4}(Y_{1}^{b}),q_{3/4}(Y_{1}^{b})]. Moreover, item 3 implies that q1/4(Y1b),q3/4(Y1b)∈Jq_{1/4}(Y_{1}^{b}),q_{3/4}(Y_{1}^{b})\in J, so that

and these events are independent. It follows that

2 Symmetric distributions

To prove Theorem 3.4, notice that the existence of the multiple-δ\delta sub-Gaussian estimator follows from Theorem 3.3. The second part is a simple consequence of Theorem 4.3 and the fact that Laplace distributions are symmetric around their means.

3 Higher moments

In this section we first prove that Pα,η⊂P2,k−reg\mathcal{P}_{\alpha,\eta}\subset\mathcal{P}_{2,k{\rm-reg}} for large enough kk, and then prove Theorem 3.5. We recall the definition of min⁡(p+(P,j)\min(p_{+}({\rm P},j) and p−(P,j)p_{-}({\rm P},j) from Definition 2.

For all α∈(2,3]\alpha\in(2,3], there exists C=CαC=C_{\alpha} such that, if j≥(Cαη)2αα−2j\geq(C_{\alpha}\eta)^{\frac{2\alpha}{\alpha-2}}, then min⁡(p+(P,j),p−(P,j))≥1/3\min(p_{+}({\rm P},j),p_{-}({\rm P},j))\geq 1/3.

Proof: We only prove that p+(P,j)≥1/3p_{+}({\rm P},j)\geq 1/3, as the other proof is analogous.

Lindberg’s proof of the central limit theorem (see ), specialized to the case where X1jX_{1}^{j} are i.i.d., gives

The right-hand side is ≥1/3\geq 1/3 when j≥(Cη)2αα−2j\geq(C\eta)^{\frac{2\alpha}{\alpha-2}} for some universal C=CαC=C_{\alpha}. □\Box

Proof of Theorem 3.5: The positive result follows directly from Theorem 3.3 plus Lemma 6.2, which guarantees p±(P,j)≥1/3p_{\pm}({\rm P},j)\geq 1/3 for j≥kαj\geq k_{\alpha}. For the second part, we first assume η>η0\eta>\eta_{0} for a sufficiently large constant η0\eta_{0}. We use the Poisson family of distributions from Section 4.5. For λ=o(1)\lambda=o\left(1\right) and α∈(2,3]\alpha\in(2,3], we have that

If we compare this to Example 3.2, we see that Poλ∈Pα,η{\sf Po}_{\lambda}\in\mathcal{P}_{\alpha,\eta} if λ≥h /η2α/(α−2)\lambda\geq h\,/\eta^{2\alpha/(\alpha-2)} for some constant h=hα>0h=h_{\alpha}>0 (recall we are assuming that η≥η0\eta\geq\eta_{0} is at least a large constant). Now take c>0c>0 such that c/n=h /η2α/(α−2)c/n=h\,/\eta^{2\alpha/(\alpha-2)}. If c>c0c>c_{0} for the constant c0c_{0} in the statement of Theorem 4.4, we can apply the theorem to deduce that there is no multiple-δ\delta estimator for (PPo[c/n,ϕ(L) c/n],n,e− c)(\mathcal{P}^{[c/n,\phi(L)\,c/n]}_{{\sf Po}},n,e^{-\,c}). Noting that cc is of the order n/kαn/k_{\alpha} finishes the proof in this case.

Now assume η≤η0\eta\leq\eta_{0}. In this case we use the Laplace distributions in Section 4.4. Since 2<α≤32<\alpha\leq 3, we may apply the fact that the central third moment of a Laplace distribution satisfies Laλ∣X−λ∣3=6≤(31/3 21/6σLaλ)3{\sf La}_{\lambda}|X-\lambda|^{3}=6\leq(3^{1/3}\,2^{1/6}\sigma_{{\sf La}_{\lambda}})^{3} to obtain

Our assumption on η\eta implies that PLa⊂Pα,η\mathcal{P}_{{\sf La}}\subset\mathcal{P}_{\alpha,\eta}. Thus Theorem 4.3 implies that there is no δ\delta-dependent or multiple-δ\delta sub-Gaussian estimator for (Pα,η,n.e1−5L2n)(\mathcal{P}_{\alpha,\eta},n.e^{1-5L^{2}n}). This is the desired result since kαk_{\alpha} is bounded when η≤η0\eta\leq\eta_{0}.

Finally, the third part of the theorem follows from the same reasoning as in the previous paragraph.

Bounded kurtosis and nearly optimal constants

In this section we prove Theorem 3.6. Throughout the proof we assume X=dPX=_{d}{\rm P} and X1n=dP⊗nX_{1}^{n}=_{d}{\rm P}^{\otimes n} for some P∈Pkrt≤κ{\rm P}\in\mathcal{P}_{{\rm krt}\leq\kappa}, and let bmax⁡b_{\max}, CC, ξ\xi be as in Section 3.4. Our proof is divided into four steps.

Preliminary estimates for mean and variance. We use the median-of-means technology to obtain preliminary estimates for the mean and variance of P{\rm P}. These estimates are not good enough to satisfy the claimed properties, but with extremely high probability they are reasonably close to the true values.

Truncation at the ideal point. We introduce a two-parameter family of truncation-based estimators for μP\mu_{{\rm P}}, and analyze the behavior of one such estimator, chosen under knowledge of μP\mu_{{\rm P}} and σP\sigma_{{\rm P}}.

Truncated estimators are insensitive. Finally, we use a chaining argument to show that this two-parameter family is insensitive to the choice of parameters.

Wrap up. The insensitivity property means that the preliminary estimates from Step 1 are good enough to “make everything work.”

We conclude the section by a remark on how to obtain a broader range of δmin⁡\delta_{\min} with a worse constant LL.

(Preliminary estimates via median of means.) Denote by μ^bmax⁡=μ^bmax⁡(X1n)\widehat{\mu}_{b_{\max}}=\widehat{\mu}_{b_{\max}}(X_{1}^{n}) the estimator given by Theorem 4.1 with δ=e−bmax⁡\delta=e^{-b_{\max}}, which is possible if C≥6/(1−log⁡2)C\geq 6/(1-\log 2). The next lemma provides an estimator of the variance.

Let B1,…,Bbmax⁡B_{1},\ldots,B_{b_{\max}} denote a partition of [n][n] into blocks of size ∣Bi∣≥k=⌊n/bmax⁡⌋≥2|B_{i}|\geq k=\lfloor n/b_{\max}\rfloor\geq 2. For each block BiB_{i} with i∈[bmax⁡]i\in[b_{\max}], define

The theorem follows by the definition of μ^bmax⁡\widehat{\mu}_{b_{\max}} and an application of Theorem 4.1. □\Box

Assume bmax⁡≥tb_{\max}\geq t, R=σPn/bmax⁡R=\sigma_{{\rm P}}\sqrt{n/b_{\max}} and μ=μP\mu=\mu_{{\rm P}}. Then, with probability at least 1−2e−t1-2e^{-t},

Proof: The proof is a consequence of Benett’s inequality. It suffices to estimate the moments of Ψμ,R(X)−μP\Psi_{\mu,R}(X)-\mu_{{\rm P}}. For the first moment,

where we used Hölder’s inequality. On the other hand,

By the Cauchy-Schwarz inequality, and using the bounded kurtosis assumption,

Finally, for any p≥4p\geq 4, since ∣Ψμ,R(X)−μP∣p≤R\left|\Psi_{\mu,R}(X)-\mu_{{\rm P}}\right|^{p}\leq R,

For s=2nt/σPs=\sqrt{2nt}/\sigma_{{\rm P}}, we have ∣sR∣/n≤1\left|sR\right|/n\leq 1 and therefore

Repeat the same computations with s=−2nt/σPs=-\sqrt{2nt}/\sigma_{{\rm P}} to prove the lower bound. □\Box

(Insensitivity of the estimators.) Given ϵμ,ϵR∈(0,1/2)\epsilon_{\mu},\epsilon_{R}\in(0,1/2), define

Assume n/(2bmax⁡)≥2(ϵμ+ϵR)\sqrt{n/(2b_{\max})}\geq 2(\epsilon_{\mu}+\epsilon_{R}) then for any t>0t>0, with probability at least 1−e−t1-e^{-t}, for all (μ,R)∈R(\mu,R)\in\mathcal{R},

By Chebyshev’s inequality, this implies that, for any positive integer pp,

A union bound in Bennett’s inequality gives that, with probability at least 1−21−je−t1-2^{1-j}e^{-t}, for any (μ,R)∈Dj(\mu,R)\in D_{j},

Summing up these inequalities gives the desired bound. □\Box

Assume t≥1t\geq 1, n/(2bmax⁡)≥2(ϵμ+ϵR)\sqrt{n/(2b_{\max})}\geq 2(\epsilon_{\mu}+\epsilon_{R}). Then, with probability at least 1−2e−t−2e−bmax⁡1-2e^{-t}-2e^{-b_{\max}}, for all (μ,R)∈R(\mu,R)\in\mathcal{R},

From Lemma 7.1, with probability at least 1−2e−bmax⁡1-2e^{-b_{\max}},

This means that, with probability at least 1−2e−bmax⁡1-2e^{-b_{\max}}, (μ^n,R^n)(\widehat{\mu}_{n},\widehat{R}_{n}) belongs to R\mathcal{R} if we define

By an appropriate choice of the constant CC, we can always assume that n/(2bmax⁡) κP\sqrt{n/(2b_{\max})\,\kappa_{{\rm P}}} is at least some large constant, to ensure that 2(ϵμ+ϵR)≤n/(2bmax⁡)2(\epsilon_{\mu}+\epsilon_{R})\leq\sqrt{n/(2b_{\max})}. So Corollary 7.1 applies and gives

In particular, if δ>4ee−2e−bmax⁡\delta>\frac{4e}{e-2}e^{-b_{\max}}, we get

Let us quickly sketch how one may get a smaller value of δmin⁡\delta_{\min} at the expense of a larger constant LL. The idea is to redo the proof of part 11 of Theorem 3.2 (cf. Section 5). We build δ\delta-dependent estimators for μP\mu_{{\rm P}} via median-of-means, as in (14), but then use the value 2σ^b(X1n)2\widehat{\sigma}_{b}(X_{1}^{n}) from Lemma 7.1 instead of the value σ22\sigma^{2}_{2} when building the confidence interval, with a choice of b≈ln⁡(1/δ)b\approx\ln(1/\delta). Then one obtains an empirical confidence interval that contains μP\mu_{{\rm P}} and has the appropriate length with probability ≥1−2δ\geq 1-2\delta whenever ln⁡(1/δ)≤c n/κ\ln(1/\delta)\leq c\,n/\kappa for some constant c>0c>0. Using Theorem 4.2 as in Section 5 then gives a multiple-δ\delta LL-sub-Gaussian estimator for (Pkrt≤κ,n,e1−cn/κ)(\mathcal{P}_{{\rm krt}\leq\kappa},n,e^{1-cn/\kappa}) for large enough values of n/κn/\kappa, where LL does not depend on nn or κ\kappa. It is an open question whether one can obtain a similar value of δmin⁡\delta_{\min} with L=2+o(1)L=\sqrt{2}+o\left(1\right).

Open problems

We conclude the paper by a partial list of problems related to our results that seem especially interesting.

Sharper constants and truly sub-Gaussian estimators. For what families P\mathcal{P} of distributions and what values of δmin⁡\delta_{\min} can one find multiple-δ\delta estimators with sharp constant L=2+o(1)L=\sqrt{2}+o\left(1\right)? One may even sharpen our definition of a sub-Gaussian estimator and ask for estimators that satisfy

for all P∈P{\rm P}\in\mathcal{P} and δ∈[δmin⁡,1)\delta\in[\delta_{\min},1)?

Sub-Gaussian confidence intervals. The notion of sub-Gaussian confidence interval introduced in Section 4.2 seems interesting on its own right. For which classes of distributions P\mathcal{P} can one find sub-Gaussian confidence intervals? Can one reverse the implication in Theorem 4.2, and build sub-Gaussian confidence intervals from multiple-δ\delta estimators?

A natural way to obtain strong sub-Gaussian concentration for heavier-tailed FF would be to replace the usual empirical estimates P^ f(θ,X)\widehat{\rm P}\,f(\theta,X) by one of our multiple-δ\delta sub-Gaussian estimates. This, however, is not straightforward. The usual chaining technique for controlling empirical processes rely on linearity, and our estimators are nonlinear in the sample. Although there are (artificial) ways around this, we do not know of any efficient method for doing the analogue of empirical risk minimization with our estimators in any nontrivial setting. These difficulties were overcome by Brownlees et al. via Catoni’s multiple-δ\delta subexponential estimator, at the cost of obtaining weaker concentration. Can one do something similar and achieve truly sub-Gaussian results at low computational cost?

Acknowledgements

Luc Devroye was supported by the Natural Sciences and Engineering Research Council (NSERC) of Canada. Gábor Lugosi and Roberto Imbuzeiro Oliveira gratefully acknowledge support from CNPq, Brazil via the Ciência sem Fronteiras grant # 401572/2014-5. Gábor Lugosi was supported by the Spanish Ministry of Science and Technology grant MTM2012-37195. Roberto Imbuzeiro Oliveira’s work was supported by a Bolsa de Produtividade em Pesquisa from CNPq. His work in this article is part of the activities of FAPESP Center for Neuromathematics (grant# 2013/ 07699-0 , FAPESP - S.Paulo Research Foundation).

References