A note on asymptotic parametric prediction

This paper is devoted to asymptotic behaviour of plug-in statistical predictors obtained by replacing the unknown parameter in a conditional expectation by a suitable estimator. We derive the L²$L^2$-convergence rate and limit in distribution for the predictors. Applications to ARMA processes and diffusion processes are considered.     

A generalized drop-the-loser rule for multi-treatment clinical trials

Urn models are popular for response adaptive designs in clinical studies. Among different urn models, Ivanova's drop-the-loser rule is capable of producing superior adaptive treatment allocation schemes. Ivanova [2003. A play-the-winner-type urn model with reduced variability. Metrika 58, 1–13] obtained the asymptotic normality only for two treatments. Recently, Zhang et al. [2007. Generalized drop-the-loser urn for clinical trials with delayed responses. Statist. Sinica, in press] extended the drop-the-loser rule to tackle more general circumstances. However, their discussion is also limited to only two treatments. In this paper, the drop-the-loser rule is generalized to multi-treatment clinical trials, and delayed responses are allowed. Moreover, the rule can be used to target any desired pre-specified allocation proportion. Asymptotic properties, including strong consistency and asymptotic normality, are also established for general multi-treatment cases.     

General linear processes in Hilbert spaces and prediction

We discuss a general definition of linear processes in Hilbert spaces that takes into account the outstanding role played by this model in prediction theory.     

Testing for changes in the covariance structure of linear processes

We consider several procedures to detect changes in the mean or the covariance structure of a linear process. The tests are based on the weighted CUSUM process. The limit distributions of the test statistics are derived under the no change null hypothesis. We develop new strong and weak approximations for the sample mean as well as the sample correlations of linear processes. A small Monte Carlo simulation illustrates the applicability of our results.     

On the detection of changes in autoregressive time series,II. Resampling procedures

We study an autoregressive time series model with a possible change in the regression parameters. Approximations to the critical values for change-point tests are obtained through various bootstrapping methods. Theoretical results show that the bootstrapping procedures have the same limiting behavior as their asymptotic counterparts discussed in Hušková et al. [2007. On the detection of changes in autoregressive time series, I. Asymptotics. J. Statist. Plann. Inference 137, 1243–1259]. In fact, a small simulation study illustrates that the bootstrap tests behave better than the original asymptotic tests if performance is measured by the α$\alpha$- and β$\beta$-errors, respectively.     

A probablistic analysis for an optimal screening problem

Summary We consider a lotL formed byN apparently similar unitsW ₁,…,W _N, where each of theW _i may come from one of two different populationsP ₁ andP ₂;T ₁,…,T _N denote the corresponding lifetimes. The units fromP _i undergo a failure of kindi and their survival function isS _i (t). We assume that the failure rate function are known and that the units fromP ₁ are ?substandard?: λ ₁ (t)≥λ ₂ (t), ∀t≥0. We want to putW ₁,…,W _N under a pre-operational test (burn-in test) in order to eliminate at least a great part of the substandard units and we face the problem of obtaining a rule for stopping the test under the assumption that, with the failure of a unit, it is possible to recognize the population from which the unit comes. Such a problem will be formalized as an optimal stopping problem for a suitably defined Markov process. Our study shall evidentiate some fundamental aspects of the problem and the role of the prior distribution of the (random) numberM ₀ of those units inL coming fromP ₁ (substandard). The latter distribution has a great influence on the form of the solution. This research was supported by the C.N.R. Project ?Statistica Bayesiana e Simulazione in Affidalità e Modellistica Biologica?.     

On change point test for ARMA–GARCH models: Bootstrap approach

The problem of testing for a parameter change has been a core issue in time series analysis. It is well known that the estimates-based CUSUM test often suffers from severe size distortions in general GARCH type models. The residual-based CUSUM test has been used as an alternative, which, however, has a defect not to detect the ARMA parameter changes in ARMA–GARCH models. As a remedy, one can employ the score vector-based CUSUM test in ARMA–GARCH models as in Oh and Lee (0000). However, it shows some size distortions for relatively small samples. Hence, we consider the bootstrap counterpart for obtaining a more stable test. Focus is made on the verification of the weak consistency of the proposed test. An empirical study is illustrated for its evaluation.     

Stationary mixture transition distribution (MTD) models via predictive distributions

This paper combines two ideas to construct autoregressive processes of arbitrary order. The first idea is the construction of first order stationary processes described in Pitt et al. [(2002). Constructing first order autoregressive models via latent processes. Scand. J. Statist.29, 657–663] and the second idea is the construction of higher order processes described in Raftery [(1985). A model for high order Markov chains. J. Roy. Statist. Soc. B.47, 528–539]. The resulting models provide appealing alternatives to model non-linear and non-Gaussian time series.     

On the detection of changes in autoregressive time series I. Asymptotics

Various test statistics are discussed which can be used for detecting changes in the parameters of an autoregressive time series. In this first part of our study, the limiting behavior of the test statistics is derived under the null hypothesis of no change as well as under alternatives. In a forthcoming second part of our investigation, these asymptotic results will be compared to some corresponding bootstrap procedures, and a small simulation study will be conducted.     

Ordering conditional lifetimes of coherent systems

Consider a system of n components that has the property that there exists a number r  (r<n)$(r<n)$, such that if it is known that at most r components have failed, the system is still functioning with probability 1. Suppose that such a system is equipped with a warning light that comes up at the time of the failure of the rth component. The system is still working then, and we are interested in its residual life. In this paper we obtain some results which stochastically compare the residual lives of such systems with the same type, or with different types, of components. Some applications are given. In particular, we derive upper and lower bounds on the expected residual lives of such systems given that the warning light has not come up yet, and given that the component hazard rate functions are bounded from below or from above by a known constant.     

