Learning of Tree-Structured Gaussian Graphical Models on Distributed Data Under Communication Constraints

From MaRDI portal
Publication:4628161

DOI10.1109/TSP.2018.2876325zbMATH Open1414.62189arXiv1809.08067OpenAlexW2891030779WikidataQ114628355 ScholiaQ114628355MaRDI QIDQ4628161FDOQ4628161


Authors: Mostafa Tavassolipour, Seyed Abolfazl Motahari, Mohammad Taghi Manzuri Shalmani Edit this on Wikidata


Publication date: 6 March 2019

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Abstract: In this paper, learning of tree-structured Gaussian graphical models from distributed data is addressed. In our model, samples are stored in a set of distributed machines where each machine has access to only a subset of features. A central machine is then responsible for learning the structure based on received messages from the other nodes. We present a set of communication efficient strategies, which are theoretically proved to convey sufficient information for reliable learning of the structure. In particular, our analyses show that even if each machine sends only the signs of its local data samples to the central node, the tree structure can still be recovered with high accuracy. Our simulation results on both synthetic and real-world datasets show that our strategies achieve a desired accuracy in inferring the underlying structure, while spending a small budget on communication.


Full work available at URL: https://arxiv.org/abs/1809.08067




Recommendations








This page was built for publication: Learning of Tree-Structured Gaussian Graphical Models on Distributed Data Under Communication Constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4628161)