Adaptive wavelet estimation of a function in an indirect regression model

We consider a nonparametric regression model where m noise-perturbed functions f ₁,…,f _m are randomly observed. For a fixed ν∈{1,…,m}, we want to estimate f _ν from the observations. To reach this goal, we develop an adaptive wavelet estimator based on a hard thresholding rule. Adopting the mean integrated squared error over Besov balls, we prove that it attains a sharp rate of convergence. Simulation results are reported to support our theoretical findings.     

Bayesian and Robust Bayesian analysis under a general class of balanced loss functions

For estimating an unknown parameter θ, we introduce and motivate the use of balanced loss functions of the form L_{r, w, d0}(q, d)=wr(d₀, d)+ (1-w) r(q, d){L_{\rho, \omega, \delta_0}(\theta, \delta)=\omega \rho(\delta_0, \delta)+ (1-\omega) \rho(\theta, \delta)}, as well as the weighted version q(q) L_{r, w, d0}(q, d){q(\theta) L_{\rho, \omega, \delta_0}(\theta, \delta)}, where ρ(θ, δ) is an arbitrary loss function, δ ₀ is a chosen a priori “target” estimator of q, w ? [0,1){\theta, \omega \in[0,1)}, and q(·) is a positive weight function. we develop Bayesian estimators under L_{r, w, d0}{L_{\rho, \omega, \delta_0}} with ω > 0 by relating such estimators to Bayesian solutions under L_{r, w, d0}{L_{\rho, \omega, \delta_0}} with ω = 0. Illustrations are given for various choices of ρ, such as absolute value, entropy, linex, and squared error type losses. Finally, under various robust Bayesian analysis criteria including posterior regret gamma-minimaxity, conditional gamma-minimaxity, and most stable, we establish explicit connections between optimal actions derived under balanced and unbalanced losses.     

Some Properties of Order Statistics When the Sample Size Is Random

ABSTRACT

The study of r-out-of-n systems is of utmost importance in reliability theory. In this note, we study closure of different partial orders under the formation of r-out-of-N and (N ? s)-out-of-N systems when the number of components N, forming the system, is a random variable having support {k, k + 1,…}, where k is a fixed positive integer, r ∈ {1,…, k} and s ∈ {0, 1,…, k ? 1}. This generalizes quite a few results already known in the literature. We also study the closure of different partial orders when two systems are formed out of different random number of components.     

Estimation of system reliability

In this paper, we estimate the reliability of a system with k components. The system functions when at least s (1≤s≤k) components survive a common random stress. We assume that the strengths of these k components are subjected to a common stress which is independent of the strengths of these k components. If (X ₁,X ₂,…,X _k ) are strengths of k components subjected to a common stress (Y), then the reliability of the system or system reliability is given byR=P[Y<X _(k−s+1)] whereX _(k−s+1) is (k−s+1)-th order statistic of (X ₁,…,X _k ). We estimate R when (X ₁,…,X _k ) follow an absolutely continuous multivariate exponential (ACMVE) distribution of Hanagal (1993) which is the submodel of Block (1975) and Y follows an independent exponential distribution. We also obtain the asymptotic normal (AN) distribution of the proposed estimator.     

Bounds for Expectations of Differences of Generalized Order Statistics Based on General and Life Distributions

Let X _? ^(r), r ≥ 1, denote generalized order statistics based on an arbitrary distribution function F with finite pth absolute moment for some 1 ≤ p ≤ ∞. We present sharp upper bounds on E(X _? ^(s) ? X _? ^(r)), 1 ≤ r < s, for F being either general or life distribution. The bounds are expressed in various scale units generated by pth central absolute or raw moments of F, respectively. The distributions achieving the bounds are specified.     

Distributions of patterns of two successes separated by a string of <Emphasis Type="Italic">k</Emphasis>-2 failures

