Reliability Estimation Techniques for the Generalized Inverted Exponential Distribution Under Improved Adaptive Type‐II Progressive Censoring

In this research, the statistical inference of unknown lifetime parameters is proposed in the presence of independent competing risks using a progressive Type-II censored dataset. The lifetime distribution associated with a failure mode is assumed to follow the new Pareto distribution, with consideration given to two distinct competing failure reasons. Maximum likelihood estimators (MLEs) for the unknown model parameters, as well as reliability and hazard functions, are derived, noting that they are not expressible in closed form. The Newton–Raphson, expectation maximization (EM), and stochastic expectation maximization (SEM) methods are employed to generate maximum likelihood (ML) estimations. Approximate confidence intervals for the unknown parameters, reliability, and hazard rate functions are constructed using the normal approximation of the MLEs and the normal approximation of the log-transformed MLEs. Additionally, the missing information principle is utilized to derive the closed form of the Fisher information matrix, which, in turn, is used with the delta approach to calculate confidence intervals for reliability and hazards. Bayes estimators are derived under both symmetric and asymmetric loss functions, with informative and non-informative priors considered, including independent gamma distributions for informative priors. The Monte Carlo Markov Chain sampling approach is employed to obtain the highest posterior density credible intervals and Bayesian point estimates for unknown parameters and reliability characteristics. A Monte Carlo simulation is conducted to assess the effectiveness of the proposed techniques, with the performances of the Bayes and maximum likelihood estimations examined using average values and mean squared errors as benchmarks. Interval estimations are compared in terms of average lengths and coverage probabilities. Real datasets are considered and examined for each topic to provide illustrative examples.

<abstract><p>The Power Rayleigh distribution (PRD) is a new extension of the standard one-parameter Rayleigh distribution. To employ this distribution as a life model in the analysis of reliability and survival data, we focused on the statistical inference for the parameters of the PRD under the adaptive Type-II censored scheme. Point and interval estimates for the model parameters and the corresponding reliability function at a given time are obtained using likelihood, Bootstrap and Bayesian estimation methods. A simulation study is conducted in different settings of the life testing experiment to compare and evaluate the performance of the estimates obtained. In addition, the estimation procedure is also investigated in real lifetimes data. The results indicated that the obtained estimates gave an accurate and efficient estimation of the model parameters. The Bootstrap estimates are better than the estimates obtained by the likelihood estimation approach, and estimates obtained using the Markov Chain Monte Carlo method by the Bayesian approach under both the squared error and the general entropy loss functions have priority over other point and interval estimates. Under the adaptive Type-II censoring scheme, concluding results confirmed that the PRD can be effectively used to model the lifetimes in survival and reliability analysis.</p></abstract>

Global illumination algorithms using Markov chain Monte Carlo (MCMC) sampling are well-known for their efficiency in scenes with complex light transport. Samples in such algorithms are generated as a history of Markov chain states so that they are distributed according to the contributions to the image. The whole process is done based only on the information of the path contributions and user-defined transition probabilities from one state to the others. In light transport simulation, however, there is more information that can be used to improve the efficiency of path sampling. A notable example is multiple importance sampling (MIS) in bidirectional path tracing, which utilizes the probability densities of constructing a given path with different estimators. While MIS is a powerful ordinary Monte Carlo method, how to incorporate such additional information into MCMC sampling has been an open problem. We introduce a novel MCMC sampling framework, primary space serial tempering , which fuses the ideas of MCMC sampling and MIS for the first time. The key idea is to explore not only the sample space using a Markov chain, but also different estimators to generate samples by utilizing the information already available for MIS. Based on this framework, we also develop a novel rendering algorithm, multiplexed Metropolis light transport , which automatically and adaptively constructs paths with appropriate techniques as predicted by MIS. The final algorithm is very easy to implement, yet in many cases shows comparable (or even better) performance than significantly more complex MCMC rendering algorithms.

