ALGORITHMS FOR RETURN PROBABILITIES FOR STOCHASTIC FLUID FLOWS

Abstract

We consider several known algorithms and introduce some new algorithms that can be used to calculate the probability of return to the initial level in the Markov stochastic fluid flow model. We give the physical interpretations of these algorithms within the fluid flow environment. The rates of convergence are explained in terms of the physical properties of the fluid flow processes. We compare these algorithms with respect to the number of iterations required and their complexity. The performance of the algorithms depends on the nature of the process considered in the analysis. We illustrate this with examples and give appropriate recommendations.     

Stochastic Algorithms for the Estimation of an Optimal Solution of a LP Problem. Convergence and Central Limit Theorem

In this article, we consider a Linear Programming (LP) problem with unknown objective function. We introduce a class of stochastic algorithms to estimate an optimal solution of the LP problem. The almost sure convergence and the speed of convergence of these algorithms are analyzed. We also prove a central limit theorem for the estimation errors of the algorithms.     

A latent process model for dementia and psychometric tests

We jointly model longitudinal values of a psychometric test and diagnosis of dementia. The model is based on a continuous-time latent process representing cognitive ability. The link between the latent process and the observations is modeled in two phases. Intermediate variables are noisy observations of the latent process; scores of the psychometric test and diagnosis of dementia are obtained by categorizing these intermediate variables. We propose maximum likelihood inference for this model and we propose algorithms for performing this task. We estimated the parameters of such a model using the data of the 5 year follow-up of the PAQUID study. In particular this analysis yielded interesting results about the effect of educational level on both latent cognitive ability and specific performance in the mini mental test examination. The predictive ability of the model is illustrated by predicting diagnosis of dementia at the 8 year follow-up of the PAQUID study based on the information from the first 5 years.     

Rate estimation in partially observed Markov jump processes with measurement errors

We present a simulation methodology for Bayesian estimation of rate parameters in Markov jump processes arising for example in stochastic kinetic models. To handle the problem of missing components and measurement errors in observed data, we embed the Markov jump process into the framework of a general state space model. We do not use diffusion approximations. Markov chain Monte Carlo and particle filter type algorithms are introduced which allow sampling from the posterior distribution of the rate parameters and the Markov jump process also in data-poor scenarios. The algorithms are illustrated by applying them to rate estimation in a model for prokaryotic auto-regulation and the stochastic Oregonator, respectively.     

Cluster Data Streams with Noisy Variables

Clustering algorithms are important methods widely used in mining data streams because of their abilities to deal with infinite data flows. Although these algorithms perform well to mining latent relationship in data streams, most of them suffer from loss of cluster purity and become unstable when the inputting data streams have too many noisy variables. In this article, we propose a clustering algorithm to cluster data streams with noisy variables. The result from simulation shows that our proposal method is better than previous studies by adding a process of variable selection as a component in clustering algorithms. The results of two experiments indicate that clustering data streams with the process of variable selection are more stable and have better purity than those without such process. Another experiment testing KDD-CUP99 dataset also shows that our algorithm can generate more stable result.     

Sampling the Dirichlet Mixture Model with Slices

We provide a new approach to the sampling of the well known mixture of Dirichlet process model. Recent attention has focused on retention of the random distribution function in the model, but sampling algorithms have then suffered from the countably infinite representation these distributions have. The key to the algorithm detailed in this article, which also keeps the random distribution functions, is the introduction of a latent variable which allows a finite number, which is known, of objects to be sampled within each iteration of a Gibbs sampler.     

Multiple-site updates in maximum a posteriori and marginal posterior modes image estimation

We describe standard single-site Monte Carlo Markov chain methods, the Hastings and Metropolis algorithms, the Gibbs sampler and simulated annealing, for maximum a posteriori and marginal posterior modes image estimation. These methods can experience great difficulty in traversing the whole image space in a finite time when the target distribution is multi-modal. We present a survey of multiple-site update methods, including Swendsen and Wang's algorithm, coupled Markov chains and cascade algorithms designed to tackle the problem of moving between modes of the posterior image distribution. We compare the performance of some of these algorithms for sampling from degraded and non-degraded Ising models     