The tube method for the moment index in projection pursuit

The projection pursuit index defined by a sum of squares of the third and the fourth sample cumulants is known as the moment index proposed by Jones and Sibson [1987. What is projection pursuit? J. Roy. Statist. Soc. Ser. A 150, 1–36]. The limiting distribution of the maximum of the moment index under the null hypothesis that the population is multivariate normal is shown to be the maximum of a Gaussian random field with a finite Karhunen–Loève expansion. An approximate formula for tail probability of the maximum, which corresponds to the p-value, is given by virtue of the tube method through determining Weyl's invariants of all degrees and the critical radius of the index manifold of the Gaussian random field.     

Nonparametric methods in multivariate factorial designs for large number of factor levels

We propose different multivariate nonparametric tests for factorial designs and derive their asymptotic distribution for the situation where the number of replications is limited, whereas the number of treatments goes to infinity (large a, small n case). The tests are based on separate rankings for the different variables, and they are therefore invariant under separate monotone transformations of the individual variables.     

Long run variance estimation and robust regression testing using sharp origin kernels with no truncation

A new family of kernels is suggested for use in long run variance (LRV) estimation and robust regression testing. The kernels are constructed by taking powers of the Bartlett kernel and are intended to be used with no truncation (or bandwidth) parameter. As the power parameter (ρ)$(\rho )$ increases, the kernels become very sharp at the origin and increasingly downweight values away from the origin, thereby achieving effects similar to a bandwidth parameter. Sharp origin kernels can be used in regression testing in much the same way as conventional kernels with no truncation, as suggested in the work of Kiefer and Vogelsang [2002a, Heteroskedasticity-autocorrelation robust testing using bandwidth equal to sample size. Econometric Theory 18, 1350–1366, 2002b, Heteroskedasticity-autocorrelation robust standard errors using the Bartlett kernel without truncation, Econometrica 70, 2093–2095] Analysis and simulations indicate that sharp origin kernels lead to tests with improved size properties relative to conventional tests and better power properties than other tests using Bartlett and other conventional kernels without truncation.     

Nonparametric estimation of conditional expectation

Denote the integer lattice points in the N  -dimensional Euclidean space by Z^N${\mathbb{Z}}^N$ and assume that (_Xi,_Yi)$(X_{\mathbf{i}},Y_{\mathbf{i}})$, i∈Z^N$\mathbf{i}\in {\mathbb{Z}}^N$ is a mixing random field. Estimators of the conditional expectation r(x)=E[_Yi|_Xi=x]$r(\mathbf{x})=\mathrm{E}[Y_{\mathbf{i}}|X_{\mathbf{i}}=\mathbf{x}]$ by nearest neighbor methods are established and investigated. The main analytical result of this study is that, under general mixing assumptions, the estimators considered are asymptotically normal. Many difficulties arise since points in higher dimensional space N?2$N?2$ cannot be linearly ordered. Our result applies to many situations where parametric methods cannot be adopted with confidence.     

The “Caterpillar”-SSA method for analysis of time series with missing values

The paper concerns the problem of applying singular spectrum analysis to time series with missing data. A method of filling in the missing data is proposed and is applied to time series of finite rank. Conditions of exact reconstruction of missing data are developed and versions of the algorithm applicable to real-life time series are presented. The proposed algorithms result in the extraction of additive components of time series such as trends and periodic components, with simultaneous filling in of the missing data. An example is presented.     

An asymptotically distribution-free test of symmetry

A procedure, based on sample spacings, is proposed for testing whether a univariate distribution is symmetric about some unknown value. The proposed test is a modification of a sign test suggested by Antille and Kersting [1977. Tests for symmetry. Z. Wahrscheinlichkeitstheorie verw. Gebiete 39, 235–255], but unlike Antille and Kersting's test, our modified test is asymptotically distribution-free and is usable in practice. A simulation study indicates that the proposed test maintains the nominal level of significance, α$\alpha$ fairly accurately even for samples of size as small as 20, and a comparison with the classical test based on sample coefficient of skewness, shows that our test has good power for detecting different asymmetric distributions.     

Efficiency of weighted averages

When combining estimates of a common parameter (of dimension d?1$d?1$) from independent data sets—as in stratified analyses and meta analyses—a weighted average, with weights ‘proportional’ to inverse variance matrices, is shown to have a minimal variance matrix (a standard fact when d=1$d=1$)—minimal in the sense that all convex combinations of the coordinates of the combined estimate have minimal variances. Minimum variance for the estimation of a single coordinate of the parameter can therefore be achieved by joint estimation of all coordinates using matrix weights. Moreover, if each estimate is asymptotically efficient within its own data set, then this optimally weighted average, with consistently estimated weights, is shown to be asymptotically efficient in the combined data set and avoids the need to merge the data sets and estimate the parameter in question afresh. This is so whatever additional non-common nuisance parameters may be in the models for the various data sets. A special case of this appeared in Fisher [1925. Theory of statistical estimation. Proc. Cambridge Philos. Soc. 22, 700–725.]: Optimal weights are ‘proportional’ to information matrices, and he argued that sample information should be used as weights rather than expected information, to maintain second-order efficiency of maximum likelihood. A number of special cases have appeared in the literature; we review several of them and give additional special cases, including stratified regression analysis—proportional-hazards, logistic or linear—, combination of independent ROC curves, and meta analysis. A test for homogeneity of the parameter across the data sets is also given.