Gerbner Dániel: Stability for maximal F-free graphs
Gerbner DánielKombinatorika szeminárium
on 4/15/21
Recently, significant progress has been made in the area of machine learning algorithms, and they have quickly become some of the most exciting tools in a scientist’s toolbox. In particular, recent advances in the field of reinforcement learning have led computers to reach superhuman level play in Atari games and Go, purely through self-play. In this talk I will give a quick introduction to neural networks and reinforcement learning algorithms. I will also indicate how these methods can be adapted to the ``game'' of trying to find a counterexample to a mathematical conjecture, and show some examples where this approach was successful.