Bounding the Complexity of Formally Verifying Neural Networks: A
Geometric Approach

v1v2 (latest)

Bounding the Complexity of Formally Verifying Neural Networks: A Geometric Approach

22 December 2020

ArXiv (abs)PDF HTML

Papers citing "Bounding the Complexity of Formally Verifying Neural Networks: A Geometric Approach"

6 / 6 papers shown

Title
Exact and Cost-Effective Automated Transformation of Neural Network Controllers to Decision Tree Controllers K. Chang Nathan Dahlin Rahul Jain Pierluigi Nuzzo OffRL 28 0 0 11 Apr 2023
Neurosymbolic Motion and Task Planning for Linear Temporal Logic Tasks Xiaowu Sun Yasser Shoukry 89 11 0 11 Oct 2022
Polynomial-Time Reachability for LTI Systems with Two-Level Lattice Neural Network Controllers James Ferlez Yasser Shoukry 41 2 0 20 Sep 2022
NNLander-VeriF: A Neural Network Formal Verification Framework for Vision-Based Autonomous Aircraft Landing Ulices Santa Cruz Yasser Shoukry 84 31 0 29 Mar 2022
Fast BATLLNN: Fast Box Analysis of Two-Level Lattice Neural Networks James Ferlez Haitham Khedr Yasser Shoukry 56 12 0 17 Nov 2021
Safe-by-Repair: A Convex Optimization Approach for Repairing Unsafe Two-Level Lattice Neural Network Controllers Ulices Santa Cruz James Ferlez Yasser Shoukry 49 10 0 06 Apr 2021