Get our free extension to see links to code for papers anywhere online!

Add to Chrome

Add to Firefox

Picture for Rudy Bunel

Rudy Bunel

Dj

IBP Regularization for Verified Adversarial Robustness via Branch-and-Bound

Jun 29, 2022
Alessandro De Palma, Rudy Bunel, Krishnamurthy Dvijotham, M. Pawan Kumar, Robert Stanforth

Figure 1 for IBP Regularization for Verified Adversarial Robustness via Branch-and-Bound

Figure 2 for IBP Regularization for Verified Adversarial Robustness via Branch-and-Bound

Figure 3 for IBP Regularization for Verified Adversarial Robustness via Branch-and-Bound

Figure 4 for IBP Regularization for Verified Adversarial Robustness via Branch-and-Bound

* ICML 2022 Workshop on Formal Verification of Machine Learning

Access Paper or Ask Questions

Improved Branch and Bound for Neural Network Verification via Lagrangian Decomposition

Apr 14, 2021
Alessandro De Palma, Rudy Bunel, Alban Desmaison, Krishnamurthy Dvijotham, Pushmeet Kohli, Philip H. S. Torr, M. Pawan Kumar

Figure 1 for Improved Branch and Bound for Neural Network Verification via Lagrangian Decomposition

Figure 2 for Improved Branch and Bound for Neural Network Verification via Lagrangian Decomposition

Figure 3 for Improved Branch and Bound for Neural Network Verification via Lagrangian Decomposition

Figure 4 for Improved Branch and Bound for Neural Network Verification via Lagrangian Decomposition

* Submitted for review to JMLR. This is an extended version of our paper in the UAI-20 conference (arXiv:2002.10410)

Access Paper or Ask Questions

Scaling the Convex Barrier with Sparse Dual Algorithms

Jan 26, 2021
Alessandro De Palma, Harkirat Singh Behl, Rudy Bunel, Philip H. S. Torr, M. Pawan Kumar

Figure 1 for Scaling the Convex Barrier with Sparse Dual Algorithms

Figure 2 for Scaling the Convex Barrier with Sparse Dual Algorithms

Figure 3 for Scaling the Convex Barrier with Sparse Dual Algorithms

Figure 4 for Scaling the Convex Barrier with Sparse Dual Algorithms

* Previous version: published at ICLR 2021. This extended version: submitted to JMLR

Access Paper or Ask Questions

Scaling the Convex Barrier with Active Sets

Jan 14, 2021
Alessandro De Palma, Harkirat Singh Behl, Rudy Bunel, Philip H. S. Torr, M. Pawan Kumar

Figure 1 for Scaling the Convex Barrier with Active Sets

Figure 2 for Scaling the Convex Barrier with Active Sets

Figure 3 for Scaling the Convex Barrier with Active Sets

Figure 4 for Scaling the Convex Barrier with Active Sets

* Published at ICLR 2021

Access Paper or Ask Questions

An efficient nonconvex reformulation of stagewise convex optimization problems

Oct 27, 2020
Rudy Bunel, Oliver Hinder, Srinadh Bhojanapalli, Krishnamurthy, Dvijotham

Figure 1 for An efficient nonconvex reformulation of stagewise convex optimization problems

Figure 2 for An efficient nonconvex reformulation of stagewise convex optimization problems

Figure 3 for An efficient nonconvex reformulation of stagewise convex optimization problems

Figure 4 for An efficient nonconvex reformulation of stagewise convex optimization problems

* First and second authors made equal contribution. To appear in Neurips 2020

Access Paper or Ask Questions