Estimation of error rate in multiple group logistic discrimination. the approximate leaving-one-out method

We present an approximate leaving-one-out technique for estimating the error rate in logistic discrimination. The new measure is based on the one-step approximation of a(i), the maximum likelihood estimate of the parameter vector based on the sample without the ith case. Some inequalities between the resubstitution error rate, the approximate and exact leaving-one-out error rates for the multiple group logistic model are investigated. Monte-Carlo simulations assess the adequacy of the approximate leaving-one-out method as an estimate of the actual error rate. The usefulness of this approach is demonstrated by means of two medical examples.     

Some asymptotic results for semiparametric nonlinear mixed-effects models with incomplete data

In modeling complex longitudinal data, semiparametric nonlinear mixed-effects (SNLME) models are very flexible and useful. Covariates are often introduced in the models to partially explain the inter-individual variations. In practice, data are often incomplete in the sense that there are often measurement errors and missing data in longitudinal studies. The likelihood method is a standard approach for inference for these models but it can be computationally very challenging, so computationally efficient approximate methods are quite valuable. However, the performance of these approximate methods is often based on limited simulation studies, and theoretical results are unavailable for many approximate methods. In this article, we consider a computationally efficient approximate method for a class of SNLME models with incomplete data and investigate its theoretical properties. We show that the estimates based on the approximate method are consistent and asymptotically normally distributed.     

Statistical Inference for the Multidimensional Mixed Rasch Model

Inference in generalized linear mixed models with multivariate random effects is often made cumbersome by the high-dimensional intractable integrals involved in the marginal likelihood. This article presents an inferential methodology based on the GEE approach. This method involves the approximations of the marginal likelihood and joint moments of the variables. It is also proposed an approximate Akaike and Bayesian information criterions based on the approximate marginal likelihood using the estimation of the parameters by the GEE approach. The different results are illustrated with a simulation study and with an analysis of real data from health-related quality of life.     

Simulated Likelihood Approximations for Stochastic Volatility Models

Abstract. This paper deals with parametric inference for continuous-time stochastic volatility models observed at discrete points in time. We consider approximate maximum likelihood estimation: for the k th-order approximation, we pretend that the observations form a k th-order Markov chain, find the corresponding approximate log-likelihood function, and maximize it with respect to θ . The approximate log-likelihood function is not known analytically, but can easily be calculated by simulation. For each k , the method yields consistent and asymptotically normal estimators. Simulations from a model based on the Cox–Ingersoll–Ross model are used for illustration.     

Profile likelihood in directed graphical models from BUGS output

We present a method for using posterior samples produced by the computer program BUGS (Bayesian inference Using Gibbs Sampling) to obtain approximate profile likelihood functions of parameters or functions of parameters in directed graphical models with incomplete data. The method can also be used to approximate integrated likelihood functions. It is easily implemented and it performs a good approximation. The profile likelihood represents an aspect of the parameter uncertainty which does not depend on the specification of prior distributions, and it can be used as a worthwhile supplement to BUGS that enable us to do both Bayesian and likelihood based analyses in directed graphical models.     

Confidence intervals on a difference of expected mean squares

A theorem is provided that extends approximate confidence intervals on a positive difference of expected mean squares to the case where the sign is unknown. Numerical integration is used to illustrate the performance of the extension based on a method proposed by Howe (1974).     

A procedure for approximate negative binomial tolerance intervals

In this article, we present a procedure for approximate negative binomial tolerance intervals. We utilize an approach that has been well-studied to approximate tolerance intervals for the binomial and Poisson settings, which is based on the confidence interval for the parameter in the respective distribution. A simulation study is performed to assess the coverage probabilities and expected widths of the tolerance intervals. The simulation study also compares eight different confidence interval approaches for the negative binomial proportions. We recommend using those in practice that perform the best based on our simulation results. The method is also illustrated using two real data examples.     

Tests of significance for the odds ratio in a 2×2 table based on the ratio of two independent F-variates

