LipShiFT: A Certifiably Robust Shift-based Vision Transformer

Rohan Menon, Nicola Franco, Stephan Günnemann
3/18/2025
cs.LGcs.AIcs.CV

No confident code implementation found for this paper. 2 possible matches can be shown below.

Abstract

Deriving tight Lipschitz bounds for transformer-based architectures presents a significant challenge. The large input sizes and high-dimensional attention modules typically prove to be crucial bottlenecks during the training process and leads to sub-optimal results. Our research highlights practical constraints of these methods in vision tasks. We find that Lipschitz-based margin training acts as a strong regularizer while restricting weights in successive layers of the model. Focusing on a Lipschitz continuous variant of the ShiftViT model, we address significant training challenges for transformer-based architectures under norm-constrained input setting. We provide an upper bound estimate for the Lipschitz constants of this model using the $l_2$ norm on common image classification datasets. Ultimately, we demonstrate that our method scales to larger models and advances the state-of-the-art in certified robustness for transformer-based architectures.

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. 2 weaker matches are 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{menon2025lipshift,
  title  = {LipShiFT: A Certifiably Robust Shift-based Vision Transformer},
  author = {Rohan Menon and Nicola Franco and Stephan Günnemann},
  year   = {2025},
  eprint = {2503.14751},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2503.14751v1}
}

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

Discussion