Certifying Robustness via Topological Representations

Jens Agerberg, Andrea Guidolin, Andrea Martinelli, Pepijn Roos Hoefgeest, David Eklund +1 more
1/18/2025
stat.MLcs.CGcs.LG

No confident code implementation found for this paper.

Abstract

We propose a neural network architecture that can learn discriminative geometric representations of data from persistence diagrams, common descriptors of Topological Data Analysis. The learned representations enjoy Lipschitz stability with a controllable Lipschitz constant. In adversarial learning, this stability can be used to certify $ε$-robustness for samples in a dataset, which we demonstrate on the ORBIT5K dataset representing the orbits of a discrete dynamical system.

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. Any repos shown below are weak matches — 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{agerberg2025certifying,
  title  = {Certifying Robustness via Topological Representations},
  author = {Jens Agerberg and Andrea Guidolin and Andrea Martinelli and Pepijn Roos Hoefgeest and David Eklund and Martina Scolamiero},
  year   = {2025},
  eprint = {2501.10876},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2501.10876v1}
}

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

Discussion