Christopher Brix — accepted AI-conference papers

2024

Scalable Neural Network Verification with Branch-and-bound Inferred Cutting Planes

Duo Zhou, Christopher Brix, Grani A. Hanasusanto, Huan Zhang

NeurIPS 2024poster

Recently, cutting-plane methods such as GCP-CROWN have been explored to enhance neural network verifiers and made significant advancements. However, GCP-CROWN currently relies on ${\it generic}$ cutting planes ("cuts") generated from external mixed integer programming (MIP) solvers. Due to the poor…

Cited by 1 Source ↗PDF ↗code ↗Scholar ↗

2023

Provably Bounding Neural Network Preimages

Suhas Kotha, Christopher Brix, J Zico Kolter, Krishnamurthy Dj Dvijotham, Huan Zhang

NeurIPS 2023spotlight

Most work on the formal verification of neural networks has focused on bounding the set of outputs that correspond to a given set of inputs (for example, bounded perturbations of a nominal input). However, many use cases of neural network verification require solving the inverse problem, or over-app…

Cited by 19 Source ↗PDF ↗code ↗Scholar ↗