Fetching the paper…
Reading the bibliography…
Tight and efficient neural network bounding is crucial to the scaling of neural network verification systems.
An algorithm for quadratic programming
Marguerite Frank and Philip Wolfe · 1956
Earlier work this paper cites.
Representability in mixed integer programming, i: Characterization results
R. G. Jeroslow · 1987
Earlier work this paper cites.
Recovery of primal solutions when using subgradient optimization methods to solve lagrangian duals of linear programs
Hanif D. Sherali and Gyunghyun Choi · 1996
Earlier work this paper cites.
Gradient-based learning applied to document recognition
Yann LeCun, Léon Bottou, Yoshua Bengio, and Patrick Haffner · 1998
Earlier work this paper cites.
Lagrangian relaxation
Claude Lemaréchal · 2001
Earlier work this paper cites.
Enhancing sparsity by reweighted ℓ \ell 1 minimization
Emmanuel J. Candès, Michael B. Wakin, and Stephen P. Boyd · 2008
Earlier work this paper cites.
Learning multiple layers of features from tiny images
A. Krizhevsky and G. Hinton · 2009
Earlier work this paper cites.
Revisiting Frank-Wolfe: Projection-free sparse convex optimization
Martin Jaggi · 2013
Earlier work this paper cites.
Intriguing properties of neural networks
Christian Szegedy, Wojciech Zaremba, Ilya Sutskever, Joan Bruna, Dumitru Erhan, Ian Goodfellow, and Rob Fergus · 2014
Earlier work this paper cites.
Adam: A method for stochastic optimization
Diederik P. Kingma and Jimmy Ba · 2015
Earlier work this paper cites.
Towards evaluating the robustness of neural networks
Nicholas Carlini and David Wagner · 2017
Earlier work this paper cites.
Formal verification of piece-wise linear feed-forward neural networks
Ruediger Ehlers · 2017
Earlier work this paper cites.
Frank-Wolfe algorithms for saddle point problems
Gauthier Gidel, Tony Jebara, and Simon Lacoste-Julien · 2017
Earlier work this paper cites.
Reluplex: An efficient SMT solver for verifying deep neural networks
Guy Katz, Clark Barrett, David Dill, Kyle Julian, and Mykel Kochenderfer · 2017
Earlier work this paper cites.
Adversarial machine learning at scale
Alexey Kurakin, Ian J. Goodfellow, and Samy Bengio · 2017
Cited alongside, same era.
Automatic differentiation in pytorch
Adam Paszke, Sam Gross, Soumith Chintala, Gregory Chanan, Edward Yang, Zachary DeVito, Zeming Lin, Alban Desmaison, Luca Antiga, and Adam Lerer · 2017
Cited alongside, same era.
A unified view of piecewise linear neural network verification
Rudy Bunel, Ilker Turkaslan, Philip HS Torr, Pushmeet Kohli, and M Pawan Kumar · 2018
Cited alongside, same era.
A dual approach to scalable verification of deep networks
Krishnamurthy Dvijotham, Robert Stanforth, Sven Gowal, Timothy Mann, and Pushmeet Kohli · 2018
Cited alongside, same era.
On the effectiveness of interval bound propagation for training verifiably robust models
Sven Gowal, Krishnamurthy Dvijotham, Robert Stanforth, Rudy Bunel, Chongli Qin, Jonathan Uesato, Timothy Mann, and Pushmeet Kohli · 2018
Cited alongside, same era.
Towards deep learning models resistant to adversarial attacks
A statistical approach to assessing neural network robustness
Stefan Webb, Tom Rainforth, Yee Whye Teh, and M Pawan Kumar · 2019
Later among the works it cites.
Strong mixed-integer programming formulations for trained neural networks
Ross Anderson, Joey Huchette, Will Ma, Christian Tjandraatmadja, and Juan Pablo Vielma · 2020
Later among the works it cites.
Adversarial training and provable defenses: Bridging the gap
Mislav Balunovic and Martin Vechev · 2020
Later among the works it cites.
Efficient verification of ReLU-based neural networks via dependency analysis
Elena Botoeva, Panagiotis Kouvaros, Jan Kronqvist, Alessio Lomuscio, and Ruth Misener · 2020
Later among the works it cites.
Branch and bound for piecewise linear neural network verification
Rudy Bunel, Jingyue Lu, Ilker Turkaslan, P Kohli, P Torr, and M Pawan Kumar · 2020
Later among the works it cites.
Efficient neural network verification with exactness characterization
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Aleksander Madry, Aleksandar Makelov, Ludwig Schmidt, Dimitris Tsipras, and Adrian Vladu · 2018
Cited alongside, same era.
Semidefinite relaxations for certifying robustness to adversarial examples
Aditi Raghunathan, Jacob Steinhardt, and Percy S Liang · 2018
Cited alongside, same era.
Fast and effective robustness certification
Gagandeep Singh, Timon Gehr, Matthew Mirman, Markus Püschel, and Martin Vechev · 2018
Cited alongside, same era.
Efficient formal safety analysis of neural networks
Shiqi Wang, Kexin Pei, Justin Whitehouse, Junfeng Yang, and Suman Jana · 2018
Cited alongside, same era.
Towards fast computation of certified robustness for relu networks
Tsui-Wei Weng, Huan Zhang, Hongge Chen, Zhao Song, Cho-Jui Hsieh, Duane Boning, Inderjit S Dhillon, and Luca Daniel · 2018
Cited alongside, same era.
Provable defenses against adversarial examples via the convex outer adversarial polytope
Eric Wong and Zico Kolter · 2018
Cited alongside, same era.
Strong mixed-integer programming formulations for trained neural networks
Ross Anderson, Joey Huchette, Christian Tjandraatmadja, and Juan Pablo Vielma · 2019
Cited alongside, same era.
Krishnamurthy Dvijotham, Robert Stanforth, Sven Gowal, Chongli Qin, Soham De, and Pushmeet Kohli · 2020
Later among the works it cites.
Gurobi optimizer reference manual, 2020
LLC Gurobi Optimization · 2020
Later among the works it cites.
Neural network branching for neural network verification
Jingyue Lu and M Pawan Kumar · 2020
Later among the works it cites.
ETH robustness analyzer for neural networks (ERAN)
Gagandeep Singh, Jonathan Maurer, Christoph Müller, Matthew Mirman, Timon Gehr, Adrian Hoffmann, Petar Tsankov, Dana Drachsler Cohen, Markus Püschel, and Martin Vechev · 2020
Later among the works it cites.
Christian Tjandraatmadja, Ross Anderson, Joey Huchette, Will Ma, Krunal Patel, and Juan Pablo Vielma · 2020
Later among the works it cites.
International verification of neural networks competition (VNN-COMP)
VNN-COMP · 2020
Later among the works it cites.
Scaling the convex barrier with active sets
Alessandro De Palma, Harkirat Singh Behl, Rudy Bunel, Philip H. S. Torr, and M. Pawan Kumar · 2021
Closest in time.
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
Closest in time.