Scalable mean-field sparse Bayesian learning

View Researcher's Other Codes

Disclaimer: The provided code links for this paper are external links. Science Nest has no responsibility for the accuracy, legality or content of these links. Also, by downloading this code(s), you agree to comply with the terms of use as set out by the author(s) of the code(s).

Please contact us in case of a broken link from here

Authors Bradley Worley
Journal/Conference Name I
Paper Category
Paper Abstract Sparse Bayesian learning is a powerful framework for expressing compressed sensing problems in the language of Bayesian inference, but its principal algorithm-the variational relevance vector machine-is matrix-bound and scales poorly to larger problem sizes. Recent approaches to construct more computationally efficient methods of variational inference in the sparse Bayesian learning framework either scale poorly with the problem size or fail to minimize the correct variational objective. This work demonstrates an efficient matrix-free algorithm for sparse Bayesian learning that scales well to large problems, converges at a rate competetive with existing fast methods, and provably descends on the correct mean-field objective.
Date of publication 2019
Code Programming Language Python
Comment

Copyright Researcher 2022