SampleSearch: A Scheme That Searches for Consistent Samples
Abstract
Sampling from belief networks which have a substantial number of zero probabilities is problematic. MCMC algorithms like Gibbs sampling do not converge and importance sampling schemes generate many zero weight samples that are rejected, yielding an inefficient sampling process (the rejection problem). In this paper, we propose to augment importance sampling with systematic constraint-satisfaction search in order to overcome the rejection problem. The resulting SampleSearch scheme can be made unbiased by using a computationally expensive weighting scheme. To overcome this an approximation is proposed such that the resulting estimator is asymptotically unbiased. Our empirical results demonstrate the potential of our new scheme.
Cite
Text
Gogate and Dechter. "SampleSearch: A Scheme That Searches for Consistent Samples." Proceedings of the Eleventh International Conference on Artificial Intelligence and Statistics, 2007.Markdown
[Gogate and Dechter. "SampleSearch: A Scheme That Searches for Consistent Samples." Proceedings of the Eleventh International Conference on Artificial Intelligence and Statistics, 2007.](https://mlanthology.org/aistats/2007/gogate2007aistats-samplesearch/)BibTeX
@inproceedings{gogate2007aistats-samplesearch,
title = {{SampleSearch: A Scheme That Searches for Consistent Samples}},
author = {Gogate, Vibhav and Dechter, Rina},
booktitle = {Proceedings of the Eleventh International Conference on Artificial Intelligence and Statistics},
year = {2007},
pages = {147-154},
volume = {2},
url = {https://mlanthology.org/aistats/2007/gogate2007aistats-samplesearch/}
}