Let Z ₁, Z ₂, . . . be a sequence of independent Bernoulli trials with constant success and failure probabilities p = Pr(Z _t  = 1) and q = Pr(Z _t  = 0) = 1 − p, respectively, t = 1, 2, . . . . For any given integer k ≥ 2 we consider the patterns E₁{\mathcal{E}_{1}}: two successes are separated by at most k−2 failures, E₂{\mathcal{E}_{2}}: two successes are separated by exactly k −2 failures, and E₃{\mathcal{E}_{3}} : two successes are separated by at least k − 2 failures. Denote by N_n,k⁽ⁱ⁾{ N_{n,k}^{(i)}} (respectively M_n,k⁽ⁱ⁾{M_{n,k}^{(i)}}) the number of occurrences of the pattern E_i{\mathcal{E}_{i}} , i = 1, 2, 3, in Z ₁, Z ₂, . . . , Z _n when the non-overlapping (respectively overlapping) counting scheme for runs and patterns is employed. Also, let T_r,k⁽ⁱ⁾{T_{r,k}^{(i)}} (resp. W_r,k⁽ⁱ⁾){W_{r,k}^{(i)})} be the waiting time for the r − th occurrence of the pattern E_i{\mathcal{E}_{i}}, i = 1, 2, 3, in Z ₁, Z ₂, . . . according to the non-overlapping (resp. overlapping) counting scheme. In this article we conduct a systematic study of N_n,k⁽ⁱ⁾{N_{n,k}^{(i)}}, M_n,k⁽ⁱ⁾{M_{n,k}^{(i)}}, T_r,k⁽ⁱ⁾{T_{r,k}^{(i)}} and W_r,k⁽ⁱ⁾{W_{r,k}^{(i)}} (i = 1, 2, 3) obtaining exact formulae, explicit or recursive, for their probability generating functions, probability mass functions and moments. An application is given.     

Efficient estimates in linear and nonlinear regression with heteroscedastic errors

In this paper we consider the heteroscedastic regression model defined by the structural relation Y = r(V, β) + s(W)ε, where V is a p-dimensional random vector, W is a q-dimensional random vector, β is an unknown vector in some open subset B of R^m, r is a known function from R^p × B into R, s is an unknown function on R^q, and ε is an unobservable random variable that is independent of the pair (V, W). We construct asymptotically efficient estimates of the regression parameter β under mild assumptions on the functions r and s and on the distributions of ε and (V, W).     

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

Exchangeability,predictive sufficiency and Bayesian bootstrap

Summary Let {X _n } be a sequence of random variables conditionally independent and identically distributed given the random variable Θ. The aim of this paper is to show that in many interesting situations the conditional distribution of Θ, given (X ₁,…,X _n ), can be approximated by means of the bootstrap procedure proposed by Efron and applied to a statisticT _n (X ₁,…,X _n ) sufficient for predictive purposes. It will also be shown that, from the predictive point of view, this is consistent with the results obtained following a common Bayesian approach.     

Csiszar’s ϕ-divergences for testing the order in a Markov chain

x ₁, ..., x _n+r can be treated as the sample values of a Markov chain of order r or less (chain in which the dependence extends over r+1 consecutive variables only), and consider the problem of testing the hypothesis H ₀ that a chain of order r− 1 will be sufficient on the basis of the tools given by the Statistical Information Theory: _ϕ-Divergences. More precisely, if p _{a 1 ....., a r}: _{a r +1} denotes the transition probability for a r ^th order Markov chain, the hypothesis to be tested is H ₀:p _{a 1 ....., a r}: _{a r +1} = p _{a 2 ....., a r}: _{a r +1}, a _i ∈{1, ..., s}, i = 1, ..., r + 1 The tests given in this paper, for the first time, will have as a particular case the likelihood ratio test and the test based on the chi-squared statistic. Received: August 3, 1998; revised version: November 25, 1999     

A discrete distribution associated with a pure birth process

A discrete distribution associated with a pure birth process starting with no individuals, with birth rates λ ⁿ =λ forn=0, 2, …,m−1 and λ ⁿ forn≥m is considered in this paper. The probability mass function is expressed in terms of an integral that is very convenient for computing probabilities, moments, generating functions and others. Using this representation, the mean and the k-th factorial moments of the distribution are obtained. Some nice characterizations of this distribution are also given.     

A Condition to Obtain the Same Decision in the Homogeneity Testing Problem from the Frequentist and Bayesian Point of View

We develop a Bayesian procedure for the homogeneity testing problem of r populations using r × s contingency tables. The posterior probability of the homogeneity null hypothesis is calculated using a mixed prior distribution. The methodology consists of choosing an appropriate value of π₀ for the mass assigned to the null and spreading the remainder, 1 ? π₀, over the alternative according to a density function. With this method, a theorem which shows when the same conclusion is reached from both frequentist and Bayesian points of view is obtained. A sufficient condition under which the p-value is less than a value α and the posterior probability is also less than 0.5 is provided.     

