nonsmooth nonconvex

Deep Learning as the Disciplined Construction of Tame Objects

arXiv:2509.18025v2 Announce Type: replace-cross Abstract: One can see deep-learning models as compositions of functions within the so-called tame geometry. In this expository note, we give an overview of some topics at the interface of tame geometry (also known as o-minimality), optimization theory, and deep learning theory and practice. To do so, we gradually introduce the concepts and tools used to build convergence guarantees for stochastic gradient descent in a general nonsmooth...