A Conditional Game for Comparing Approximations

AISTATS 2011 pp. 63-71

/aistats/2011/eaton2011aistats-conditional/

Abstract

We present a “conditional game” to be played between two approximate inference algorithms. We prove that exact inference is an optimal strategy and demonstrate how the game can be used to estimate the relative accuracy of two different approximations in the absence of exact marginals.

PDF AISTATS Semantic Scholar

Cite

Text

Eaton. "A Conditional Game for Comparing Approximations." Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics, 2011.

Markdown

[Eaton. "A Conditional Game for Comparing Approximations." Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics, 2011.](https://mlanthology.org/aistats/2011/eaton2011aistats-conditional/)

BibTeX

@inproceedings{eaton2011aistats-conditional,
  title     = {{A Conditional Game for Comparing Approximations}},
  author    = {Eaton, Frederik},
  booktitle = {Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics},
  year      = {2011},
  pages     = {63-71},
  volume    = {15},
  url       = {https://mlanthology.org/aistats/2011/eaton2011aistats-conditional/}
}