Fetching the paper…
Reading the bibliography…
State-of-the-art neural network verifiers are fundamentally based on one of two paradigms: either encoding the whole verification problem via tight multi-neuron convex relaxations or applying a Branch-and-Bound (BaB) procedure leveraging imprecise but fast bounding methods on a large number of easier subproblems.
Econometrica , 28(3), 1960
An automatic method of solving discrete programming problems · 1960
Earlier work this paper cites.
Finding cuts in the tsp (a preliminary report)
David Applegate, Robert Bixby, Vašek Chvátal, and William Cook · 1995
Earlier work this paper cites.
Learning multiple layers of features from tiny images
Alex Krizhevsky, Geoffrey Hinton, et al · 2009
Earlier work this paper cites.
The mnist database of handwritten digit images for machine learning research
Li Deng · 2012
Earlier work this paper cites.
Formal verification of piece-wise linear feed-forward neural networks
Ruediger Ehlers · 2017
Earlier work this paper cites.
Reluplex: An efficient smt solver for verifying deep neural networks
Guy Katz, Clark Barrett, David L Dill, Kyle Julian, and Mykel J Kochenderfer · 2017
Earlier work this paper cites.
Output range analysis for deep feedforward neural networks
Souradeep Dutta, Susmit Jha, Sriram Sankaranarayanan, and Ashish Tiwari · 2018
Earlier work this paper cites.
Ai2: Safety and robustness certification of neural networks with abstract interpretation
Timon Gehr, Matthew Mirman, Dana Drachsler-Cohen, Petar Tsankov, Swarat Chaudhuri, and Martin Vechev · 2018
Earlier work this paper cites.
On the effectiveness of interval bound propagation for training verifiably robust models
Sven Gowal, Krishnamurthy Dvijotham, Robert Stanforth, Rudy Bunel, Chongli Qin, Jonathan Uesato, Relja Arandjelovic, Timothy Mann, and Pushmeet Kohli · 2018
Earlier work this paper cites.
Towards deep learning models resistant to adversarial attacks
Aleksander Madry, Aleksandar Makelov, Ludwig Schmidt, Dimitris Tsipras, and Adrian Vladu · 2018
Earlier work this paper cites.
Fast and effective robustness certification
Gagandeep Singh, Timon Gehr, Matthew Mirman, Markus Püschel, and Martin T. Vechev · 2018
Earlier work this paper cites.
Provable defenses against adversarial examples via the convex outer adversarial polytope
Eric Wong and J. Zico Kolter · 2018
Cited alongside, same era.
Certified adversarial robustness via randomized smoothing
Jeremy M. Cohen, Elan Rosenfeld, and J. Zico Kolter · 2019
Cited alongside, same era.
Pytorch: An imperative style, high-performance deep learning library
Adam Paszke, Sam Gross, Francisco Massa, Adam Lerer, James Bradbury, Gregory Chanan, Trevor Killeen, Zeming Lin, Natalia Gimelshein, Luca Antiga, Alban Desmaison, Andreas Köpf, Edward Yang, Zachary DeVito, Martin Raison, Alykhan Tejani, Sasank Chilamkurthy, Benoit Steiner, Lu Fang, Junjie Bai, and Soumith Chintala · 2019
Cited alongside, same era.
A convex relaxation barrier to tight robustness verification of neural networks
Hadi Salman, Greg Yang, Huan Zhang, Cho-Jui Hsieh, and Pengchuan Zhang · 2019
Cited alongside, same era.
Beyond the single neuron convex barrier for neural network certification
Gagandeep Singh, Rupanshu Ganvir, Markus Püschel, and Martin T. Vechev · 2019
Cited alongside, same era.
The convex relaxation barrier, revisited: Tightened single-neuron relaxations for neural network verification
Christian Tjandraatmadja, Ross Anderson, Joey Huchette, Will Ma, Krunal Patel, and Juan Pablo Vielma · 2020
Later among the works it cites.
Automatic perturbation analysis for scalable certified robustness and beyond
Kaidi Xu, Zhouxing Shi, Huan Zhang, Yihan Wang, Kai-Wei Chang, Minlie Huang, Bhavya Kailkhura, Xue Lin, and Cho-Jui Hsieh · 2020
Later among the works it cites.
Improved branch and bound for neural network verification via lagrangian decomposition
Alessandro De Palma, Rudy Bunel, Alban Desmaison, Krishnamurthy Dvijotham, Pushmeet Kohli, Philip HS Torr, and M Pawan Kumar · 2021
Later among the works it cites.
Deepsplit: An efficient splitting method for neural network verification via indirect effect analysis
Patrick Henriksen and Alessio Lomuscio · 2021
Later among the works it cites.
Towards scalable complete verification of relu neural networks via dependency-based branching
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Evaluating robustness of neural networks with mixed integer programming
Vincent Tjeng, Kai Y. Xiao, and Russ Tedrake · 2019
Cited alongside, same era.
Branch and bound for piecewise linear neural network verification
Rudy Bunel, P Mudigonda, Ilker Turkaslan, P Torr, Jingyue Lu, and Pushmeet Kohli · 2020
Cited alongside, same era.
Enabling certification of verification-agnostic networks via memory-efficient semidefinite programming
Sumanth Dathathri, Krishnamurthy Dvijotham, Alexey Kurakin, Aditi Raghunathan, Jonathan Uesato, Rudy Bunel, Shreya Shankar, Jacob Steinhardt, Ian J. Goodfellow, Percy Liang, and Pushmeet Kohli · 2020
Cited alongside, same era.
Neural network branching for neural network verification
Jingyue Lu and M. Pawan Kumar · 2020
Cited alongside, same era.
Guided adversarial attack for evaluating and enhancing adversarial defenses
Gaurang Sriramanan, Sravanti Addepalli, Arya Baburaj, and Venkatesh Babu R · 2020
Cited alongside, same era.
An abstract domain for certifying neural networks
Gagandeep Singh, Timon Gehr, Markus Püschel, and Martin Vechev
Cited in the paper.
Boosting robustness certification of neural networks
Gagandeep Singh, Timon Gehr, Markus Püschel, and Martin T. Vechev
Cited in the paper.
Panagiotis Kouvaros and Alessio Lomuscio · 2021
Later among the works it cites.
Scaling the convex barrier with active sets
Alessandro De Palma, Harkirat S. Behl, Rudy R. Bunel, Philip H. S. Torr, and M. Pawan Kumar · 2021
Later among the works it cites.
Beta-crown: Efficient bound propagation with per-neuron split constraints for neural network robustness verification
Shiqi Wang, Huan Zhang, Kaidi Xu, Xue Lin, Suman Jana, Cho-Jui Hsieh, and J Zico Kolter · 2021
Later among the works it cites.
Fast and complete: Enabling complete neural network verification with rapid and massively parallel incomplete verifiers
Kaidi Xu, Huan Zhang, Shiqi Wang, Yihan Wang, Suman Jana, Xue Lin, and Cho-Jui Hsieh · 2021
Later among the works it cites.
How does mixup help with robustness and generalization?
Linjun Zhang, Zhun Deng, Kenji Kawaguchi, Amirata Ghorbani, and James Zou · 2021
Later among the works it cites.
Prima: General and precise neural network certification via scalable convex hull approximations
Mark Niklas Müller, Gleb Makarchuk, Gagandeep Singh, Markus Püschel, and Martin Vechev · 2022
Closest in time.