Buckley and James proposed an extension of the classical least squares estimator to the censored regression model. It has been found in some empirical and Monte Carlo studies that their approach provides satisfactory results and seems to be superior to other extensions of the least squares estimator in the literature. To develop a complete asymptotic theory for this approach, we introduce herein a slight modification of the Buckley-James estimator to get around the…
Probability density functions are estimated by the method of maximum likelihood in sequences of regular exponential families. This method is also familiar as entropy maximization subject to empirical constraints. The approximating families of log-densities that we consider are polynomials, splines and trigonometric series. Bounds on the relative entropy (Kullback-Leibler distance) between the true density and the estimator are obtained and rates of convergence are…
Peter J. Bickel · Ya'Acov Ritov · Jon A. Wellner·刊期 1991-09-01 · 卷 19(3)·The Annals of Statistics已编入正刊
已知边际分布时概率测度线性泛函的有效估计AI 解读
Suppose that $P$ is the distribution of a pair of random variables $(X, Y)$ on a product space $\mathbb{X} \times \mathbb{Y}$ with known marginal distributions $P_X$ and $P_Y$. We study efficient estimation of functions $\theta(h) = \int h dP$ for fixed $h: \mathbb{X} \times \mathbb{Y} \rightarrow R$ under iid sampling of $(X, Y)$ pairs from $P$ and a regularity condition on $P$. Our proposed estimator is based on partitions of both $\mathbb{X}$ and $\mathbb{Y}$ and the…
Many important statistics can be written as functions of sample means of vector variables. A fundamental contribution to the Edgeworth expansion for functions of sample means was made by Bhattacharya and Ghosh. In their work the crucial Cramer $c$-condition is assumed on the joint distribution of all the components of the vector variable. However, in many practical situations, only one or a few of the components satisfy (conditionally) this condition while the rest do not…
We discuss the difficulties of estimating quadratic functionals based on observations $Y(t)$ from the white noise model $Y(t) = \int^t_0 f(u) du + \sigma W(t),\quad t \in \lbrack 0, 1\rbrack,$ where $W(t)$ is a standard Wiener process on $\lbrack 0, 1\rbrack$. The optimal rates of convergence (as $\sigma \rightarrow 0$) for estimating quadratic functionals under certain geometric constraints are found. Specifically, the optimal rates of estimating $\int^1_0\lbrack f^{(k)}(x)\rbrack^2 dx$…
If $X \sim P_\theta, \theta \in \Omega$ and $\theta \sim G \ll \mu$, where $dG/d\mu$ belongs to the convex family $\Gamma_{L, U} = \{g: L \leq \operatorname{cg} \leq U$, for some $c > 0\}$, then the sets minimizing $\lambda(S)$ subject to $\inf_{G \in \Gamma_{L,U}} P_G(S\mid X) \geq p$ are derived, where $P_G(S\mid X)$ is the posterior probability of $S$ under the prior $G$, and $\lambda$ is any nonnegative measure on $\Omega$ such that $\mu \ll \lambda \ll \mu$.…
Certain orthogonal polynomials are employed to estimate the prior distribution of the parameter of natural exponential families with quadratic variance functions in an approach which combines Bayesian and nonparametric empirical Bayesian methods. These estimates are based on samples from the marginal distribution rather than the conditional distribution.
A general representation is obtained for the formal Bayes estimator of a parameter matrix. We assume that the prior distribution is symmetric in some sense, but it is not specified otherwise. The formal Bayes risk is minimized subject to order constraints by a variational technique; hence our representation is called "the variational form of the Bayes estimator" (VFBE). The VFBE is used to obtain estimators that have good frequency properties relative to the usual…
Given a realization of $T$ consecutive observations of a stationary autoregressive process of unknown, possibly infinite, order $m$, it is assumed that a process of arbitrary finite order $p$ is fitted by least squares. Under appropriate conditions it is known that the estimators of the autoregressive coefficients are asymptotically normal. The question considered here is whether the moments of the (scaled) estimators converge, as $T \rightarrow \infty$, to the moments of…
Least squares estimators of the parameters of a linear time series model, where the parameters are constrained by a set of nonlinear restrictions, are studied. The model may contain lags of the dependent variable as regressors and the sums of squares of the explanatory variables may grow at different rates as the sample size increases. The estimation procedures can be applied to a regression model with an error process that satisfies either a stationary or a nonstationary…
An asymptotic analysis is presented for estimation in the three-parameter first-order autoregressive model, where the parameters are the mean, autoregressive coefficient and variance of the shocks. The nearly nonstationary asymptotic model is considered wherein the autoregressive coefficient tends to 1 as sample size tends to $\infty$. Three different estimators are considered: the exact Gaussian maximum likelihood estimator, the conditional maximum likelihood or least…
The nearly nonstationary first-order autoregression is a sequence of autoregressive processes $y_n(k + 1) = \phi_ny_n(k) + \varepsilon(k + 1), 0 \leq k \leq n$, where the $\varepsilon(k)$'s are iid mean zero shocks and the autoregressive coefficient $\phi_n = 1 - \beta/n$ for some $\beta > 0$, so that $\phi_n \rightarrow 1$ as $n \rightarrow \infty$. We consider a class of maximum likelihood type estimators called $M$ estimators, which are not necessarily robust. The…
Deconvolution problems arise in a variety of situations in statistics. An interesting problem is to estimate the density $f$ of a random variable $X$ based on $n$ i.i.d. observations from $Y = X + \varepsilon$, where $\varepsilon$ is a measurement error with a known distribution. In this paper, the effect of errors in variables of nonparametric deconvolution is examined. Insights are gained by showing that the difficulty of deconvolution depends on the smoothness of error…
The papers of Blackwell and Hodges (1957) and Diaconis and Graham (1981) contain an error concerning the asymptotic distribution of the number of returns to the origin of a constrained random walk. The correct distribution is given.
Under minimal conditions precise bounds are obtained for the expectation of the supremum of the weighted empirical process over the interval $(0, 1/(n(\log n)^{d - 1}))$, where $d$ is the dimension of the underlying random vectors. The allowed growth of the weight function is optimal in the iid case. The results will have broad applications in the theory of all kinds of nonstandard weighted empirical processes, such as empirical processes based on uniform spacings or $U$-stat…
I. V. Basawa · A. K. Mallik · W. P. McCormick · J. H. Reeves · R. L. Taylor·刊期 1991-06-01 · 卷 19(2)·The Annals of Statistics已编入正刊
不稳定一阶自回归过程的自助法AI 解读
Consider a first-order autoregressive process $X_t = \beta X_{t - 1} + \varepsilon_t$, where $\{\varepsilon_t\}$ are independent and identically distributed random errors with mean 0 and variance 1. It is shown that when $\beta = 1$ the standard bootstrap least squares estimate of $\beta$ is asymptotically invalid, even if the error distribution is assumed to be normal. The conditional limit distribution of the bootstrap estimate at $\beta = 1$ is shown to converge to a…
The Kalman recursion for state space models is extended to allow for likelihood evaluation and minimum mean square estimation given states with an arbitrarily large covariance matrix. The extension is computationally minor. Application is made to likelihood evaluation, state estimation, prediction and smoothing.
We derive Bahadur-type representations for quantile estimates obtained from two different types of nonparametric bootstrap resampling--the commonly used uniform resampling method, where each sample value is drawn with the same probability, and importance resampling, where different sample values are assigned different resampling weights. These results are applied to obtain the relative efficiency of uniform resampling and importance resampling and to derive exact convergence…
Thomas DiCiccio · Peter Hall · Joseph Romano·刊期 1991-06-01 · 卷 19(2)·The Annals of Statistics已编入正刊
经验似然可作 Bartlett 校正AI 解读
It is shown that, in a very general setting, the empirical likelihood method for constructing confidence intervals is Bartlett-correctable. This means that a simple adjustment for the expected value of log-likelihood ratio reduces coverage error to an extremely low $O(n^{-2})$, where $n$ denotes sample size. That fact makes empirical likelihood competitive with methods such as the bootstrap which are not Bartlett-correctable and which usually have coverage error of size $n^{-1}$…
Bickel and Rosenblatt proposed a procedure for testing the goodness of fit of a specified density to observed data. The test statistic is based on the distance between the kernel density estimate and the hypothesized density, and it depends on a kernel $K$, a bandwidth $b_n$ and an arbitrary weight function $a$. We study the behavior of the asymptotic power of the test and show that a uniform kernel maximizes the power when $a > 0$.
The binary hypothesis testing problem of deciding between two Markov chains is formulated under memory constraints. The optimality criterion used in the exponential rate with which the probability of error approaches zero as the sample size tends to infinity. The optimal memory constrained test is shown to be the solution of a set of equations derived from suitable large deviation twistings of the transition matrices under the two hypotheses. A computational algorithm and…
Sequential estimation continues observations until the observed sample satisfies a prescribed criterion. Its properties are superior on the average to those of nonsequential estimation in which the number of observations is fixed a priori. A higher-order asymptotic theory of sequential estimation is given in the framework of geometry of multidimensional curved exponential families. This gives a design principle of the second-order efficient sequential estimation procedure.…
Consider the problem of continuous invariant estimation of a distribution function with the weighted Cramer-von Mises loss. The minimaxity of the empirical distribution function, which is also the best invariant estimator, is proved for any sample size. This solves a long-standing conjecture.
We introduce new criteria for evaluating test statistics based on the $p$-values of the statistics. Given a set of test statistics, a good statistic is one which is robust in being reasonably sensitive to all departures from the null implied by that set. We present a constructive approach to finding the optimal statistic. We apply the criteria to two-sided problems; combining independent tests; testing that the mean of a spherical normal distribution is 0, and extensions to…
Efficient Estimation of Linear Functionals of a Probability Measure P with Known Marginal Distributions
Suppose that P is the distribution of a pair of random variables (X,Y) on a product space X×Y with known marginal distributions PX and PY. We study efficient estimation of functions θ(h)=∫hdP for fixed h:X×Y→R under iid sampling of (X,Y) pairs from P and a regularity condition on P. Our proposed estimator is based on partitions of both X and Y and the…
Many important statistics can be written as functions of sample means of vector variables. A fundamental contribution to the Edgeworth expansion for functions of sample means was made by Bhattacharya and Ghosh. In their work the crucial Cramer c-condition is assumed on the joint distribution of all the components of the vector variable. However, in many practical situations, only one or a few of the components satisfy (conditionally) this condition while the rest do not…
We discuss the difficulties of estimating quadratic functionals based on observations Y(t) from the white noise model Y(t)=∫0tf(u)du+σW(t),t∈[0,1], where W(t) is a standard Wiener process on [0,1]. The optimal rates of convergence (as σ→0) for estimating quadratic functionals under certain geometric constraints are found. Specifically, the optimal rates of estimating ∫01[f(k)(x)]2dx…
If X∼Pθ,θ∈Ω and θ∼G≪μ, where dG/dμ belongs to the convex family ΓL,U={g:L≤cg≤U, for some c>0}, then the sets minimizing λ(S) subject to infG∈ΓL,UPG(S∣X)≥p are derived, where PG(S∣X) is the posterior probability of S under the prior G, and λ is any nonnegative measure on Ω such that μ≪λ≪μ.…
Given a realization of T consecutive observations of a stationary autoregressive process of unknown, possibly infinite, order m, it is assumed that a process of arbitrary finite order p is fitted by least squares. Under appropriate conditions it is known that the estimators of the autoregressive coefficients are asymptotically normal. The question considered here is whether the moments of the (scaled) estimators converge, as T→∞, to the moments of…
An asymptotic analysis is presented for estimation in the three-parameter first-order autoregressive model, where the parameters are the mean, autoregressive coefficient and variance of the shocks. The nearly nonstationary asymptotic model is considered wherein the autoregressive coefficient tends to 1 as sample size tends to ∞. Three different estimators are considered: the exact Gaussian maximum likelihood estimator, the conditional maximum likelihood or least…
The nearly nonstationary first-order autoregression is a sequence of autoregressive processes yn(k+1)=ϕnyn(k)+ε(k+1),0≤k≤n, where the ε(k)'s are iid mean zero shocks and the autoregressive coefficient ϕn=1−β/n for some β>0, so that ϕn→1 as n→∞. We consider a class of maximum likelihood type estimators called M estimators, which are not necessarily robust. The…
Deconvolution problems arise in a variety of situations in statistics. An interesting problem is to estimate the density f of a random variable X based on n i.i.d. observations from Y=X+ε, where ε is a measurement error with a known distribution. In this paper, the effect of errors in variables of nonparametric deconvolution is examined. Insights are gained by showing that the difficulty of deconvolution depends on the smoothness of error…
Under minimal conditions precise bounds are obtained for the expectation of the supremum of the weighted empirical process over the interval (0,1/(n(logn)d−1)), where d is the dimension of the underlying random vectors. The allowed growth of the weight function is optimal in the iid case. The results will have broad applications in the theory of all kinds of nonstandard weighted empirical processes, such as empirical processes based on uniform spacings or U-stat…
Consider a first-order autoregressive process Xt=βXt−1+εt, where {εt} are independent and identically distributed random errors with mean 0 and variance 1. It is shown that when β=1 the standard bootstrap least squares estimate of β is asymptotically invalid, even if the error distribution is assumed to be normal. The conditional limit distribution of the bootstrap estimate at β=1 is shown to converge to a…
It is shown that, in a very general setting, the empirical likelihood method for constructing confidence intervals is Bartlett-correctable. This means that a simple adjustment for the expected value of log-likelihood ratio reduces coverage error to an extremely low O(n−2), where n denotes sample size. That fact makes empirical likelihood competitive with methods such as the bootstrap which are not Bartlett-correctable and which usually have coverage error of size n−1…
Bickel and Rosenblatt proposed a procedure for testing the goodness of fit of a specified density to observed data. The test statistic is based on the distance between the kernel density estimate and the hypothesized density, and it depends on a kernel K, a bandwidth bn and an arbitrary weight function a. We study the behavior of the asymptotic power of the test and show that a uniform kernel maximizes the power when a>0.
We introduce new criteria for evaluating test statistics based on the p-values of the statistics. Given a set of test statistics, a good statistic is one which is robust in being reasonably sensitive to all departures from the null implied by that set. We present a constructive approach to finding the optimal statistic. We apply the criteria to two-sided problems; combining independent tests; testing that the mean of a spherical normal distribution is 0, and extensions to…