Name
Abstract | ||
|---|---|---|
This paper proposes a new algorithmic framework, predictor-verifier training, to train neural networks that are verifiable, i.e., networks that provably satisfy some desired input-output properties. The key idea is to simultaneously train two networks: a predictor network that performs the task at hand,e.g., predicting labels given inputs, and a verifier network that computes a bound on how well the predictor satisfies the properties being verified. Both networks can be trained simultaneously to optimize a weighted combination of the standard data-fitting loss and a term that bounds the maximum violation of the property. Experiments show that not only is the predictor-verifier architecture able to train networks to achieve state of the art verified robustness to adversarial examples with much shorter training times (outperforming previous algorithms on small datasets like MNIST and SVHN), but it can also be scaled to produce the first known (to the best of our knowledge) verifiably robust networks for CIFAR-10. |
Year | Venue | Field |
|---|---|---|
2018 | arXiv: Learning | Architecture,MNIST database,Robustness (computer science),Verifiable secret sharing,Artificial intelligence,Artificial neural network,Machine learning,Mathematics |
DocType | Volume | Citations |
Journal | abs/1805.10265 | 15 |
PageRank | References | Authors |
0.50 | 17 | 7 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Krishnamurthy Dvijotham | 1 | 187 | 26.90 |
| Sven Gowal | 2 | 100 | 14.85 |
| Robert Stanforth | 3 | 73 | 7.08 |
| Relja Arandjelovic | 4 | 1096 | 41.22 |
| Brendan O'Donoghue | 5 | 172 | 10.19 |
| Jonathan Uesato | 6 | 85 | 6.60 |
| Pushmeet Kohli | 7 | 7398 | 332.84 |