Approximate computations for binary Markov random fields and their use in Bayesian models

Discrete Markov random fields form a natural class of models to represent images and spatial datasets. The use of such models is, however, hampered by a computationally intractable normalising constant. This makes parameter estimation and a fully Bayesian treatment of discrete Markov random fields difficult. We apply approximation theory for pseudo-Boolean functions to binary Markov random fields and construct approximations and upper and lower bounds for the associated computationally intractable normalising constant. As a by-product of this process we also get a partially ordered Markov model approximation of the binary Markov random field. We present numerical examples with both the pairwise interaction Ising model and with higher-order interaction models, showing the quality of our approximations and bounds. We also present simulation examples and one real data example demonstrating how the approximations and bounds can be applied for parameter estimation and to handle a fully Bayesian model computationally.     

A note on bounding monte carlo variances michael lavine

A density bounded class P of probability distributions on a space χ is the set of all probability distributions corresponding to probability densities bounded below by a given subprob-ability density and bounded above by a given superprobability density. Density bounded classes arise in robust Bayesian analysis (Lavine 1991) and also in Monte Carlo integration (Fishman Granovsky and Rubin 1989). Finding upper and lower bounds on the variance over all p? P allows one to bound the Monte Carlo variance. Fishman Granovsky and Rubin (1989) find bounds on the variance over all p ? P and also find the densities in P achieving those bounds in the case where χ is discrete; that is, where P is actually a set of probability mass functions. This article generalizes their result by showing how to bound the variance and find the densities achieving the bounds when χ is continuous.     

Efficient designs for constrained mixture experiments

Many practical experiments on mixtures (where the components sum to one) include additional lower or upper bounds on components, or on linear combinations of them. Usually theory cannot be used to obtain a good design, and algorithmic methods are necessary. Some of the available methods are discussed. Their performance is evaluated on some examples, and the form of the optimal design is investigated.     

Some bounds related to Harris family of distributions

As a lifetime distribution, Harris family of distributions are applied to the lifetime of a series system with random number of components. In this paper, properties of various ageing classes of mixtures of Harris family of distributions, where the tilt parameter of a Harris distribution is taken as a random variable, are studied. We obtain an upper bound for maximum error in evaluating its reliability function. Two bounds are also presented for survival function and expectation of the mixed Harris family. We also provide some interesting bounds for its residual survival function. Our results generalize several previous findings in this connection. Some illustrative examples are also provided.     

Lower bounds on expectations of positive L-statistics from without-replacement models

We consider samples drawn without replacement from finite populations. We establish optimal lower non-negative and upper non-positive bounds on the expectations of linear combinations of order statistics centered about the population mean in units generated by the population central absolute moments of various orders. We also specify the general results for important examples of sample extremes, Gini mean differences and sample range. The paper completes the results of Papadatos and Rychlik [2004. Bounds on expectations of L-statistics from without replacement samples. J. Statist. Plann. Inference 124, 317–336], where sharp negative lower and positive upper bounds on the expectations of the combinations were presented for the without-replacement samples.     

Bayesian prediction based on type-I censored data from a mixture of Burr type XII distribution and its reciprocal

This paper is concerned with the problem of obtaining Bayesian prediction bounds of future observables from a finite mixture of Burr type XII distribution with its reciprocal based on type-I censored data. We consider the one-sample and two-sample prediction schemes using the Markov chain Monte Carlo algorithm. Numerical examples are given to illustrate the procedures and the accuracy of prediction intervals is investigated via extensive Monte Carlo simulation.     

An improved algorithm for reliability bounds of multistate networks

Abstract

Indirect approaches based on minimal path vectors (d-MPs) and/or minimal cut vectors (d-MCs) are reported to be efficient for the reliability evaluation of multistate networks. Given the need to find more efficient evaluation methods for exact reliability, such techniques may still be cumbersome when the size of the network and the states of component are relatively large. Alternatively, computing reliability bounds can provide approximated reliability with less computational effort. Based on Bai’s exact and indirect reliability evaluation algorithm, an improved algorithm is proposed in this study, which provides sequences of upper and lower reliability bounds of multistate networks. Novel heuristic rules with a pre-specified value to filter less important sets of unspecified states are then developed and incorporated into the algorithm. Computational experiments comparing the proposed methods with an existing direct bounding algorithm show that the new algorithms can provide tight reliability bounds with less computational effort, especially for the proposed algorithm with heuristic L1.     

Lower Bounds for the Efficiency of Designs with Respect to the D-Criterion when the Observations are Correlated

