{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/formal-verification-of-piece-wise-linear-feed","title":"Formal Verification of Piece-Wise Linear Feed-Forward Neural Networks","arxiv_id":"1705.01320","date":"2017-05-03","proceeding":null,"authors":["Ruediger Ehlers"],"abstract":"We present an approach for the verification of feed-forward neural networks\nin which all nodes have a piece-wise linear activation function. Such networks\nare often used in deep learning and have been shown to be hard to verify for\nmodern satisfiability modulo theory (SMT) and integer linear programming (ILP)\nsolvers.\n  The starting point of our approach is the addition of a global linear\napproximation of the overall network behavior to the verification problem that\nhelps with SMT-like reasoning over the network behavior. We present a\nspecialized verification algorithm that employs this approximation in a search\nprocess in which it infers additional node phases for the non-linear nodes in\nthe network from partial node phase assignments, similar to unit propagation in\nclassical SAT solving. We also show how to infer additional conflict clauses\nand safe node fixtures from the results of the analysis steps performed during\nthe search. The resulting approach is evaluated on collision avoidance and\nhandwritten digit recognition case studies.","url_abs":"http://arxiv.org/abs/1705.01320v3","url_pdf":"http://arxiv.org/pdf/1705.01320v3.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"formal-verification-of-piece-wise-linear-feed","repo_url":"https://github.com/progirep/planet","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"collision-avoidance","task_name":"Collision Avoidance"},{"task_slug":"handwritten-digit-recognition","task_name":"Handwritten Digit Recognition"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=1705.01320","mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}