This article is a review article on the optimal Markov chain Monte Carlo (MCMC) sampling. The focus is on homogeneous Markov chains. This article first reviews the problem of finding the optimal transition matrix, which is defined to minimize the asymptotic variance of MCMC estimators. The article later reviews the locally optimal sampler (LOS), an MCMC sampling that performs local updates based on the optimal transition matrix. We conducted a simulation study to compare the LOS with the Metropolis–Hastings and the Gibbs Sampler. The LOS was shown to provide an improved rate of convergence over these two most popular sampling schemes. The implementation of the LOS requires only minor modifications in existing Gibbs sampling code. WIREs Comput Stat 2013. doi: 10.1002/wics.1265This article is categorized under: Statistical and Graphical Methods of Data Analysis > Markov Chain Monte Carlo (MCMC)

RNA exosomes are large multi-subunit protein complexes involved in controlled and processive 3' to 5' RNA degradation. Exosomes form large molecular chambers and harbor multiple nuclease sites as well as RNA binding regions. This makes a quantitative kinetic analysis of RNA degradation with reliable parameter and error estimates challenging. For instance, recent quantitative biochemical assays revealed that degradation speed and efficiency depend on various factors, such as the type of RNA binding caps and the RNA length. We propose the combination of a differential equation model with Bayesian Markov Chain Monte Carlo (MCMC) sampling for a more robust and reliable analysis of such complex kinetic systems. Using the exosome as a paradigm, it is shown that conventional “best fit” approaches to parameter estimation are outperformed by the MCMC method. The parameter distribution returned by MCMC sampling allows for a reliable and meaningful comparison of the data from different time series. In the case of the exosome, we find that the cap structures of the exosome have a direct effect on the recruitment and degradation of RNA, and that these effects are RNA length-dependent. The described approach can be widely applied to any processive reaction with a similar kinetics like the XRN1-dependent RNA degradation, RNA/DNA synthesis by polymerases, and protein synthesis by the ribosome.

Global fits of physics models require efficient methods for exploring high-dimensional and/or multimodal posterior functions. We introduce a novel method for accelerating Markov Chain Monte Carlo (MCMC) sampling by pairing a Metropolis-Hastings algorithm with a diffusion model that can draw global samples with the aim of approximating the posterior. We briefly review diffusion models in the context of image synthesis before providing a streamlined diffusion model tailored towards low-dimensional data arrays. We then present our adapted Metropolis-Hastings algorithm which combines local proposals with global proposals taken from a diffusion model that is regularly trained on the samples produced during the MCMC run. Our approach leads to a significant reduction in the number of likelihood evaluations required to obtain an accurate representation of the Bayesian posterior across several analytic functions, as well as for a physical example based on a global analysis of parton distribution functions. Our method is extensible to other MCMC techniques, and we briefly compare our method to similar approaches based on normalizing flows. A code implementation can be found at https://github.com/NickHunt-Smith/MCMC-diffusion.

We present a new galaxy survey simulation package, which combines the power of Markov Chain Monte Carlo (MCMC) sampling with a robust and adaptable model of galaxy evolution. The aim of this code is to aid in the characterization and study of new and existing galaxy surveys. In this paper we briefly describe the MCMC implementation and the survey simulation methodology and associated tools. A test case of this full suite was to constrain the evolution of the IR Luminosity Function (LF) based on the HerMES (Herschel SPIRE) survey of the Spitzer First Look Survey field. The initial results are consistent with previous studies, but our more general approach should be of wider benefit to the community.

