140 citations · 526 across the 24 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.LG2021★ 16 cited
Improved Branch and Bound for Neural Network Verification via Lagrangian Decomposition
Alessandro De Palma, Rudy Bunel, Alban Desmaison +4
We improve the scalability of Branch and Bound (BaB) algorithms for formally proving input-output properties of neural networks. First, we propose novel bounding algorithms based o…
cs.LG2021★ 5 cited
Scaling the Convex Barrier with Sparse Dual Algorithms
Alessandro De Palma, Harkirat Singh Behl, Rudy Bunel +2
Tight and efficient neural network bounding is crucial to the scaling of neural network verification systems. Many efficient bounding algorithms have been presented recently, but t…