Negative Examples for Sequential Importance Sampling of Binary Contingency Tables

Details Negative Examples for Sequential Importance Sampling of Binary Contingency Tables Negative Examples for Sequential Importance Sampling of Binary Contingency Tables

2006-06-26

arxiv.org/abs/math/0606650v3

Mathematics

Statistics Theory

Scientific paper

The sequential importance sampling (SIS) algorithm has gained considerable popularity for its empirical success. One of its noted applications is to the binary contingency tables problem, an important problem in statistics, where the goal is to estimate the number of 0/1 matrices with prescribed row and column sums. We give a family of examples in which the SIS procedure, if run for any subexponential number of trials, will underestimate the number of tables by an exponential factor. This result holds for any of the usual design choices in the SIS algorithm, namely the ordering of the columns and rows. These are apparently the first theoretical results on the efficiency of the SIS algorithm for binary contingency tables. Finally, we present experimental evidence that the SIS algorithm is efficient for row and column sums that are regular. Our work is a first step in determining the class of inputs for which SIS is effective.

Affiliated with

Also associated with

No associations

Rating

Negative Examples for Sequential Importance Sampling of Binary Contingency Tables does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Negative Examples for Sequential Importance Sampling of Binary Contingency Tables, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Negative Examples for Sequential Importance Sampling of Binary Contingency Tables will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-400300