S. Mendelson

activity

20022026

most citedLocal Rademacher complexities

373 citations · 909 across the 61 of their papers we have counts for

collaborators

Showing 2020Show all

4 papers · 1 filter

math.FA2020

An isomorphic Dvoretzky-Milman Theorem using general random ensembles

Shahar Mendelson

We construct rather general random ensembles that yield the optimal (isomorphic) estimate in the Dvoretzky-Milman Theorem. This is the first construction of non gaussian/spherical…

math.ST2020

Multivariate mean estimation with direction-dependent accuracy

Gabor Lugosi, Shahar Mendelson

We consider the problem of estimating the mean of a random vector based on $N$ independent, identically distributed observations. We prove the existence of an estimator that has a…

math.PR2020★ 1 cited

Approximating $L_{p}$ unit balls via random sampling

Shahar Mendelson

Let $X$ be an isotropic random vector in $R^{d}$ that satisfies that for every $v \in S^{d - 1}$ , $∥ < X, v > ∥_{L_{q}} \leq L ∥ < X, v > ∥_{L_{p}}$ for some $q \geq 2 p$ . We show that for $0<\va…

stat.ML2020★ 2 cited

Learning bounded subsets of $L_{p}$

Shahar Mendelson

We study learning problems in which the underlying class is a bounded subset of $L_{p}$ and the target $Y$ belongs to $L_{p}$ . Previously, minimax sample complexity estimates were know…

An isomorphic Dvoretzky-Milman Theorem using general random ensembles

Multivariate mean estimation with direction-dependent accuracy

Approximating Lp​ unit balls via random sampling

Learning bounded subsets of Lp​

Approximating $L_{p}$ unit balls via random sampling

Learning bounded subsets of $L_{p}$