__ Summary and Contributions__: The paper presents an approach for weighted sampling of keys by powers of their frequency, crucially without replacement, in the context of a sequence of data in which keys may appear multiple times. The technique works by transforming the inputs, reweighting by some random noise; then sampling consists of finding the top-k elements. This can be done using off-the-shelf sketch datastructures for finding heavy hitters. The authors present multiple variations on this approach and some experiments.

__ Strengths__: The authors make the point that their method took some cleverness to come up with and analyze, yet its actual implementation is very easy and uses only simple transformations of the input data combined with simple off-the-shelf tools (heavy hitters sketches are widely available). This seems to be the major strength of the work.

__ Weaknesses__: Although I don't have much background in the field, it seems like the scope of the work may be sort of narrow -- weighted sampling for data that cannot fit entirely in memory, where weights are scaled by a power, without replacement, in the case where keys may have negative updates to their weights, seems like an oddly specific problem setting. The authors do make the case that all these things may have practical relevance and previous work had not addressed all of them at once.

__ Correctness__: I was not able to evaluate the correctness of the proofs.
The empirical methodology seems sort of sparse (one toy distribution), but that's probably not the point of a sketching algorithms paper.

__ Clarity__: It is not especially clear -- it is certainly very dense with details and background facts about the algorithms used.
Note I have little background in the field, so while it was hard for me to read, maybe this is to be expected.

__ Relation to Prior Work__: Yes, there is a section on previous contributions that details various approaches to related problems. It seems like there are previous approaches for lp weighted WOR sampling that do not support negative updates for keys, and approaches for lp weighted sampling that do support negative updates but cannot do WOR. It might help to explicitly discuss which of these approaches are most similar in their implementations.

__ Reproducibility__: Yes

__ Additional Feedback__: A clearer outline up front about the progression from bottom k sampling to sampling by transformed frequency to picking the k keys using rHH would have been helpful, I think probably even for a better-informed audience than me.
I checked "yes" on the "broader impact" question even though that section is not included, because it seems clear this is a pure theory paper where the discussion is not necessary.
I didn't notice the pun in the title at first, but when I did notice it I chuckled slightly.
After author response:
Thanks to the authors for correcting my misunderstanding about the scope of the algorithms and relationship to previous work. After reading the reviews and author response, I find that the presentation of the paper is still very difficult to follow. These were the two main weaknesses, and my score remains the same (and is still low confidence).

__ Summary and Contributions__: This paper designs a new sketch for WithOut Replacement (WOR) of frequencies of keys from a multi-set stream, but proportional to the frequencies to the power p for p in [0,2].
In particular the algorithm should sample at most one item for each label in the multi-set (without replacement), since the goal is to understand the distribution of the frequencies. It can weight them to represent the frequencies.
The most interesting cases are p=0 (is it there or not), p=1 (total count), and p=2 (count squared -- related to l_2 norm errors). These are all covered in the meta-algorithms presented.
The algorithms are essentially:
- compute a rHH sketch of data elements, with weights transformed by ^p
(a rHH sketch is a heavy-hitters sketch with residual error -- all standard ones, CountMin, CountSketch, Misra-Gries) satisfy this.
- produce a sample from this sketch
- reweight the sampled items to account for bias/variance as possible.
The details of the weight transforms and the reweighting are a bit technical, and the rational for that is derived in the Supplement. But the algorithms are quite simple.

__ Strengths__: I like the results, I find them interesting and non-trivial.

__ Weaknesses__: But I have some reservation based on its tenuous connection to other core topics in NeurIPS, and the following concerns.
While this work has simple algorithms, the writing is a bit hard to follow since it is very notation heavy. There is a lot of background on previous works, and not all of them seem to be used, but I think contributes to the complex notation. I like that it is able to be described concretely and precisely in 8 pages, but I feel it would be more useful to introduce the simple algorithms first, and then elaborate on the analysis. Perhaps even a small algorithm block would have helped.
Also, it is not clear why *samples* are needed, instead of just using the original rHH sketches? If I am understanding the error bounds, they seem weaker than the existing rHH sketches -- please clarify what is added by using samples. All experiments are for p=1 or p=2 where there are well-known, tried-and-true rHH sketches.
All or almost all error from the new sketches appear to be over-estimates (Although quite small). It would be useful to see if using the MG sketch (which only under estimates) these may even balance better in case the sampling also contribute to over-estimates. Also it would be useful to also put the rHH sketches (without the added sampling sketch) as comparison in the experiments -- or to demonstrate or explain why they are not comparable.

__ Correctness__: I did not attempt to verify the proofs, but I have no reason to doubt the correctness.

__ Clarity__: Not really. See above.

__ Relation to Prior Work__: The concept referred to as "composable sketches" appears to be the same as the "mergeable summaries" in this paper:
https://www.researchgate.net/publication/254006519_Mergeable_Summaries
which in fact demonstrated it held for the various rHH sketches discussed.
Also, why not just use standard rHH sketches for this problem, what is the advantage for the most important cases of p=1 and p=2?

__ Reproducibility__: Yes

__ Additional Feedback__: --- after rebuttal ---
My concerns about the writing persist.
But the authors answered clearly my concerns about (1) fit, and (2) why sampling is better than just heavy hitters.
After the explanation, I like the title now :)

__ Summary and Contributions__: The paper proposes a method for sampling without replacement proportionally to a transformation x -> x^p on the frequency, that reduces the computation of a quantity to a few, important elements.

__ Strengths__: The work proposes a computationally efficient approach to efficient SWOR sampling.
The analysis seems thorough, though as stated in my confidence evaluation I did not understand it in depth. Though I am familiar with sampling theory, I am not familiar with the notions introduced in this work, and thus can hardly assess its significance and novelty.

__ Weaknesses__: I feel that the paper is not accessible enough for the NeurIPS community.
Many notions are properly introduced in the middle of the paper, which makes the paper rather obscure even to audience familiar with sampling. Specifically, I refer to:
- what is a negative update ?
- heavy hitters are only defined in 2.3. It seems that for a specific epsilon, any element can be a heavy hitter, so referring to a l_2 heavy hitter refers to any element,
- what is p ? Without context (e.g. in title, in "the case for p's) p refers to a probability but not here, \ell_p is already clearer.
- in the definition of composable sketches, the expression "data structures that are such that the desired output can be produced from the sketch" is not a clear definition.
--- After rebuttal ---
After reading the rebuttal and the other reviews, I still believe that: while the paper might be well-considered in a data mining conference, it is not accessible enough to the general ML community. For this reason, I still believe it should be rejected.
I don't believe the claim that distributed sketching appears significantly at all generalist ML conference, but in doubt I'll raise by score to weak reject.

__ Correctness__: I think the claims and method can be trusted.

__ Clarity__: Specific points:
- The legends of both Figure 1 and 2 are unreadable.
- Avoid inline fractions.
- The first equality below eq 2 is useless.

__ Relation to Prior Work__: The paper explains the relation to prior work, which seems to make its contribution clear for people that are very familiar to related work.

__ Reproducibility__: Yes

__ Additional Feedback__: