Sub-Gaussian mean estimators
Luc Devroye, Matthieu Lerasle, Gabor Lugosi, Roberto I. Oliveira
Introduction
Estimating the mean of a probability distribution on the real line based on a sample of 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 have a finite second moment, this estimator has Gaussian tails, asymptotically, when . Indeed,
where and are the mean and variance of (respectively) and 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 , we would like to construct sub-Gaussian estimators. These should take an i.i.d. sample from some unknown and produce an estimate of that satisfies
for some constant that depends only on . One would like to keep as small as possible (say exponentially small in ).
Of course, when with fixed, (5) is a weaker form of (1) since . The point is that (5) should hold non-asymptotically, for extremely small , and uniformly over , even for classes containing distributions with heavy tails. The empirical mean cannot satisfy this property unless either contains only sub-Gaussian distributions or 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 we consider, there do exist estimators that achieve (5) for all large , with and a value of that does not depend on or . In each case, is a constant that depends on the class under consideration, and we also obtain nearly tight bounds on how must depend on . (In particular, cannot be superexponentially small in .) In the specific case of bounded-kurtosis distributions (cf. (4) above), we achieve for . This value of is nearly optimal by Remark 1 below.
Before this paper, it was known that (5) could be achieved for the whole class of distributions with finite second moments, with a weaker notion of estimator that we call -dependent estimator, that is, an estimator that may also depend on the confidence parameter . By contrast, the estimators that we introduce here are called multiple- estimators: a single estimator works for the whole range of . This distinction is made formal in Definition 1 below. By way of comparison, we also prove some results on -dependent estimators in the paper. In particular, we show that the distinction is substantial. For instance, there are no multiple- sub-Gaussian estimators for the full class for any nontrivial range of . Interestingly, multiple- estimators do exist (with ) for the class (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 .
Weakly sub-Gaussian estimators
Consider the class of all Bernoulli distributions, that is, the class that contains all distributions of the form
Perhaps surprisingly, no multiple- estimator exists for this class of distributions, even when 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 and ,
Of course, this bound has a sub-Gaussian flavor as it resembles (5) except that the confidence bounds do not scale by but rather by a distribution-free constant times .
In general, we may call an estimate weakly sub-Gaussian with respect to the class if there exists a constant such that for all ,
for some constant . -dependent and multiple- versions of this definition may be given in analogy to those of sub-Gaussian estimators.
Note that if a class is such that , 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 -dependent and multiple- estimators, and our construction of multiple- sub-Gaussian estimators for exponentially small , are all new. On the other hand, constructions of -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 -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 -dependent sub-Gaussian estimators with nearly optimal for a wide range of and the classes and defined in (3). The -dependent sub-Gaussian estimator introduced by may be converted into a multiple- estimators with subexponential (instead of sub-Gaussian) tails for by choosing the single parameter of the estimator appropriately. Loosely speaking, this corresponds to squaring the term in (5). Catoni also obtains multiple- estimators for 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 -dependent (Theorem 4.3), and the Poisson family for multiple- 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 ).
Our constructions of estimators use two main ideas. The first one is that, while one cannot turn -dependent into multiple- estimators, one can build multiple- estimators from the slightly stronger concept of sub-Gaussian confidence intervals. That is, if for each one can find an empirical confidence interval for with “sub-Gaussian length”, one may combine these intervals to produce a single multiple- 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 . 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 with respect to . Assuming , we use the symbols and for the mean and variance of .
We write instead of 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 for .
It transpires from these definitions that multiple- 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 in advance means that -dependent estimators may be too pessimistic when a small is desired. The main problem addressed in this paper is the following:
Given a family (or more generally a sequence of families ), find the smallest possible sequence such that multiple- -sub-Gaussian estimators for (resp. ) exist for all large , and with a constant that does not depend on .
(optimality of sub-gaussian estimators.) Call a class “reasonable” when it contains all Gaussian distributions with a given variance . Catoni [5, Proposition 6.1] shows that, if , is reasonable and some estimator achieves
then . The same result holds for the lower tail. Since for small , this means that, for any reasonable class , no constant is achievable for small , and no better dependence on or is possible. In particular, sub-Gaussian estimators are optimal up to constants, and estimators with 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 , fixed and , the empirical mean
is not a -sub-Gaussian estimator for the class of all distibutions with variance . 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 , is a multiple- -sub-Gaussian estimator for , where
for some and . Similar results (with worse constants) hold for the class (cf. (4)) when and is bounded [5, Proposition 5.1]. Catoni [5, Proposition 6.3] shows that the sub-Gaussian property breaks down when . Exponentially small can be achieved under much stronger assumptions. For example, Bennett’s inequality implies that is -sub-Gaussian for the triple , with 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 -dependent setting. The so-called median of means construction gives -sub-Gaussian estimators (with some constant) for any triple where . 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 obtained by the median-of-means estimator is larger than the optimal value (see Remark 1). Catoni designs -dependent sub-Gaussian estimators with nearly optimal for the classes (known variance) and (bounded kurtosis). A variant of Catoni’s estimator is a multiple- estimator, however with subexponential instead of sub-Gaussian tails (i.e., the term in (7) appears squared). Both estimators work for exponentially small , although the constant in the exponent for depends on .
Main results
Here we present the main results of the paper. Proofs are deferred to Sections 4 to 7.
Let be a positive integer, , , and . Then for any mean estimator ,
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 , , and , there exists an estimator such that
The estimator satisfying this bound is the median-of-means estimator with appropriately chosen parameters.
It is an interesting question whether multiple- 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 , define the class of distributions with variance between and :
This class interpolates between the classes of distributions with fixed variance and with completely unknown variance . The next theorem is proven in Section 5.
Let and define .
Letting and , for every there exists a multiple- -sub-Gaussian estimator for .
For any , there exist and such that, when , there is no multiple- -sub-Gaussian estimator for for any .
For any value of and , if we let , there is no -dependent -sub-Gaussian estimator for for any .
It is instructive to consider this result when grows and may change with . The theorem says that, when , there are multiple- -sub-Gaussian estimators for all large , with exponentially small and a constant . On the other hand, if , for any constant and all large , no multiple- -sub-Gaussian estimators exist for any sequence . Finally, the third item says that even when , -dependent estimators are limited to , 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- sub-Gaussian estimation. The following shows that what we call regularity conditions can substitute for knowledge of the variance.
We say that a distribution is symmetric around the mean if, given , as well. Clearly, if has this property, for all and thus . In other words, where is the class of all that are symmetric around the mean.
Given and , set
We show in Lemma 6.2 that, for in this family, once for a constant depending only on . We deduce
Our main result about -regular classes states that sub-Gaussian multiple- estimators exist for in the sense of the following theorem, proven in Section 6.1.
Let be positive integers with . Set and . Then there exists a -sub-Gaussian multiple- estimator for .
We also show that the range of 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 -regular classes has nearly optimal range of for these two smaller classes. The next result, for symmetric distributions, is proven in Section 6.2.
Consider the class defined in Example 3.1. Then
the estimator obtained in Theorem 3.3 for is a -sub-Gaussian multiple- estimator for when ;
on the other hand, for any , no -dependent -sub-Gaussian estimator can exist for .
We also have an analogue result for the class . The proof may be found in Section 6.3.
Fix and assume . Consider the class defined in Example 3.2. Then there exists some depending only on such that if ,
the estimator obtained in Theorem 3.3 for is a -sub-Gaussian multiple- estimator for when ;
finally, for there is no -dependent sub-Gaussian estimator for .
4 Bounded kurtosis and nearly optimal constants
This section shows that multiple- sub-Gaussian estimation with nearly optimal constants can be proved when the kurtosis
(when ) is uniformly bounded in the class. (For completeness, we set when .) More specifically, we will consider the class of all distributions with .
To state the result, let be a positive integer to be specified below. Also define
Note that when , . The main result for classes of distributions with bounded kurtosis is the following. For the proof see Section 7.
Let , , . There exists an absolute constant such that, if , then there exists a multiple- -sub-Gaussian estimator for .
This result is most interesting in the regime where , possibly depends on and . In this case, we may take and obtain multiple- -sub-Gaussian estimators for . Catoni obtained -dependent -estimators for a smaller value . In Remark 2 we show how one can obtain a similar range of with a multiple- estimator, albeit with worse constant .
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- estimators from confidence intervals. The point is that confidence intervals are “-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 for -dependent estimators.
Section 4.5 uses the Poisson family to derive lower bounds on for multiple- estimators.
A combination of the above results will allow us to derive the sharp range for 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 and there exists a -dependent -sub-Gaussian estimators for
(If several fit the above description, we take the smallest one.) We need the following Lemma (proven subsequently):
In our case we set . To build our estimator for a given , we first choose
and define the median-of-means estimator by
We now show that is a sub-Gaussian estimator for the class . Let for a distribution . is the median of random variables
Each has mean and variance . Then, using our choice of , Lemma 4.1 implies
Now, because
and since this works for any , the proof is complete.
Proof of Lemma 4.1: Let . Clearly,
The indicators variables on the right-hand side are all independent, and by Chebyshev’s inequality, for all ,
since .
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- estimators. This will be our main tool in defining all multiple- 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- sub-Gaussian mean estimator.
so it makes sense to define the estimator as its midpoint.
We claim that is the sub-Gaussian estimator we are looking for. To prove this, we let and choose the smallest with . Assume with . Then
When holds, for all , so . In particular, and .
Finally, our choice of implies , so, under we have
with as in the statement of the theorem.
and since this holds for all and all , the proof is complete.
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- estimators for the class of distributions that contains two discrete distributions defined by
where and . Note that , and that for any , the -th central moment of both distributions equals
For , let be independent pairs of real-valued random variables such that
Note that and . Let . If and , then (using ),
Let be any mean estimator, possibly depending on . Then
From (10) we have that and therefore
Theorem 3.1 simply follows by noting that .
4 Laplace distributions and single-δ𝛿\delta estimators
The next result proves that -dependent -sub-Gaussian estimators are limited to exponentially small even over the one-dimensional family .
If then, for any constant , there are no -dependent -sub-Gaussian estimators for .
Proof: We proceed by contradiction, assuming that there exist -sub-Gaussian -dependent estimators for where and arbitrarily large . We set
Using the definition of and the fact that and , 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 , we see that
For , some simple estimates show that this leads to a contradiction when .
5 Poisson distributions and multiple-δ𝛿\delta estimators
We use the family of Poisson distributions for bounding the range of confidence values of multiple- estimators. Denote by the Poisson distribution with parameter . Given , define
Proof: We prove the following stronger result: there exist constants such that, when , and , there is no multiple- sub-Gaussian estimator for
The theorem then follows by taking and .
and .
and .
We apply the sub-Gaussian property for the triple () to . This is possible because, for with a large enough , this value is , which is much larger than the minimum confidence parameter allowed by () (at least if with a large enough ). Recalling F0, we obtain
Now F1 implies that the left-hand side is the same if we switch from to . In particular, by looking at the complementary event we obtain
Since we are taking and , a calculation reveals
Therefore, by taking a large enough we can ensure that
We now use F0 to rewrite the previous probability as
Since we assumed is -sub-Gaussian for the triple (), we obtain
Comparing the left and right hand sides, and recalling , we obtain . This is a contradiction if because grows like (cf. F4). This contradiction shows that there does not exist a -sub-Gaussian estimator for , as desired.
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 . The three parts of the theorem are proven separately.
whenever for some . We define a confidence interval for each via
Clearly, (14) and the fact that for all imply that is a -sub-Gaussian confidence interval for . Applying Theorem 4.2 gives the desired result.
(Non-existence of multiple- estimators when .) We use Theorem 4.4. By rescaling, we may assume , where is the constant appearing in Theorem 4.4. We also set for as in Theorem 4.4. The assumption on ensures that , so there cannot be a -sub-Gaussian estimator when .
(Non-existence of -dependent estimators when .) By rescaling, we may assume . Then the class in Theorem 4.3 is contained in , 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 -regular classes.
Proof of Theorem 3.3: By Theorem 4.2, it suffices to build a -sub-Gaussian confidence interval for .
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 and -quantiles to build an interval.
The next result (proven subsequently) is an analogue of Lemma 4.1.
and
Now fix . We define a confidence interval as follows. First set and note that
is a -sub-Gaussian collection of confidence intervals for .
To see this, we take a distribution in this family and assume . Set . Because the blocks are disjoint and have at least elements each, the random variables
all have mean and variance . Moreover, using (15),
so the -regularity property implies that for all ,
by the choice of and the fact that . To finish, we use (15) and the definition of to obtain
Plugging this back into (16) and recalling implies the desired result.
Proof of Lemma 6.1: Define . Assume the following three properties hold.
The number of indices with is at least .
Then clearly . Moreover, item 3 implies that , 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- 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 for large enough , and then prove Theorem 3.5. We recall the definition of and from Definition 2.
For all , there exists such that, if , then .
Proof: We only prove that , as the other proof is analogous.
Lindberg’s proof of the central limit theorem (see ), specialized to the case where are i.i.d., gives
The right-hand side is when for some universal .
Proof of Theorem 3.5: The positive result follows directly from Theorem 3.3 plus Lemma 6.2, which guarantees for . For the second part, we first assume for a sufficiently large constant . We use the Poisson family of distributions from Section 4.5. For and , we have that
If we compare this to Example 3.2, we see that if for some constant (recall we are assuming that is at least a large constant). Now take such that . If for the constant in the statement of Theorem 4.4, we can apply the theorem to deduce that there is no multiple- estimator for . Noting that is of the order finishes the proof in this case.
Now assume . In this case we use the Laplace distributions in Section 4.4. Since , we may apply the fact that the central third moment of a Laplace distribution satisfies to obtain
Our assumption on implies that . Thus Theorem 4.3 implies that there is no -dependent or multiple- sub-Gaussian estimator for . This is the desired result since is bounded when .
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 and for some , and let , , 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 . 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 , and analyze the behavior of one such estimator, chosen under knowledge of and .
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 with a worse constant .
(Preliminary estimates via median of means.) Denote by the estimator given by Theorem 4.1 with , which is possible if . The next lemma provides an estimator of the variance.
Let denote a partition of into blocks of size . For each block with , define
The theorem follows by the definition of and an application of Theorem 4.1.
Assume , and . Then, with probability at least ,
Proof: The proof is a consequence of Benett’s inequality. It suffices to estimate the moments of . 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 , since ,
For , we have and therefore
Repeat the same computations with to prove the lower bound.
(Insensitivity of the estimators.) Given , define
Assume then for any , with probability at least , for all ,
By Chebyshev’s inequality, this implies that, for any positive integer ,
A union bound in Bennett’s inequality gives that, with probability at least , for any ,
Summing up these inequalities gives the desired bound.
Assume , . Then, with probability at least , for all ,
From Lemma 7.1, with probability at least ,
This means that, with probability at least , belongs to if we define
By an appropriate choice of the constant , we can always assume that is at least some large constant, to ensure that . So Corollary 7.1 applies and gives
In particular, if , we get
Let us quickly sketch how one may get a smaller value of at the expense of a larger constant . The idea is to redo the proof of part of Theorem 3.2 (cf. Section 5). We build -dependent estimators for via median-of-means, as in (14), but then use the value from Lemma 7.1 instead of the value when building the confidence interval, with a choice of . Then one obtains an empirical confidence interval that contains and has the appropriate length with probability whenever for some constant . Using Theorem 4.2 as in Section 5 then gives a multiple- -sub-Gaussian estimator for for large enough values of , where does not depend on or . It is an open question whether one can obtain a similar value of with .
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 of distributions and what values of can one find multiple- estimators with sharp constant ? One may even sharpen our definition of a sub-Gaussian estimator and ask for estimators that satisfy
for all and ?
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 can one find sub-Gaussian confidence intervals? Can one reverse the implication in Theorem 4.2, and build sub-Gaussian confidence intervals from multiple- estimators?
A natural way to obtain strong sub-Gaussian concentration for heavier-tailed would be to replace the usual empirical estimates by one of our multiple- 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- 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).