cs.LGNov 6, 2026

Robust Deep Prototype Classifiers via Lipschitz Training

Authors: Adia Khalid Khan, Lukas Gehring, Benjamin Paaßen

Organizations: Faculty of Technology, Bielefeld University

Abstract

Robustness and interpretability are interrelated and desirable properties of machine learning models. A model that changes its prediction under imperceptible perturbations behaves inconsistently with human-recognizable features and, hence, is not interpretable. Prototype-based classifiers such as Generalized Learning Vector Quantization address both at once. They are interpretable by construction because they make the decision by comparing the input to the prototypical example; and their hypothesis margin yields a closed form robustness certificate. However, on high-dimensional data, these shallow models need deep embedding networks to achieve high accuracy, and this voids the robustness certificate. The margin is a statement about distances in the embedding space, and an unconstrained network can map an arbitrarily small input perturbation to arbitrarily large attacks in the embedding space. We close this gap with a theorem: if the embedding network is locally L-Lipschitz around a point, and the classifier is ε-robust around its embedding, then the full model is ε/L-robust in the input space. Based on this, we propose a Lipschitz training scheme to achieve L-Lipschitz properties for embedding networks. We evaluate three classification heads (linear, linear Support Vector Machine, and GLVQ) crossed with two embedding networks (standard and Lipschitz-constrained) on MNIST, CIFAR-10, and Imagenette-160, under FGS, PGD and C&W attacks. The evaluation results show that combining a prototype-based head with a Lipschitz-constrained embedding provides the strongest robustness. This suggests that the Lipschitz constraint provides an additional robustness benefit in addition to the advantage provided by the prototype-based head. Since the Lipschitz constraint is enforced by sampling rather than by construction, the reported robustness is empirical rather than certified.

Figures & tables

Explore similar work

CardsList
  1. Adversarial Detection for Pre-trained Classifiers via Lipschitz-Margin Analysis with Certification

    Oct 11, 2026Rui Zhang, Youwen Zhu, Xinle Cao +2Adversarial Example DetectionAdversarial Robustness

  2. Lipschitz Thinking: Ten Years of Certifiable-by-Design Robust Neural Networks

    Oct 5, 2026Fabio Brau, Giorgio Piras, Maura Pintor +1Neural Network RobustnessCertified Robustness

  3. Convex training of Lipschitz-regularized shallow neural networks

    Jun 17, 2026Chao Yin, Antoine Lesage-LandryAdversarial TrainingShallow Neural Networks