Computational issues in parameter estimation for stationary hidden Markov models

The parameters of a hidden Markov model (HMM) can be estimated by numerical maximization of the log-likelihood function or, more popularly, using the expectation–maximization (EM) algorithm. In its standard implementation the latter is unsuitable for fitting stationary hidden Markov models (HMMs). We show how it can be modified to achieve this. We propose a hybrid algorithm that is designed to combine the advantageous features of the two algorithms and compare the performance of the three algorithms using simulated data from a designed experiment, and a real data set. The properties investigated are speed of convergence, stability, dependence on initial values, different parameterizations. We also describe the results of an experiment to assess the true coverage probability of bootstrap-based confidence intervals for the parameters.     

The Alive Particle Filter and Its Use in Particle Markov Chain Monte Carlo

In the following article, we investigate a particle filter for approximating Feynman–Kac models with indicator potentials and we use this algorithm within Markov chain Monte Carlo (MCMC) to learn static parameters of the model. Examples of such models include approximate Bayesian computation (ABC) posteriors associated with hidden Markov models (HMMs) or rare-event problems. Such models require the use of advanced particle filter or MCMC algorithms to perform estimation. One of the drawbacks of existing particle filters is that they may “collapse,” in that the algorithm may terminate early, due to the indicator potentials. In this article, using a newly developed special case of the locally adaptive particle filter, we use an algorithm that can deal with this latter problem, while introducing a random cost per-time step. In particular, we show how this algorithm can be used within MCMC, using particle MCMC. It is established that, when not taking into account computational time, when the new MCMC algorithm is applied to a simplified model it has a lower asymptotic variance in comparison to a standard particle MCMC algorithm. Numerical examples are presented for ABC approximations of HMMs.     

Extreme inaccuracies in Gaussian Bayesian networks

To evaluate the impact of model inaccuracies over the network’s output, after the evidence propagation, in a Gaussian Bayesian network, a sensitivity measure is introduced. This sensitivity measure is the Kullback-Leibler divergence and yields different expressions depending on the type of parameter to be perturbed, i.e. on the inaccurate parameter.In this work, the behavior of this sensitivity measure is studied when model inaccuracies are extreme, i.e. when extreme perturbations of the parameters can exist. Moreover, the sensitivity measure is evaluated for extreme situations of dependence between the main variables of the network and its behavior with extreme inaccuracies. This analysis is performed to find the effect of extreme uncertainty about the initial parameters of the model in a Gaussian Bayesian network and about extreme values of evidence. These ideas and procedures are illustrated with an example.     

Cross-entropic learning of a machine for the decision in a partially observable universe

In this paper, we are interested in optimal decisions in a partially observable universe. Our approach is to directly approximate an optimal strategic tree depending on the observation. This approximation is made by means of a parameterized probabilistic law. A particular family of Hidden Markov Models (HMM), with input and output, is considered as a model of policy. A method for optimizing the parameters of these HMMs is proposed and applied. This optimization is based on the cross-entropic (CE) principle for rare events simulation developed by Rubinstein.     

Arc refractor methods for adaptive importance sampling on large Bayesian networks under evidential reasoning

Approximate Bayesian inference by importance sampling derives probabilistic statements from a Bayesian network, an essential part of evidential reasoning with the network and an important aspect of many Bayesian methods. A critical problem in importance sampling on Bayesian networks is the selection of a good importance function to sample a network’s prior and posterior probability distribution. The initially optimal importance functions eventually start deviating from the optimal function when sampling a network’s posterior distribution given evidence, even when adaptive methods are used that adjust an importance function to the evidence by learning. In this article we propose a new family of Refractor Importance Sampling (RIS) algorithms for adaptive importance sampling under evidential reasoning. RIS applies “arc refractors” to a Bayesian network by adding new arcs and refining the conditional probability tables. The goal of RIS is to optimize the importance function for the posterior distribution and reduce the error variance of sampling. Our experimental results show a significant improvement of RIS over state-of-the-art adaptive importance sampling algorithms.     

A New Filled Function Method with Two Parameters for Global Optimization

The filled function method is an effective approach to find the global minimizer of multi-modal functions. The conventional filled functions are often numerically unstable due to the exponential or logarithmic term and the sensitivity to parameters. In this paper, a new filled function is proposed, which is continuously differentiable, not sensitive to parameters, and not easy to cause overflow. Then a new local search algorithm is given. Based on this, a new filled function method is proposed. The simulations indicate that the proposed method is numerically stable to the variations of the initial points and the parameters. The comparison with some existing algorithms shows that the proposed method is more efficient and effective.     

Bayesian Model Selection for Exponential Random Graph Models via Adjusted Pseudolikelihoods

