arXiv Analytics

Sign in

arXiv:1302.6677 [cs.LG]AbstractReferencesReviewsResources

Taming the Curse of Dimensionality: Discrete Integration by Hashing and Optimization

Stefano Ermon, Carla P. Gomes, Ashish Sabharwal, Bart Selman

Published 2013-02-27Version 1

Integration is affected by the curse of dimensionality and quickly becomes intractable as the dimensionality of the problem grows. We propose a randomized algorithm that, with high probability, gives a constant-factor approximation of a general discrete integral defined over an exponentially large set. This algorithm relies on solving only a small number of instances of a discrete combinatorial optimization problem subject to randomly generated parity constraints used as a hash function. As an application, we demonstrate that with a small number of MAP queries we can efficiently approximate the partition function of discrete graphical models, which can in turn be used, for instance, for marginal computation or model selection.

Related articles: Most relevant | Search more
arXiv:1301.2269 [cs.LG] (Published 2013-01-10)
Learning the Dimensionality of Hidden Variables
arXiv:2007.04440 [cs.LG] (Published 2020-07-08)
On the relationship between class selectivity, dimensionality, and robustness
arXiv:1701.00831 [cs.LG] (Published 2017-01-03)
Collapsing of dimensionality