@percyliang Oops! I accidentally uploaded this test set to dolminos last November (fixed now: https://t.co/NN5iVDUwjU)!
And to be crystal clear -- Olmo2 never saw the test set, this was purely a mistake in uploading data for release!
@i_am_sidward @AlexGDimakis@docmilanfar (3/3)
3. Another promising direction is to use variants of randomized smoothing, which convolves the network output with some distribution (e.g. gaussian), for which you can also get lipschitz bounds for free
@i_am_sidward @AlexGDimakis@docmilanfar (2/3)
2. More promising is to design a net with stability in mind. There's some work which enforces the output net has Lip(f)<=1. Search "Lipschitz Neural Networks" on GScholar for some recent papers. You get worse performance, but get robustness guarantees for essentially free
@TheGregYang@AlexGDimakis (2/2)
The two main approaches that might be helpful are:
1) using loose upper bounds to quickly reject candidate polytopes
2) training the nets to be conducive to efficient verification (see also: https://t.co/PvrfS36io0)
@TheGregYang@AlexGDimakis (1/2) Unfortunately, if we want to deterministically compute the exact verification, we can't get around the hardness: so scaling will always be an issue for deep nets.
Wrote a paper about a geometric technique for exactly computing pointwise robustness of neural nets in arbitrary convex norms: to the best of my knowledge, this is the first complete/exact technique for computing l2 robustness.
New paper: Provable Certificates for Adversarial Examples: Fitting a Ball in the Union of Polytopes. Our geometry result: Polytopes for ReLu nets are `perfectly glued' i.e. partition space into a polyhedral complex.
https://t.co/XSVTP57QRo
Code: https://t.co/cIK7V0Z6dF
Our new preprint: Quantifying Perceptual Distortion of Adversarial Examples
https://t.co/zwEnZUSgdZ
which introduces a perceptual threat model and a PyTorch toolbox for adversarial ML. Meet #MisterEd
https://t.co/DPopNcuj39