Models with intractable likelihood functions arise in areas including network analysis and spatial statistics, especially those involving Gibbs random fields. Posterior parameter estimation in these settings is termed a doubly intractable problem because both the likelihood function and the posterior distribution are intractable. The comparison of Bayesian models is often based on the statistical evidence, the integral of the un-normalized posterior distribution over the model parameters which is rarely available in closed form. For doubly intractable models, estimating the evidence adds another layer of difficulty. Consequently, the selection of the model that best describes an observed network among a collection of exponential random graph models for network analysis is a daunting task. Pseudolikelihoods offer a tractable approximation to the likelihood but should be treated with caution because they can lead to an unreasonable inference. This article specifies a method to adjust pseudolikelihoods to obtain a reasonable, yet tractable, approximation to the likelihood. This allows implementation of widely used computational methods for evidence estimation and pursuit of Bayesian model selection of exponential random graph models for the analysis of social networks. Empirical comparisons to existing methods show that our procedure yields similar evidence estimates, but at a lower computational cost. Supplementary material for this article is available online.     

Parallel sequential Monte Carlo samplers and estimation of the number of states in a Hidden Markov Model

The majority of modelling and inference regarding Hidden Markov Models (HMMs) assumes that the number of underlying states is known a priori. However, this is often not the case and thus determining the appropriate number of underlying states for a HMM is of considerable interest. This paper proposes the use of a parallel sequential Monte Carlo samplers framework to approximate the posterior distribution of the number of states. This requires no additional computational effort if approximating parameter posteriors conditioned on the number of states is also necessary. The proposed strategy is evaluated on a comprehensive set of simulated data and shown to outperform the state of the art in this area: although the approach is simple, it provides good performance by fully exploiting the particular structure of the problem. An application to business cycle analysis is also presented.     

Skew normal measurement error models

In this paper we define a class of skew normal measurement error models, extending usual symmetric normal models in order to avoid data transformation. The likelihood function of the observed data is obtained, which can be maximized by using existing statistical software. Inference on the parameters of interest can be approached by using the observed information matrix, which can also be computed by using existing statistical software, such as the Ox program. Bayesian inference is also discussed for the family of asymmetric models in terms of invariance with respect to the symmetric normal distribution showing that early results obtained for the normal distribution also holds for the asymmetric family. Results of a simulation study and an analysis of a real data set analysis are provided.     

A Gridding Method for Bayesian Sequential Decision Problems

This article introduces a numerical method for finding optimal or approximately optimal decision rules and corresponding expected losses in Bayesian sequential decision problems. The method, based on the classical backward induction method, constructs a grid approximation to the expected loss at each decision time, viewed as a function of certain statistics of the posterior distribution of the parameter of interest. In contrast with most existing techniques, this method has a computation time which is linear in the number of stages in the sequential problem. It can also be applied to problems with insufficient statistics for the parameters of interest. Furthermore, it is well-suited to be implemented using parallel processors.     

Wavelet improvement in turning point detection using a hidden Markov model: from the aspects of cyclical identification and outlier correction

The hidden Markov model (HMM) has been widely used in regime classification and turning point detection for econometric series after the decisive paper by Hamilton (Econometrica 57(2):357–384, 1989). The present paper will show that when using HMM to detect the turning point in cyclical series, the accuracy of the detection will be influenced when the data are exposed to high volatilities or combine multiple types of cycles that have different frequency bands. Moreover, outliers will be frequently misidentified as turning points. The present paper shows that these issues can be resolved by wavelet multi-resolution analysis based methods. By providing both frequency and time resolutions, the wavelet power spectrum can identify the process dynamics at various resolution levels. We apply a Monte Carlo experiment to show that the detection accuracy of HMMs is highly improved when combined with the wavelet approach. Further simulations demonstrate the excellent accuracy of this improved HMM method relative to another two change point detection algorithms. Two empirical examples illustrate how the wavelet method can be applied to improve turning point detection in practice.     

Clustering Multivariate Longitudinal Observations: The Contaminated Gaussian Hidden Markov Model

The Gaussian hidden Markov model (HMM) is widely considered for the analysis of heterogenous continuous multivariate longitudinal data. To robustify this approach with respect to possible elliptical heavy-tailed departures from normality, due to the presence of outliers, spurious points, or noise (collectively referred to as bad points herein), the contaminated Gaussian HMM is here introduced. The contaminated Gaussian distribution represents an elliptical generalization of the Gaussian distribution and allows for automatic detection of bad points in the same natural way as observations are typically assigned to the latent states in the HMM context. Once the model is fitted, each observation has a posterior probability of belonging to a particular state and, inside each state, of being a bad point or not. In addition to the parameters of the classical Gaussian HMM, for each state we have two more parameters, both with a specific and useful interpretation: one controls the proportion of bad points and one specifies their degree of atypicality. A sufficient condition for the identifiability of the model is given, an expectation-conditional maximization algorithm is outlined for parameter estimation and various operational issues are discussed. Using a large-scale simulation study, but also an illustrative artificial dataset, we demonstrate the effectiveness of the proposed model in comparison with HMMs of different elliptical distributions, and we also evaluate the performance of some well-known information criteria in selecting the true number of latent states. The model is finally used to fit data on criminal activities in Italian provinces. Supplementary materials for this article are available online     

An S-Plus Implementation of Hidden Markov Models in Continuous Time

Abstract

