Fetching the paper…
Reading the bibliography…
Inspired by recent successes with parallel optimization techniques for solving Boolean satisfiability, we investigate a set of strategies and heuristics that aim to leverage parallel computing to improve the scalability of neural network verification.
R. Nieuwenhuis, A. Oliveras, and C. Tinelli, “Solving sat and sat modulo theories: From an abstract davis– putnam–logemann–loveland procedure to dpll( t
2006
Earlier work this paper cites.
L. M. de Moura and N. Bjørner, “Z3: an efficient SMT solver,” in TACAS , ser. Lecture Notes in Computer Science, vol. 4963. Springer, 2008, pp. 337–340
2008
Earlier work this paper cites.
J. P. M. Silva, I. Lynce, and S. Malik, “Conflict-driven clause learning SAT solvers,” in Handbook of Satisfiability , ser. Frontiers in Artificial Intelligence and Applications. IOS Press, 2009, vol. 185, pp. 131–153
2009
Earlier work this paper cites.
M. Heule and H. van Maaren, “Look-ahead based SAT solvers,” in Handbook of Satisfiability , ser. Frontiers in Artificial Intelligence and Applications. IOS Press, 2009, vol. 185, pp. 155–184
2009
Earlier work this paper cites.
L. Pulina and A. Tacchella, “An abstraction-refinement approach to verification of artificial neural networks,” in CAV , ser. Lecture Notes in Computer Science, vol. 6174. Springer, 2010, pp. 243–257
2010
Earlier work this paper cites.
V. Nair and G. E. Hinton, “Rectified linear units improve restricted boltzmann machines,” in ICML . Omnipress, 2010, pp. 807–814
2010
Earlier work this paper cites.
C. W. Barrett, C. L. Conway, M. Deters, L. Hadarean, D. Jovanovic, T. King, A. Reynolds, and C. Tinelli, “CVC4,” in CAV , ser. Lecture Notes in Computer Science, vol. 6806. Springer, 2011, pp. 171–177
2011
Earlier work this paper cites.
M. Heule, O. Kullmann, S. Wieringa, and A. Biere, “Cube and conquer: Guiding CDCL SAT solvers by lookaheads,” in Haifa Verification Conference , ser. Lecture Notes in Computer Science, vol. 7261. Springer, 2011, pp. 50–65
2011
Earlier work this paper cites.
A. Krizhevsky, I. Sutskever, and G. E. Hinton, “Imagenet classification with deep convolutional neural networks,” in NIPS , 2012, pp. 1106–1114
2012
Earlier work this paper cites.
G. Hinton, L. Deng, D. Yu, G. E. Dahl, A.-r. Mohamed, N. Jaitly, A. Senior, V. Vanhoucke, P. Nguyen, T. N. Sainath et al. , “Deep neural networks for acoustic modeling in speech recognition: The shared views of four research groups,” IEEE Signal processing magazine , vol. 29, no. 6, pp. 82–97, 2012
2012
Earlier work this paper cites.
——, “Challenging SMT solvers to verify neural networks,” AI Commun. , vol. 25, no. 2, pp. 117–135, 2012
2012
Earlier work this paper cites.
A. L. Maas, A. Y. Hannun, and A. Y. Ng, “Rectifier nonlinearities improve neural network acoustic models,” in Proc. icml , vol. 30, no. 1, 2013, p. 3
2013
Earlier work this paper cites.
C. Szegedy, W. Zaremba, I. Sutskever, J. Bruna, D. Erhan, I. J. Goodfellow, and R. Fergus, “Intriguing properties of neural networks,” in ICLR (Poster) , 2014
2014
Cited alongside, same era.
A. E. Hyvärinen, M. Marescotti, and N. Sharygina, “Search-space partitioning for parallelizing smt solvers,” in International Conference on Theory and Applications of Satisfiability Testing . Springer, 2015, pp. 369–386
2015
Cited alongside, same era.
I. Goodfellow, Y. Bengio, and A. Courville, Deep Learning . MIT Press, 2016, http://www.deeplearningbook.org
2016
Cited alongside, same era.
D. Silver, A. Huang, C. J. Maddison, A. Guez, L. Sifre, G. Van Den Driessche, J. Schrittwieser, I. Antonoglou, V. Panneershelvam, M. Lanctot et al. , “Mastering the game of go with deep neural networks and tree search,” nature , vol. 529, no. 7587, p. 484, 2016
2016
Cited alongside, same era.
——, “Efficient formal safety analysis of neural networks,” in Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, NeurIPS 2018, 3-8 December 2018, Montréal, Canada , 2018, pp. 6369–6379. [Online]. Available: http://papers.nips.cc/paper/7873-efficient-formal-safety-analysis-of-neural-networks
2018
Later among the works it cites.
N. Narodytska, S. Kasiviswanathan, L. Ryzhyk, M. Sagiv, and T. Walsh, “Verifying properties of binarized deep neural networks,” in Thirty-Second AAAI Conference on Artificial Intelligence , 2018
2018
Later among the works it cites.
T. Gehr, M. Mirman, D. Drachsler-Cohen, P. Tsankov, S. Chaudhuri, and M. Vechev, “Ai2: Safety and robustness certification of neural networks with abstract interpretation,” in 2018 IEEE Symposium on Security and Privacy (SP) . IEEE, 2018, pp. 3–18
2018
Later among the works it cites.
G. Singh, T. Gehr, M. Mirman, M. Püschel, and M. Vechev, “Fast and effective robustness certification,” in Advances in Neural Information Processing Systems , 2018, pp. 10 802–10 813
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
M. J. H. Heule, O. Kullmann, and V. W. Marek, “Solving and verifying the boolean pythagorean triples problem via cube-and-conquer,” in SAT , ser. Lecture Notes in Computer Science, vol. 9710. Springer, 2016, pp. 228–245
2016
Cited alongside, same era.
M. Marescotti, A. E. Hyvärinen, and N. Sharygina, “Clause sharing and partitioning for cloud-based smt solving,” in International Symposium on Automated Technology for Verification and Analysis . Springer, 2016, pp. 428–443
2016
Cited alongside, same era.
2017
Cited alongside, same era.
A. Kurakin, I. J. Goodfellow, and S. Bengio, “Adversarial examples in the physical world,” in ICLR (Workshop) . OpenReview.net, 2017
2017
Cited alongside, same era.
G. Katz, C. Barrett, D. Dill, K. Julian, and M. Kochenderfer, “Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networks,” in Proc. 29th Int. Conf. on Computer Aided Verification (CAV) , 2017, pp. 97–117
2017
Cited alongside, same era.
R. Ehlers, “Formal verification of piece-wise linear feed-forward neural networks,” in International Symposium on Automated Technology for Verification and Analysis . Springer, 2017, pp. 269–286
2017
Cited alongside, same era.
G. Katz, C. W. Barrett, D. L. Dill, K. Julian, and M. J. Kochenderfer, “Towards proving the adversarial robustness of deep neural networks,” in FVAV@iFM , ser. EPTCS, vol. 257, 2017, pp. 19–26
2017
Cited alongside, same era.
S. Wang, K. Pei, J. Whitehouse, J. Yang, and S. Jana, “Formal security analysis of neural networks using symbolic intervals,” in 27th { \{ USENIX } \} Security Symposium ( { \{ USENIX } \} Security 18) , 2018, pp. 1599–1614
2018
Cited alongside, same era.
2018
Later among the works it cites.
K. D. Julian, M. J. Kochenderfer, and M. P. Owen, “Deep neural network compression for aircraft collision avoidance systems,” Journal of Guidance, Control, and Dynamics , vol. 42, no. 3, pp. 598–608, 2019. [Online]. Available: https://doi.org/10.2514/1.G003724
2019
Later among the works it cites.
G. Katz, D. A. Huang, D. Ibeling, K. Julian, C. Lazarus, R. Lim, P. Shah, S. Thakoor, H. Wu, A. Zeljić et al. , “The marabou framework for verification and analysis of deep neural networks,” in International Conference on Computer Aided Verification , 2019, pp. 443–452
2019
Later among the works it cites.
D. Gopinath, H. Converse, C. Pasareanu, and A. Taly, “Property inference for deep neural networks,” in 2019 34th IEEE/ACM International Conference on Automated Software Engineering (ASE) , Nov 2019, pp. 797–809
2019
Later among the works it cites.
S. Fouladi, F. Romero, D. Iter, Q. Li, S. Chatterjee, C. Kozyrakis, M. Zaharia, and K. Winstein, “From laptop to lambda: Outsourcing everyday jobs to thousands of transient functional containers,” in 2019 USENIX Annual Technical Conference, USENIX ATC 2019, Renton, WA, USA, July 10-12, 2019 , 2019, pp. 475–488. [Online]. Available: https://www.usenix.org/conference/atc19/presentation/fouladi
2019
Later among the works it cites.
G. Singh, T. Gehr, M. Püschel, and M. Vechev, “An abstract domain for certifying neural networks,” Proceedings of the ACM on Programming Languages , vol. 3, no. POPL, pp. 1–30, 2019
2019
Later among the works it cites.
C. Liu, T. Arnon, C. Lazarus, C. Barrett, and M. J. Kochenderfer, “Algorithms for verifying deep neural networks,” 2019
2019
Later among the works it cites.
2020
Closest in time.
E. Botoeva, P. Kouvaros, J. Kronqvist, A. Lomuscio, and R. Misener, “Efficient verification of relu-based neural networks via dependency analysis.” in AAAI , 2020, pp. 3291–3299
2020
Closest in time.