Structure Learning of Sparse GGMs Over Multiple Access Networks.

Autor: Tavassolipour, Mostafa, Karamzade, Armin, Mirzaeifard, Reza, Motahari, Seyed Abolfazl, Manzuri Shalmani, Mohammad-Taghi
Předmět:
Zdroj: IEEE Transactions on Communications; Feb2020, Vol. 68 Issue 2, p987-997, 11p
Abstrakt: A central machine is interested in estimating the underlying structure of a sparse Gaussian Graphical Model (GGM) from a dataset distributed across multiple local machines. The local machines can communicate with the central machine through a wireless multiple access channel. In this paper, we are interested in designing effective strategies where reliable learning is feasible under power and bandwidth limitations. Two approaches are proposed: Signs and Uncoded methods. In the Signs method, the local machines quantize their data into binary vectors and an optimal channel coding scheme is used to reliably send the vectors to the central machine where the structure is learned from the received data. In the Uncoded method, data symbols are scaled and transmitted through the channel. The central machine uses the received noisy symbols to recover the structure. Theoretical results show that both methods can recover the structure with high probability for a large enough sample size. Experimental results indicate the superiority of the Signs method over the Uncoded method under several circumstances. [ABSTRACT FROM AUTHOR]
Databáze: Complementary Index