Comparison of PLS algorithms when number of objects is much larger than number of variables

NIPALS and SIMPLS algorithms are the most commonly used algorithms for partial least squares analysis. When the number of objects, N, is much larger than the number of explanatory, K, and/or response variables, M, the NIPALS algorithm can be time consuming. Even though the SIMPLS is not as time consuming as the NIPALS and can be preferred over the NIPALS, there are kernel algorithms developed especially for the cases where N is much larger than number of variables. In this study, the NIPALS, SIMPLS and some kernel algorithms have been used to built partial least squares regression model. Their performances have been compared in terms of the total CPU time spent for the calculations of latent variables, leave-one-out cross validation and bootstrap methods. According to the numerical results, one of the kernel algorithms suggested by Dayal and MacGregor (J Chemom 11:73–85, 1997) is the fastest algorithm.     

Superiority of the r–k Class Estimator Over Some Estimators In A Linear Model

In regression analysis, to overcome the problem of multicollinearity, the r ? k class estimator is proposed as an alternative to the ordinary least squares estimator which is a general estimator including the ordinary ridge regression estimator, the principal components regression estimator and the ordinary least squares estimator. In this article, we derive the necessary and sufficient conditions for the superiority of the r ? k class estimator over each of these estimators under the Mahalanobis loss function by the average loss criterion. Then, we compare these estimators with each other using the same criterion. Also, we suggest to test to verify if these conditions are indeed satisfied. Finally, a numerical example and a Monte Carlo simulation are done to illustrate the theoretical results.     

Linear Combinations,Products and Ratios of Simplicial or Spherical Variates

The density level sets of the two types of measures under consideration are l _{2, p} -circles with p = 1 and p = 2, respectively. The intersection-percentage function (ipf) of such a measure reflects the percentages which the level set corresponding to the p-radius r shares for each r > 0 with a set to be measured. The geometric measure representation formulae in Richter (2009 Richter , W.-D. (2009). Continuous l _{n, p} -symmetric distributions. Lithuanian Mathemat. J. 49:93–108.[Crossref], [Web of Science ®] , [Google Scholar]) is based upon these ipf's and will be used here for evaluating exact cdf's and pdf's for the linear combination, the product, and the ratio of the components of two-dimensional simplicial or spherically distributed random vectors.     

The number of records within a random interval of the current record value

LetX ₁,X ₂, … be a sequence of i.i.d. random variables with some continuous distribution functionF. LetX(n) be then-th record value associated with this sequence and μ _n ⁻ , μ _n ⁺ be the variables that count the number of record values belonging to the random intervals(f−(X(n)), X(n)), (X(n), f+(X(n))), wheref−, f+ are two continuous functions satisfyingf−(x)<x, f+(x)>x. Properties of μ _n ⁻ , μ _n ⁺ are studied in the present paper. Some statistical applications connected with these variables are also provided.     

Sequential experimental design and response optimisation

We consider the situation where one wants to maximise a functionf(θ,x) with respect tox, with θ unknown and estimated from observationsy _k . This may correspond to the case of a regression model, where one observesy _k =f(θ,x _k )+ε _k , with ε _k some random error, or to the Bernoulli case wherey _k ∈{0, 1}, with Pr[y _k =1|θ,x _k |=f(θ,x _k ). Special attention is given to sequences given by , with an estimated value of θ obtained from (x₁, y₁),...,(x _k ,y _k ) andd _k (x) a penalty for poor estimation. Approximately optimal rules are suggested in the linear regression case with a finite horizon, where one wants to maximize ∑ _i=1 ^N w _i f(θ, x _i ) with {w _i } a weighting sequence. Various examples are presented, with a comparison with a Polya urn design and an up-and-down method for a binary response problem.     

Strong consistency of least squares estimates with i.i.d. errors with mean values not necessarily defined

We establish strong consistency of the least squares estimates in multiple regression models discarding the usual assumption of the errors having null mean value. Thus, we required them to be i.i.d. with absolute moment of order r, 0<r<2, and null mean value when r>1. Only moderately restrictive conditions are imposed on the model matrix. In our treatment, we use an extension of the Marcinkiewicz–Zygmund strong law to overcome the errors mean value not being defined. In this way, we get a unified treatment for the case of i.i.d. errors extending the results of some previous papers.