A note on spectral estimation for ARMA processes

The standard frequency domain approximation to the Gaussian likelihood of a sample from an ARMA process is considered. The Newton-Raphson and Gauss-Newton numerical maximisation algorithms are evaluated for this approximate likelihood and the relationships between these algorithms and those of Akaike and Hannan explored. In particular it is shown that Hannan's method has certain computational advantages compared to the other spectral estimation methods considered     

Algorithms for Point Processes Analysis

A time point process can be defined either by the statistical properties of the time intervals between successive points or by those of the number of points in arbitrary time intervals. There are mathematical expressions to link up these two points of view, but they are in many cases too complicated to be used in practice. In this article, we present an algorithmic procedure to obtain the number of points of a stationary point process recorded in some time intervals by processing the values of the distances between successive points. We present some results concerning the statistical analysis of these numbers of points and when analytical calculations are possible the experimental results obtained with our algorithms are in excellent agreement with those predicted by the theory. Some properties of point processes in which theoretical calculations are almost impossible are also presented.     

Bayesian inference for a partially observed birth–death process using data on proportions

Stochastic kinetic models are often used to describe complex biological processes. Typically these models are analytically intractable and have unknown parameters which need to be estimated from observed data. Ideally we would have measurements on all interacting chemical species in the process, observed continuously in time. However, in practice, measurements are taken only at a relatively few time‐points. In some situations, only very limited observation of the process is available, for example settings in which experimenters can only observe noisy observations on the proportion of cells that are alive. This makes the inference task even more problematic. We consider a range of data‐poor scenarios and investigate the performance of various computationally intensive Bayesian algorithms in determining the posterior distribution using data on proportions from a simple birth‐death process.     

Perfect sampling for Bayesian variable selection in a linear regression model

We describe the use of perfect sampling algorithms for Bayesian variable selection in a linear regression model. Starting with a basic case solved by Huang and Djurić (EURASIP J. Appl. Si. Pr. 1 (2002) 38), where the model coefficients and noise variance are assumed to be known, we generalize the model step by step to allow for other sources of randomness. We specify perfect simulation algorithms that solve these cases by incorporating various techniques including Gibbs sampling, the perfect independent Metropolis–Hastings (IMH) algorithm, and recently developed “slice coupling” algorithms. Applications to simulated data sets suggest that our algorithms perform well in identifying relevant predictor variables.     

Discussion of “Nonparametric Bayesian Inference in Applications”: Bayesian nonparametric methods in econometrics

The use of Bayesian nonparametrics models has increased rapidly over the last few decades driven by increasing computational power and the development of efficient Markov chain Monte Carlo algorithms. We review some applications of these models in economic applications including: volatility modelling (using both stochastic volatility models and GARCH-type models) with Dirichlet process mixture models, uses in portfolio allocation problems, long memory models with flexible forms of time-dependence, flexible extension of the dynamic Nelson-Siegel model for interest rate yields and multivariate time series models used in macroeconometrics.     

Bayesian inference for non-Gaussian Ornstein–Uhlenbeck stochastic volatility processes

Summary.  We develop Markov chain Monte Carlo methodology for Bayesian inference for non-Gaussian Ornstein–Uhlenbeck stochastic volatility processes. The approach introduced involves expressing the unobserved stochastic volatility process in terms of a suitable marked Poisson process. We introduce two specific classes of Metropolis–Hastings algorithms which correspond to different ways of jointly parameterizing the marked point process and the model parameters. The performance of the methods is investigated for different types of simulated data. The approach is extended to consider the case where the volatility process is expressed as a superposition of Ornstein–Uhlenbeck processes. We apply our methodology to the US dollar–Deutschmark exchange rate.     

Boltzmann machines that learn to recognize patterns on control charts

