Abstract: There is a growing interest in statistical bounds with no explicit dependence on the dimensionality of the data. This talk is devoted to three classical problems where one can successfully remove any explicit dependence on the dimension. The first part is devoted to robust algorithms for the k-means clustering problem where a quantizer is constructed based on a sample of independent...