- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
The paper shows that Gumbel sampling method could maintain the consistency of the result under deletion. In particular, if we consider generating a sample from a finite state space and use Gumbel sampling, dropping one element from the state space will still give the same realization under the same random seed.
Critical strengths
N/A
Critical weaknesses
This paper is an AI slop. The introduction and abstract are full of incoherent arguments, self-invented composite terms and unnatural pharses. I suggest the authors put some human effort on the paper before submitting it to any human reviewed conference.
I'll cite one paragraph in their introduction as an example:
Line 50-55: "The proof derives a common race representation from agreement constraints on an arbitrary measurable sampler. Deletion optimality first forces the winner to survive every nonwinner deletion. Three-label distributions then connect binary comparisons. If a label wins at lower odds but loses at higher odds, these connections propagate the reversal along a geometric chain. At its endpoints, exact marginal probabilities make that reversal arbitrarily unlikely. Nested binary comparisons yield random thresholds; consistency across triples makes these thresholds ratios of common scores. Finally, exact categorical marginals identify the exponential-ratio law."
As a proof overview shown in the first page, I have no idea about what "race representation", "nonwinner deletion" and " propagate the reversal along a geometric chain" means.
Questions for authors
N/A
2 comments
I thank the reviewer's thoughtful response and all the extra effort they have made. However, my concerns about the readability still remains. The response and the revised content still seems to be heavily AI-generated and has low quality. To justify my argument, I would like to use their modified abstract as a concrete example.
Line 11-16: "A shared-randomness sampler maps a probability distribution on a set of labels, together with a random seed, to a label distributed according to . When one seed is used for every input, the outputs for different inputs are coupled, and the probability that two inputs produce the same label (their agreement) is what matters in correlated sampling, counterfactual generation, watermarking and drafterinvariant speculative decoding. "
"shared-randomness" is irrelevant to the definition of sampler in the first sentence and the definition of "shared-randomness sampelr" is never explicitly given in the main text of this paper and such a term shows up in the first sentence of the abstract and the core theorem placed in the first page.
"one seed is used for every input" is also vague and the motivation of "two inputs produce the same label (their agreement) is what matters" is not clearly justified. The implication here is: "Let be a sampler take a random seed and a target distribution as input, when is randomly drawn from a (rather easier) distribution, the distribution of the output of is . In practice, when and are close, we expect the sampler have some level of consistency: When use the same seed to draw from and , the output should agree with each other more. Such consistency is usefuly and has wide applications on other fields..."
It takes siginificant amount of intermediate reasoning to understand those narratives and such efforts in my opinion is not necessary for understanding the content. Such issues should be carefully resolved by human rewriting and understanding before the paper being submitted to any human-reviewed conference.
Response to Reviewer Pn9v
Response to Reviewer Pn9v
Thank you for quoting lines 50–55. You are right that the submitted Abstract and Introduction were poorly written and obscured what the paper proves; we rewrote both from scratch in standard terminology (Abstract, lines 11–31; Sec. 1, lines 34–115) so the converse claim—that optimal deletion agreement on at least three labels forces Gumbel's joint law—is clear upfront.
Response: We rewrote both sections (lines 11–31, 34–115) and standardized notation (Defs. 1–3, Table 1, lines 123–176):
Response: Submitted lines 50–55 were opaque; we replaced those phrases and rewrote the passage as a five-step "Proof roadmap" (Sec. 1, lines 104–115; Fig. 2, lines 270–285):
"race representation""nonwinner deletion""propagate the reversal..."Before (submitted lines 50–55):
After (revised Sec. 1 "Proof roadmap", lines 104–115):
Thank you again for this feedback.