On estimating a constrained bivariate random effects model for meta-analysis of test accuracy studies

Tailored meta-analysis uses setting-specific knowledge for the test positive rate and disease prevalence to constrain the possible values for a test's sensitivity and specificity. The constrained region is used to select those studies relevant to the setting for meta-analysis using an unconstrained bivariate random effects model (BRM). However, sometimes there may be no studies to aggregate, or the summary estimate may lie outside the plausible or “applicable” region. Potentially these shortcomings may be overcome by incorporating the constraints in the BRM to produce a constrained model. Using a penalised likelihood approach we developed an optimisation algorithm based on co-ordinate ascent and Newton-Raphson iteration to fit a constrained bivariate random effects model (CBRM) for meta-analysis. Using numerical examples based on simulation studies and real datasets we compared its performance with the BRM in terms of bias, mean squared error and coverage probability. We also determined the ‘closeness’ of the estimates to their true values using the Euclidian and Mahalanobis distances. The CBRM produced estimates which in the majority of cases had lower absolute mean bias and greater coverage probability than the BRM. The estimated sensitivities and specificity for the CBRM were, in general, closer to the true values than the BRM. For the two real datasets, the CBRM produced estimates which were in the applicable region in contrast to the BRM. When combining setting-specific data with test accuracy meta-analysis, a constrained model is more likely to yield a plausible estimate for the sensitivity and specificity in the practice setting than an unconstrained model.

Comparative Study of New and Traditional Estimators of a New Lifetime Model

In this article, we have studied the behavior of estimators of parameter of a new lifetime model, suggested by Maurya et al. (2016), obtained by using methods of moments, maximum likelihood, maximum product spacing, least squares, weighted least squares, percentile, Cramer-von-Mises, Anderson-Darling and Right-tailed Anderson-Darling. Comparison of the estimators has been done on the basis of their mean square errors, biases, absolute and maximum absolute differences between empirical and estimated distribution function and a newly proposed criterion. We have also obtained the asymptomatic confidence interval and associated coverage probability for the parameter.

Comparison of Performance of Recursive Partitioning Models and Parametric Imputation Models Based On Predictive Mean Matching In Multiple Imputation By Chained Equations, in Order to Impute The Missing Values of The Binary Outcome, in The Presence of An Interaction Effect

Background: Among the new multiple imputation methods, Multiple Imputation by Chained ‎Equations (MICE) is a ‎popular ‎approach for implementing multiple imputations because of its ‎flexibility. Our main focus in this study ‎is to ‎compare the performance of parametric ‎imputation models based on predictive mean matching and ‎recursive partitioning methods ‎in multiple imputation by chained equations in the ‎presence of interaction in the ‎data.Methods: We compared the performance of parametric and tree-based imputation methods via simulation using two data generation models. For each combination of data generation model and imputation method, the following steps were performed: data generation, removal of observations, imputation, logistic regression analysis, and calculation of bias, Coverage Probability (CP), and Confidence Interval (CI) width for each coefficient Furthermore, model-based and empirical SE, and estimated proportion of the variance attributable to the missing data (λ) were calculated.Results: ‎We have shown by simulation that to impute a binary response in ‎observations involving an ‎interaction, manually interring the interaction term into the imputation model in the ‎predictive mean matching ‎model improves the performance of the PMM method compared to the recursive partitioning models in ‎ ‎multiple imputation by chained equations.‎ The parametric method in which we entered the interaction model into the imputation model (MICE-‎‎‎Interaction) led to smaller bias, slightly higher coverage probability for the interaction effect, but it ‎had ‎slightly ‎wider confidence intervals than tree-based imputation (especially classification and ‎regression ‎trees). Conclusions: The application of MICE-Interaction led to better performance than ‎recursive ‎partitioning methods in MICE, although ‎the user is interested in estimating the interaction and does not ‎know ‎enough about the structure of the observations, recursive partitioning methods can be ‎suggested to impute ‎the ‎missing values.

Evaluating Dropout Placements in Bayesian Regression Resnet

Deep Neural Networks (DNNs) have shown great success in many fields. Various network architectures have been developed for different applications. Regardless of the complexities of the networks, DNNs do not provide model uncertainty. Bayesian Neural Networks (BNNs), on the other hand, is able to make probabilistic inference. Among various types of BNNs, Dropout as a Bayesian Approximation converts a Neural Network (NN) to a BNN by adding a dropout layer after each weight layer in the NN. This technique provides a simple transformation from a NN to a BNN. However, for DNNs, adding a dropout layer to each weight layer would lead to a strong regularization due to the deep architecture. Previous researches [1, 2, 3] have shown that adding a dropout layer after each weight layer in a DNN is unnecessary. However, how to place dropout layers in a ResNet for regression tasks are less explored. In this work, we perform an empirical study on how different dropout placements would affect the performance of a Bayesian DNN. We use a regression model modified from ResNet as the DNN and place the dropout layers at different places in the regression ResNet. Our experimental results show that it is not necessary to add a dropout layer after every weight layer in the Regression ResNet to let it be able to make Bayesian Inference. Placing Dropout layers between the stacked blocks i.e. Dense+Identity+Identity blocks has the best performance in Predictive Interval Coverage Probability (PICP). Placing a dropout layer after each stacked block has the best performance in Root Mean Square Error (RMSE).

Cellular coverage probability is independent of base station density under stochastic geometric models

We prove that under stochastic geometric modelling of cellular networks, the coverage probability is <i>not</i> a function of base stations density, contrary to widespread belief. That is, we reveal that the base station density, $\lambda$, that is appears in a plethora of published cellular coverage probability expressions is superfluous.<br>

Cellular coverage probability is independent of base station density under stochastic geometric models

We prove that under stochastic geometric modelling of cellular networks, the coverage probability is <i>not</i> a function of base stations density, contrary to widespread belief. That is, we reveal that the base station density, $\lambda$, that is appears in a plethora of published cellular coverage probability expressions is superfluous.<br>

Cellular coverage probability is independent of base station density under stochastic geometric models

Stochastic geometry (SG) has been extensively used to model cellular communications, under the assumption that the base stations (BS) are deployed as a Poisson point process in the Euclidean plane. This has spawned a huge number of articles over the past years for different scenarios, culminating in an equally huge number of expressions for the coverage probability in both the uplink (UL) and downink (DL) directions. The trouble is that those expressions include the BS density, $\lambda$, which we prove irrelevant in this article. We start by developing a SG model for a baseline cellular scenario, then prove that the coverage probability is independent of $\lambda$, contrary to popular belief.