Show simple item record

dc.contributor.authorDaskalakis, C
dc.contributor.authorDikkala, N
dc.contributor.authorJayanti, S
dc.date.accessioned2022-06-14T19:04:34Z
dc.date.available2022-06-14T19:04:34Z
dc.date.issued2018-01-01
dc.identifier.urihttps://hdl.handle.net/1721.1/143124
dc.description.abstract© 2018 Curran Associates Inc..All rights reserved. Asynchronous Gibbs sampling has been recently shown to be fast-mixing and an accurate method for estimating probabilities of events on a small number of variables of a graphical model satisfying Dobrushin's condition [DSOR16]. We investigate whether it can be used to accurately estimate expectations of functions of all the variables of the model. Under the same condition, we show that the synchronous (sequential) and asynchronous Gibbs samplers can be coupled so that the expected Hamming distance between their (multivariate) samples remains bounded by O(τ log n), where n is the number of variables in the graphical model, and τ is a measure of the asynchronicity. A similar bound holds for any constant power of the Hamming distance. Hence, the expectation of any function that is Lipschitz with respect to a power of the Hamming distance, can be estimated with a bias that grows logarithmically in n. Going beyond Lipschitz functions, we consider the bias arising from asynchronicity in estimating the expectation of polynomial functions of all variables in the model. Using recent concentration of measure results [DDK17, GLP17, GSS18], we show that the bias introduced by the asynchronicity is of smaller order than the standard deviation of the function value already present in the true model. We perform experiments on a multiprocessor machine to empirically illustrate our theoretical findings.en_US
dc.language.isoen
dc.relation.isversionofhttps://papers.nips.cc/paper/2018/hash/a5bfc9e07964f8dddeb95fc584cd965d-Abstract.htmlen_US
dc.rightsArticle is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.en_US
dc.sourceNeural Information Processing Systems (NIPS)en_US
dc.titleHogwild!-Gibbs can be panaccurateen_US
dc.typeArticleen_US
dc.identifier.citationDaskalakis, C, Dikkala, N and Jayanti, S. 2018. "Hogwild!-Gibbs can be panaccurate." Advances in Neural Information Processing Systems, 2018-December.
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
dc.contributor.departmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
dc.relation.journalAdvances in Neural Information Processing Systemsen_US
dc.eprint.versionFinal published versionen_US
dc.type.urihttp://purl.org/eprint/type/ConferencePaperen_US
eprint.statushttp://purl.org/eprint/status/NonPeerRevieweden_US
dc.date.updated2022-06-14T18:54:38Z
dspace.orderedauthorsDaskalakis, C; Dikkala, N; Jayanti, Sen_US
dspace.date.submission2022-06-14T18:54:40Z
mit.journal.volume2018-Decemberen_US
mit.licensePUBLISHER_POLICY
mit.metadata.statusAuthority Work and Publication Information Neededen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record