Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published May 2014 | public
Book Section - Chapter

Parameter identifiability in Sparse Bayesian Learning

Abstract

The problem of parameter identifiability in linear underdetermined models is addressed, where the observed data vectors follow a multivariate Gaussian distribution. The problem is underdetermined because the dimension of parameters characterizing the distribution of the data is larger than the dimension of the observed vectors. Such models arise frequently in Bayesian Compressive sensing and Sparse Bayesian Learning problems, where the parameter vector to be estimated, is assumed to be sparse. We establish explicit conditions for parameter identifiability in such models, by relating the ambient dimension of the hyperparameter space and that of the data. We establish a crucial result that in such underdetermined models, even without requiring the parameter to be sparse, it is possible to guarantee unique identifiability of the parameters as long as these two dimensions satisfy a certain condition. When such a condition is violated, the unconstrained statistical model is no more identifiable and additional constraints in the form of sparsity need to be enforced to recover the true parameter.

Additional Information

© 2014 IEEE. Work supported in parts by the ONR grant N00014-11-1-0676, and the California Institute of Technology.

Additional details

Created:
August 22, 2023
Modified:
October 19, 2023