In the general linear model consider the experimental design problem for the Gauß-Markov estimator or least squares estimator when the observations are correlated. We prove new formulas for the efficiency of an exact design with respect to the D-criterion. For models with intercept term, for example, these formulas are useful to derive better lower bounds for the efficiency than the bounds recently given for an arbitrary linear model. These bounds are applied in examples to symmetrical regular circulants as covariance matrices. A byproduct of the investigations is some insight as to what kinds of designs might retain their optimality or high efficiency (for the uncorrelated homoscedastic case) under correlated observations.     

Bayesian and frequentist prediction limits for the Poisson distribution

Prediction limits for Poisson distribution are useful in real life when predicting the occurrences of some phenomena, for example, the number of infections from a disease per year among school children, or the number of hospitalizations per year among patients with cardiovascular disease. In order to allocate the right resources and to estimate the associated cost, one would want to know the worst (i.e., an upper limit) and the best (i.e., the lower limit) scenarios. Under the Poisson distribution, we construct the optimal frequentist and Bayesian prediction limits, and assess frequentist properties of the Bayesian prediction limits. We show that Bayesian upper prediction limit derived from uniform prior distribution and Bayesian lower prediction limit derived from modified Jeffreys non informative prior coincide with their respective frequentist limits. This is not the case for the Bayesian lower prediction limit derived from a uniform prior and the Bayesian upper prediction limit derived from a modified Jeffreys prior distribution. Furthermore, it is shown that not all Bayesian prediction limits derived from a proper prior can be interpreted in a frequentist context. Using a counterexample, we state a sufficient condition and show that Bayesian prediction limits derived from proper priors satisfying our condition cannot be interpreted in a frequentist context. Analysis of simulated data and data on Atlantic tropical storm occurrences are presented.     

Bayesian prediction with a random sample size for the burr lifetime distribution

This paper is concerned with the problem of deriving Bayesian prediction bounds for the Burr distribution when the sample size is a random variable. Prediction bounds for both the future observations (the case of two-sample prediction) and the remaining observations in the same sample (the case of one-sample prediction) will be derived. The analysis will depend mainly on assuming that the size of the sample is a random variable having the Poisson distribution. Finally, numerical examples are given to illustrate the results.     

A simulation approach to convergence rates for Markov chain Monte Carlo algorithms

Markov chain Monte Carlo (MCMC) methods, including the Gibbs sampler and the Metropolis–Hastings algorithm, are very commonly used in Bayesian statistics for sampling from complicated, high-dimensional posterior distributions. A continuing source of uncertainty is how long such a sampler must be run in order to converge approximately to its target stationary distribution. A method has previously been developed to compute rigorous theoretical upper bounds on the number of iterations required to achieve a specified degree of convergence in total variation distance by verifying drift and minorization conditions. We propose the use of auxiliary simulations to estimate the numerical values needed in this theorem. Our simulation method makes it possible to compute quantitative convergence bounds for models for which the requisite analytical computations would be prohibitively difficult or impossible. On the other hand, although our method appears to perform well in our example problems, it cannot provide the guarantees offered by analytical proof.     

D-optimal minimax design criterion for two-level fractional factorial designs

A D-optimal minimax design criterion is proposed to construct two-level fractional factorial designs, which can be used to estimate a linear model with main effects and some specified interactions. D-optimal minimax designs are robust against model misspecification and have small biases if the linear model contains more interaction terms. When the D-optimal minimax criterion is compared with the D-optimal design criterion, we find that the D-optimal design criterion is quite robust against model misspecification. Lower and upper bounds derived for the loss functions of optimal designs can be used to estimate the efficiencies of any design and evaluate the effectiveness of a search algorithm. Four algorithms to search for optimal designs for any run size are discussed and compared through several examples. An annealing algorithm and a sequential algorithm are particularly effective to search for optimal designs.     

Robust bayesian analysis given bounds on the probability of a set

Suppose that just the lower and the upper bounds on the probability of a measurable subset K in the parameter space ω are a priori known. Instead of eliciting a unique prior probability measure, consider the class Γ of all the probability measures compatible with such bounds. Under mild regularity conditions about the likelihood function, both prior and posterior bounds on the expected value of any function of the unknown parameter ω are computed, as the prior measure varies in Γ. Such bounds are analysed according to the robust Bayesian viewpoint. Furthermore, lower and upper bounds on the Bayes factor are corisidered. Finally, the local sensitivity analysis is performed, considering the class Γ as a aeighbourhood of an elicited prior     

