- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 3
Read review
Paper summary
This paper analyses monomial lower bounds for integer allocation problems; the authors supplement their theoretical results with experimental validation.
Critical strengths
None
Critical weaknesses
Readibility: This paper is extremely difficult to read and at first glance appears as thought the authors submitted the direct output of a conversation with ChatGPT or Claude. The abstract alone is written in an incomprehensible manner as in the second sentence, it introduces a function, with no relevant background, and compares it to a "monomial certificate". The rest of the paper fares little better on this front with numerous terms such as equality geometry, reusable monomials, and irreducible capacity tax. This strange use of notation and nomenclature becomes especially evident in the introduction, where a reading of the main results gives no insight into what the authors prove.
Novelty and Scope: The authors aim to present their work as providing a theoretical understanding when certain batch sizes should be used. Instead, the prove results concerning lower bounds for monomials, all the while giving no justification for why this class in particular is relevant to batching. Moreover, the text itself (lines 76-80) admits that the convex optimization ingredients are standard. This begs the question of where the technical novelty is. It appears to me their best result is a reformulation of the convex hull for their monomials of choice.
Questions for authors
Why is this setting relevant to the community at ICLR; the section why this matters does not even mention the headline setting of batching? See the weakness section.