Following Gart (1966) a test of significance for the odds ratio in a 2×2 table is developed based on a semi-empirical method of approximating discrete distributions by their continuous analogues. The distribution of the test statistic (W), the ratio of two independent F-variates, is derived. This approximate technique is compared with the "exact" test, uncorrected X test, and a normal approximation based on lnW.     

Approxmating the distribution of the maximum of a dependent stationary sequence based on estimatimates from a genrating function

A method based on estimating the coefficients of a generating function is used to approximate the distribution of the maximum term of a stationary dependent sequence. In a numerical comparison of our approximation with other apporoximations, our method yielded uniformly closer estimates to the exact distribution. In the examples we considered, statisfactory estimates of the distribution were obtained by our method based on a knowledge of the tri-variate distribution of the underlying random sequence. Knowledge of higher variate distributions can be incorporated to yield even more accurate estimates.     

Hilbert space methods for reduced-rank Gaussian process regression

Statistics and Computing - This paper proposes a novel scheme for reduced-rank Gaussian process regression. The method is based on an approximate series expansion of the covariance function in...     

确定组合预测权系数最优近似解的方法研究

一、引言组合预测可以综合利用各单项预测方法提供的信息,是提高预测精度的有效途径,组合预测的关键是确定各单项预测方法的加权系数;根据加权系数是否为时变参数,组合预测方法大致可分为非线性组合预测方法和线性组合预测方法两类;目前研究最多、应用最广泛的是线性...     

Better approximate confidence intervals for a binomial parameter

This paper discusses five methods for constructing approximate confidence intervals for the binomial parameter Θ, based on Y successes in n Bernoulli trials. In a recent paper, Chen (1990) discusses various approximate methods and suggests a new method based on a Bayes argument, which we call method I here. Methods II and III are based on the normal approximation without and with continuity correction. Method IV uses the Poisson approximation of the binomial distribution and then exploits the fact that the exact confidence limits for the parameter of the Poisson distribution can be found through the x² distribution. The confidence limits of method IV are then provided by the Wilson-Hilferty approximation of the x². Similarly, the exact confidence limits for the binomial parameter can be expressed through the F distribution. Method V approximates these limits through a suitable version of the Wilson-Hilferty approximation. We undertake a comparison of the five methods in respect to coverage probability and expected length. The results indicate that method V has an advantage over Chen's Bayes method as well as over the other three methods.     

Estimation of the scale parameter of the half-logistic distribution with multiply type II censored sample

In this paper, we consider the maximum likelihood and Bayes estimation of the scale parameter of the half-logistic distribution based on a multiply type II censored sample. However, the maximum likelihood estimator(MLE) and Bayes estimator do not exist in an explicit form for the scale parameter. We consider a simple method of deriving an explicit estimator by approximating the likelihood function and discuss the asymptotic variances of MLE and approximate MLE. Also, an approximation based on the Laplace approximation (Tierney & Kadane, 1986) is used to obtain the Bayes estimator. In order to compare the MLE, approximate MLE and Bayes estimates of the scale parameter, Monte Carlo simulation is used.     

Parameter Estimation for Hidden Markov Models with Intractable Likelihoods

Approximate Bayesian computation (ABC) is a popular technique for analysing data for complex models where the likelihood function is intractable. It involves using simulation from the model to approximate the likelihood, with this approximate likelihood then being used to construct an approximate posterior. In this paper, we consider methods that estimate the parameters by maximizing the approximate likelihood used in ABC. We give a theoretical analysis of the asymptotic properties of the resulting estimator. In particular, we derive results analogous to those of consistency and asymptotic normality for standard maximum likelihood estimation. We also discuss how sequential Monte Carlo methods provide a natural method for implementing our likelihood‐based ABC procedures.     

两个部分线性模型的比较

内容提要:对于两个部分线性模型参数部分中模型系数是否相等的检验问题,本文基于比较原假设与备择假设下模型拟合的残差平方和的思想构造了检验统计量,并给出了计算检验_^p* 值的F分布逼近法。     

