Skip to main content
Unpublished Paper
Monte Carlo MCMC: Efficient Inference by Approximate Sampling
  • Sameer Singh
  • Michael Wick
  • Andrew McCallum, University of Massachusetts - Amherst
Conditional random fields and other graphical models have achieved state of the art results in a variety of tasks such as coreference, relation extraction, data integration, and parsing. Increasingly, practitioners are using models with more complex structure---higher tree-width, larger fan-out, more features, and more data---rendering even approximate inference methods such as MCMC inefficient. In this paper we propose an alternative MCMC sampling scheme in which transition probabilities are approximated by sampling from the set of relevant factors. We demonstrate that our method converges more quickly than a traditional MCMC sampler for both marginal and MAP inference. In an author coreference task with over 5 million mentions, we achieve a 13 times speedup over regular MCMC inference.
Publication Date
This is the pre-published version harvested from CIIR.
Citation Information
Sameer Singh, Michael Wick and Andrew McCallum. "Monte Carlo MCMC: Efficient Inference by Approximate Sampling" (2012)
Available at: