An alternative derivation of the Kalman filter using the quasi-likelihood method

The Kalman filter gives a recursive procedure for estimating state vectors. The recursive procedure is determined by a matrix, so-called gain matrix, where the gain matrix is varied based on the system to which the Kalman filter is applied. Traditionally the gain matrix is derived through the maximum likelihood approach when the probability structure of underlying system is known. As an alternative approach, the quasi-likelihood method is considered in this paper. This method is used to derive the gain matrix without the full knowledge of the probability structure of the underlying system. Two models are considered in this paper, the simple state space model and the model with correlated between measurement and transition equation disturbances. The purposes of this paper are (i) to show a simple way to derive the gain matrix; (ii) to give an alternative approach for obtaining optimal estimation of state vector when underlying system is relatively complex.     

A generalization of the alias matrix

The investigation of aliases or biases is important for the interpretation of the results from factorial experiments. For two-level fractional factorials this can be facilitated through their group structure. For more general arrays the alias matrix can be used. This tool is traditionally based on the assumption that the error structure is that associated with ordinary least squares. For situations where that is not the case, we provide in this article a generalization of the alias matrix applicable under the generalized least squares assumptions. We also show that for the special case of split plot error structure, the generalized alias matrix simplifies to the ordinary alias matrix.     

Variance estimation in the central limit theorem for Markov chains

This article concerns the variance estimation in the central limit theorem for finite recurrent Markov chains. The associated variance is calculated in terms of the transition matrix of the Markov chain. We prove the equivalence of different matrix forms representing this variance. The maximum likelihood estimator for this variance is constructed and it is proved that it is strongly consistent and asymptotically normal. The main part of our analysis consists in presenting closed matrix forms for this new variance. Additionally, we prove the asymptotic equivalence between the empirical and the maximum likelihood estimation (MLE) for the stationary distribution.     

A Note on the Factorization of a Matrix Inverse

The decomposition of a matrix as a product of a lower triangular with ones on the diagonal and an upper triangular matrix is useful for solving systems of linear equations. For a given non singular matrix, this type of decomposition is unique and algorithms exist to obtain the two factors. However, in certain problems the factorization of the inverse matrix may be of interest. This note presents an algorithm for factoring the inverse matrix using simple operations of elements from the original matrix. As examples, we give factorizations for several well-known and widely used correlation matrices. The usefulness and practicality of these factorizations are provided in an application of statistical modeling using unbiased estimating equations.     

稳健高维协方差矩阵估计及其投资组合应用——基于中心正则化算法

高维协方差矩阵的估计问题现已成为大数据统计分析中的基本问题,传统方法要求数据满足正态分布假定且未考虑异常值影响,当前已无法满足应用需要,更加稳健的估计方法亟待被提出。针对高维协方差矩阵,一种稳健的基于子样本分组的均值-中位数估计方法被提出且简单易行,然而此方法估计的矩阵并不具备正定稀疏特性。基于此问题,本文引进一种中心正则化算法,弥补了原始方法的缺陷,通过在求解过程中对估计矩阵的非对角元素施加L1范数惩罚,使估计的矩阵具备正定稀疏的特性,显著提高了其应用价值。在数值模拟中,本文所提出的中心正则稳健估计有着更高的估计精度,同时更加贴近真实设定矩阵的稀疏结构。在后续的投资组合实证分析中,与传统样本协方差矩阵估计方法、均值-中位数估计方法和RA-LASSO方法相比,基于中心正则稳健估计构造的最小方差投资组合收益率有着更低的波动表现。     

A Selection Procedure for the Number of Signals in Presence of Colored Noise

Ranking and selection theory is used to estimate the number of signals present in colored noise. The data structure follows the well-known MUSIC (MUltiple SIgnal Classification) model. We deal with the eigenvalues of a covariance matrix, using the MUSIC model and colored noise. The data matrix can be written as the product of two matrices. The first matrix is the sample covariance matrix of the observed vectors. The second matrix is the inverse of the sample covariance matrix of reference vectors. We propose a multi-step selection procedure to construct a confidence interval on the number of signals present in a data set. Properties of this procedure will be stated and proved. Those properties will be used to compute the required parameters (procedure constants). Numerical examples are given to illustrate our theory.     

