We derive an approximation of a density estimator based on weakly dependent random vectors by a density estimator built from independent random vectors. We construct, on a sufficiently rich probability space, such a pairing of the random variables of both experiments that the set of observations $X_1,\ldots,X_n}$ from the time series model is nearly the same as the set of observations $Y_1,\ldots,Y_n}$ from the i.i.d. model. With a high probability, all sets of the form $({X_1,\ldots,X_n}\\Delta{Y_1,\ldots,Y_n})\bigcap([a_1,b_1]\times\ldots\times[a_d,b_d])$…
Thomas Mathew · Kenneth Nordström · Manoj Kumar Sharma·刊期 1998-10-01 · 卷 26(5)·The Annals of Statistics已编入正刊
多元校准中的容忍域与可多次使用的置信域AI 解读
Let $\mathrm{y}~ N(Bx_i,\Sigma),i=1,2\ldots,N$, and $\mathrm{y}~N(B\theta, \Sigma)$ be independent multivariate observations, where the $x_i$'s are known vectors, $B,\theta$ and $\Sigma$ are unknown, $\Sigma$ being a positive definite matrix. The calibration problem deals with statistical inference concerning $\theta$ and the problem that we have addressed is the construction of confidence regions. In this article, we have constructed a region for $\theta$ based on a…
Consider a counting process $N(t), t\inT}$ with compensator process ${A(t),t\in T}$, where $A(t)=\int_0^t Y(s) ds, {Y(t), t\in T}$ is an observable predictable process, and $\lambda_0(\dot)$ is an unknown hazard rate function. A general procedure for extending Neyman’s smooth goodnessoffit test for the composite null hypothesis $H_0: \lambda_0(\dot)\inC ={\lambda_0(\dot;\eta):\eta\in\Gamma\subseteq\Re^q}$ is proposed and developed. The extension is obtained by embedding $C$…
In the context of regression analysis it is known that the residual cusum process may serve as a basis for the construction of various omnibus, smooth and directional goodness-of-fit tests. Since a deeper analysis requires the decomposition of the cusums into their principal components and this is difficult to obtain, we propose to replace this process by its innovation martingale. It turns out that the resulting tests are (asymptotically) distribution free under composite…
This paper outlines a theoretical framework for finite population models with unequal sample probabilities, along with sampling schemes for drawing random samples from these models. We first present four exact weighted sampling schemes that can be used for any finite population model to satisfy such requirements as ordered/ unordered samples, with/without replacement, and fixed/nonfixed sample size. We then introduce a new class of finite population models called weighted…
The purpose of this article is to derive and illustrate a method for fitting models involving both convex and log-convex constraints on the probability vector(s) of a (product) multinomial distribution. We give a two-step algorithm to obtain maximum likelihood estimates of the probability vector(s) and show that it is guaranteed to converge to the true solution. Some examples are discussed which illustrate the procedure.
The asymptotic risk of efficient estimators with Kullback–Leibler loss in smoothly parametrized statistical models is $k/2_n$, where $k$ is the parameter dimension and $n$ is the sample size. Under fairly general conditions, we given a simple information-theoretic proof that the set of parameter values where any arbitrary estimator is superefficient is negligible. The proof is based on a result of Rissanen that codes have asymptotic redundancy not smaller than $(k/2)\log n$,…
Standard wavelet shrinkage procedures for nonparametric regression are restricted to equispaced samples. There, data are transformed into empirical wavelet coefficients and threshold rules are applied to the coefficients. The estimators are obtained via the inverse transform of the denoised wavelet coefficients. In many applications, however, the samples are nonequispaced. It can be shown that these procedures would produce suboptimal estimators if they were applied directly…
A computational scheme for fitting smoothing spline ANOVA models to large data sets with a (near) tensor product design is proposed. Such data sets are common in spatial-temporal analyses. The proposed scheme uses the backfitting algorithm to take advantage of the tensor product design to save both computational memory and time. Several ways to further speed up the backfitting algorithm, such as collapsing component functions and successive over-relaxation, are discussed. An…
A general formula for computing the breakdown point in robustness for the $t$th bootstrap quantile of a statistic $T_n$ is obtained. The answer depends on $t$ and the breakdown point of $T_n$. Since the bootstrap quantiles are vital ingredients of bootstrap confidence intervals, the theory has implications pertaining to robustness of bootstrap confidence intervals. For certain $L$ and $M$ estimators, a robustification of bootstrap is suggested via the notion of Winsorization.
In the problem of regions, we wish to know which one of a discrete set of possibilities applies to a continuous parameter vector. This problem arises in the following way: we compute a descriptive statistic from a set of data, notice an interesting feature and wish to assign a confidence level to that feature. For example, we compute a density estimate and notice that the estimate is bimodal. What confidence can we assign to bimodality? A natural way to measure confidence is…
In this paper, we study the local behavior of regression splines. In particular, explicit expressions for the asymptotic pointwise bias and variance of regression splines are obtained. In addition, asymptotic normality for regression splines is established, leading to the construction of approximate confidence intervals and confidence bands for the regression function.
In this paper, the computation of the exact Fisher information matrix of a large class of Gaussian time series models is considered. This class, which is often called the single-input–single-output (SISO) model, includes dynamic regression with autocorrelated errors and the transfer function model, with autoregressive moving average errors. The method is based on a combination of two computational procedures: recursions for the covariance matrix of the derivatives of the…
Peter J. Bickel · Ya’acov Ritov · Tobias Rydén·刊期 1998-08-01 · 卷 26(4)·The Annals of Statistics已编入正刊
一般隐马尔可夫模型极大似然估计量的渐近正态性AI 解读
Hidden Markov models (HMMs) have during the last decade become a widespread tool for modeling sequences of dependent random variables. Inference for such models is usually based on the maximum-likelihood estimator (MLE), and consistency of the MLE for general HMMs was recently proved by Leroux. In this paper we show that under mild conditions the MLE is also asymptotically normal and prove that the observed information matrix is a consistent estimator of the Fisher…
We derive a strong approximation of a local polynomial estimator LPE in nonparametric autoregression by an (LPE) in a corresponding nonparametric regression model. This generally suggests the application of regression-typical tools for statistical inference in nonparametric autoregressive models. It provides an important simplification for the boot-strap method to be used: It is enough to mimic the structure of a nonparametric regression model rather than to imitate the more…
For the Fourier regression model, we determine optimal designs for identifying the order of periodicity. It is shown that the optimal design problem for trigonometric regression models is equivalent to the problem of optimal design for discriminating between certain homo-and heteroscedastic polynomial regression models. These optimization problems are then solved using the theory of canonical moments, and the optimal discriminating designs for the Fourier regression model…
A chain graph (CG) is a graph admitting both directed and undirected edges with (partially) directed cycles forbidden. It generalizes both the concept of undirected graph (UG) and the concept of directed acyclic graph (DAG). A chain graph can be used to describe efficiently the conditional independence structure of a multidimensional discrete probability distribution in the form of a graphoid, that is, in the form of a list of statements “$X$ is independent of $Y$ given $Z$”…
Let a linear regression be given. For detecting change-points, it is usual to consider the sequence of partial sums of least squares residuals whence a partial sums process is defined. Given a sequence of exact experimental designs, we consider for each design the corresponding partial sums process. If the sequence of designs converges to a continuous design, we derive the explicit form of the limit process of the corresponding sequence of partial sums processes. This is a…
We define the sharp change point problem as an extension of earlier problems in change point analysis related to nonparametric regression. As particular cases, these include estimation of jump points in smooth curves. More generally, we give a systematic treatment of the correct rate of convergence for estimating the position of a “cusp”of an arbitrary order. We propose a test function for the local regularity of a signal that characterizes such a point as a global maximum.…
We propose a method of adaptive estimation of a regression function which is near optimal in the classical sense of the mean integrated error. At the same time, the estimator is shown to be very sensitive to discontinuities or change-points of the underlying function $f$ or its derivatives. For instance, in the case of a jump of a regression function, beyond the intervals of length (in order) $n^{-1} \log n$ around change-points the quality of estimation is essentially the…
The longitudinal regression model $Y_{i,j} = m(V_\tau_{i,j}^i) + \varepsilon_{i,j}$ where $Y_{i,j}$, is the $j$th measurement of the $i$th subject at random time $\tau_{i,j}$, $m$ is the regression function, $V_\tau_{i, j}$ is a predictable covariate process observed at time $\tau_{i,j}$ and $\varepsilon_{i,j}$ is noise, often provides an adequate framework for modeling and comparing groups of data. The proposed longitudinal regression model is based on marked point process…
This paper concerns linear regression with interval censored data. $M$-estimators for the regression coefficients are derived. Asymptotic consistency and normality of the $M$-estimators are obtained via an exponential inequality for $U$-statistics. Asymptotically efficient estimators are provided under mild conditions.
The two-way analysis of variance with interactions is a well established and integral part of statistics. In spite of its long standing, it is shown that the standard definition of interactions is counterintuitive and obfuscates rather than clarifies. A different definition of interaction is given which among other advantages allows the detection of interactions even in the case of one observation per cell. A characterization of unconditionally identifiable interaction…
.Measures of association between two random variables (r.v.) that are symmetric nondecreasing functions of the canonical coefficients provided by the nonlinear canonical analysis of the r.v.’s are studied. These measures can be used to characterize independence. Their estimators are obtained by estimating a suitable approximation to nonlinear canonical analysis. When some conditions are satisfied, asymptotic distributions of the estimators, both under the independence…
We derive an approximation of a density estimator based on weakly dependent random vectors by a density estimator built from independent random vectors. We construct, on a sufficiently rich probability space, such a pairing of the random variables of both experiments that the set of observations $X_1,\ldots,X_n}$ from the time series model is nearly the same as the set of observations $Y_1,\ldots,Y_n}$ from the i.i.d. model. With a high probability, all sets of the form (X1,…,XnDeltaY1,…,Yn)⋂([a1,b1]×…×[ad,bd])…
Let yN(Bxi,Σ),i=1,2…,N, and yN(Bθ,Σ) be independent multivariate observations, where the xi's are known vectors, B,θ and Σ are unknown, Σ being a positive definite matrix. The calibration problem deals with statistical inference concerning θ and the problem that we have addressed is the construction of confidence regions. In this article, we have constructed a region for θ based on a…
Consider a counting process $N(t), t\inT}$ with compensator process A(t),t∈T, where A(t)=∫0tY(s)ds,Y(t),t∈T is an observable predictable process, and λ0()˙ is an unknown hazard rate function. A general procedure for extending Neyman’s smooth goodnessoffit test for the composite null hypothesis $H_0: \lambda_0(\dot)\inC ={\lambda_0(\dot;\eta):\eta\in\Gamma\subseteq\Re^q}$ is proposed and developed. The extension is obtained by embedding C…
The asymptotic risk of efficient estimators with Kullback–Leibler loss in smoothly parametrized statistical models is k/2n, where k is the parameter dimension and n is the sample size. Under fairly general conditions, we given a simple information-theoretic proof that the set of parameter values where any arbitrary estimator is superefficient is negligible. The proof is based on a result of Rissanen that codes have asymptotic redundancy not smaller than (k/2)logn,…
A general formula for computing the breakdown point in robustness for the tth bootstrap quantile of a statistic Tn is obtained. The answer depends on t and the breakdown point of Tn. Since the bootstrap quantiles are vital ingredients of bootstrap confidence intervals, the theory has implications pertaining to robustness of bootstrap confidence intervals. For certain L and M estimators, a robustification of bootstrap is suggested via the notion of Winsorization.
A chain graph (CG) is a graph admitting both directed and undirected edges with (partially) directed cycles forbidden. It generalizes both the concept of undirected graph (UG) and the concept of directed acyclic graph (DAG). A chain graph can be used to describe efficiently the conditional independence structure of a multidimensional discrete probability distribution in the form of a graphoid, that is, in the form of a list of statements “X is independent of Y given Z”…
We propose a method of adaptive estimation of a regression function which is near optimal in the classical sense of the mean integrated error. At the same time, the estimator is shown to be very sensitive to discontinuities or change-points of the underlying function f or its derivatives. For instance, in the case of a jump of a regression function, beyond the intervals of length (in order) n−1logn around change-points the quality of estimation is essentially the…
The longitudinal regression model $Y_{i,j} = m(V_\tau_{i,j}^i) + \varepsilon_{i,j}$ where Yi,j, is the jth measurement of the ith subject at random time τi,j, m is the regression function, $V_\tau_{i, j}$ is a predictable covariate process observed at time τi,j and εi,j is noise, often provides an adequate framework for modeling and comparing groups of data. The proposed longitudinal regression model is based on marked point process…
This paper concerns linear regression with interval censored data. M-estimators for the regression coefficients are derived. Asymptotic consistency and normality of the M-estimators are obtained via an exponential inequality for U-statistics. Asymptotically efficient estimators are provided under mild conditions.