Alternative definitions of the concentration ellipsoid of a random vector are surveyed, and an extension of the concentration ellipsoid of Darmois is suggested as being the most convenient and natural definition. The advantage of the proposed definition in providing substantially simplified proofs of results in (linear) estimation theory is discussed, and is illustrated by new and short proofs of two key results. A not-so-well-known, but elementary, extremal representation of a nonnegative definite quadratic form, together with the corresponding Cauchy-Schwarẓ-type inequality, is seen to play a crucial role in these proofs.

This paper proposes an empirical likelihood-based estimation method for semiparametric conditional moment restriction models, which contain finite dimensional unknown parameters and unknown functions. We extend the results of Donald, Imbens, and Newey (2003, Journal of Econometrics 117, 55–93) by allowing unknown functions to be included in the conditional moment restrictions. We approximate unknown functions by a sieve method and estimate the finite dimensional parameters and unknown functions jointly. We establish consistency and derive the convergence rate of the estimator. We also show that the estimator of the finite dimensional parameters is $\sqrt n$-consistent, asymptotically normally distributed, and asymptotically efficient.

The paper “Kernel estimation when density may not exist” (Zinde-Walsh, 2008) considered density as a generalized function given by a functional on a space of smooth functions; this made it possible to establish the limit properties of the kernel estimator without assuming the existence of the density function. This note corrects an error in that paper in the derivation of the variance of the kernel estimator. The corrected result is that in the space of generalized functions the parametric rate of convergence of the kernel density estimator to the limit Gaussian process is achievable.

A Sharpening Of Nonuniform bounds of the Berry-Esseen type initially obtained by Esseen and later generalized by Kolodjažnyĭ–who also proved that they are, in some sense, optimal–is proposed. Further, the corresponding inequalities are shown to provide uniformly improved Chebyshev bounds for the tail probabilities of the distribution functions to be approximated. In contrast with most results on Berry–Esseen bounds, which emphasize rates of convergence to normality, the bounds proposed are sufficiently explicit to allow the computation of numerical bounds on a distribution function. For example, they can be applied to the sum of a small number of independent random variables. The bounds are easy to compute and can be used in confidence estimation as well as in testing problems. Applications include signed-rank tests, permutation tests, and the chi-square approximation to Bartlett's test statistic for the homogeneity of several variances.

This book, Matrix Algebra, is the first volume of the Econometric Exercises series. Other volumes of the series (Statistics [vol. 2], Econometric Theory I [vol. 3], and Empirical Applications [vol. 4]) are to appear in the near future. A variety of planned titles will also follow (e.g., Time Series, Microeconometrics, and Financial Econometrics). Although there have been a few worked-exercise books in econometrics (e.g., Phillips and Wickens, 1978), this series is the first comprehensive exercise series in modern econometrics that covers the materials for advanced undergraduate and graduate econometrics courses. According to the preface, each volume follows the same format. Chapters start with a brief overview, and then exercises and solutions follow. Solutions are provided immediately after the exercise is posed. There is a variety of exercises from proofs and applications of theorems to numerical examples. In this review I discuss only the first volume in the Econometric Exercises series and find it very useful and successful. I expect succeeding volumes in the series to be of similar quality and usefulness, given the overall objectives of the series.

Lyapunov exponents may be used to provide information on attractors of nonlinear models and, if strange, their aperiodic dynamics, in much the same way as eigenvalues of a linear model. An advantage of calculating these from an estimated model, rather than calculating the largest ones from a time series, is that economic theory is used to help distinguish between deterministic and stochastic behavior. Estimates of the Bergstrom/Wymer model of the United Kingdom, and of some other models of a similar form, were unstable in a classical sense, to some extent being caused by policy parameters. The Lyapunov exponents show that this model, and variants of it, have strange attractors in the neighborhood of the estimated parameter values and hence are stable but with aperiodic oscillations.

