We lifted 2 functions out of this paper's own repositories and ran 1 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.
| Repository | Role | Ran |
|---|---|---|
| sagarverma/transformer-lipschitz | canonical | 1 of 2 |
| Function | Status | Where it lives |
|---|---|---|
| test | Ran | sagarverma/transformer-lipschitz/liptrf/pretrained/train_cifar10_from_pretrained.py pointer only (licence: NONE) · get_code("c1d2eea42a7972d5") |
| test | Not yet run | sagarverma/transformer-lipschitz/liptrf/scratch/vit/train_mnist.py pointer only (licence: NONE) · get_code("eace55e02c3af27b") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Lipschitz bounded neural networks are certifiably robust and have a good trade-off between clean and certified accuracy. Existing Lipschitz bounding methods train from scratch and are limited to moderately sized networks (< 6M parameters). They require a fair amount of hyper-parameter tuning and are computationally prohibitive for large networks like Vision Transformers (5M to 660M parameters). Obtaining certified robustness of transformers is not feasible due to the non-scalability and inflexibility of the current methods. This work presents CertViT, a two-step proximal-projection method to achieve certified robustness from pre-trained weights. The proximal step tries to lower the Lipschitz bound and the projection step tries to maintain the clean accuracy of pre-trained weights. We show that CertViT networks have better certified accuracy than state-of-the-art Lipschitz trained networks. We apply CertViT on several variants of pre-trained vision transformers and show adversarial robustness using standard attacks. Code : https://github.com/sagarverma/transformer-lipschitz
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2302.10287")
get_code_for_paper("2302.10287")
have("2302.10287")
Connect an agent — have() is free.