Showing 2025Show all
2 papers · 1 filter
cs.LG2025
Probably Approximately Global Robustness Certification
Peter Blohm, Patrick Indri, Thomas Gärtner +1
We propose and investigate probabilistic guarantees for the adversarial robustness of classification algorithms. While traditional formal verification approaches for robustness are…
cs.LG2025
WILTing Trees: Interpreting the Distance Between MPNN Embeddings
Masahiro Negishi, Thomas Gärtner, Pascal Welke
We investigate the distance function learned by message passing neural networks (MPNNs) in specific tasks, aiming to capture the functional distance between prediction targets that…