TY - GEN
T1 - Parallelization Techniques for Verifying Neural Networks
AU - Wu, Haoze
AU - Ozdemir, Alex
AU - Zeljic, Aleksandar
AU - Julian, Kyle
AU - Irfan, Ahmed
AU - Gopinath, Divya
AU - Fouladi, Sadjad
AU - Katz, Guy
AU - Pasareanu, Corina
AU - Barrett, Clark
N1 - Publisher Copyright: © 2020 FMCAD Association.
PY - 2020/9/21
Y1 - 2020/9/21
N2 - Inspired by recent successes of parallel techniques for solving Boolean satisfiability, we investigate a set of strategies and heuristics to leverage parallelism and improve the scalability of neural network verification. We present a general description of the Split-and-Conquer partitioning algorithm, implemented within the Marabou framework, and discuss its parameters and heuristic choices. In particular, we explore two novel partitioning strategies, that partition the input space or the phases of the neuron activations, respectively. We introduce a branching heuristic and a direction heuristic that are based on the notion of polarity. We also introduce a highly parallelizable pre-processing algorithm for simplifying neural network verification problems. An extensive experimental evaluation shows the benefit of these techniques on both existing and new benchmarks. A preliminary experiment ultra-scaling our algorithm using a large distributed cloud-based platform also shows promising results.
AB - Inspired by recent successes of parallel techniques for solving Boolean satisfiability, we investigate a set of strategies and heuristics to leverage parallelism and improve the scalability of neural network verification. We present a general description of the Split-and-Conquer partitioning algorithm, implemented within the Marabou framework, and discuss its parameters and heuristic choices. In particular, we explore two novel partitioning strategies, that partition the input space or the phases of the neuron activations, respectively. We introduce a branching heuristic and a direction heuristic that are based on the notion of polarity. We also introduce a highly parallelizable pre-processing algorithm for simplifying neural network verification problems. An extensive experimental evaluation shows the benefit of these techniques on both existing and new benchmarks. A preliminary experiment ultra-scaling our algorithm using a large distributed cloud-based platform also shows promising results.
UR - https://www.scopus.com/pages/publications/85097996932
U2 - 10.34727/2020/isbn.978-3-85448-042-6_20
DO - 10.34727/2020/isbn.978-3-85448-042-6_20
M3 - Conference contribution
T3 - Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design, FMCAD 2020
SP - 128
EP - 137
BT - Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design, FMCAD 2020
A2 - Ivrii, Alexander
A2 - Strichman, Ofer
A2 - Hunt, Warren A.
A2 - Weissenbacher, Georg
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 20th International Conference on Formal Methods in Computer-Aided Design, FMCAD 2020
Y2 - 21 September 2020 through 24 September 2020
ER -