Comparison of dispersions of mixtures of ordered distributions

In the paper we consider mixtures of unknown stochastically ordered distribution functions according to known mixing distribution functions. We provide optimal lower and upper bounds on ratios of general dispersion measures of such mixtures. The bounds do not depend on the particular form of dispersion measure. We present applications of the results in reliability theory, insurance mathematics, Bayesian statistics, and regression analysis.     

Bayesian neural tree models for nonparametric regression

Frequentist and Bayesian methods differ in many aspects but share some basic optimal properties. In real-life prediction problems, situations exist in which a model based on one of the above paradigms is preferable depending on some subjective criteria. Nonparametric classification and regression techniques, such as decision trees and neural networks, have both frequentist (classification and regression trees (CARTs) and artificial neural networks) as well as Bayesian counterparts (Bayesian CART and Bayesian neural networks) to learning from data. In this paper, we present two hybrid models combining the Bayesian and frequentist versions of CART and neural networks, which we call the Bayesian neural tree (BNT) models. BNT models can simultaneously perform feature selection and prediction, are highly flexible, and generalise well in settings with limited training observations. We study the statistical consistency of the proposed approaches and derive the optimal value of a vital model parameter. The excellent performance of the newly proposed BNT models is shown using simulation studies. We also provide some illustrative examples using a wide variety of standard regression datasets from a public available machine learning repository to show the superiority of the proposed models in comparison to popularly used Bayesian CART and Bayesian neural network models.     

Lower bounds on Bayes risks for estimating a normal variance: With applications

Brown and Gajek (1990) gave useful lower bounds on Bayes risks, which improve on earlier bounds by various authors. Many of these use the information inequality. For estimating a normal variance using the invariant quadratic loss and any arbitrary prior on the reciprocal of the variance that is a mixture of Gamma distributions, we obtain lower bounds on Bayes risks that are different from Borovkov-Sakhanienko bounds. The main tool is convexity of appropriate functionals as opposed to the information inequality. The bounds are then applied to many specific examples, including the multi-Bayesian setup (Zidek and his coauthors). Subsequent use of moment theory and geometry gives a number of new results on efficiency of estimates which are linear in the sufficient statistic. These results complement earlier results of Donoho, Liu and MacGibbon (1990), Johnstone and MacGibbon (1992) and Vidakovic and DasGupta (1994) for the location case.     

Sharp bounds on the expectations of L-statistics expressed in the Gini mean difference units

We describe a method of calculating sharp lower and upper bounds on the expectations of arbitrary, properly centered L-statistics expressed in the Gini mean difference units of the original i.i.d. observations. Precise values of bounds are derived for the single-order statistics, their differences, and some examples of L-estimators. We also present the families of discrete distributions which attain the bounds, possibly in the limit.     

Nonparametric Estimation of Bounded Survival Functions with Censored Observations

Stochastic ordering of survival functions is a useful concept in many areas of statistics, especially in nonparametric and order restricted inferences. In this paper we introduce an algorithm to compute maximum likelihood estimates of survival functions where both upper and lower bounds are given. The algorithm allows censored survival data. In a simulation study, we found that the proposed estimates are more efficient than the unrestricted Kaplan-Meier product limit estimates both with and without censored observations.     

Bayesian sequential analysis for multiple-arm clinical trials

Use of full Bayesian decision-theoretic approaches to obtain optimal stopping rules for clinical trial designs typically requires the use of Backward Induction. However, the implementation of Backward Induction, apart from simple trial designs, is generally impossible due to analytical and computational difficulties. In this paper we present a numerical approximation of Backward Induction in a multiple-arm clinical trial design comparing k experimental treatments with a standard treatment where patient response is binary. We propose a novel stopping rule, denoted by τ ^p , as an approximation of the optimal stopping rule, using the optimal stopping rule of a single-arm clinical trial obtained by Backward Induction. We then present an example of a double-arm (k=2) clinical trial where we use a simulation-based algorithm together with τ ^p to estimate the expected utility of continuing and compare our estimates with exact values obtained by an implementation of Backward Induction. For trials with more than two treatment arms, we evaluate τ ^p by studying its operating characteristics in a three-arm trial example. Results from these examples show that our approximate trial design has attractive properties and hence offers a relevant solution to the problem posed by Backward Induction.     

Prediction bounds for the burr model

Given a type 2 censored sample from the Burr life time distribution, Bayesian prediction bounds are derived for future observations. An approximate Bayesian method has been used to simplify the computation of the prediction bounds. Numerical examples are used to illustrate the procedures.