activity
20232026
collaborators

7 papers

math.PR2026

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…

math.ST2025

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…

math.ST2025

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…

math.PR2025

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…

math.PR2023

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:…

math.FA2023

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…

math.PR2023

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…