- Rating
- 3(+1)
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 3
Read review
Paper summary
Suppose one wishes to sample from all possible allocations of objects into boxes, where each box has a capacity of at most . (Each of these numbers are integers). The authors consider a version of this problem which includes importance sampling terms inspired by exponential tilting and Ising/spin models. They observe that if the interaction between boxes depends only on some group totals in a manner which can be learned, then it is sufficient to first sample those totals and subsequently sample individual allocations conditional on them. They devise an algorithm which, conditioned on the group dependence, samples the allocations. Then they discuss how to learn the group dependence.
Critical strengths
Ultimately, the running time reduction is substantial, under the assumption. This is a major strength of the paper. The simplicity of Algorithm 1 is also a plus point, since its analysis was particularly easy.
Critical weaknesses
A critical weakness of the paper is that it fails to motivate practical scenarios under which the group dependence actually occurs. The experiments all come with the allocations that need to be learned, but there is no real-life scenario explained in the paper where the group dependence exists, but is not known beforehand. This applies, in particular, to situations where binary grouping is used.
In light of this, the contribution feels tangential to ongoing research. Furthermore, the introduction is tersely written and does not really bring out the separation between learning the group dependence, and then sampling once the group dependence is known: the writing needs to reflect this better.
Terms such as compiled interaction, remaining energy, macrostate, group-count law, source total, and membership swap are introduced rapidly and not within context.
These concerns have been addressed by the author's comments below
Questions for authors
a) Typographical error : in the graphics in page 2, the subscripts have not rendered, so it looks like instead of . Similar for .
b) I think the introduction and abstract contain a number of terms that require definition or explanation. For example, "A fixed total couples every variable in an integer allocation model" is a very terse statement, which can be replaced by "in an integer allocation model, under the constraint that the total number of slots are fixed, the occupancies of each slot become highly dependent on one another". I think you should be very clear about what you mean by "groups", and isolate the learning of group dependence from the actual sampling conditioned on the dependence itself.
c) I think you should check out Ankur Moitra et. al. "Steering diffusion models with quadratic rewards: a fine-grained analysis" : you will find some hardness results on generating from tilted distributions. Do see both the result and linked literature.
These questions have been addressed by the authors below. Since their addressal of the problem is sufficient, I have decided to raise my rating from 2 to 3.
d) Is there some theoretical result which can be provided on the accuracy of the ML scheme? Right now, I'm thinking why is this particular scheme chosen, so it could be validated not only by experiments but by basic results establishing asymptotic correctness and a rate of convergence.
Right now, I am marking this for a borderline rejection due to its writing primarily. I like the idea and I think it can be taken further, but need convincing that the rewrite required at this point for acceptance is not substantial.