Identifying patterns in data enables us to formulate questions that can lead to exact results. Since many of the patterns are subtle, machine learning has emerged as a useful tool in discovering these relationships. We show that topological features of Calabi–Yau geometries are machine learnable. We indicate the broad applicability of our methods to existing large data sets by finding relations between knot invariants, in particular, the hyperbolic volume of the knot complement and the Jones polynomial.
