Review for NeurIPS paper: Simple and Fast Algorithm for Binary Integer and Online Linear Programming

Weaknesses: - My primary concern is insufficient comparison with the existing literature on online LP, like the two works cited [Agrawal '14, Kesselheim et al. '14]: - The paper claims novelty in the sublihear competitive ratios obtained in those works of the form O(1 - \eps(m,n)), so that \eps(m,n) * OPT is the regret. From a glance at the works cited by [Agrawal '14], "Online stochastic packing applied to display ad allocation" [Feldman et al. '10] has an 1/OPT term in this competitive ratio, giving a sublinear regret bound. Some clarifying discussion is necessary here. Some discussion and a clearer comparison is necessary, since this line of work is so well-established. Some clarification about this would be appreciated; in any case, the manuscript should discuss this at greater depth.