University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Reinforcement learning and knot theory

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Reinforcement learning and knot theory

Download to your calendar using vCal

  • UserAndras Juhasz (University of Oxford)
  • ClockThursday 24 July 2025, 14:50-15:40
  • HouseExternal.

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:

Note that ex-directory lists are not shown.

Other lists

Average on weekdays: 8921.16828794 kWh Webinar & LT2, Computer Laboratory, William Gates Building. Cambridge Philosophical Society

Other talks

LCLU Annual Talk: The Early Aqueous Environment of Mars Inferred From Mission Lifetime Results by the Curiosity Rover at Gale Crater Polar Oceans Seminar Talk Scientific Steering Committee meeting Title TBC Cambridge AI in Medicine Seminar - July 2026 Mergers all the way down: simulating the origin of globular clusters in a galactic context
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity