On the Tightness of Semidefinite Relaxations for Certifying Robustness to Adversarial Examples.

Richard Y. Zhang

Published in: NeurIPS (2020)

Keyphrases

semidefinite
semidefinite programming
sufficient conditions
convex relaxation
interior point methods
higher dimensional
lower bound
training examples
convex sets
feature selection
linear programming