- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This work addresses the generation of spatiotemporal event configurations under predefined count constraints over multiple regions that may overlap. The authors differentiate between the conservation of expected event counts and path-wise conservation for individual samples. The target conditional distribution is factorized into a distribution defined on feasible count tables, paired with a positional distribution conditioned on each such table. The proposed approach integrates a fitted Poisson-mixture table model with count-preserving position diffusion. For scenarios with overlapping constraints, the sampling procedure interleaves position denoising steps with null-space Metropolis–Hastings (MH) updates, which incorporate Markov-basis moves. Experiments on synthetic datasets, earthquake records, emergency call data and wildfire ignition events demonstrate performance gains compared with pipelines that first generate samples and then apply repair or projection post-processing.
Critical strengths
Joint budgets lock the full fine-grained count table, so performance gains under this setup serve as evidence validating the efficacy of the within-cell position model. The wildfire experiment further contrasts direct constrained sampling against post-generation projection with an identical network architecture, which corroborates the practical merit of the sampling trajectory itself. These control experiments reinforce the empirical arguments of the paper. Relevant content can be found on pages 8–9, Sections 5.2–5.3 and Figures 3–4.
Critical weaknesses
Proposition 4 proves that remains invariant under table updates with fixed proposal weights. Nevertheless, Algorithm 1 keeps updating the table throughout reverse denoising and uniformly resamples relocated events. At intermediate noise levels, the positions conditioned on a given table are typically non-uniform. Consequently, valid Metropolis–Hastings updates for the table do not inherently preserve the target joint distribution over tables and positions.
Even if the reference table probabilities are perfectly accurate and the reverse position kernels are exact, Proposition 4 alone cannot guarantee the correctness of this interleaved sampling scheme. The authors note on page 21 that the final position distribution may depend on the complete trajectory of table states. However, Equation (13) decomposes the total error yet fails to account for the extra positional bias introduced by interleaving table and position updates. Given that overlapping constraints constitute a core use case of this work, this theoretical gap substantially impacts the overall evaluation. Relevant discussion can be found on page 7, Section 4.3; pages 20–21, Appendices D.3–D.4; and Algorithm 1, line 9 on page 24.
Questions for authors
What joint target distribution corresponds to the interleaved table updates and uniform positional resampling steps described in Algorithm 1? If these update operations fail to exactly preserve the intermediate joint distribution, what theoretical analysis or empirical evidence demonstrates that the introduced extra bias is adequately small? Under the same computational budget allocated to table updates, do the main conclusions still hold if we first fully run table sampling to convergence, then fix the obtained table and reinitialize positions before performing position denoising?
2 comments
Dear Reviewer QQTb,
Thank you again for your careful reading of the sampler. Before the discussion period closes, we wanted to briefly check in on our revision.
Following your suggestion, we made the table-first sampler the default in Algorithm 1. Positions are now redrawn after the table chain finishes, so the joint target is explicit and the error in Eq. (13) splits into a table term and a position term.
At the same table-proposal budget, it gives nearly the same results as the interleaved sampler (Table S3). Our response above gives the revised algorithm and the full comparison.
If you have a moment, we would value your view on whether this resolves the theoretical gap you raised, and we are happy to discuss any remaining point.
Best regards,
The Authors
Response to Reviewer QQTb
Thank you for your thorough review and constructive feedback. We address your concerns below and hope these clarifications will help you re-evaluate and update the score:
We adopted your table-first sampler as the default, and at an equal proposal budget its results match the interleaved schedule (Table S3, Appendix E.3).
1. Joint target and interleaving
"What joint target distribution corresponds to the interleaved table updates and uniform positional resampling steps described in Algorithm 1?"
You are right that interleaving does not generally preserve the intended joint law of tables and noised positions, since Proposition 4 establishes invariance of the table distribution only. At intermediate noise levels positions given a table are not uniform, so uniformly relocating events after a table update need not keep that joint law.
Eq. (13) remains an exact decomposition of the actual output distribution, and its position term includes any interleaving error but does not isolate it. We adopt your table-first sampler, which makes the target explicit.
2. Revised sampler
"first fully run table sampling to convergence, then fix the obtained table and reinitialize positions before performing position denoising"
We have made this table-first variant the default and revised Algorithm 1 accordingly:
The independent redraw removes the position kernel's dependence on the table trajectory, so the output law has the form of Eq. (3),
PTFb=∑xwLb(x)Rθ(⋅∣x),
with wLb the table law after L proposals and Rθ the output law of the fixed-table position sampler. By Proposition 3, the error in Eq. (13) splits exactly into a table term and a position term. A chain that is too short can therefore only affect which table is chosen, not where events are placed within it.
3. Matched-budget comparison
"Under the same computational budget allocated to table updates, do the main conclusions still hold"
Yes, at equal table-proposal counts the two samplers give nearly identical results (Table S3, Appendix E.3). We compare them using the same five trained networks, 156 test weeks and five samples per week per network. Entries are interleaved → table-first, and "both" covers air-attack and helitack areas.
For weekly counts over both base types, the paired distance difference is 0.002, with a 95% paired block-bootstrap interval of [−0.004, 0.007]. The main comparisons in Table 3 remain unchanged. For example, table-first distance is 0.859 versus 0.980 for DSTPP + global projection.
4. Does the table chain mix adequately?
In our checks, the chain targets the right table law, and a longer chain leaves the results unchanged. To check whether the table chain mixes adequately within the finite proposal budget, we looked at three things.
Formally, with fixed proposal weights, Proposition 4 shows that the chain keeps our fitted table law wref(⋅∣b) invariant. With Markov-basis moves, it also converges geometrically from every feasible start.
Partition-budget sampling already fixes the table before position denoising, so Tables 1–2 are unaffected. We have updated Algorithm 1, Appendix D.3, and Table 3 accordingly.