English

Universal Approximation with Certified Networks

Machine Learning 2020-01-16 v2 Machine Learning

Abstract

Training neural networks to be certifiably robust is critical to ensure their safety against adversarial attacks. However, it is currently very difficult to train a neural network that is both accurate and certifiably robust. In this work we take a step towards addressing this challenge. We prove that for every continuous function ff, there exists a network nn such that: (i) nn approximates ff arbitrarily close, and (ii) simple interval bound propagation of a region BB through nn yields a result that is arbitrarily close to the optimal output of ff on BB. Our result can be seen as a Universal Approximation Theorem for interval-certified ReLU networks. To the best of our knowledge, this is the first work to prove the existence of accurate, interval-certified networks.

Keywords

Cite

@article{arxiv.1909.13846,
  title  = {Universal Approximation with Certified Networks},
  author = {Maximilian Baader and Matthew Mirman and Martin Vechev},
  journal= {arXiv preprint arXiv:1909.13846},
  year   = {2020}
}

Comments

ICLR 2020

R2 v1 2026-06-23T11:30:34.302Z