scholarly journals Shrinkage priors for single-spiked covariance models

2021 ◽  
pp. 109127
Author(s):  
Michiko Okudo ◽  
Fumiyasu Komaki
Biometrika ◽  
2020 ◽  
Vol 107 (3) ◽  
pp. 745-752 ◽  
Author(s):  
Sirio Legramanti ◽  
Daniele Durante ◽  
David B Dunson

Summary The dimension of the parameter space is typically unknown in a variety of models that rely on factorizations. For example, in factor analysis the number of latent factors is not known and has to be inferred from the data. Although classical shrinkage priors are useful in such contexts, increasing shrinkage priors can provide a more effective approach that progressively penalizes expansions with growing complexity. In this article we propose a novel increasing shrinkage prior, called the cumulative shrinkage process, for the parameters that control the dimension in overcomplete formulations. Our construction has broad applicability and is based on an interpretable sequence of spike-and-slab distributions which assign increasing mass to the spike as the model complexity grows. Using factor analysis as an illustrative example, we show that this formulation has theoretical and practical advantages relative to current competitors, including an improved ability to recover the model dimension. An adaptive Markov chain Monte Carlo algorithm is proposed, and the performance gains are outlined in simulations and in an application to personality data.


Bernoulli ◽  
2010 ◽  
Vol 16 (3) ◽  
pp. 780-797 ◽  
Author(s):  
Martin Schlather

2021 ◽  
Author(s):  
Arinjita Bhattacharyya ◽  
Subhadip Pal ◽  
Riten Mitra ◽  
Shesh Rai

Abstract Background: Prediction and classification algorithms are commonly used in clinical research for identifying patients susceptible to clinical conditions like diabetes, colon cancer, and Alzheimer’s disease. Developing accurate prediction and classification methods have implications for personalized medicine. Building an excellent predictive model involves selecting features that are most significantly associated with the response at hand. These features can include several biological and demographic characteristics, such as genomic biomarkers and health history. Such variable selection becomes challenging when the number of potential predictors is large. Bayesian shrinkage models have emerged as popular and flexible methods of variable selection in regression settings. The article discusses variable selection with three shrinkage priors and illustrates its application to clinical data sets such as Pima Indians Diabetes, Colon cancer, ADNI, and OASIS Alzheimer’s data sets. Methods: We present a unified Bayesian hierarchical framework that implements and compares shrinkage priors in binary and multinomial logistic regression models. The key feature is the representation of the likelihood by a Polya-Gamma data augmentation, which admits a natural integration with a family of shrinkage priors. We specifically focus on the Horseshoe, Dirichlet Laplace, and Double Pareto priors. Extensive simulation studies are conducted to assess the performances under different data dimensions and parameter settings. Measures of accuracy, AUC, brier score, L1 error, cross-entropy, ROC surface plots are used as evaluation criteria comparing the priors to frequentist methods like Lasso, Elastic-Net, and Ridge regression. Results: All three priors can be used for robust prediction with significant metrics, irrespective of their categorical response model choices. Simulation study could achieve the mean prediction accuracy of 91% (95% CI: 90.7, 91.2) and 74% (95% CI: 73.8,74.1) for logistic regression and multinomial logistic models, respectively. The model can identify significant variables for disease risk prediction and is computationally efficient. Conclusions: The models are robust enough to conduct both variable selection and future prediction because of their high shrinkage property and applicability to a broad range of classification problems.


2014 ◽  
Vol 23 (03) ◽  
pp. 1460008
Author(s):  
Kevin Byron ◽  
Jason T. L. Wang ◽  
Dongrong Wen

Developing effective artificial intelligence tools to find motifs in DNA, RNA and proteins poses a challenging yet important problem in life science research. In this paper, we present a computational approach for finding RNA tertiary motifs in genomic sequences. Specifically, we predict genomic coordinate locations for coaxial helical stackings in 3-way RNA junctions. These predictions are provided by our tertiary motif search package, named CSminer, which utilizes two versatile methodologies: random forests and covariance models. A coaxial helical stacking tertiary motif occurs in a 3-way RNA junction where two separate helical elements form a pseudocontiguous helix and provide thermodynamic stability to the RNA molecule as a whole. Our CSminer tool first uses a genome-wide search method based on covariance models to find a genomic region that may potentially contain a coaxial helical stacking tertiary motif. CSminer then uses a random forests classifier to predict whether the genomic region indeed contains the tertiary motif. Experimental results demonstrate the effectiveness of our approach.


Sign in / Sign up

Export Citation Format

Share Document