Disentangling a Deep Learned Volume Formula
Not on the map. Why?
Abstract (arXiv)
We present a simple phenomenological formula which approximates the hyperbolic volume of a knot using only a single evaluation of its Jones polynomial at a root of unity. The average error is just 2.86% on the first 1.7 million knots, which represents a large improvement over previous formulas of this kind. To find the approximation formula, we use layer-wise relevance propagation to reverse engineer a black box neural network which achieves a similar average error for the same approximation task when trained on 10% of the total dataset. The particular roots of unity which appear in our analysis cannot be written as e2π i / (k+2) with integer k; therefore, the relevant Jones polynomial evaluations are not given by unknot-normalized expectation values of Wilson loop operators in conventional SU(2) Chernunicodex2013Simons theory with level k. Instead, they correspond to an analytic continuation of such expectation values to fractional level. We briefly review the continuation procedure and comment on the presence of certain Lefschetz thimbles, to which our approximation formula is sensitive, in the analytically continued Chernunicodex2013Simons integration cycle.
Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). First posted on arXiv 7 Dec 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 1; 2023: 2; 2024: 4; 2025: 2.
12 papers.
- 2024KAN: Kolmogorov-Arnold Networkscited by 634
- 2021Machine-Learning Mathematical Structurescited by 25
- 2021Learning knot invariants across dimensionscited by 12
- 2024Rigor with Machine Learning from Field Theory to the Poincar'e Conjecturecited by 12
- 2021Machine Learning Kreuzer--Skarke Calabi--Yau Threefoldscited by 8
- 2022Augmenting astrophysical scaling relations with machine learning: application to reducing the Sunyaev-Zeldovich flux-mass scattercited by 6
- 2024A Triumvirate of AI Driven Theoretical Discoverycited by 5
- 2025On knot detection via picture recognitioncited by 2
- 2024Learning 3-Manifold Triangulationscited by 1
- 2023Black holes and the loss landscape in machine learningcited by 0
- 2023Learning to be Simplecited by 0
- 2025Colored Jones Polynomials and the Volume Conjecturecited by 0
- 2025On knot detection via picture recognition6 Oct 2025
- 2025Colored Jones Polynomials and the Volume Conjecture25 Feb 2025
- 2024A Triumvirate of AI Driven Theoretical Discovery30 May 2024
- 2024Learning 3-Manifold Triangulations15 May 2024
- 2024KAN: Kolmogorov-Arnold Networks30 Apr 2024
- 2024Rigor with Machine Learning from Field Theory to the Poincar'e Conjecture20 Feb 2024
- 2023Learning to be Simple8 Dec 2023
- 2023Black holes and the loss landscape in machine learning26 Jun 2023
- 2022Augmenting astrophysical scaling relations with machine learning: application to reducing the Sunyaev-Zeldovich flux-mass scatter4 Jan 2022
- 2021Machine Learning Kreuzer--Skarke Calabi--Yau Threefolds16 Dec 2021
- 2021Learning knot invariants across dimensions30 Nov 2021
- 2021Machine-Learning Mathematical Structures15 Jan 2021