On the convergence of gaussian belief propagation with nodes of arbitrary size
| dc.contributor.author | Kamper, Francois | en_ZA |
| dc.contributor.author | Steel, Sarel J. | en_ZA |
| dc.contributor.author | Du Preez, Johan A. | en_ZA |
| dc.date.accessioned | 2021-12-01T07:07:03Z | |
| dc.date.available | 2021-12-01T07:07:03Z | |
| dc.date.issued | 2019 | |
| dc.description | CITATION: Kamper, F., Steel, S. J. & Du Preez, J. A. 2019. On the convergence of Gaussian belief propagation with nodes of arbitrary size. Journal of Machine Learning Research, 20(165):1-37. | |
| dc.description | The original publication is available at http://jmlr.org | |
| dc.description.abstract | This paper is concerned with a multivariate extension of Gaussian message passing applied to pairwise Markov graphs (MGs). Gaussian message passing applied to pairwise MGs is often labeled Gaussian belief propagation (GaBP) and can be used to approximate the marginal of each variable contained in the pairwise MG. We propose a multivariate extension of GaBP (we label this GaBP-m) that can be used to estimate higher-dimensional marginals. Beyond the ability to estimate higher-dimensional marginals, GaBP-m exhibits better convergence behavior than GaBP, and can also provide more accurate univariate marginals. The theoretical results of this paper are based on an extension of the computation tree analysis conducted on univariate nodes to the multivariate case. The main contribution of this paper is the development of a convergence condition for GaBP-m that moves beyond the walk-summability of the precision matrix. Based on this convergence condition, we derived an upper bound for the number of iterations required for convergence of the GaBP-m algorithm. An upper bound on the dissimilarity between the approximate and exact marginal covariance matrices was established. We argue that GaBP-m is robust towards a certain change in variables, a property not shared by iterative solvers of linear systems, such as the conjugate gradient (CG) and preconditioned conjugate gradient (PCG) methods. The advantages of using GaBP-m over GaBP are also illustrated empirically. | en_ZA |
| dc.description.uri | https://www.jmlr.org/papers/v20/18-040.html | |
| dc.description.version | Publisher's version | |
| dc.format.extent | 37 pages ; illustrations | |
| dc.identifier.citation | Kamper, F., Steel, S. J. & Du Preez, J. A. 2019. On the convergence of Gaussian belief propagation with nodes of arbitrary size. Journal of Machine Learning Research, 20(165):1-37 | |
| dc.identifier.issn | 1533-7928 (online) | |
| dc.identifier.issn | 1532-4435 (print) | |
| dc.identifier.uri | http://hdl.handle.net/10019.1/123510 | |
| dc.language.iso | en_ZA | en_ZA |
| dc.publisher | Journal of Machine Learning Research | |
| dc.rights.holder | Authors retain copyright | |
| dc.subject | Gaussian distribution | en_ZA |
| dc.subject | Gaussian processes | en_ZA |
| dc.title | On the convergence of gaussian belief propagation with nodes of arbitrary size | en_ZA |
| dc.type | Article | en_ZA |