Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing 2018
DOI: 10.1145/3209582.3209600
|View full text |Cite
|
Sign up to set email alerts
|

Learning Data Dependency with Communication Cost

Abstract: In this paper, we consider the problem of recovering a graph that represents the statistical data dependency among nodes for a set of data samples generated by nodes, which provides the basic structure to perform an inference task, such as MAP (maximum a posteriori). This problem is referred to as structure learning. When nodes are spatially separated in different locations, running an inference algorithm requires a non-negligible amount of message passing, incurring some communication cost. We inevitably have… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 32 publications
0
2
0
Order By: Relevance
“…The error exponent of Chow-Liu algorithm is analyzed in [8], [9], and [23] for tree-structured discrete distribution, continuous distribution, and tree-structured Ising model with side information, respectively. The tree-structured graphical models are learned in the decentralized system [10] with Gaussian random variables and the fully distributed system [15] with binary random variables under communication constraints. Tavassolipour et al study the structure learning problem where the data set is distributed vertically across machines [10].…”
Section: A Motivation and Literature Reviewmentioning
confidence: 99%
See 1 more Smart Citation
“…The error exponent of Chow-Liu algorithm is analyzed in [8], [9], and [23] for tree-structured discrete distribution, continuous distribution, and tree-structured Ising model with side information, respectively. The tree-structured graphical models are learned in the decentralized system [10] with Gaussian random variables and the fully distributed system [15] with binary random variables under communication constraints. Tavassolipour et al study the structure learning problem where the data set is distributed vertically across machines [10].…”
Section: A Motivation and Literature Reviewmentioning
confidence: 99%
“…Our proposed bounds are evaluated on synthetic data sets, and similar data sets have been used in literature such as [9]- [15], [18].…”
Section: Paper Organization and Notationsmentioning
confidence: 99%