Reinforcement learning and knot theory

Add to your list(s) Download to your calendar using vCal

• Andras Juhasz (University of Oxford)
• Thursday 24 July 2025, 14:50-15:40
• External.

If you have a question about this talk, please contact nobody.

OGGW05 - Geometric and combinatorial methods in the foundations of computer science and artificial intelligence

Several hard problems in knot theory can be formulated as single-player games, including computing the unknotting number and the 4-ball genus, making these amenable to reinforcement learning (RL) algorithms. There has been substantial progress over the past few years, but there is still a gap between what is possible using RL and more classical methods. I will discuss some of the latest results and remaining challenges. 

This talk is part of the Isaac Newton Institute Seminar Series series.

This talk is included in these lists:

• All CMS events
• External
• Featured lists
• INI info aggregator
• Isaac Newton Institute Seminar Series
• School of Physical Sciences
• bld31

Note that ex-directory lists are not shown.