On the limitations of embedding methods
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
|Collections||ANU Research Publications|
|Source:||Lecture Notes in Computer Science (LNCS)|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.