mlsanityData to 7 Oct 2026

Searching for ribbons with machine learning

arXiv 2304.09304 ↗First posted 18 Apr 2023math.GT cs.LGcited by 11

Not on the map. Why?

Abstract (arXiv)

We apply Bayesian optimization and reinforcement learning to a problem in topology: the question of when a knot bounds a ribbon disk. This question is relevant in an approach to disproving the four-dimensional smooth Poincar'e conjecture; using our programs, we rule out many potential counterexamples to the conjecture. We also show that the programs are successful in detecting many ribbon knots in the range of up to 70 crossings.

Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). Builds on 4 of its 37 references that are in the map. First posted on arXiv 18 Apr 2023.

Builds on

4 of 37 references.

References · 4

  1. 2015Trust Region Policy Optimizationcited by 2,503
  2. 2016Asynchronous Methods for Deep Reinforcement Learningcited by 2,218
  3. 2020Learning to Unknotcited by 40
  4. 2021The signature and cusp geometry of hyperbolic knotscited by 8

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 2; 2024: 4; 2025: 2; 2026: 3.

11 papers.