Algebraic Adversarial Attacks on Explainability Models

Lachlan Simpson, Federico Costanza, Kyle Millar, Adriel Cheng, Cheng-Chew Lim +1 more
3/16/2025
cs.LGmath.GR

No confident code implementation found for this paper.

Abstract

Classical adversarial attacks are phrased as a constrained optimisation problem. Despite the efficacy of a constrained optimisation approach to adversarial attacks, one cannot trace how an adversarial point was generated. In this work, we propose an algebraic approach to adversarial attacks and study the conditions under which one can generate adversarial examples for post-hoc explainability models. Phrasing neural networks in the framework of geometric deep learning, algebraic adversarial attacks are constructed through analysis of the symmetry groups of neural networks. Algebraic adversarial examples provide a mathematically tractable approach to adversarial examples. We validate our approach of algebraic adversarial examples on two well-known and one real-world dataset.

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{simpson2025algebraic,
  title  = {Algebraic Adversarial Attacks on Explainability Models},
  author = {Lachlan Simpson and Federico Costanza and Kyle Millar and Adriel Cheng and Cheng-Chew Lim and Hong Gunn Chew},
  year   = {2025},
  eprint = {2503.12683},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2503.12683v1}
}

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

Discussion