Regularized covariance matrix estimation under the common principal components model

The common principal components (CPC) model provides a way to model the population covariance matrices of several groups by assuming a common eigenvector structure. When appropriate, this model can provide covariance matrix estimators of which the elements have smaller standard errors than when using either the pooled covariance matrix or the per group unbiased sample covariance matrix estimators. In this article, a regularized CPC estimator under the assumption of a common (or partially common) eigenvector structure in the populations is proposed. After estimation of the common eigenvectors using the Flury–Gautschi (or other) algorithm, the off-diagonal elements of the nearly diagonalized covariance matrices are shrunk towards zero and multiplied with the orthogonal common eigenvector matrix to obtain the regularized CPC covariance matrix estimates. The optimal shrinkage intensity per group can be estimated using cross-validation. The efficiency of these estimators compared to the pooled and unbiased estimators is investigated in a Monte Carlo simulation study, and the regularized CPC estimator is applied to a real dataset to demonstrate the utility of the method.     

A mixture of the manova and gmanova models

A mixture of the MANOVA and GMANOVA models is presented. The expected value of the response matrix in this model is the sum of two matrix components. The first component represents the GMANOVA portion and the second component represents the MANOVA portion. Maximum likelihood estimators are derived for the parameters in this model, and goodness-of-fit tests are constructed for fuller models via the likelihood ration criterion. Finally, likelihood ration tests for general liinear hypotheses are developed and a numerical example is presented.     

Data‐driven choice of the smoothing parametrization for kernel density estimators

There are several levels of sophistication when specifying the bandwidth matrix H to be used in a multivariate kernel density estimator, including H to be a positive multiple of the identity matrix, a diagonal matrix with positive elements or, in its most general form, a symmetric positive‐definite matrix. In this paper, the author proposes a data‐based method for choosing the smoothing parametrization to be used in the kernel density estimator. The procedure is fully illustrated by a simulation study and some real data examples. The Canadian Journal of Statistics © 2009 Statistical Society of Canada     

Simultaneous equivariant estimation of the parameters of matrix scale and matrix location-scale models

Eaton and Olkin (1987) discussed the problem of best equivariant estimator of the matrix scale parameter with respect to different scalar loss functions. Edwin Prabakaran and Chandrasekar (1994) developed simultaneous equivariant estimation approach and illustrated the method with examples. The problems considered in this paper are simultaneous equivariant estimation of the parameters of (i) a matrix scale model and (ii) a multivariate location-scale model. By considering matrix loss function (Klebanov, Linnik and Ruhin, 1971) a characterization of matrix minimum risk equivariant (MMRE) estimator of the matrix parameter is obtained in each case. Illustrative examples are provided in which MMRE estimators are obtained with respect to two matrix loss functions.     

On the independence between two generalized second degree polynomial statistics and their covariance

The condition of independence between two generalized second degree polynomial statistics is worked out in this paper under the assumption that the covariance matrix of the underlying normal distribution may be singular. The covariance between two such forms is also worked out without the assumption of normality. The results are indicated in compact matrix form.     

New Algorithms for Evaluating the Log-Likelihood Function Derivatives in the AI-REML Method

In this study, we propose several improvements of the Average Information Restricted Maximum Likelihood algorithms for estimating the variance components for genetic mapping of quantitative traits. The improved methods are applicable when two variance components are to be estimated. The improvements are related to the algebraic part of the methods and utilize the properties of the underlying matrix structures.

In contrast to previously developed algorithms, the explicit computation of a matrix inverse is replaced by the solution of a linear system of equations with multiple right-hand sides, based on a particular matrix decomposition. The computational costs of the proposed algorithms are analyzed and compared.     

Estimating the permanent by importance sampling from a finite population

