Skip navigation
Skip navigation

On the limitations of embedding methods

Mendelson, Shahar


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

CollectionsANU Research Publications
Date published: 2005
Type: Journal article
Source: Lecture Notes in Computer Science (LNCS)


There are no files associated with this item.

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  22 January 2019/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator