no code implementations • 29 Feb 2024 • Anan Kabaha, Dana Drachsler-Cohen
We evaluate VHAGaR on several datasets and classifiers and show that, given a three hour timeout, the average gap between the lower and upper bound on the minimal globally robust bound computed by VHAGaR is 1. 9, while the gap of an existing global robustness verifier is 154. 7.
no code implementations • 31 Oct 2023 • Roie Reshef, Anan Kabaha, Olga Seleznova, Dana Drachsler-Cohen
We propose Sphynx, an algorithm that computes an abstraction of all networks, with a high probability, from a small set of networks, and verifies LDCP directly on the abstract network.
no code implementations • 12 Sep 2022 • Anan Kabaha, Dana Drachsler-Cohen
Deep neural networks have been shown to be vulnerable to adversarial attacks that perturb inputs based on semantic features.
no code implementations • ICLR 2019 • Marc Fischer, Mislav Balunovic, Dana Drachsler-Cohen, Timon Gehr, Ce Zhang, Martin Vechev
We present DL2, a system for training and querying neural networks with logical constraints.
no code implementations • 15 Jun 2017 • Nader H. Bshouty, Dana Drachsler-Cohen, Martin Vechev, Eran Yahav
Our algorithm asks at most $|F| \cdot OPT(F_\vee)$ membership queries where $OPT(F_\vee)$ is the minimum worst case number of membership queries for learning $F_\vee$.