Sampling technique is one of the asymptotically unbiased estimation approaches for inference in Bayesian probabilistic models. Markov chain Monte Carlo (MCMC) is a kind of sampling methods, which is widely used in the inference of complex probabilistic models. However, current MCMC methods can incur high autocorrelation of samples, which means that the samples generated by MCMC samplers are far from independent. In this paper, we propose the neural networks Langevin Monte Carlo (NNLMC) which makes full use of the flexibility of neural networks and the high efficiency of the Langevin dynamics sampling to construct a new MCMC sampling method. We propose the new update function to generate samples and employ appropriate loss functions to improve the performance of NNLMC during the process of sampling. We evaluate our method on a large diversity of challenging distributions and real datasets. Our results show that NNLMC is able to sample from the target distribution with low autocorrelation and rapid convergence, and outperforms the state-of-the-art MCMC samplers.

The point and interval estimations for the unknown parameters of an exponentiated half-logistic distribution based on adaptive type II progressive censoring are obtained in this article. At the beginning, the maximum likelihood estimators are derived. Afterward, the observed and expected Fisher’s information matrix are obtained to construct the asymptotic confidence intervals. Meanwhile, the percentile bootstrap method and the bootstrap-t method are put forward for the establishment of confidence intervals. With respect to Bayesian estimation, the Lindley method is used under three different loss functions. The importance sampling method is also applied to calculate Bayesian estimates and construct corresponding highest posterior density (HPD) credible intervals. Finally, numerous simulation studies are conducted on the basis of Markov Chain Monte Carlo (MCMC) samples to contrast the performance of the estimations, and an authentic data set is analyzed for exemplifying intention.

This study uses the adaptive Type-II progressively censored competing risks model to estimate the unknown parameters and the survival function of the Gompertz distribution. Where the lifetime for each failure is considered independent, and each follows a unique Gompertz distribution with different shape parameters. First, the Newton-Raphson method is used to derive the maximum likelihood estimators (MLEs), and the existence and uniqueness of the estimators are also demonstrated. We used the stochastic expectation maximization (SEM) method to construct MLEs for unknown parameters, which simplified and facilitated computation. Based on the asymptotic normality of the MLEs and SEM methods, we create the corresponding confidence intervals for unknown parameters, and the delta approach is utilized to obtain the interval estimation of the reliability function. Additionally, using two bootstrap techniques, the approximative interval estimators for all unknowns are created. Furthermore, we computed the Bayes estimates of unknown parameters as well as the survival function using the Markov chain Monte Carlo (MCMC) method in the presence of square error and LINEX loss functions. Finally, we look into two real data sets and create a simulation study to evaluate the efficacy of the established approaches.

In this paper, the statistical inference of the unknown parameters of a Burr Type III (BIII) distribution based on the unified hybrid censored sample is studied. The maximum likelihood estimators of the unknown parameters are obtained using the Expectation–Maximization algorithm. It is observed that the Bayes estimators cannot be obtained in explicit forms, hence Lindley's approximation and the Markov Chain Monte Carlo (MCMC) technique are used to compute the Bayes estimators. Further the highest posterior density credible intervals of the unknown parameters based on the MCMC samples are provided. The new model selection test is developed in discriminating between two competing models under unified hybrid censoring scheme. Finally, the potentiality of the BIII distribution to analyze the real data is illustrated by using the fracture toughness data of the three different materials namely silicon nitride (Si3N4), Zirconium dioxide (ZrO2) and sialon (Si6−xAlxOxN8−x). It is observed that for the present data sets, the BIII distribution has the better fit than the Weibull distribution which is frequently used in the fracture toughness data analysis.

The development of adequate models for binary time series data with covariate adjustment has been an active research area in the last years. In the case, where interest is focused on marginal and association parameters, generalized estimating equations (GEE) (see for example Lipsitz, Laird and Harrington (1991) and Liang, Zeger and Qaqish (1992)) and likelihood (see for example Fitzmaurice and Laird (1993) and Molenberghs and Lesaffre (1994)) based methods have been proposed. The number of parameters required for the full specification of these models grows exponentially with the length of the binary time series. Therefore, the analysis is often focused on marginal and first order parameters. In this case, the multivariate probit model (Ashford and Sowden (1970)) becomes an attractive alternative to the above models. The application of the multivariate probit model has been hampered by the intractability of the maximum likelihood estimator, when the length of the binary time series is large. This paper shows that this difficulty can be overcome by the use of Markov Chain Monte Carlo methods. This analysis also allows for valid point and interval estimates of the parameters in small samples. In addition, the analysis is adopted to handle the case of missing at random responses. The approach is illustrated on data involving binary responses measured at unequally spaced time points. Finally, this data analysis is compared to a GEE analysis given in Fitzmaurice and Lipsitz (1995).

