Expected sample moments of concomitants of selected order statistics

In this paper, the task of determining expected values of sample moments, where the sample members have been selected based on noisy information, is considered. This task is a recurring problem in the theory of evolution strategies. Exact expressions for expected values of sums of products of concomitants of selected order statistics are derived. Then, using Edgeworth and Cornish-Fisher approximations, explicit results that depend on coefficients that can be determined numerically are obtained. While the results are exact only for normal populations, it is shown experimentally that including skewness and kurtosis in the calculations can yield greatly improved results for other distributions.     

A Unified Approach to the Approximation of Multivariate Densities

Approximation of a density by another density is considered in the case of different dimensionalities of the distributions. The results have been derived by inverting expansions of characteristic functions with the help of matrix techniques. The approximations obtained are all functions of cumulant differences and derivatives of the approximating density. The multivariate Edgeworth expansion follows from the results as a special case. Furthermore, the density functions of the trace and eigenvalues of the sample covariance matrix are approximated by the multivariate normal density and a numerical example is given     

测试实数编码遗传算法的困难度

分析了遗传算法困难度测试在遗传算法研究中的重要意义. 鉴于当前这方面的研究集 中于二进制编码遗传算法,对实数编码遗传算法的困难度测试进行了分析. 探讨了实数编码遗 传算法困难度分析的适应值与距离相关系数测试法与基于随机游走模型的相关函数测试法, 提出了最佳一阶函数逼近测试法,做了大量实验,并根据实证分析结果对三种方法进行了比较 与评价.     

Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee

The paper presents a general method of designing constant-factor approximation algorithms for some discrete optimization problems with assignment-type constraints. The core of the method is a simple deterministic procedure of rounding of linear relaxations (referred to as pipage rounding). With the help of the method we design approximation algorithms with better performance guarantees for some well-known problems including MAXIMUM COVERAGE, MAX CUT with given sizes of parts and some of their generalizations.     

Higher-order Bayesian Approximations for Pseudo-posterior Distributions

The theory of higher-order asymptotics provides accurate approximations to posterior distributions for a scalar parameter of interest, and to the corresponding tail area, for practical use in Bayesian analysis. The aim of this article is to extend these approximations to pseudo-posterior distributions, e.g., posterior distributions based on a pseudo-likelihood function and a suitable prior, which are proved to be particularly useful when the full likelihood is analytically or computationally infeasible. In particular, from a theoretical point of view, we derive the Laplace approximation for a pseudo-posterior distribution, and for the corresponding tail area, for a scalar parameter of interest, also in the presence of nuisance parameters. From a computational point of view, starting from these higher-order approximations, we discuss the higher-order tail area (HOTA) algorithm useful to approximate marginal posterior distributions, and related quantities. Compared to standard Markov chain Monte Carlo methods, the main advantage of the HOTA algorithm is that it gives independent samples at a negligible computational cost. The relevant computations are illustrated by two examples.     

Quadratic Approximation via the SCAD Penalty with a Diverging Number of Parameters

The high-dimensional data arises in diverse fields of sciences, engineering and humanities. Variable selection plays an important role in dealing with high dimensional statistical modelling. In this article, we study the variable selection of quadratic approximation via the smoothly clipped absolute deviation (SCAD) penalty with a diverging number of parameters. We provide a unified method to select variables and estimate parameters for various of high dimensional models. Under appropriate conditions and with a proper regularization parameter, we show that the estimator has consistency and sparsity, and the estimators of nonzero coefficients enjoy the asymptotic normality as they would have if the zero coefficients were known in advance. In addition, under some mild conditions, we can obtain the global solution of the penalized objective function with the SCAD penalty. Numerical studies and a real data analysis are carried out to confirm the performance of the proposed method.     

Asymptotic approximations to the distribution of Kendall's sample τ

This paper provides a saddlepoint approximation to the distribution of the sample version of Kendall's τ, which is a measure of association between two samples. The saddlepoint approximation is compared with the Edgeworth and the normal approximations, and with the bootstrap resampling distribution. A numerical study shows that with small sample sizes the saddlepoint approximation outperforms both the normal and the Edgeworth approximations. This paper gives also an analytical comparison between approximated and exact cumulants of the sample Kendall's τ when the two samples are independent.     

Confidence interval estimation and hypothesis testing for a common correlation coefficient

Several procedures have been proposed for testing the hypothesis that all off-diagonal elements of the correlation matrix of a multivariate normal distribution are equal. If the hypothesis of equal correlation can be accepted, it is then of interest to estimate and perhaps test hypotheses for the common correlation. In this paper, two versions of five different test statistics are compared via simulation in terms of adequacy of the normal approximation, coverage probabilities of confidence intervals, control of Type I error, and power. The results indicate that two test statistics based on the average of the Fisher z-transforms of the sample correlations should be used in most cases. A statistic based on the sample eigenvalues also gives reasonable results for confidence intervals and lower-tailed tests.     

Assessing the performance of variational methods for mixed logistic regression models

We present a variational estimation method for the mixed logistic regression model. The method is based on a lower bound approximation of the logistic function [Jaakkola, J.S. and Jordan, M.I., 2000, Bayesian parameter estimation via variational methods. Statistics & Computing, 10, 25–37.]. Based on the approximation, an EM algorithm can be derived that results in a considerable simplification of the maximization problem in that it does not require the numerical evaluation of integrals over the random effects. We assess the performance of the variational method for the mixed logistic regression model in a simulation study and an empirical data example, and compare it to Laplace's method. The results indicate that the variational method is a viable choice for estimating the fixed effects of the mixed logistic regression model under the condition that the number of outcomes within each cluster is sufficiently high.     

Non uniform exponential bounds on normal approximation by Stein’s method and monotone size bias couplings

It is known that the normal approximation is applicable for sums of non negative random variables, W, with the commonly employed couplings. In this work, we use the Stein’s method to obtain a general theorem of non uniform exponential bound on normal approximation base on monotone size bias couplings of W. Applications of the main result to give the bound on normal approximation for binomial random variable, the number of bulbs on at the terminal time in the lightbulb process, and the number of m runs are also provided.