Recorded 14 February 2023. Adam Wagner of Worcester Polytechnic Institute presents "Finding counterexamples to conjectures via reinforcement learning" at IPAM's Machine Assisted Proofs Workshop. Abstract: In this talk we will leverage a reinforcement learning method, specifically the cross-entropy method, to search for counterexamples to several conjectures in graph theory and combinatorics. We will present a very simplistic setup, in which only minimal changes need to be made (namely the reward function used for RL) in order to successfully attack a wide variety of problems. As a result we will resolve several open problems, and find more elegant counterexamples to previously disproved ones. Learn more online at: http://www.ipam.ucla.edu/programs/workshops/machine-assisted-proofs/