This paper provides a systematic approach to semiparametric identification that is based on statistical information as a measure of its “quality.” Identification can be regular or irregular, depending on whether the Fisher information for the parameter is positive or zero, respectively. I first characterize these cases in models with densities linear in an infinite-dimensional parameter. I then introduce a novel “generalized Fisher information.” If positive, it implies (possibly irregular) identification when other conditions hold. If zero, it implies impossibility results on rates of estimation. Three examples illustrate the applicability of the general results. First, I consider the canonical example of average densities. Second, I show irregular identification of the median willingness to pay in contingent valuation studies. Finally, I study identification of the discount factor and average measures of risk aversion in a nonparametric Euler equation with nonparametric measurement error in consumption.

Wu introduced a new technique for proving consistency of least-squares estimators in nonlinear regression. This paper extends his results in three directions. First, we consider the minimization of arbitrary functions (M-estimators instead of least squares). Second, we use an improved type 2 inequality. Third, an extension of Kronecker's lemma yields a more powerful result.

In testing for correlation of the errors in regression models, the power of tests can be very low for strongly correlated errors. This counterintuitive phenomenon has become known as the “zero-power trap.” Despite a considerable amount of literature devoted to this problem, mainly focusing on its detection, a convincing solution has not yet been found. In this article, we first discuss theoretical results concerning the occurrence of the zero-power trap phenomenon. Then, we suggest and compare three ways to avoid it. Given an initial test that suffers from the zero-power trap, the method we recommend for practice leads to a modified test whose power converges to $1$ as the correlation gets very strong. Furthermore, the modified test has approximately the same power function as the initial test and thus approximately preserves all of its optimality properties. We also provide some numerical illustrations in the context of testing for network generated correlation.

The aim of this paper is to construct a robust nonparametric estimator for the production frontier. We study this problem under a regression model with one-sided errors, where the regression function defines the achievable maximum output, for a given level of inputs-usage, and the regression error defines the inefficiency term. The main tool is a concept of partial regression boundary defined as a special probability-weighted moment. This concept motivates a robustified unconditional alternative to the pioneering class of nonparametric conditional expected maximum production functions. We prove that both the resulting benchmark partial frontier and its estimator share the desirable monotonicity of the true full frontier. We derive the asymptotic properties of the partial and full frontier estimators, and unravel their behavior from a robustness theory point of view. We provide numerical illustrations and Monte Carlo evidence that the presented concept of unconditional expected maximum production functions is more efficient and reliable in filtering out noise than the original conditional version. The methodology is very easy and fast to implement. Its usefulness is discussed through two concrete datasets from the sector of Delivery Services, where outliers are likely to affect the traditional conditional approach.

The limiting distribution of the least squares estimate of the derived process of a noninvertible and nearly noninvertible moving average model with infinite variance innovations is established as a functional of a Lévy process. The form of the limiting law depends on the initial value of the innovation and the stable index α. This result enables one to perform asymptotic testing for the presence of a unit root for a noninvertible moving average model through the constructed derived process under the null hypothesis. It provides not only a parallel analog of its autoregressive counterparts, but also a useful alternative to determine “over-differencing” for time series that exhibit heavy-tailed phenomena.

We consider an omnibus test for the correct specification of the dynamics of a sequence $\left\{ {x\left( t \right)} \right\}_{t \in Z^d } $ in a lattice. As it happens with causal models and d = 1, its asymptotic distribution is not pivotal and depends on the estimator of the unknown parameters of the model under the null hypothesis. One first main goal of the paper is to provide a transformation to obtain an asymptotic distribution that is free of nuisance parameters. Secondly, we propose a bootstrap analog of the transformation and show its validity. Thirdly, we discuss the results when $\left\{ {x\left( t \right)} \right\}_{t \in Z^d } $ are the errors of a parametric regression model. As a by product, we also discuss the asymptotic normality of the least squares estimator of the parameters of the regression model under very mild conditions. Finally, we present a small Monte Carlo experiment to shed some light on the finite sample behavior of our test.

A simple formula for computing the best linear unbiased estimate of the mean of an autoregressive process as well as its variance is given. Numerical results show that the estimate can have much lower variance than that of the usual sample mean.

The work of Professor P.C.B. Phillips, even if it is focused on the area of linear nonstationary models, is enormous. So it is hard for me to explore the whole of his work in this paper. Therefore, I have decided to take up only a few results of his work. The topics chosen here are applications of the martingale approximation and the problem of choosing between stochastic and deterministic trends, which I discuss and, hopefully, extend.