373 citations · 909 across the 61 of their papers we have counts for
79 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…
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…
Can we spot a fake?
Shahar Mendelson, Grigoris Paouris, Roman Vershynin
The problem of detecting fake data inspires the following seemingly simple mathematical question. Sample a data point from the standard normal distribution in . A…
Covariance estimation with direction dependence accuracy
Pedro Abdalla, Shahar Mendelson
We construct an estimator for covariance matrices of unknown, centred random vectors X, with the given data consisting of N independent measurements of X…
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:…