Confidence estimation of a normal mean vector with incomplete data

The problem of confidence estimation of a normal mean vector when data on different subsets of response variables are missing is considered. A simple approximate confidence region is proposed when the data matrix is of monotone pattern. Simultaneous inferential procedures based on Scheffe's method and Bonferroni's method are outlined. Further, applications of the results to a repeated measurements model are given. The results are illustrated using a practical example.     

Approximate MLEs of the parameters of location-scale models under type II censoring

Log-location-scale distributions are widely used parametric models that have fundamental importance in both parametric and semiparametric frameworks. The likelihood equations based on a Type II censored sample from location-scale distributions do not provide explicit solutions for the para-meters. Statistical software is widely available and is based on iterative methods (such as, Newton Raphson Algorithm, EM algorithm etc.), which require starting values near the global maximum. There are also many situations that the specialized software does not handle. This paper provides a method for determining explicit estimators for the location and scale parameters by approximating the likelihood function, where the method does not require any starting values. The performance of the proposed approximate method for the Weibull distribution and Log-Logistic distributions is compared with those based on iterative methods through the use of simulation studies for a wide range of sample size and Type II censoring schemes. Here we also examine the probability coverages of the pivotal quantities based on asymptotic normality. In addition, two examples are given.     

Modeling service-time distributions for queueing network simulation

Shapes of service-time distributions in queueing network models have a great impact on the distribution of system response-times. It is essential for the analysis of response-time distribution that the modeled service-time distributions have the correct shape. Tradionally modeling of service-time distributions is based on a parametric approach by assuming a specific distribution and estimating its parameters. We introduce an alternative approach based on the principles of exploratory data analysis and nonparametric data modeling. The proposed method applies nonlinear data transformation and resistant curve fitting. The method can be used in cases, where the available data is a complete sample, a histogram, or the mean and a set of 5-10 quantiles. The reported results indicate that the proposed method is able to approximate the distribution of measured service times so that accurate estimates for quantiles of the response-time distribution are obtained     

Wavelet fuzzy hybrid model for physico-financial signals

In the present paper, a fuzzy logic-based method is combined with wavelet decomposition to develop a step-by-step dynamic hybrid model to analyze and approximate one-dimensional physico-financial signals characterized by fuzzy values. Computational tests based on a well-known signal and conducted with the pure fuzzy model, the wavelet one and the new hybrid model, are developed and result in an efficient hybrid one.     

Proximal Markov chain Monte Carlo algorithms

This paper presents a new Metropolis-adjusted Langevin algorithm (MALA) that uses convex analysis to simulate efficiently from high-dimensional densities that are log-concave, a class of probability distributions that is widely used in modern high-dimensional statistics and data analysis. The method is based on a new first-order approximation for Langevin diffusions that exploits log-concavity to construct Markov chains with favourable convergence properties. This approximation is closely related to Moreau–Yoshida regularisations for convex functions and uses proximity mappings instead of gradient mappings to approximate the continuous-time process. The proposed method complements existing MALA methods in two ways. First, the method is shown to have very robust stability properties and to converge geometrically for many target densities for which other MALA are not geometric, or only if the step size is sufficiently small. Second, the method can be applied to high-dimensional target densities that are not continuously differentiable, a class of distributions that is increasingly used in image processing and machine learning and that is beyond the scope of existing MALA and HMC algorithms. To use this method it is necessary to compute or to approximate efficiently the proximity mappings of the logarithm of the target density. For several popular models, including many Bayesian models used in modern signal and image processing and machine learning, this can be achieved with convex optimisation algorithms and with approximations based on proximal splitting techniques, which can be implemented in parallel. The proposed method is demonstrated on two challenging high-dimensional and non-differentiable models related to image resolution enhancement and low-rank matrix estimation that are not well addressed by existing MCMC methodology.