Antieigenvalues provide a bound on realized signal to noise ratio

We provide a lower bound on realized signal to noise ratio in terms of generalized antieigenvalue. This result shows that there exists a minimum for the loss in discrimination efficiency when an estimate of the covariance matrix is used.     

Decision-theoretic estimation of generalized variance and generalized precision

Consider a random data matrix X=(X₁,...,X_k):pXk with independent columns [sathik] and an independent p X p Wishart matrix [sathik]. Estimators dominating the best affine equivariant estimators of [sathik] are obtained under four types of loss functions. Improved estimators (Testimators) of generalized variance and generalized precision are also considered under convex entropy loss (CEL).     

Robust estimation of a high-dimensional integrated covariance matrix

In this article, we consider a robust method of estimating a realized covariance matrix calculated as the sum of cross products of intraday high-frequency returns. According to recent articles in financial econometrics, the realized covariance matrix is essentially contaminated with market microstructure noise. Although techniques for removing noise from the matrix have been studied since the early 2000s, they have primarily investigated a low-dimensional covariance matrix with statistically significant sample sizes. We focus on noise-robust covariance estimation under converse circumstances, that is, a high-dimensional covariance matrix possibly with a small sample size. For the estimation, we utilize a statistical hypothesis test based on the characteristic that the largest eigenvalue of the covariance matrix asymptotically follows a Tracy–Widom distribution. The null hypothesis assumes that log returns are not pure noises. If a sample eigenvalue is larger than the relevant critical value, then we fail to reject the null hypothesis. The simulation results show that the estimator studied here performs better than others as measured by mean squared error. The empirical analysis shows that our proposed estimator can be adopted to forecast future covariance matrices using real data.     

Flat-Top Realized Kernel Estimation of Quadratic Covariation With Nonsynchronous and Noisy Asset Prices

This article develops a general multivariate additive noise model for synchronized asset prices and provides a multivariate extension of the generalized flat-top realized kernel estimators, analyzed earlier by Varneskov (2014), to estimate its quadratic covariation. The additive noise model allows for α-mixing dependent exogenous noise, random sampling, and an endogenous noise component that encompasses synchronization errors, lead-lag relations, and diurnal heteroscedasticity. The various components may exhibit polynomially decaying autocovariances. In this setting, the class of estimators considered is consistent, asymptotically unbiased, and mixed Gaussian at the optimal rate of convergence, n^1/4. A simple finite sample correction based on projections of symmetric matrices ensures positive definiteness without altering the asymptotic properties of the estimators. It, thereby, guarantees the existence of nonlinear transformations of the estimated covariance matrix such as correlations and realized betas, which inherit the asymptotic properties from the flat-top realized kernel estimators. An empirically motivated simulation study assesses the choice of sampling scheme and projection rule, and it shows that flat-top realized kernels have a desirable combination of robustness and efficiency relative to competing estimators. Last, an empirical analysis of signal detection and out-of-sample predictions for a portfolio of six stocks of varying size and liquidity illustrates the use and properties of the new estimators.     

Improved minimax estimation of a normal precision matrix

Let S_{p × p} have a Wishart distribution with parameter matrix Σ and n degrees of freedom. We consider here the problem of estimating the precision matrix Σ^?1 under the loss functions L₁(σ) tr (σ) - log |σ| and L₂(σ) = tr (σ). James-Stein-type estimators have been derived for an arbitrary p. We also obtain an orthogonal invariant and a diagonal invariant minimax estimator under both loss functions. A Monte-Carlo simulation study indicates that the risk improvement of the orthogonal invariant estimators over the James-Stein type estimators, the Haff (1979) estimator, and the “testimator” given by Sinha and Ghosh (1987) is substantial.     

Central limit theorems for functionals of large sample covariance matrix and mean vector in matrix‐variate location mixture of normal distributions

In this paper, we consider the asymptotic distributions of functionals of the sample covariance matrix and the sample mean vector obtained under the assumption that the matrix of observations has a matrix‐variate location mixture of normal distributions. The central limit theorem is derived for the product of the sample covariance matrix and the sample mean vector. Moreover, we consider the product of the inverse sample covariance matrix and the mean vector for which the central limit theorem is established as well. All results are obtained under the large‐dimensional asymptotic regime, where the dimension p and the sample size n approach infinity such that p/n→c ∈ [0, + ∞) when the sample covariance matrix does not need to be invertible and p/n→c ∈ [0,1) otherwise.     

On estimation of the scale matrix of the multivariate f distribution

