activity
20022026
most citedLocal Rademacher complexities

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

collaborators
Showing 2014Show all

7 papers · 1 filter

math.FA2014

Dvoretzky type theorems for subgaussian coordinate projections

Shahar Mendelson

Given a class of functions on a probability space , we study the structure of a typical coordinate projection of the class, defined by ,…

stat.ML2014

Learning without Concentration for General Loss Functions

Shahar Mendelson

We study prediction and estimation problems using empirical risk minimization, relative to a general convex loss function. We obtain sharp error rates even when concentration is fa…

math.PR2014★ 6 cited

Upper bounds on product and multiplier empirical processes

Shahar Mendelson

We study two empirical process of special structure: firstly, the centred multiplier process indexed by a class , $f \to \left|\sum_{i=1}^N (ξ_i f(X_i) - \E ξf)\right|$, where t…

math.ST2014★ 1 cited

Necessary moment conditions for exact reconstruction via basis pursuit

Guillaume Lecué, Shahar Mendelson

Let be a random vector that satisfies a weak small ball property and whose coordinates satisfy that for $p \…

math.ST2014★ 19 cited

Performance of empirical risk minimization in linear aggregation

Guillaume Lecué, Shahar Mendelson

We study conditions under which, given a dictionary and an i.i.d. sample , the empirical minimizer in relative…

math.ST2014

Sparse recovery under weak moment assumptions

Guillaume Lecué, Shahar Mendelson

We prove that iid random vectors that satisfy a rather weak moment assumption can be used as measurement vectors in Compressed Sensing, and the number of measurements required for…