A D-Wave quantum annealer (QA) having a 2048 qubit lattice, with no missing qubits and couplings, allowed embedding of a complete graph of a restricted Boltzmann machine (RBM). A handwritten digit OptDigits dataset having 8 × 7 pixels of visible units was used to train the RBM using classical contrastive divergence. Embedding of the classically trained RBM into the D-Wave lattice was used to demonstrate that the QA offers a high-efficiency alternative to the classical Markov chain Monte Carlo (MCMC) for reconstructing missing labels of the test images as well as a generative model on a classically trained RBM. At any training iteration, the D-Wave-based classification had classification error less than half of that in MCMC. The main goal of this study was to investigate the quality of the QA sample from the RBM model probability distribution and compare it to a classical MCMC during the Gibbs sampling traditionally used in RBM training. For the OptDigits dataset, the states in the D-Wave sample belonged to about twice as many local valleys (LVs) as in the MCMC sample. All the lowest energy (the highest joint probability), local minima in the MCMC sample were also found by the D-Wave. The D-Wave missed many of the higher-energy LVs, while also finding many “new” LVs consistently missed by the MCMC. It was established that the “new” LVs that the D-Wave finds are important for the model distribution in terms of the energy of the corresponding local minima, the width of the LVs and the height of the escape barrier.

In the context of Bayesian inversion for scientific and engineering modeling, Markov chain Monte Carlo (MCMC) sampling strategies have become the benchmark due to their flexibility and robustness in dealing with arbitrary posterior probability density functions (PDFs). However, these algorithms have been shown to be inefficient when sampling from high-dimensional posterior distributions or exhibit multimodality and/or strong parameter correlations. In such contexts, transitional MCMC (TMCMC) provides a more efficient alternative. Despite the recent applicability for Bayesian updating and model selection across a variety of disciplines, TMCMC may require a prohibitive number of tempering stages when the prior pdf is significantly different from the target posterior. Furthermore, the need to start with an initial set of samples from the prior distribution may present a challenge when dealing with implicit priors, e.g., based on feasible regions. Finally, TMCMC cannot be used for inverse problems with improper prior PDFs that represent a lack of prior knowledge on all or a subset of parameters. A generalization of TMCMC is proposed that alleviates such challenges and limitations toward providing a more robust and efficient tempering sampling strategy. We present convergence analysis, proving that the distance between the intermediate distributions and the target posterior distribution monotonically decreases as the algorithm proceeds. We also demonstrate the advantages of the proposed generalization through a series of test problems and an engineering application in the oil and gas industry.

This chapter provides a brief introduction to the use of Bayesian graphical models in R. In these models, parameters are treated as random quantities on an equal footing with the random variables. This allows complex stochastic systems to modeled, often using Markov chain Monte Carlo (MCMC) sampling methods. We first consider a series of examples, ranging from simple repeated sampling, linear regression models, random coefficient regression models, to the chest clinic example of Chap. 3. We formulate these as Bayesian graphical models, and represent them graphically in a compact form using plates. We then describe a special case, in which the unknown parameters are all discrete, and explain how probability propagation methods described in Chap. 3 may be used to compute the posterior distributions. We then turn to the general case, when MCMC sampling is required, and explain the computations involved in Metropolis-Hastings sampling and Gibbs sampling. Finally we illustrate a Bayesian linear regression analysis using the R2WinBUGS package.