Let F _p×phave a multivariate F distribution with a scale p×p matrix Δ and degrees of freedom k₁ and k₂ such that k_i - p - 1 > 0, i = 1,2. The estimation of Δ under entropy and squared error loss functions are considered. In both cases a new class of orthogonally invariant estimators are obtained which dominate the best unbiased estimator.     

Influence Functions for the Coefficient of Variation,Its Inverse,and CV Comparisons

Expressions are found for the influence function of the coefficient of variation, CV, and its reciprocal, the signal to noise ratio. These functions are free of units, which permits the comparison of the values of the CVs of continuous positive distributions to a perturbation by a small amount of probability at x. For a CV ≤0.5, the influence function response will be negative, of modest size, for values of x near E(X). For such values of a CV and of x, the influence function for 1/CV will be positive and its values will be substantial. These results imply similar behavior by the sample coefficient of variation or its reciprocal, which is supported by simulation studies in the literature. Values of the CV ≥1 are associated with large negative responses of their influence functions. The distributions producing such responses often have densities that decrease from positive infinite to zero on the positive axis with a long tail to the right. An influence function for the difference of two coefficients of variation is also obtained.     

Difference-based Methods for Truncating the Singular Value Decomposition

Given a noisy time series (or signal), one may wish to remove the noise from the observed series. Assuming that the noise-free series lies in some low-dimensional subspace of rank r, a common approach is to embed the noisy time series into a Hankel trajectory matrix. The singular value decomposition is then used to deconstruct the Hankel matrix into a sum of rank-one components. We wish to demonstrate that there may be some potential in using difference-based methods of the observed series in order to provide guidance regarding the separation of the noise from the signal, and to estimate the rank of the low-dimensional subspace in which the true signal is assumed to lie.     

Parameter expansion for sampling a correlation matrix: an efficient GPX-RPMH algorithm

Sampling the correlation matrix (R) plays an important role in statistical inference for correlated models. There are two main constraints on a correlation matrix: positive definiteness and fixed diagonal elements. These constraints make sampling R difficult. In this paper, an efficient generalized parameter expanded re-parametrization and Metropolis-Hastings (GPX-RPMH) algorithm for sampling a correlation matrix is proposed. Drawing all components of R simultaneously from its full conditional distribution is realized by first drawing a covariance matrix from the derived parameter expanded candidate density (PXCD), and then translating it back to a correlation matrix and accepting it according to a Metropolis-Hastings (M-H) acceptance rate. The mixing rate in the M-H step can be adjusted through a class of tuning parameters embedded in the generalized candidate prior (GCP), which is chosen for R to derive the PXCD. This algorithm is illustrated using multivariate regression (MVR) models and a simulation study shows that the performance of the GPX-RPMH algorithm is more efficient than that of other methods.     

Zonal Polynomials and Hypergeometric Functions of Quaternion Matrix Argument

We define zonal polynomials of quaternion matrix argument and deduce some impor-tant formulae of zonal polynomials and hypergeometric functions of quaternion matrix argument. As an application, we give the distributions of the largest and smallest eigenvalues of a quaternion central Wishart matrix W ～ ?W(n, Σ), respectively.     

Adaptive shrinkage of singular values

To recover a low-rank structure from a noisy matrix, truncated singular value decomposition has been extensively used and studied. Recent studies suggested that the signal can be better estimated by shrinking the singular values as well. We pursue this line of research and propose a new estimator offering a continuum of thresholding and shrinking functions. To avoid an unstable and costly cross-validation search, we propose new rules to select two thresholding and shrinking parameters from the data. In particular we propose a generalized Stein unbiased risk estimation criterion that does not require knowledge of the variance of the noise and that is computationally fast. A Monte Carlo simulation reveals that our estimator outperforms the tested methods in terms of mean squared error on both low-rank and general signal matrices across different signal-to-noise ratio regimes. In addition, it accurately estimates the rank of the signal when it is detectable.     

JAMES-STEIN RULE ESTIMATORS IN LINEAR REGRESSION MODELS WITH MULTIVARIATE-t DISTRIBUTED ERROR

This paper considers estimation of β in the regression model y =Xβ+μ, where the error components in μ have the jointly multivariate Student-t distribution. A family of James-Stein type estimators (characterised by nonstochastic scalars) is presented. Sufficient conditions involving only X are given, under which these estimators are better (with respect to the risk under a general quadratic loss function) than the usual minimum variance unbiased estimator (MVUE) of β. Approximate expressions for the bias, the risk, the mean square error matrix and the variance-covariance matrix for the estimators in this family are obtained. A necessary and sufficient condition for the dominance of this family over MVUE is also given.     

Admissibilities of matrix linear estimators multivariate linear models

