On the limitations of embedding methods
Abstract
We show that for any class of functions H which has a reasonable combinatorial dimension, the vast majority of small subsets of the combinatorial cube can not be represented as a Lipschitz image of a subset of H, unless the Lipschitz constant is very larg
Description
Citation
Collections
Source
Lecture Notes in Computer Science (LNCS)