- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
The paper considers coresets for kernel density estimation. For different kernel functions, the question is how large a coreset is needed to approximate the kernel density estimate within error . The paper uses the known discrepancy approach, which constructs a coreset by repeatedly finding a low-discrepancy coloring and discarding half the points.For bounded data and fixed bandwidth, this yields Gaussian and Laplacian coresets of size , improving the previous factor. The paper also obtains bounds for unrestricted data in fixed dimension for other kernels.
Critical strengths
Kernel density estimation is an important problem both from a theoretical and practical perspective and several papers have considers coresets for the problem. It is nice that the paper improves the best known bounds for such coresets for several common kernels.
Critical weaknesses
It was very difficult for me to parse the paper. Theorems and definitions contain very complicated expressions that are explained in very little detail, e.g., I don't know how to think about the integrals of theorem 8 and 10. The core tools like Dudley's theorem and chaining which are highly technical concepts are defined but not explained. There is no technical overview, even though the proofs are highly technical, and many of the ideas needed in the proofs would need to be explained.
Unfortunately, I think that in the era of LLMs this kind of very technical theoretical paper is not of very high value, even though the theoretical results are interesting. If the authors for a different conference writes a paper which better explains what's going on, I would be more open to accepting the paper.
Also, the title of the paper in the pdf is currently "FORMATTING INSTRUCTIONS FOR ICLR 2027 CONFERENCE SUBMISSIONS". Not in itself a big issue, but it does give the idea that the manuscript might have been prepared very quickly perhaps with the help of some busy LLMs. Along the same note, the abstract uses concepts like chaining, which I don't think most readers would understand the meaning of here.
Finally, I believe that it is never introduced what the bandwidth parameter is even though it is used several times.
Questions for authors
What is the bandwidth parameter?
What are the lower bounds for the different kernel functions and how close are your upper bounds to matching those lower bounds?