skip to main content
research-article
Public Access

ReachNN: Reachability Analysis of Neural-Network Controlled Systems

Published:08 October 2019Publication History
Skip Abstract Section

Abstract

Applying neural networks as controllers in dynamical systems has shown great promises. However, it is critical yet challenging to verify the safety of such control systems with neural-network controllers in the loop. Previous methods for verifying neural network controlled systems are limited to a few specific activation functions. In this work, we propose a new reachability analysis approach based on Bernstein polynomials that can verify neural-network controlled systems with a more general form of activation functions, i.e., as long as they ensure that the neural networks are Lipschitz continuous. Specifically, we consider abstracting feedforward neural networks with Bernstein polynomials for a small subset of inputs. To quantify the error introduced by abstraction, we provide both theoretical error bound estimation based on the theory of Bernstein polynomials and more practical sampling based error bound estimation, following a tight Lipschitz constant estimation approach based on forward reachability analysis. Compared with previous methods, our approach addresses a much broader set of neural networks, including heterogeneous neural networks that contain multiple types of activation functions. Experiment results on a variety of benchmarks show the effectiveness of our approach.

References

  1. M. Althoff. 2015. An introduction to CORA 2015. In Proc. of ARCH’15 (EPiC Series in Computer Science), Vol. 34. EasyChair, 120--151.Google ScholarGoogle Scholar
  2. R. Alur, C. Courcoubetis, N. Halbwachs, T. A. Henzinger, P.-H. Ho, X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine. 1995. The algorithmic analysis of hybrid systems. Theor. Comput. Sci. 138, 1 (1995), 3--34.Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Jimmy Ba and Rich Caruana. 2014. Do deep nets really need to be deep?. In Advances in Neural Information Processing Systems. 2654--2662.Google ScholarGoogle Scholar
  4. Randall D. Beer, Hillel J. Chiel, and Leon S. Sterling. 1989. Heterogeneous neural networks for adaptive behavior in dynamic environments. In Advances in Neural Information Processing Systems. 577--585.Google ScholarGoogle Scholar
  5. M. Berz and K. Makino. 1998. Verified integration of ODEs and flows using differential algebraic methods on high-order taylor models. Reliable Computing 4 (1998), 361--369. Issue 4.Google ScholarGoogle ScholarCross RefCross Ref
  6. B. M. Brown, D. Elliott, and D. F. Paget. 1987. Lipschitz constants for the Bernstein polynomials of a Lipschitz continuous function. Journal of Approximation Theory 49, 2 (1987), 196--199.Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Cristian Bucilă, Rich Caruana, and Alexandru Niculescu-Mizil. 2006. Model compression. In Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 535--541.Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. X. Chen. 2015. Reachability Analysis of Non-Linear Hybrid Systems Using Taylor Models. Ph.D. Dissertation. RWTH Aachen University.Google ScholarGoogle Scholar
  9. X. Chen, E. Ábrahám, and S. Sankaranarayanan. 2012. Taylor model flowpipe construction for non-linear hybrid systems. In Proc. of RTSS’12. IEEE Computer Society, 183--192.Google ScholarGoogle Scholar
  10. X. Chen, E. Ábrahám, and S. Sankaranarayanan. 2013. Flow*: An analyzer for non-linear hybrid systems. In Proc. of CAV’13 (LNCS), Vol. 8044. Springer, 258--263.Google ScholarGoogle Scholar
  11. X. Chen and S. Sankaranarayanan. 2016. Decomposed reachability analysis for nonlinear systems. In 2016 IEEE Real-Time Systems Symposium (RTSS). IEEE Press, 13--24.Google ScholarGoogle Scholar
  12. Louis De Branges. 1959. The stone-weierstrass theorem. Proc. Amer. Math. Soc. 10, 5 (1959), 822--824.Google ScholarGoogle ScholarCross RefCross Ref
  13. T. Dreossi, T. Dang, and C. Piazza. 2016. Parallelotope bundles for polynomial reachability. In HSCC. ACM, 297--306.Google ScholarGoogle Scholar
  14. P. S. Duggirala, S. Mitra, M. Viswanathan, and M. Potok. 2015. C2E2: A verification tool for stateflow models. In Proc. of TACAS’15 (LNCS), Vol. 9035. Springer, 68--82.Google ScholarGoogle Scholar
  15. S. Dutta, X. Chen, and S. Sankaranarayanan. 2019. Reachability analysis for neural feedback systems using regressive polynomial rule inference. In Hybrid Systems: Computation and Control (HSCC). ACM Press, 157--168.Google ScholarGoogle Scholar
  16. S. Dutta, S. Jha, S. Sankaranarayanan, and A. Tiwari. 2018. Output range analysis for deep feedforward neural networks. In NASA Formal Methods Symposium. Springer, 121--138.Google ScholarGoogle Scholar
  17. G. Frehse. 2005. PHAVer: Algorithmic verification of hybrid systems past HyTech. In HSCC. Springer, 258--273.Google ScholarGoogle Scholar
  18. G. Frehse, C. Le Guernic, A. Donzé, S. Cotton, R. Ray, O. Lebeltel, R. Ripado, A. Girard, T. Dang, and O. Maler. 2011. SpaceEx: Scalable verification of hybrid systems. In Proc. of CAV’11 (LNCS), Vol. 6806. Springer, 379--395.Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Eduardo Gallestey and Peter Hokayem. 2019. Lecture notes in Nonlinear Systems and Control.Google ScholarGoogle Scholar
  20. T. A. Henzinger, P. W. Kopke, A. Puri, and P. Varaiya. 1998. What’s decidable about hybrid automata? Journal of Computer and System Sciences 57, 1 (1998), 94--124.Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Geoffrey E. Hinton, Oriol Vinyals, and Jeffrey Dean. 2015. Distilling the knowledge in a neural network. CoRR abs/1503.02531 (2015).Google ScholarGoogle Scholar
  22. C. Huang, X. Chen, W. Lin, Z. Yang, and X. Li. 2017. Probabilistic safety verification of stochastic hybrid systems using barrier certificates. TECS 16, 5s (2017), 186.Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. X. Huang, M. Kwiatkowska, S. Wang, and M. Wu. 2017. Safety verification of deep neural networks. In International Conference on Computer Aided Verification. Springer, 3--29.Google ScholarGoogle Scholar
  24. Radoslav Ivanov, James Weimer, Rajeev Alur, George J. Pappas, and Insup Lee. 2018. Verisig: Verifying safety properties of hybrid systems with neural network controllers. arXiv preprint arXiv:1811.01828 (2018).Google ScholarGoogle Scholar
  25. G. Katz, C. Barrett, D. L. Dill, K. Julian, and M. J. Kochenderfer. 2017. Reluplex: An efficient SMT solver for verifying deep neural networks. In International Conference on Computer Aided Verification. Springer, 97--117.Google ScholarGoogle Scholar
  26. S. Kong, S. Gao, W. Chen, and E. M. Clarke. 2015. dReach: Δ-reachability analysis for hybrid systems. In Proc. of TACAS’15 (LNCS), Vol. 9035. Springer, 200--205.Google ScholarGoogle Scholar
  27. Timothy P. Lillicrap, Jonathan J. Hunt, Alexander Pritzel, Nicolas Heess, Tom Erez, Yuval Tassa, David Silver, and Daan Wierstra. 2016. Continuous control with deep reinforcement learning. CoRR abs/1509.02971 (2016).Google ScholarGoogle Scholar
  28. George G. Lorentz. 2013. Bernstein Polynomials. American Mathematical Soc.Google ScholarGoogle Scholar
  29. J. Lygeros, C. Tomlin, and S. Sastry. 1999. Controllers for reachability specifications for hybrid systems. Automatica 35, 3 (1999), 349--370.Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. K. Makino and M. Berz. 2005. Verified global optimization with taylor model-based range bounders. Transactions on Computers 11, 4 (2005), 1611--1618.Google ScholarGoogle Scholar
  31. J. D. Meiss. 2007. Differential Dynamical Systems. SIAM publishers.Google ScholarGoogle Scholar
  32. Volodymyr Mnih, Koray Kavukcuoglu, David Silver, Andrei A. Rusu, Joel Veness, Marc G. Bellemare, Alex Graves, Martin Riedmiller, Andreas K. Fidjeland, Georg Ostrovski, et al. 2015. Human-level control through deep reinforcement learning. Nature 518, 7540 (2015), 529.Google ScholarGoogle Scholar
  33. Yunpeng Pan, Ching-An Cheng, Kamil Saigol, Keuntaek Lee, Xinyan Yan, Evangelos Theodorou, and Byron Boots. 2018. Agile autonomous driving using end-to-end deep imitation learning. Proceedings of Robotics: Science and Systems. Pittsburgh, Pennsylvania (2018).Google ScholarGoogle ScholarCross RefCross Ref
  34. S. Prajna and A. Jadbabaie. 2004. Safety verification of hybrid systems using barrier certificates. In HSCC. Springer, 477--492.Google ScholarGoogle Scholar
  35. H. L. Royden. 1968. Real Analysis. Krishna Prakashan Media.Google ScholarGoogle Scholar
  36. W. Ruan, X. Huang, and M. Kwiatkowska. 2018. Reachability analysis of deep neural networks with provable guarantees. arXiv preprint arXiv:1805.02242 (2018).Google ScholarGoogle Scholar
  37. Georgi V. Smirnov. 2002. Introduction to the Theory of Differential Inclusions. Vol. 41. American Mathematical Soc.Google ScholarGoogle Scholar
  38. C. Szegedy, W. Zaremba, I. Sutskever, J. Bruna, D. Erhan, I. Goodfellow, and R. Fergus. 2013. Intriguing properties of neural networks. arXiv preprint arXiv:1312.6199 (2013).Google ScholarGoogle Scholar
  39. W. Xiang and T. T. Johnson. 2018. Reachability analysis and safety verification for neural network control systems. arXiv preprint arXiv:1805.09944 (2018).Google ScholarGoogle Scholar
  40. Z. Yang, C. Huang, X. Chen, W. Lin, and Z. Liu. 2016. A linear programming relaxation based approach for generating barrier certificates of hybrid systems. In FM. Springer, 721--738.Google ScholarGoogle Scholar
  41. Yuichi Yoshida and Takeru Miyato. 2017. Spectral norm regularization for improving the generalizability of deep learning. arXiv preprint arXiv:1705.10941 (2017).Google ScholarGoogle Scholar
  42. F. Zhao. 1992. Automatic Analysis and Synthesis of Controllers for Dynamical Systems Based on Phase-Space Knowledge. Ph.D. Dissertation. Massachusetts Institute of Technology.Google ScholarGoogle Scholar

Index Terms

  1. ReachNN: Reachability Analysis of Neural-Network Controlled Systems

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        • Published in

          cover image ACM Transactions on Embedded Computing Systems
          ACM Transactions on Embedded Computing Systems  Volume 18, Issue 5s
          Special Issue ESWEEK 2019, CASES 2019, CODES+ISSS 2019 and EMSOFT 2019
          October 2019
          1423 pages
          ISSN:1539-9087
          EISSN:1558-3465
          DOI:10.1145/3365919
          Issue’s Table of Contents

          Copyright © 2019 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 8 October 2019
          • Accepted: 1 July 2019
          • Revised: 1 June 2019
          • Received: 1 April 2019
          Published in tecs Volume 18, Issue 5s

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article
          • Research
          • Refereed

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader

        HTML Format

        View this article in HTML Format .

        View HTML Format