[Re] Subspace Attack: Exploiting Promising Subspaces for Query-Efficient Black-box Attacks

Dan Shaked Renous, Edoardo Debenedetti, Seyedeh Faezeh Nassajian Mojarrad

Abstract: As part of the NeurIPS 2019 Reproducibility Challenge, we chose to attempt reproduce the attack algorithm proposed in ``Subspace Attack: Exploiting Promising Subspaces for Query-Efficient Black-box Attacks''. Our reported results are better than the original paper in terms of the median number of queries per attack, but worse in terms of failure rate. A concise assessment of our implementation is also included.

Track: Replicability

NeurIPS Paper Id: https://openreview.net/forum?id=S1g-OVBl8r