On the Learnability of Knot Invariants: Representation, Predictability, and Neural Similarity

Audrey Lindsay, Fabian Ruehle
2/17/2025
math.GTcs.LG

No confident code implementation found for this paper.

Abstract

We analyze different aspects of neural network predictions of knot invariants. First, we investigate the impact of different knot representations on the prediction of invariants and find that braid representations work in general the best. Second, we study which knot invariants are easy to learn, with invariants derived from hyperbolic geometry and knot diagrams being very easy to learn, while invariants derived from topological or homological data are harder. Predicting the Arf invariant could not be learned for any representation. Third, we propose a cosine similarity score based on gradient saliency vectors, and a joint misclassification score to uncover similarities in neural networks trained to predict related topological invariants.

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{lindsay2025learnability,
  title  = {On the Learnability of Knot Invariants: Representation, Predictability, and Neural Similarity},
  author = {Audrey Lindsay and Fabian Ruehle},
  year   = {2025},
  eprint = {2502.12243},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2502.12243v1}
}

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

Discussion