Bayesian linear models with unknown design over finite alphabets
Abstract
Our topic is the reconstruction of the unknown matrices S and{omega} for the multivariate linear model Y = S{omega} +{varepsilon} under the assumption that the entries of S are drawn from the finite alphabet [A] = 0, 1 and{omega} 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{omega} lead to the same reconstruction S{omega}, we introduce an order-preserving shrinkage prior to establish identifiability with respect to permutations.
02 /Specification & Classification
Click any tag to browse matching papersReproducibility ledger
Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.
Sign in to file a reproducibility report.
Related papers
- Multivariate Bayesian Inversion for Classification and Regression
Joram Soch, Carsten Allefeld·International Journal of Data Science and AnalyticsPeer-reviewed·Jun 25, 2026
- Joint Learning of Full-structure Noise in Hierarchical Bayesian Regression Models
Ali B. Hashemi, Chang Cai, … Stefan Haufe·IEEE Transactions on Medical ImagingPeer-reviewed·Nov 24, 2022
- Identifiability of Bayesian Models of Cognition
Michael Hahn, Entang Wang, Xue-Xin Wei·bioRxiv·Jun 25, 2025
- Bayes factor for linear mixed model in genetic association studies
Yongtao Guan, Daniel A Levy·Quantitative BiologyPeer-reviewed·Mar 15, 2026
- Hierarchical Bayesian Models of Reinforcement Learning: Introduction and comparison to alternative methods
Camilla van Geen, Raphael T. Gerraty·Journal of Mathematical PsychologyPeer-reviewed·Oct 18, 2021
- A Comment On Priors For Bayesian Occupancy Models
J. M. Northrup, B. D. Gerber·bioRxiv·May 17, 2017