MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Learning graphical models from the Glauber dynamics

Author(s)
Bresler, Guy; Gamarnik, David; Shah, Devavrat
Thumbnail
DownloadGamarnik_Learning graphical.pdf (206.6Kb)
OPEN_ACCESS_POLICY

Open Access Policy

Creative Commons Attribution-Noncommercial-Share Alike

Terms of use
Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/
Metadata
Show full item record
Abstract
In this paper we consider the problem of learning undirected graphical models from data generated according to the Glauber dynamics. The Glauber dynamics is a Markov chain that sequentially updates individual nodes (variables) in a graphical model and it is frequently used to sample from the stationary distribution (to which it converges given sufficient time). Additionally, the Glauber dynamics is a natural dynamical model in a variety of settings. This work deviates from the standard formulation of graphical model learning in the literature, where one assumes access to i.i.d. samples from the distribution. Much of the research on graphical model learning has been directed towards finding algorithms with low computational cost. As the main result of this work, we establish that the problem of reconstructing binary pairwise graphical models is computationally tractable when we observe the Glauber dynamics. Specifically, we show that a binary pairwise graphical model on p nodes with maximum degree d can be learned in time f(d)p[superscript 3] log p, for a function f(d), using nearly the information-theoretic minimum possible number of samples. There is no known algorithm of comparable efficiency for learning arbitrary binary pairwise models from i.i.d. samples.
Date issued
2014-09
URI
http://hdl.handle.net/1721.1/98837
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Sloan School of Management
Journal
Proceedings of the 2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Bresler, Guy, David Gamarnik, and Devavrat Shah. “Learning Graphical Models from the Glauber Dynamics.” 2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton) (September 2014).
Version: Author's final manuscript
ISBN
978-1-4799-8009-3

Collections
  • MIT Open Access Articles

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.