20 citations · 47 across the 6 of their papers we have counts for
12 papers
Lookback for Learning to Branch
Prateek Gupta, Elias B. Khalil, Didier Chetélat +4
The expressive and computationally inexpensive bipartite Graph Neural Networks (GNN) have been shown to be an important component of deep learning based Mixed-Integer Linear Progra…
IBP Regularization for Verified Adversarial Robustness via Branch-and-Bound
Alessandro De Palma, Rudy Bunel, Krishnamurthy Dvijotham +2
Recent works have tried to increase the verifiability of adversarially trained networks by running the attacks over domains larger than the original perturbations and adding variou…
In Defense of the Unitary Scalarization for Deep Multi-Task Learning
Vitaly Kurin, Alessandro De Palma, Ilya Kostrikov +2
Recent multi-task learning research argues against unitary scalarization, where training simply minimizes the sum of the task losses. Several ad-hoc multi-task optimization algorit…
ANCER: Anisotropic Certification via Sample-wise Volume Maximization
Francisco Eiras, Motasem Alfarra, M. Pawan Kumar +4
Randomized smoothing has recently emerged as an effective tool that enables certification of deep neural network classifiers at scale. All prior art on randomized smoothing has foc…
Make Sure You're Unsure: A Framework for Verifying Probabilistic Specifications
Leonard Berrada, Sumanth Dathathri, Krishnamurthy Dvijotham +5
Most real world applications require dealing with stochasticity like sensor noise or predictive uncertainty, where formal specifications of desired behavior are inherently probabil…
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…