Approximation by log-concave distributions, with applications to regression
Lutz Duembgen, Richard Samworth, Dominic Schuhmacher
Introduction
Log-concave distributions, that is, distributions with a Lebesgue density the logarithm of which is concave, are an interesting nonparametric model comprising many parametric families of distributions. Bagnoli and Bergstrom (2005) give an overview of many interesting properties and applications in econometrics. Indeed, these distributions have received a lot of attention among statisticians recently as described in the review by Walther (2009). The nonparametric maximum likelihood estimator was studied in the univariate setting by Pal, Woodroofe and Meyer (2007), Rufibach (2006), Dümbgen, Hüsler and Rufibach (2007), Balabdaoui, Rufibach and Wellner (2009) and Dümbgen and Rufibach (2009). These references contain characterizations of the estimators, consistency results and explicit algorithms. Extensions of one or more of these aspects to the multivariate setting are presented by Cule, Samworth and Stewart (2010), Cule and Samworth (2010), Koenker and Mizera (2010), Seregin and Wellner (2010) and Schuhmacher and Dümbgen (2010). Both Cule and Samworth (2010) and Schuhmacher, Hüsler and Dümbgen (2009) show that multivariate log-concave distributions are a very well-behaved nonparametric class. For instance, moments of arbitrary order are continuous statistical functionals with respect to weak convergence.
(provided this exists and is unique). Even if fails to have a density within , one may view as an estimator of the approximating density
Since the sequence of empirical measures converges weakly to almost surely, this entails strong consistency of the Grenander estimator in total variation distance.
Some additional properties of will be established as well. We show that the mapping is continuous with respect to Mallows distance [Mallows (1972)] , also known as a Wasserstein, Monge–Kantorovich or Earth Mover’s distance. Precisely, let satisfy the properties just mentioned, and let be a sequence of probability distributions converging to in ; in other words,
as . Then is well defined for sufficiently large and
This entails strong consistency of the maximum likelihood estimator , because converges almost surely to with respect to Mallows distance . In addition we show that is convex and upper semicontinuous with respect to weak convergence.
In Section 3 we apply these results to the following type of regression problem: suppose that we observe independent real random variables , such that
Many proofs and technical arguments are deferred to Section 4. A longer and more detailed version of this paper is the technical report by Dümbgen, Samworth and Schuhmacher (2010), referred to as [DSS 2010] hereafter. It contains all proofs, additional examples and plots, a detailed description of our algorithms and extensive simulation studies. There we also indicate potential applications to change-point analyses.
Log-concave approximations
The next theorem provides a complete characterization of all distributions with real profile log-likelihood . To state the result we first define the convex support of a distribution and collect some of its properties.
is itself closed and convex with . The following three properties of are equivalent:
has nonempty interior;
For any , the value of is real if and only if
In that case, there exists a unique function
This function satisfies and
Let be the approximating probability measure with . It satisfies the following (in)equalities:
The profile log-likelihood is convex on . Precisely, for arbitrary and ,
The two sides are equal and real if and only if with .
Furthermore, suppose that has a density on an open set such that on this set. Then
2 The one-dimensional case
For the case of one can generalize Theorem 2.4 of Dümbgen and Rufibach (2009) as follows: for a function let
One consequence of this theorem is that the c.d.f. of follows the c.d.f. of quite closely in that
Let be a rescaled version of Student’s distribution with density and distribution function
respectively. The best approximating log-concave distribution is the Laplace distribution with density and distribution function
respectively. To verify this claim, note that by symmetry it suffices to show that
Indeed the integral on the left-hand side equals
for all . Clearly this expression is zero for , and elementary considerations show that it is nonpositive for all . Numerical calculations reveal that is smaller than everywhere.
Suppose that has a continuous but not log-concave density . Nevertheless one can say the following about the approximating log-density :
Suppose that is concave on an interval with and . Then there exists a point such that is linear on and on .
Suppose that is differentiable everywhere, convex on a bounded interval and concave on both and . Then there exist points and such that is linear on while on .
Suppose that is convex on an interval such that . Then is linear on .
Let us illustrate part (ii) of Remark 2.11 with a numerical example. Figure 1 shows the bimodal
3 Continuity in Q𝑄Q
For the applications to regression problems to follow we need to understand the properties of both and on . Our first hope was that both mappings would be continuous with respect to the weak topology. It turned out, however, that we need a somewhat stronger notion of convergence, namely, convergence with respect to Mallows distance which is defined as follows: for two probability distributions ,
where the infimum is taken over all pairs of random vectors and on a common probability space. It is well known that the infimum in is a minimum. The distance is also known as Wasserstein, Monge–Kantorovich or Earth Mover’s distance. An alternative representation due to Kantorovič and Rubinšteĭn (1958) is
A good starting point for more detailed information on Mallows distance is Chapter 7 of Villani (2003).
Before presenting the main results of this section we mention two useful facts about the convex support of distributions.
Moreover, if is a sequence in converging weakly to , then
This lemma implies that the set is an open subset of with respect to the topology of weak convergence. The supremum is a maximum over closed halfspaces and is related to Tukey’s halfspace depth [Donoho and Gasko (1992), Section 6]. For a proof of Lemma 2.13 we refer to [DSS 2010]. Now we are ready to state the main results of this section.
Let be a sequence of distributions in converging weakly to some . Then
Moreover, if and only if
This result already entails continuity of on with respect to Mallows distance . The next theorem extends this result to :
Let be a sequence of distributions in such that for some . Then
In case of , the probability densities f:=\exp\mbox{{}\circ{}}\psi(\cdot|Q) and f_{n}:=\exp\mbox{{}\circ{}}\psi(\cdot|Q_{n}) are well defined for sufficiently large and satisfy
Applications to regression problems
We propose to estimate by a maximizer of
maximizes over all satisfying the additional constraint that \exp\mbox{{}\circ{}}\phi defines a probability density with mean zero.
Define and . Then we may write
and this representation is our key to proving the existence of . Before doing so we state a simple inequality of independent interest, which follows from Jensen’s inequality and elementary considerations:
For any distribution ,
where is a median of while denotes its mean .
The constraint excludes situations with perfect fit. In that case, the Dirac measure would be the most plausible error distribution.
The maximum likelihood estimator need not be unique in general. Nevertheless we will prove it to be consistent under certain regularity conditions. A key point here is Fisher consistency in the following sense: note that the expectation measure of the empirical distribution equals
with equality if and only if is constant on . This follows from a more general inequality which is somewhat reminiscent of Anderson’s lemma [Anderson (1955)]:
Let and . Then and
2 Consistency
In this subsection we consider a triangular scheme of independent observations , , with fixed design points and
where is an unknown regression function in and are unobserved independent random errors with mean zero and unknown distribution . Two basic assumptions are:
for some distribution .
We write for a maximizer of over all pairs such that and , where stands for the empirical distribution of the residuals , . We also need to consider its expectation measure
It is also convenient to metrize weak convergence. In Theorem 3.6 below we utilize the bounded Lipschitz distance: for probability distributions on the real line let
Let assumptions (A.1) and (A.2) be satisfied. Suppose further that: {longlist}[(A.2)]
Then, with f_{n}:=\exp\mbox{{}\circ{}}\psi(\cdot|Q_{n}) and \hat{f}_{n}:=\exp\mbox{{}\circ{}}\hat{\psi}_{n}, the maximum likelihood estimator of exists with asymptotic probability one and satisfies
We know already that assumption (A.1) is satisfied for multiple linear regression and isotonic regression. Assumption (A.2) is a generalization of assuming a fixed error distribution for all sample sizes. The crucial point, of course, is assumption (A.3). In our two examples it is satisfied under mild conditions:
The proof of Theorem 3.7 is given in Section 4. For the proof of Theorem 3.8, which uses similar ideas and an additional approximation argument, we refer to [DSS 2010].
3 Algorithms and numerical results
Extensive simulation studies in [DSS 2010] suggest that provides rather accurate estimates even if is only moderately large. For various skewed error distributions, may be considerably better than the corresponding least squares estimator. As an example consider the simple linear regression model with observations
where are independent design points from the distribution and are independent errors from a centered gamma distribution with shape parameter and variance . Note that the distribution of does not depend on or . Monte Carlo estimation of the root mean squared error based on 1000 simulations of this model gives 0.023 for the estimator versus 0.118 for the least squares estimator of if , and 0.095 versus 0.113 for the same comparison if .
4 A data example
A familiar task in econometrics is to model expenditure () of households as a function of their income (). Not only the mean curve (Engel curve) but also quantile curves play an important role. A related application are growth charts in which, for instance, is the age of a newborn or infant and is its height or weight.
Interestingly, neither linear nor quadratic nor cubic regression yield convincing fits to these data. Polynomial regression of degree four or cubic splines with knot points at, say, , , , , seem to fit the data quite well. Moreover, exact Monte Carlo goodness-of-fits test, assuming the regression function to be a cubic spline and based on a Kolmogorov–Smirnov statistic applied to studentized residuals, revealed the regression errors to be definitely non-Gaussian.
Figure 3 shows the data and estimated -quantile curves for , , , , , based on our additive regression model. Note that the estimated -quantile curve is simply the estimated mean curve plus the -quantile of the estimated error distribution. On the left-hand side, we only assumed to be nondecreasing, on the right-hand side we fitted the aforementioned spline model. In both cases the fitted quantile curves are similar to the quantile curves in Figure 2 but with fewer irregularities such as big jumps which may be artifacts due to sampling error.
Proofs
For the proof of Theorem 2.2 we need an elementary bound for the Lebesgue measure of level sets of log-concave distributions:
Another key ingredient for the proofs of Theorems 2.2 and 2.15 is a lemma on pointwise limits of sequences in :
is nonempty. Then there exist a subsequence of and a function such that and
Proof of Theorem 2.2 Suppose first that . Since any is majorized by for suitable constants and , this entails that .
For the remainder of this proof suppose that and that has nonempty interior. Since the concave function satisfies , we have . When maximizing over all we may and do restrict our attention to functions such that (see end of Section 1) and . For if , replacing with for all would also increase strictly. Let be the family of all with these properties.
as for any fixed . But Lemma 2.1 entails that for sufficiently large and sufficiently small ,
If , then is not an interior point of the closed, convex set . Hence
with defined in Lemma 2.13. In the case of these inequalities are true as well. Thus
which establishes (5). Combining (5) with , we may deduce from Lemma 3.3 of Schuhmacher, Hüsler and Dümbgen (2009) that there exist constants and such that
Since the boundary of has Lebesgue measure zero, it follows from dominated convergence that . Moreover, applying Fatou’s lemma to the nonnegative functions yields
In our proofs of Theorems 2.7 and 2.15 we utilize a special approximation scheme for functions in :
For any function with nonempty domain and any parameter set
Proof of Theorem 2.7 Let be the distribution corresponding to . Suppose first that . Then it follows from (4) and Fubini’s theorem that
It remains to be shown that for . Suppose first that . Note that is nonincreasing on the interior of with
Moreover, implies that for all satisfying . For such we define
When is the left or right endpoint of , we define and conclude analogously that .
Since , we may continue with
where the first displayed inequality follows from log-concavity of with log-density . Thus .
Theorem 2.14 and the second part of Theorem 2.15 are a consequence of the following result:
Let be a sequence of distributions in such that , and as . Then , and if and only if . Moreover,
In the latter case, the densities f:=\exp\mbox{{}\circ{}}\psi(\cdot|Q) and f_{n}:=\exp\mbox{{}\circ{}}\psi(\cdot|Q_{n}) are well defined for sufficiently large and satisfy
Before presenting the proof of this result, let us recall two elementary facts about weak convergence and unbounded functions:
If the stronger statement holds, then
Proof of Theorem 4.4 The asserted inequality follows from the first part of Lemma 4.5 with .
Suppose that . Then with ,
In other words, entails that .
This can be verified as follows: since , the sequence satisfies . With similar arguments as in the proof of Theorem 2.2 one can deduce that is bounded from above, provided that
Another key property of the functions is that
by virtue of Lemma 2.13. Combining (5) with (7) we may again deduce that there exist constants and such that
Thus if .
By monotone convergence, applied to the functions , and dominated convergence, applied to \exp\mbox{{}\circ{}}\psi^{(\varepsilon)},
Note that the probability densities f=\exp\mbox{{}\circ{}}\psi and f_{n}=\exp\mbox{{}\circ{}}\psi_{n} obviously satisfy
In particular, converges to almost everywhere w.r.t. Lebesgue measure, whence .
where is a real, matrix and . Note that and for . Thus
and the right-hand side tends to infinity as . Thus it follows from Lemma 3.1 that
Our goal is to show that , viewed as a function of and thus fixed, too, is well defined for sufficiently large with
Note that we replaced with f=\exp\mbox{{}\circ{}}\psi(\cdot|Q) because tends to .
where and .
Note first that belongs to , whence
Since is tight, to verify (13) we may consider a subsequence that converges weakly to some distribution as . Then , so
by Theorems 2.14 and 3.5. Because of (14) we even know that as . Consequently, we may deduce from Theorems 2.14 and 3.5 that
Hence is not greater than
as . As , the limit on the right-hand side converges to . Consequently, . But then coincides with .
In our proofs of Theorems 3.7 and 3.8 we utilize a simple inequality for the bounded Lipschitz distance in terms of the Kolmogorov–Smirnov distance,
of two distributions :
Let and be distributions on the real line. Then for arbitrary ,
Proof of Theorem 3.7 A key insight is that the empirical distributions are close to their expectations with respect to Kolmogorov–Smirnov distance, uniformly over all . Namely,
for some universal constant [see Pollard (1990), Theorems 2.2 and 3.5, and van der Vaart and Wellner (1996), Theorem 2.6.4 and Lemma 2.6.16].
Acknowledgments
Constructive comments by an Associate Editor and two referees are gratefully acknowledged.