Hidden Markov models (HMM) can be applied to the study of time varying unobserved categorical variables for which only indirect measurements are available. An S-Plus module to fit HMMs in continuous time to this type of longitudinal data is presented. Covariates affecting the transition intensities of the hidden Markov process or the conditional distribution of the measured response (given the hidden states of the process) are handled under a generalized regression framework. Users can provide C subroutines specifying the parameterization of the model to adapt the software to a wide variety of data types. HMM analysis using the S-Plus module is illustrated on a dataset from a prospective study of human papillomavirus infection in young women and on simulated data.     

受控AR信号模型下基于Kullback-Leibler信息量HMM参数的估计算法

本是在对现实世界中常见的信号模型一受控AR模型的处理中引进HMM的，并且基于Kullback-Leibler(简记为K-L)信息量在此特定信号模型下蛤出了HMM参数的估计算法。     

Redundant fuzzy rules exclusion by genetic algorithms

A genetic-algorithm-based method for exclusion of the potential redundant if-then fuzzy rules that have been extracted from numerical input-output data is proposed. The main idea is the input-space separation into activation rectangles, corresponding to certain output intervals. The generation of fuzzy rules and the membership functions are based on these activation rectangles and appropriate fuzzy rules inference mechanism is proposed. As the method usually produces too many rules, it is necessary to exclude the potential redundant if-then rules. The concept for varying the family of sensitivity parameters, defining the overlapping of the fuzzy regions is proposed. The genetic algorithms are used to resolve the following combinatorial optimization problem: the generation of families of sensitivity parameters. In this way the potential redundant if-then fuzzy rules are excluded.

The method formalizes the synthesis of the fuzzy system and could be used for function approximation, classification and control purposes. An illustrative example for implementation of the method for traffic fuzzy control is given.     

Variational Bayes With Intractable Likelihood

Variational Bayes (VB) is rapidly becoming a popular tool for Bayesian inference in statistical modeling. However, the existing VB algorithms are restricted to cases where the likelihood is tractable, which precludes their use in many interesting situations such as in state--space models and in approximate Bayesian computation (ABC), where application of VB methods was previously impossible. This article extends the scope of application of VB to cases where the likelihood is intractable, but can be estimated unbiasedly. The proposed VB method therefore makes it possible to carry out Bayesian inference in many statistical applications, including state--space models and ABC. The method is generic in the sense that it can be applied to almost all statistical models without requiring too much model-based derivation, which is a drawback of many existing VB algorithms. We also show how the proposed method can be used to obtain highly accurate VB approximations of marginal posterior distributions. Supplementary material for this article is available online.     

Co-variation for sensitivity analysis in Bayesian networks: Properties,consequences and alternatives

Upon varying parameters in a sensitivity analysis of a Bayesian network, the standard approach is to co-vary the parameters from the same conditional distribution such that their proportions remain the same. Alternative co-variation schemes are, however, possible. In this paper we investigate the properties of the standard proportional co-variation and introduce two alternative schemes: uniform and order-preserving co-variation. We theoretically investigate the effects of using alternative co-variation schemes on the so-called sensitivity function, and conclude that its general form remains the same under any linear co-variation scheme. In addition, we generalise the CD-distance for bounding global belief change to explicitly include the co-variation scheme under consideration. We prove a tight lower bound on this distance for parameter changes in single conditional probability tables.     

贝叶斯网络仿真元模型及其在装备战场损伤仿真中的应用研究

结合装备战场损伤仿真系统,研究了贝叶斯网络仿真元模型的构建方法.从条件概率角度描述了仿真模型输入参数与输出参数之间的映射关系,研究了构建贝叶斯网络仿真元模型的可行性,分析了贝叶斯网络仿真元模型的优点;研究了贝叶斯网络仿真元模型构建过程中的关键问题,包括:元模型参数的确定、原始模型参数向贝叶斯网络节点的转化、联结强度的计算、衍生元模型的构建;针对不完全信息条件下装备战场损伤快速定位问题,研究了基于K2算法的贝叶斯网络仿真元模型构建方法;构建了某型高炮的战场损伤贝叶斯网络仿真元模型.     

Continuous Contour Monte Carlo for Marginal Density Estimation With an Application to a Spatial Statistical Model

The problem of marginal density estimation for a multivariate density function f(x) can be generally stated as a problem of density function estimation for a random vector λ(x) of dimension lower than that of x. In this article, we propose a technique, the so-called continuous Contour Monte Carlo (CCMC) algorithm, for solving this problem. CCMC can be viewed as a continuous version of the contour Monte Carlo (CMC) algorithm recently proposed in the literature. CCMC abandons the use of sample space partitioning and incorporates the techniques of kernel density estimation into its simulations. CCMC is more general than other marginal density estimation algorithms. First, it works for any density functions, even for those having a rugged or unbalanced energy landscape. Second, it works for any transformation λ(x) regardless of the availability of the analytical form of the inverse transformation. In this article, CCMC is applied to estimate the unknown normalizing constant function for a spatial autologistic model, and the estimate is then used in a Bayesian analysis for the spatial autologistic model in place of the true normalizing constant function. Numerical results on the U.S. cancer mortality data indicate that the Bayesian method can produce much more accurate estimates than the MPLE and MCMLE methods for the parameters of the spatial autologistic model.