• Computer Science
  • Published in AAAI 2016

Exact Sampling with Integer Linear Programs and Random Perturbations

@inproceedings{Kim2016ExactSW,
  title={Exact Sampling with Integer Linear Programs and Random Perturbations},
  author={Carolyn Kim and Ashish Sabharwal and Stefano Ermon},
  booktitle={AAAI},
  year={2016}
}
We consider the problem of sampling from a discrete probability distribution specified by a graphical model. [...] Key Method Our technique, GumbelMIP, leverages linear programming (LP) relaxations to evaluate the quality of samples and prune large portions of the search space, and can thus scale to large tree-width models beyond the reach of current exact inference methods. Further, when the optimization problem is not solved to optimality, our method yields a novel approximate sampling technique. We…Expand Abstract

Citations

Publications citing this paper.
SHOWING 1-10 OF 16 CITATIONS

Adversarial Filters of Dataset Biases

VIEW 3 EXCERPTS
CITES METHODS & BACKGROUND

Fast Generating A Large Number of Gumbel-Max Variables

VIEW 1 EXCERPT
CITES BACKGROUND

Differentiable Subset Sampling

VIEW 1 EXCERPT
CITES BACKGROUND

Approximate Inference via Weighted Rademacher Complexity

VIEW 1 EXCERPT
CITES BACKGROUND

References

Publications referenced by this paper.
SHOWING 1-10 OF 27 REFERENCES

A* Sampling

VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

Exact sampling with integer linear programs and random perturbations

  • C. Kim, A. Sabharwal, S. Ermon
  • Technical report, Stanford University.
  • 2015
VIEW 1 EXCERPT

Machine learning - a probabilistic perspective

  • Kevin P. Murphy
  • Computer Science
  • Adaptive computation and machine learning series
  • 2012
VIEW 1 EXCERPT