기초과학연구원 이산수학그룹
On June 2, 2021, Adam Zsolt Wagner from the Tel Aviv University gave an online talk at the Virtual Discrete Math Colloquium on disproving graph theory conjectures by using reinforcement learning. The title of the talk was “Constructions in combinatorics via neural networks“.
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 very basic 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.
On January 20, 2020, Adam Zsolt Wagner from ETH Zurich gave a talk on the largest subset of
What is the largest subset of
This is joint work with Jason Long.