Robust Linear Calibration

We regard the simple linear calibration problem where only the response y of the regression line y = β₀ + β₁ t is observed with errors. The experimental conditions t are observed without error. For the errors of the observations y we assume that there may be some gross errors providing outlying observations. This situation can be modeled by a conditionally contaminated regression model. In this model the classical calibration estimator based on the least squares estimator has an unbounded asymptotic bias. Therefore we introduce calibration estimators based on robust one-step-M-estimators which have a bounded asymptotic bias. For this class of estimators we discuss two problems: The optimal estimators and their corresponding optimal designs. We derive the locally optimal solutions and show that the maximin efficient designs for non-robust estimation and robust estimation coincide.     

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?.     

Optimal Designs for Approximating a Stochastic Process with Respect to a Minimax Criterion

We study the problem of approximating a stochastic process Y = {Y(t: t ∈ T} with known and continuous covariance function R on the basis of finitely many observations Y(t ₁,), …, Y(t _n ). Dependent on the knowledge about the mean function, we use different approximations ? and measure their performance by the corresponding maximum mean squared error sub _t∈T E(Y(t) ? ?(t))². For a compact T ? ? ^p we prove sufficient conditions for the existence of optimal designs. For the class of covariance functions on T ² = [0, 1]² which satisfy generalized Sacks/Ylvisaker regularity conditions of order zero or are of product type, we construct sequences of designs for which the proposed approximations perform asymptotically optimal.     

An iterative plug-in algorithm for decomposing seasonal time series using the Berlin Method

We propose a fast data-driven procedure for decomposing seasonal time series using the Berlin Method, the procedure used, e.g. by the German Federal Statistical Office in this context. The formula of the asymptotic optimal bandwidth h _A is obtained. Methods for estimating the unknowns in h _A are proposed. The algorithm is developed by adapting the well-known iterative plug-in idea to time series decomposition. Asymptotic behaviour of the proposal is investigated. Some computational aspects are discussed in detail. Data examples show that the proposal works very well in practice and that data-driven bandwidth selection offers new possibilities to improve the Berlin Method. Deep insights into the iterative plug-in rule are also provided.     

Multivariate orthogonal series estimates for random design regression

In this paper a new multivariate regression estimate is introduced. It is based on ideas derived in the context of wavelet estimates and is constructed by hard thresholding of estimates of coefficients of a series expansion of the regression function. Multivariate functions constructed analogously to the classical Haar wavelets are used for the series expansion. These functions are orthogonal in _L2(_μn)$L_2({\mu }_n)$, where _μn${\mu }_n$ denotes the empirical design measure. The construction can be considered as designing adapted Haar wavelets.     

Changepoint Problems Under Random Censorship

Let X ₁, …, X _[nθ], X _{[nθ] + 1}, …, X _n be a sequence of independent random variables (the “lifetimes”) such that X _j ? F ₁ for 1 ≤ j ≤ [nθ] and X _j ? F ₂ for [nθ] + 1 ≤ j ≤ n, with F ₁ ≠ F ₂ unknown. In this paper we investigate an estimator θ _n for the changepoint θ if the X's are subject to censoring. The rate of almost sure convergence of θ _n to θ is established and a test for the hypothesis θ = 0, i.e. “no change”, is proposed.     

Estimation of Ordered Location Parameters: The Exponential Distribution

The problem of component wise estimation of ordered location parameters θ ₁ (θ ₁ ≤ θ ₂) of two independent exponential distributions is investigated. The scale parameters are assumed to be unequal but known. Independent random samples of unequal sample sizes are drawn from two populations and the estimators admissible among the mixed estimators of θ ₁ and θ ₂ are obtained. It is shown that the minimum risk estimators (MREs) of θ ₁ and θ ₂ without assuming θ ₁ ≤ θ ₂ are inadmissible when one does assume that θ ₁ ≤ θ ₂. The efficiencies of mixed estimators relative to MREs (without assuming θ ₁ ≤ θ ₂) are tabulated for equal sample sizes and equal scale parameters.     

On hypothesis tests in misspecified change-point problems for a Poisson process

Consider an inhomogeneous Poisson process X on [0, T] whose unk-nown intensity function “switches” from a lower function g_* to an upper function h_* at some unknown point ?_* that has to be identified. We consider two known continuous functions g and h such that g_*(t) ? g(t) < h(t) ? h_*(t) for 0 ? t ? T. We describe the behavior of the generalized likelihood ratio and Wald’s tests constructed on the basis of a misspecified model in the asymptotics of large samples. The power functions are studied under local alternatives and compared numerically with help of simulations. We also show the following robustness result: the Type I error rate is preserved even though a misspecified model is used to construct tests.     

Second order asymptotic relations of M-estimators and R-estimators in two-sample location model

Let T_M be an M-estimator (maximum likelihood type estimator) and T_R be an R-estimator (Hodges-Lehmann's estimator) of the shift parameter Δ in the two-sample location model. The asymptotic representation of √N(T_M-T_R) up to a term of the order O_p(N^{-$\text{1}\text{4}$}) is derived which is valid if the functions Ψ and ? generating T_M and T_R, respectively, decompose into an absolutely continuous and a step-function components; the order O_p(N^{-$\text{1}\text{4}$}) cannot be improved unless the discontinuous components vanish. As a consequence, the conditions under which √N(T_M-T_R)=O_p(N^{-$\text{1}\text{4}$}) are obtained. The main tool for obtaining the results is the second order asymptotic linearity of the pertaining linear rank statistics which is proved here under the assumption that the score-generating function ? has some jump-discontinuities.     

Asymptotic power comparison of T2-type test and likelihood ratio test for a mean vector based on two-step monotone missing data

Abstract

In a 2-step monotone missing dataset drawn from a multivariate normal population, T²-type test statistic (similar to Hotelling’s T² test statistic) and likelihood ratio (LR) are often used for the test for a mean vector. In complete data, Hotelling’s T² test and LR test are equivalent, however T²-type test and LR test are not equivalent in the 2-step monotone missing dataset. Then we interest which statistic is reasonable with relation to power. In this paper, we derive asymptotic power function of both statistics under a local alternative and obtain an explicit form for difference in asymptotic power function. Furthermore, under several parameter settings, we compare LR and T²-type test numerically by using difference in empirical power and in asymptotic power function. Summarizing obtained results, we recommend applying LR test for testing a mean vector.     

Consistent and rate-optimal density estimation from heteroscedastic data groups

We consider the problem of estimating a density function based on aggregated data where the data group sizes may differ from each other. The reconstruction of the target density can be regarded as a nonlinear statistical inverse problem. We introduce some estimation procedures which are capable to use the observations from all groups by some nonstandard deconvolution techniques. General consistency and rate-optimality under common smoothness constraints are developed. We give some numerical simulations and a data-driven bandwidth selector.     

On the asymptotic behaviour of location-scale invariant Bickel–Rosenblatt tests

Location-scale invariant Bickel–Rosenblatt goodness-of-fit tests (IBR tests) are considered in this paper to test the hypothesis that f, the common density function of the observed independent d-dimensional random vectors, belongs to a null location-scale family of density functions. The asymptotic behaviour of the test procedures for fixed and non-fixed bandwidths is studied by using an unifying approach. We establish the limiting null distribution of the test statistics, the consistency of the associated tests and we derive its asymptotic power against sequences of local alternatives. These results show the asymptotic superiority, for fixed and local alternatives, of IBR tests with fixed bandwidth over IBR tests with non-fixed bandwidth.     

Optimal bandwidth matrices in functional principal component analysis of density functions

In order to explore and compare a finite number T of data sets by applying functional principal component analysis (FPCA) to the T associated probability density functions, we estimate these density functions by using the multivariate kernel method. The data set sizes being fixed, we study the behaviour of this FPCA under the assumption that all the bandwidth matrices used in the estimation of densities are proportional to a common parameter h and proportional to either the variance matrices or the identity matrix. In this context, we propose a selection criterion of the parameter h which depends only on the data and the FPCA method. Then, on simulated examples, we compare the quality of approximation of the FPCA when the bandwidth matrices are selected using either the previous criterion or two other classical bandwidth selection methods, that is, a plug-in or a cross-validation method.     

Regression models for functional data by reproducing kernel Hilbert spaces methods

Non-parametric regression models are developed when the predictor is a function-valued random variable X={_Xt}t∈T$X=\{X_t{\}}_{t\in T}$. Based on a representation of the regression function f(X)$f(X)$ in a reproducing kernel Hilbert space such models generalize the classical setting used in statistical learning theory. Two applications corresponding to scalar and categorical response random variable are performed on stock-exchange and medical data. The results of different regression models are compared.     

A formula for P(bi≤Ri≤ai, 1≤i≤m) under a general class of alternatives

Let X_i≤?≤X_m and Y_i≤?≤Y_n be two sets of independent order statistics from continous distributions with distribution functions F and G respectively. Let R_i denote the rank of X_i in the combined order sample. Steck (1980) has found an expression for P(b_i≤R_i≤a_i, all i) when F = h(G), h being the incomplete beta function with parameters (α,β?α+1). An alternative expression for the same probability is obtained which is computationally a substantial improvement on Steck's result.     

The uniform convergence of the nadaraya-watson regression function estimate

If (X₁,Y₁), …, (X_n,Y_n) is a sequence of independent identically distributed R_d × R-valued random vectors then Nadaraya (1964) and Watson (1964) proposed to estimate the regression function m(x) = ? {Y₁|X₁ = x{ by where K is a known density and {h_n} is a sequence of positive numbers satisfying certain properties. In this paper a variety of conditions are given for the strong convergence to 0 of ess_Xsup|m_n (X)-m(X)| (here X is independent of the data and distributed as X₁). The theorems are valid for all distributions of X₁ and for all sequences {h_n} satisfying h_n → 0 and nh/log n→0.     

Rate of strong uniform convergence of k-NN density estimates

Let f_n(x) be the univariate k-nearest neighbor (k-NN) density estimate proposed by Loftsgaarden and Quesenberry (1965). By using similar techniques as in Bahadur's representation of sample quantiles (1966), and by the recent results on the oscillation of empirical processes by Stute (1982), we derive the rate of strong uniform convergence of f_n(x) on some suitably chosen interval J_δ. Some comparison with the kernel estimates is given, as well as the choice of the bandwidth sequence relative to the sample size.     

Interpreting the Principal Component Analysis of Multivariate Density Functions

Functional principal component analysis (FPCA) as a reduction data technique of a finite number T of functions can be used to identify the dominant modes of variation of numeric three-way data.

We carry out the FPCA on multidimensional probability density functions, relate this method to other standard methods and define its centered or standardized versions. Grounded on the relationship between FPCA of densities, FPCA of their corresponding characteristic functions, PCA of the MacLaurin expansions of these characteristic functions and dual STATIS method applied to their variance matrices, we propose a method for interpreting the results of the FPCA of densities. This method is based on the investigations of the relationships between the scores of the FPCA and the moments associated to the densities.

The method is illustrated using known Gaussian densities. In practice, FPCA of densities deals with observations of multidimensional variables on T occasions. These observations can be used to estimate the T associated densities (i) by estimating the parameters of these densities, assuming that they are Gaussian, or (ii) by using the Gaussian kernel method and choosing the matrix bandwidth by the normal reference rule. Thereafter, FPCA estimate is derived from these estimates and the interpretation method is carried out to explore the dominant modes of variation of the types of three-way data encountered in sensory analysis and archaeology.     

La méthode de vraisemblance pour les processus linéaires spatiaux définis sur un treillis triangulaire

Spatial linear processes {X_s, s ? T} where T is a triangular lattice in R² are considered. Special attention is given to the class of spatial moving-average processes. Precisely, for each site s T, the variable X_s is defined as a linear combination of real-valued random shocks located at the vertices of regular concentric hexagons centered at s. For Gaussian random shocks, the process is also Gaussian, and estimates of its parameters are obtained by maximizing the exact likelihood. For non-Gaussian random shocks, the exact likelihood is difficult to obtain; however, the Gaussian likelihood is still used giving the pseudo-Gaussian likelihood estimates. The behaviour of these estimates is analyzed through the study of asymptotic properties and some simulation experiments based on an isotropic model defined with one coefficient.