Lower Bounds on Adversarial Robustness from Optimal Transport.
Arjun Nitin BhagojiDaniel CullinaPrateek MittalPublished in: NeurIPS (2019)
Keyphrases
- lower bound
- worst case
- optimal cost
- optimal solution
- upper bound
- dynamic programming
- branch and bound
- objective function
- branch and bound algorithm
- neural network
- multi agent
- computational efficiency
- optimal control
- provide an upper bound
- regret bounds
- constant factor
- asymptotically optimal
- closed form
- evolutionary algorithm
- feature selection