Certifying Ensembles: A General Certification Theory with S-Lipschitzness

Aleksandar Petrov, Francisco Eiras, Amartya Sanyal, Philip H. S. Torr, Adel Bibi
4/25/2023
cs.LG

No confident code implementation found for this paper.

Abstract

Improving and guaranteeing the robustness of deep learning models has been a topic of intense research. Ensembling, which combines several classifiers to provide a better model, has shown to be beneficial for generalisation, uncertainty estimation, calibration, and mitigating the effects of concept drift. However, the impact of ensembling on certified robustness is less well understood. In this work, we generalise Lipschitz continuity by introducing S-Lipschitz classifiers, which we use to analyse the theoretical robustness of ensembles. Our results are precise conditions when ensembles of robust classifiers are more robust than any constituent classifier, as well as conditions when they are less robust.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{petrov2023certifying,
  title  = {Certifying Ensembles: A General Certification Theory with S-Lipschitzness},
  author = {Aleksandar Petrov and Francisco Eiras and Amartya Sanyal and Philip H. S. Torr and Adel Bibi},
  year   = {2023},
  eprint = {2304.13019},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2304.13019v1},
  journal = {ICML 2023 2023}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2304.13019.svg)](https://codeofpaper.com/paper/2304.13019)

Discussion