Training Safe Neural Networks with Global SDP Bounds

Roman Soletskyi, David "davidad" Dalrymple
9/15/2024
cs.LGcs.AImath.OC

No confident code implementation found for this paper.

Abstract

This paper presents a novel approach to training neural networks with formal safety guarantees using semidefinite programming (SDP) for verification. Our method focuses on verifying safety over large, high-dimensional input regions, addressing limitations of existing techniques that focus on adversarial robustness bounds. We introduce an ADMM-based training scheme for an accurate neural network classifier on the Adversarial Spheres dataset, achieving provably perfect recall with input dimensions up to $d=40$. This work advances the development of reliable neural network verification methods for high-dimensional systems, with potential applications in safe RL policies.

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{soletskyi2024training,
  title  = {Training Safe Neural Networks with Global SDP Bounds},
  author = {Roman Soletskyi and David "davidad" Dalrymple},
  year   = {2024},
  eprint = {2409.09687},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2409.09687v1}
}

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/2409.09687.svg)](https://codeofpaper.com/paper/2409.09687)

Discussion