- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 3
- Soundness
- 1
Read review
Paper summary
This paper studies neural network certification with affine relaxation and a W1 input set. It proposes a closed form solution for concretizing the bound given an affine inequality produced by existing affine relaxations to the W1 input set. It then did some evaluation for this method.
Critical strengths
The method is well-presented, the extension beyond Lp norm to translation etc is important, the closed form solution is sound, and the method is well-motivated.
Critical weaknesses
There is a deadly weakness: the main result has already been published as lemma 7 by Wegel et al. (https://arxiv.org/html/2110.06816v1#A1). I confirmed the equivalence between the results. In particular, although Wegel et al. studies a linear classifier, this work's result is also about concretizing a linear relaxation, so essentially equivalent. This equivalence is acknowledged by the authors in related work, while they argue their implementation is faster. I do not consider this as sufficient novelty, especially given the introduction clearly highlights that they contribute the closed-form solution without even mentioning the same result by Wegel et al.
The second main contribution mentioned in the introduction is also trivial. The bound from Wegel et al. can be trivially applied on any linear relaxation as well.
Further, the extension to geometric perturbations like translation is not new; see https://papers.nips.cc/paper_files/paper/2019/file/f7fa6aca028e7ff4ef62d75ed025fe76-Paper.pdf, but there is no demonstration about why the proposed W1 specification might be better for these perturbations which motivates the study (Line 45).
Questions for authors
See weakness. The authors should clearly highlight the difference between this work and the result of Wegel et al., and argue about its novelty.