7 papers
On the structure of marginals in high dimensions
Daniel Bartl, Shahar Mendelson
Let be independent copies of a standard gaussian random vector in and denote by the standard gaussi…
Robust, sub-Gaussian mean estimators in metric spaces
Daniel Bartl, Gabor Lugosi, Roberto Imbuzeiro Oliveira +1
Estimating the mean of a random vector from i.i.d. data has received considerable attention, and the optimal accuracy one may achieve with a given confidence is fairly well underst…
Do we really need the Rademacher complexities?
Daniel Bartl, Shahar Mendelson
We study the fundamental problem of learning with respect to the squared loss in a convex class. The state-of-the-art sample complexity estimates in this setting rely on Rademacher…
Uniform mean estimation via generic chaining
Daniel Bartl, Shahar Mendelson
We introduce an empirical functional that is an optimal uniform mean estimator: Let be a class of mean zero functions, is a real valued function, and $X_1…
A uniform Dvoretzky-Kiefer-Wolfowitz inequality
Daniel Bartl, Shahar Mendelson
We show that under minimal assumptions on a class of functions defined on a probability space , there is a threshold satisfying the following:…
Optimal non-gaussian Dvoretzky-Milman embeddings
Daniel Bartl, Shahar Mendelson
We construct the first non-gaussian ensemble that yields the optimal estimate in the Dvoretzky-Milman Theorem: the ensemble exhibits almost Euclidean sections in arbitrary normed s…
Empirical approximation of the gaussian distribution in
Daniel Bartl, Shahar Mendelson
Let be independent copies of the standard gaussian random vector in . We show that there is an absolute constant such that for any $A \subset S^{d…