Relocation of compact sets in Rn by diffeomorphisms and linear separability of datasets in Rn
Abstract
Relocation of compact sets in an n-dimensional manifold by self-diffeomorphism is of its own interest as well as significant potential applications to data classification in data science. This paper presents a theory for relocating a finite number of compact sets in Rn to be relocated to arbitrary target domains in Rn by diffeomorphisms of Rn. Furthermore, we prove that for any such collection, there exists a differentiable embedding into Rn+1 such that their images become linearly separable. As applications of the established theory, we show that a finite number of compact datasets in Rn can be made linearly separable by width-n deep neural networks (DNNs) with Leaky-ReLU, ELU, or SELU activation functions, under a mild condition. In addition, we show that any finite number of mutually disjoint compact datasets in Rn can be made linearly separable in Rn+1 by a width-(n+1) DNN.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.