Letter to the editor comments on Groparu-Cojocaru and Doray (2013)

Although estimating the five parameters of an unknown Generalized Normal Laplace (GNL) density by minimizing the distance between the empirical and true characteristic functions seems appealing, the approach cannot be advocated in practice. This conclusion is based on extensive numerical simulations in which a fast minimization procedure delivers deceiving estimators with values that are quite far away from the truth. These findings can be predicted by the very large values obtained for the true asymptotic variances of the estimators of the five parameters of the true GNL density.     

Global convergence of the log-concave MLE when the true distribution is geometric

Let X₁, …, X_n be i.i.d. from a discrete probability mass function (pmf) p. In Balabdaoui et al. [(2013), ‘Asymptotic Distribution of the Discrete Log-Concave mle and Some Applications’, JRSS-B, in press], the pointwise limit distribution of the log-concave maximum-likelihood estimator (MLE) was derived in both the well- and misspecified settings. In the well-specified setting, the geometric distribution was excluded, classified as being degenerate. In this article, we establish the global asymptotic theory of the log-concave MLE of a geometric pmf in all ?_q distances for q∈{1, 2, …}∪{∞}. We also show how these asymptotic results could be used in testing whether a pmf is geometric.     

Score estimation in the monotone single‐index model

We consider estimation in the single‐index model where the link function is monotone. For this model, a profile least‐squares estimator has been proposed to estimate the unknown link function and index. Although it is natural to propose this procedure, it is still unknown whether it produces index estimates that converge at the parametric rate. We show that this holds if we solve a score equation corresponding to this least‐squares problem. Using a Lagrangian formulation, we show how one can solve this score equation without any reparametrization. This makes it easy to solve the score equations in high dimensions. We also compare our method with the effective dimension reduction and the penalized least‐squares estimator methods, both available on CRAN as R packages, and compare with link‐free methods, where the covariates are elliptically symmetric.     

ON THE GRENANDER ESTIMATOR AT ZERO

We establish limit theory for the Grenander estimator of a monotone density near zero. In particular we consider the situation when the true density f(0) is unbounded at zero, with different rates of growth to infinity. In the course of our study we develop new switching relations using tools from convex analysis. The theory is applied to a problem involving mixtures.