Bayesian linear models with unknown design over finite alphabets
Preprint
Abstract
Our topic is the reconstruction of the unknown matrices S and ω for the multivariate linear model Y = Sω + ε under the assumption that the entries of S are drawn from the finite alphabet 𝔄 = 0, 1 and ω is a weight matrix. While a frequentist method has recently been proposed for this purpose, a Bayesian approach seems also desirable. We therefore provide a new hierarchical Bayesian method for this inferential task. Our approach provides estimates of the posterior that may be used to quantify uncertainty. Since matching permutations in both S and ω lead to the same reconstruction Sω , we introduce an order-preserving shrinkage prior to establish identifiability with respect to permutations.Keywords
This publication has 32 references indexed in Scilit:
- Maximum Likelihood Estimation of Frequencies of Known Haplotypes from Pooled Sequence DataMolecular Biology and Evolution, 2013
- Quantifying Selection Acting on a Complex Trait Using Allele Frequency Time Series DataMolecular Biology and Evolution, 2011
- Sparse Bayesian infinite factor modelsBiometrika, 2011
- PoolHap: Inferring Haplotype Frequencies from Pooled Samples by Next Generation SequencingPLOS ONE, 2011
- MaCH: using sequence and genotype data to estimate haplotypes and unobserved genotypesGenetic Epidemiology, 2010
- The Next Generation of Molecular Markers From Massively Parallel Sequencing of Pooled DNA SamplesGenetics, 2010
- Estimating population haplotype frequencies from pooled SNP data using incomplete database informationBioinformatics, 2009
- A Unified Approach to Genotype Imputation and Haplotype-Phase Inference for Large Data Sets of Trios and Unrelated IndividualsThe American Journal of Human Genetics, 2009
- Finite sample identifiability of multiple constant modulus sourcesIEEE Transactions on Information Theory, 2003
- Blind separation of synchronous co-channel digital signals using an antenna array. I. AlgorithmsIEEE Transactions on Signal Processing, 1996