A constrained optimization approach to improve robustness of neural networks

Shudian Zhao, Jan Kronqvist
9/18/2024
cs.LGmath.OC

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

In this paper, we present a novel nonlinear programming-based approach to fine-tune pre-trained neural networks to improve robustness against adversarial attacks while maintaining high accuracy on clean data. Our method introduces adversary-correction constraints to ensure correct classification of adversarial data and minimizes changes to the model parameters. We propose an efficient cutting-plane-based algorithm to iteratively solve the large-scale nonconvex optimization problem by approximating the feasible region through polyhedral cuts and balancing between robustness and accuracy. Computational experiments on standard datasets such as MNIST and CIFAR10 demonstrate that the proposed approach significantly improves robustness, even with a very small set of adversarial data, while maintaining minimal impact on accuracy.

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. 1 weaker match is hidden by default — 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{zhao2024constrained,
  title  = {A constrained optimization approach to improve robustness of neural networks},
  author = {Shudian Zhao and Jan Kronqvist},
  year   = {2024},
  eprint = {2409.13770},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2409.13770v2}
}

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

Discussion