Boltzmann machines (BM), a type of neural networking algorithm, have been proven to be useful in pattern recognition. Patterns on quality control charts have long been recognized as providing useful information for correcting process performance problems. In computer-integrated manufacturing environments, where the control charts are monitored by computer algorithms, the potential for using pattern-recognition algorithms is considerable. The main purpose of this paper is to formulate a Boltzmann machine pattern recognizer (BMPR) and demonstrate its utility in control chart pattern recognition. It is not the intent of this paper to make comparisons between existing related algorithms. A factorial design of experiments was conducted to study the effects of numerous factors on the convergence behavior and performance of these BMPRs. These factors include the number of hidden nodes used in the network and the annealing schedule. Simulations indicate that the temperature level of the annealing schedule significantly affects the convergence behavior of the training process and that, to achieve a balanced performance of these BMPRs, a medium to high level of annealing temperatures is recommended. Numerical results for cyclical and stratification patterns illustrate that the classification capability of these BMPRs is quite powerful.     

On the exact maximum likelihood inference of Fisher–Bingham distributions using an adjusted holonomic gradient method

Holonomic function theory has been successfully implemented in a series of recent papers to efficiently calculate the normalizing constant and perform likelihood estimation for the Fisher–Bingham distributions. A key ingredient for establishing the standard holonomic gradient algorithms is the calculation of the Pfaffian equations. So far, these papers either calculate these symbolically or apply certain methods to simplify this process. Here we show the explicit form of the Pfaffian equations using the expressions from Laplace inversion methods. This improves on the implementation of the holonomic algorithms for these problems and enables their adjustments for the degenerate cases. As a result, an exact and more dimensionally efficient ODE is implemented for likelihood inference.     

Nonparametric Forecasting in Time Series—A Comparative Study

The problem of predicting a future value of a time series is considered in this article. If the series follows a stationary Markov process, this can be done by nonparametric estimation of the autoregression function. Two forecasting algorithms are introduced. They only differ in the nonparametric kernel-type estimator used: the Nadaraya-Watson estimator and the local linear estimator. There are three major issues in the implementation of these algorithms: selection of the autoregressor variables, smoothing parameter selection, and computing prediction intervals. These have been tackled using recent techniques borrowed from the nonparametric regression estimation literature under dependence. The performance of these nonparametric algorithms has been studied by applying them to a collection of 43 well-known time series. Their results have been compared to those obtained using classical Box-Jenkins methods. Finally, the practical behavior of the methods is also illustrated by a detailed analysis of two data sets.     

On several estimates to the precision parameter of Dirichlet process prior

The article presents careful comparisons among several empirical Bayes estimates to the precision parameter of Dirichlet process prior, with the setup of univariate observations and multigroup data. Specifically, the data are equipped with a two-stage compound sampling model, where the prior is assumed as a Dirichlet process that follows within a Bayesian nonparametric framework. The precision parameter α measures the strength of the prior belief and kinds of estimates are generated on the basis of observations, including the naive estimate, two calibrated naive estimates, and two different types of maximum likelihood estimates stemming from distinct distributions. We explore some theoretical properties and provide explicitly detailed comparisons among these estimates, in the perspectives of bias, variance, and mean squared error. Besides, we further present the corresponding calculation algorithms and numerical simulations to illustrate our theoretical achievements.     

Asymptotic Theory of Outlier Detection Algorithms for Linear Time Series Regression Models

Outlier detection algorithms are intimately connected with robust statistics that down‐weight some observations to zero. We define a number of outlier detection algorithms related to the Huber‐skip and least trimmed squares estimators, including the one‐step Huber‐skip estimator and the forward search. Next, we review a recently developed asymptotic theory of these. Finally, we analyse the gauge, the fraction of wrongly detected outliers, for a number of outlier detection algorithms and establish an asymptotic normal and a Poisson theory for the gauge.     

On the Value of derivative evaluations and random walk suppression in Markov Chain Monte Carlo algorithms

Two strategies that can potentially improve Markov Chain Monte Carlo algorithms are to use derivative evaluations of the target density, and to suppress random walk behaviour in the chain. The use of one or both of these strategies has been investigated in a few specific applications, but neither is used routinely. We undertake a broader evaluation of these techniques, with a view to assessing their utility for routine use. In addition to comparing different algorithms, we also compare two different ways in which the algorithms can be applied to a multivariate target distribution. Specifically, the univariate version of an algorithm can be applied repeatedly to one-dimensional conditional distributions, or the multivariate version can be applied directly to the target distribution.