The Calculation of the permanent of a matrix is an extremely difficult task. Indeed it belongs to the class of hard counting problems denoted #P complete and hence any algorithm to compute the permanent must run in exponential time in the order of the matrix. Attention, therefore, has concentrated on Monte Carlo algorithms to estimate permanents with considerable emphasis on deriving randomised polynomial time algorithms. Interest in this area hs largely stemmed from problems in combibatorial enumeration, for instance the permanent of a square(0,1) matrix gives the number of perfect matchings in a bipartite graph.     

An iterative sparse algorithm for the penalized maximum likelihood estimator in mixed effects model

In this paper, we propose a new iterative sparse algorithm (ISA) to compute the maximum likelihood estimator (MLE) or penalized MLE of the mixed effects model. The sparse approximation based on the arrow-head (A-H) matrix is one solution which is popularly used in practice. The A-H method provides an easy computation of the inverse of the Hessian matrix and is computationally efficient. However, it often has non-negligible error in approximating the inverse of the Hessian matrix and in the estimation. Unlike the A-H method, in the ISA, the sparse approximation is applied “iteratively” to reduce the approximation error at each Newton Raphson step. The advantages of the ISA over the exact and A-H method are illustrated using several synthetic and real examples.     

Estimation of eigenvalues of the scale matrix of the multivariate f distribution

Let F have the multivariate F distribution with a scale matrix Δ. In this paper, the problem of estimating the eigenvalues of the scale matrix Δ is considered. New class of estimators are obtained which dominate the best linear estimator of the form cF. Simulation study is also carried out to compare the performance of these estimators.     

The Density Functions of the Singular Quaternion Normal Matrix and the Singular Quaternion Wishart Matrix

In this article, we give the density functions of the singular quaternion normal matrix and the singular quaternion Wishart matrix. Furthermore, we also give the density functions of certain singular quaternion β-matrix and the singular quaternion F-matrix in terms of the density function of the singular quaternion Wishart matrix and hypergeometric functions of quaternion matrix argument.     

Recurrence relations of coefficients of the generalized hypergeometric function in multivariate analysis

James(1960) defined the zonal polynomials and used it to represent the joint distributions of latent roots of VVisfiart matrix. The zonal polviionnals played an important role to define the generalized hypergeometric function of symmetric matrix argument Since then, many density functions and moments based on Wishart matrix have been expressed in terms of the generalized hy¬pergeometric Function. The purpose of this paper is to get the recurrence relations for the coefficients of it. In Section 1 we derive a partial differen¬tial equations having the generalized hypergeometric function as the unique solution. Then we ubtain the recurrence relations until order 7 in Section 2.     

A note on the asymptotic distribution of the maximum likelihood estimator for the scalar skew-normal distribution

We consider likelihood based inference for the parameter of a skew-normal distribution. One of the problems shown by this model is the singularity of the Fisher information matrix when skewness is absent. We derive the rate of convergence to the asymptotic distribution of the maximum likelihood estimator and study an alternative parameterization which overcomes problems related to the singularity of the information matrix.     

Improving on the sample covariance matrix for a complex elliptically contoured distribution

In this paper the problem of estimating the scale matrix in a complex elliptically contoured distribution (complex ECD) is addressed. An extended Haff–Stein identity for this model is derived. It is shown that the minimax estimators of the covariance matrix obtained under the complex normal model remain robust under the complex ECD model when the Stein loss function is employed.     

On the use of the selection matrix in the maximum likelihood estimation of normal distribution models with missing data

In this article, by using the constant and random selection matrices, several properties of the maximum likelihood (ML) estimates and the ML estimator of a normal distribution with missing data are derived. The constant selection matrix allows us to obtain an explicit form of the ML estimates and the exact relationship between the EM algorithm and the score function. The random selection matrix allows us to clarify how the missing-data mechanism works in the proof of the consistency of the ML estimator, to derive the asymptotic properties of the sequence by the EM algorithm, and to derive the information matrix.