The sharp, the flat and the shallow: Can weakly interacting agents learn to escape bad minima?

Nikolas Kantas, Panos Parpas, Grigorios A. Pavliotis

An open problem in machine learning is whether flat minima generalize better and how to compute such minima efficiently. This is a very challenging problem. As a first step towards…