Clemens Kinn

Fast approximation and learning of binary classification tasks in o-minimal structures using ReLU neural networks

Clemens Kinn, Philipp Petersen

We study binary classification problems whose decision sets are given by definable sets in o-minimal expansions of the real field. Motivated by cell decomposition of definable sets, we introduce traceable sets as a classical proxy for definable decision regions and analyze their…Read more