This article respectively provides sufficient conditions and necessary conditions of matrix linear estimators of an estimable parameter matrix linear function in multivariate linear models with and without the assumption that the underlying distribution is a normal one with completely unknown covariance matrix. In the latter model, a necessary and sufficient condition is given for matrix linear estimators to be admissible in the space of all matrix linear estimators under each of three different kinds of quadratic matrix loss functions, respectively. In the former model, a sufficient condition is first provided for matrix linear estimators to be admissible in the space of all matrix estimators having finite risks under each of the same loss functions, respectively. Furthermore in the former model, one of these sufficient conditions, correspondingly under one of the loss functions, is also proved to be necessary, if additional conditions are assumed.     

Bayesian estimation of mean and square of mean of normal distribution using linex loss function

In this paper, the Bayes estimators for mean and square of mean ol a normal distribution with mean μ and vaiiance σ r2 (known), relative to LINEX loss function are obtained Comparisons in terms of risk functions and Bayes risks of those under LINEX loss and squared error loss functions with their respective alternative estimators viz, UMVUE and Bayes estimators relative to squared error loss function, are made. It is found that Bayes estimators relative to LINEX loss function dominate the alternative estimators m terms of risk function snd Bayes risk. It is also found that if t2 is unknown the Bayes estimators are still preferable over alternative estimators.     

Monitoring Variation in a Multivariate Process When the Dimension is Large Relative to the Sample Size

A control procedure is presented for monitoring changes in variation for a multivariate normal process in a Phase II operation where the subgroup size, m, is less than p, the number of variates. The methodology is based on a form of Wilk' statistic, which can be expressed as a function of the ratio of the determinants of two separate estimates of the covariance matrix. One estimate is based on the historical data set from Phase I and the other is based on an augmented data set including new data obtained in Phase II. The proposed statistic is shown to be distributed as the product of independent beta distributions that can be approximated using either a chi-square or F-distribution. An ARL study of the statistic is presented for a range of conditions for the population covariance matrix. Cases are considered where a p-variate process is being monitored using a sample of m observations per subgroup and m < p. Data from an industrial multivariate process is used to illustrate the proposed technique.     

ON UMP INVARIANT F-TEST PROCEDURES IN A GENERAL LINEAR MODEL

A simple method of setting linear hypotheses for a split mean vector testable by F-tests in a general linear model, when the covariance matrix has a general form and is completely unknown, is provided by extending the method discussed in Ukita et al. The critical functions in these F-tests are constructed as UMP invariants, when the covariance matrix has a known structure. Further critical functions in F-tests of linear hypotheses for the other split mean vector in the model are shown to be UMP invariant if the same known structure of the covariance matrix is assumed.     

Estimation and prediction for Chen distribution with bathtub shape under progressive censoring

We consider estimation of the unknown parameters of Chen distribution [Chen Z. A new two-parameter lifetime distribution with bathtub shape or increasing failure rate function. Statist Probab Lett. 2000;49:155–161] with bathtub shape using progressive-censored samples. We obtain maximum likelihood estimates by making use of an expectation–maximization algorithm. Different Bayes estimates are derived under squared error and balanced squared error loss functions. It is observed that the associated posterior distribution appears in an intractable form. So we have used an approximation method to compute these estimates. A Metropolis–Hasting algorithm is also proposed and some more approximate Bayes estimates are obtained. Asymptotic confidence interval is constructed using observed Fisher information matrix. Bootstrap intervals are proposed as well. Sample generated from MH algorithm are further used in the construction of HPD intervals. Finally, we have obtained prediction intervals and estimates for future observations in one- and two-sample situations. A numerical study is conducted to compare the performance of proposed methods using simulations. Finally, we analyse real data sets for illustration purposes.     

Flexible reliability assessment of digital circuits based on signal probability

In order to evaluate the reliability of VLSI, a level matrix for reliability and signal propagation evaluation is proposed based on the combination of probabilistic transfer matrix and signal probability reliability. By appropriate operations of the proposed matrix, reliability and signal probability of the entire circuit as well as the individual output(s) can be obtained flexibly. This new approach realizes hierarchical calculation by the proposed level matrix propagated from the previous state instead of the primary one. The efficiency and feasibility of the proposed method have been verified by both combinational and sequential benchmark circuits.     

Construction of optimal designs in random coefficient regression models

We consider the problem of optimal experimental design in random coefficient regression models with respect to a quadratic loss function. By application of WHITTLE'S general equivalence theorem we obtain the structure of optimal designs. An alogrithm is given which allows, under certain assumptions, the construction of the information matrix of an optimal design. Moreover, we give conditions on the equivalence of optimal designs with respect to optimality criteria which are analogous to usual A-D- and _E/-optimality.