| Rademacher and Gaussian complexities: Risk bounds and structural results PL Bartlett, S Mendelson Journal of Machine Learning Research 3 (Nov), 463-482, 2002 | 2880 | 2002 |
| Local rademacher complexities PL Bartlett, O Bousquet, S Mendelson | 908 | 2005 |
| Uniform uncertainty principle for Bernoulli and subgaussian ensembles S Mendelson, A Pajor, N Tomczak-Jaegermann Constructive Approximation 28, 277-289, 2008 | 357 | 2008 |
| Learning without concentration S Mendelson Journal of the ACM 63 (3), 1-25, 2014 | 353 | 2014 |
| Suprema of chaos processes and the restricted isometry property F Krahmer, S Mendelson, H Rauhut Communications on Pure and Applied Mathematics 67 (11), 1877-1904, 2014 | 263 | 2014 |
| A probabilistic approach to the geometry of the ℓpn-ball F Barthe, O Guédon, S Mendelson, A Naor | 261 | 2005 |
| Empirical minimization PL Bartlett, S Mendelson Probability theory and related fields 135 (3), 311-334, 2006 | 257 | 2006 |
| Phase retrieval: Stability and recovery guarantees YC Eldar, S Mendelson Applied and Computational Harmonic Analysis 36 (3), 473-494, 2014 | 243 | 2014 |
| Reconstruction and subgaussian operators in asymptotic geometric analysis S Mendelson, A Pajor, N Tomczak-Jaegermann Geometric and Functional Analysis 17 (4), 1248-1282, 2007 | 241 | 2007 |
| A few notes on statistical learning theory S Mendelson Advanced Lectures on Machine Learning: Machine Learning Summer School 2002 …, 2003 | 239 | 2003 |
| Mean estimation and regression under heavy-tailed distributions: A survey G Lugosi, S Mendelson Foundations of Computational Mathematics 19 (5), 1145-1190, 2019 | 216 | 2019 |
| Bounding the smallest singular value of a random matrix without concentration V Koltchinskii, S Mendelson International Mathematics Research Notices 2015 (23), 12991-13008, 2015 | 185 | 2015 |
| Sub-Gaussian estimators of the mean of a random vector G Lugosi, S Mendelson | 174 | 2019 |
| Regularization in kernel learning S Mendelson, J Neeman | 161 | 2010 |
| Complexity measures of sign matrices N Linial, S Mendelson, G Schechtman, A Shraibman Combinatorica 27, 439-463, 2007 | 161 | 2007 |
| Risk minimization by median-of-means tournaments G Lugosi, S Mendelson Journal of the European Mathematical Society 22 (3), 925-965, 2019 | 150 | 2019 |
| Improving the sample complexity using global data S Mendelson IEEE transactions on Information Theory 48 (7), 1977-1991, 2002 | 144 | 2002 |
| Entropy and the combinatorial dimension S Mendelson, R Vershynin Inventiones mathematicae 152 (1), 37-55, 2003 | 142 | 2003 |
| Localized rademacher complexities PL Bartlett, O Bousquet, S Mendelson International Conference on Computational Learning Theory, 44-58, 2002 | 134 | 2002 |
| Rademacher and Gaussian complexities: Risk bounds and structural results PL Bartlett, S Mendelson International Conference on Computational Learning Theory, 224-240, 2001 | 128 | 2001 |
