Mendelson, Shahar2015-12-132015-12-130302-9743http://hdl.handle.net/1885/85311We 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 largKeywords: Classification (of information); Problem solving; Classification problems; Combinatorial dimension; Lipschitz image; Lipschitz loss; Embedded systems20052015-12-12