Shahar Mendelson

发表

Non-Gaussian hyperplane tessellations and robust one-bit compressed sensing

Sjoerd Dirksen, Shahar Mendelson, S. Mendelson, 2018, Journal of the European Mathematical Society.

Advanced Lectures on Machine Learning

Alexander J. Smola, Shahar Mendelson, S. Mendelson, 2003, Lecture Notes in Computer Science.

Local Complexities for Empirical Risk Minimization

Peter L. Bartlett, Shahar Mendelson, Petra Philips, 2004, COLT.

Geometric Parameters of Kernel Machines

Shahar Mendelson, S. Mendelson, 2002, COLT.

Robust one-bit compressed sensing with partial circulant matrices pdf

Sjoerd Dirksen, Shahar Mendelson, S. Mendelson, 2018, The Annals of Applied Probability.

Improving the sample complexity using global data

Shahar Mendelson, S. Mendelson, 2002, IEEE Trans. Inf. Theory.

Geometric Methods in the Analysis of Glivenko-Cantelli Classes

Shahar Mendelson, 2001, COLT/EuroCOLT.

Learning Relatively Small Classes

Shahar Mendelson, 2001, COLT/EuroCOLT.

Learning without Concentration

Shahar Mendelson, S. Mendelson, 2014, COLT.

Lower Bounds for the Empirical Minimization Algorithm

Shahar Mendelson, S. Mendelson, 2008, IEEE Transactions on Information Theory.

Embedding with a Lipschitz function

Shahar Mendelson, S. Mendelson, 2005, Random Struct. Algorithms.

On the Limitations of Embedding Methods

Shahar Mendelson, S. Mendelson, 2005, COLT.

Phase Retrieval: Stability and Recovery Guarantees pdf

Yonina C. Eldar, Shahar Mendelson, S. Mendelson, 2012, ArXiv.

Entropy, Combinatorial Dimensions and Random Averages

Shahar Mendelson, Roman Vershynin, S. Mendelson, 2002, COLT.

A Few Notes on Statistical Learning Theory

Shahar Mendelson, S. Mendelson, 2002, Machine Learning Summer School.

Regularization and the small-ball method II: complexity dependent error rates

Shahar Mendelson, Guillaume Lecué, S. Mendelson, 2016, J. Mach. Learn. Res..

On the geometry of polytopes generated by heavy-tailed random vectors pdf

Holger Rauhut, Shahar Mendelson, Felix Krahmer, 2019, Communications in Contemporary Mathematics.

Mean Estimation and Regression Under Heavy-Tailed Distributions: A Survey

Shahar Mendelson, Gabor Lugosi, G. Lugosi, 2019, Found. Comput. Math..

Suprema of Chaos Processes and the Restricted Isometry Property pdf

Holger Rauhut, Shahar Mendelson, Felix Krahmer, 2012, ArXiv.

The Geometry of Random {-1,1}-Polytopes

Shahar Mendelson, Mark Rudelson, Alain Pajor, 2005, Discret. Comput. Geom..

On the Size of Convex Hulls of Small Sets

Shahar Mendelson, S. Mendelson, 2002, J. Mach. Learn. Res..

Ellipsoid Approximation Using Random Vectors

Shahar Mendelson, Alain Pajor, S. Mendelson, 2005, COLT.

Obtaining fast error rates in nonconvex situations

Shahar Mendelson, S. Mendelson, 2008, J. Complex..

Learnability in Hilbert Spaces with Reproducing Kernels

Shahar Mendelson, S. Mendelson, 2002, J. Complex..

On the Performance of Kernel Classes

Shahar Mendelson, S. Mendelson, 2003, J. Mach. Learn. Res..

Approximating the covariance ellipsoid pdf

Shahar Mendelson, S. Mendelson, 2018, Communications in Contemporary Mathematics.

Rademacher averages and phase transitions in Glivenko-Cantelli classes

Shahar Mendelson, S. Mendelson, 2002, IEEE Trans. Inf. Theory.

Gaussian averages of interpolated bodies and applications to approximate reconstruction

Shahar Mendelson, Alexander E. Litvak, Alain Pajor, 2007, J. Approx. Theory.

Learning bounded subsets of Lp pdf

Shahar Mendelson, 2020, ArXiv.

Agnostic Learning Nonconvex Function Classes

Shahar Mendelson, Robert C. Williamson, 2002, COLT.

A New On-Line Learning Model

Shahar Mendelson, S. Mendelson, 2001, Neural Computation.

An Unrestricted Learning Procedure

Shahar Mendelson, S. Mendelson, 2019, J. ACM.

Statistical Sufficiency for Classes in Empirical L2 Spaces

Naftali Tishby, Shahar Mendelson, Naftali Tishby, 2000, COLT.

Localized Rademacher Complexities

Peter L. Bartlett, Shahar Mendelson, Olivier Bousquet, 2002, COLT.

Rademacher and Gaussian Complexities: Risk Bounds and Structural Results

Peter L. Bartlett, Shahar Mendelson, P. Bartlett, 2003, J. Mach. Learn. Res..

Random Subclass Bounds

Shahar Mendelson, Petra Philips, S. Mendelson, 2003, COLT.

Complexity measures of sign matrices

Nathan Linial, Gideon Schechtman, Adi Shraibman, 2007, Comb..

Advanced Lectures on Machine Learning: Machine Learning Summer School 2002, Canberra, Australia, February 11-22, 2002, Revised Lectures

Alexander J. Smola, Shahar Mendelson, 2003 .

Robust one-bit compressed sensing with non-Gaussian measurements pdf

Sjoerd Dirksen, Shahar Mendelson, S. Mendelson, 2018, ArXiv.

On the Importance of Small Coordinate Projections

Shahar Mendelson, Petra Philips, S. Mendelson, 2004, J. Mach. Learn. Res..

The Information Of Observations And Application For Active Learning With Uncertainty

Naftali Tishby, Shahar Mendelson, Shai Fine, 2001 .

Improved bounds for sparse recovery from subsampled random convolutions pdf

Holger Rauhut, Rachel Ward, Shahar Mendelson, 2016, The Annals of Applied Probability.

Column randomization and almost-isometric embeddings

Shahar Mendelson, 2021 .

Random embeddings with an almost Gaussian distortion

Shahar Mendelson, Daniel Bartl, 2021 .

Sharp estimates on random hyperplane tessellations pdf

Sjoerd Dirksen, Shahar Mendelson, Alexander Stollenwerk, 2022, SIAM Journal on Mathematics of Data Science.

On Monte-Carlo methods in convex stochastic optimization

Shahar Mendelson, Daniel Bartl, S. Mendelson, 2021, The Annals of Applied Probability.

ON THE OPTIMALITY OF SAMPLE-BASED ESTIMATES OF THE EXPECTATION OF THE EMPIRICAL MINIMIZER ∗, ∗∗

Peter L. Bartlett, Shahar Mendelson, Petra Philips, 2010 .

A subgaussian embedding theorem

Shahar Mendelson, Nicole Tomczak-Jaegermann, S. Mendelson, 2008 .

The shattering dimension of sets of linear functionals

Gideon Schechtman, Shahar Mendelson, 2004 .

Local Rademacher complexities and oracle inequalities in risk minimization

Peter L. Bartlett, Shahar Mendelson, P. Bartlett, 2006 .

Extending the scope of the small-ball method

Shahar Mendelson, S. Mendelson, 2017, Studia Mathematica.

Generalized dual Sudakov minoration via dimension-reduction—a program

Shahar Mendelson, Grigoris Paouris, Emanuel Milman, 2016, Studia Mathematica.

On the Geometry of Random Polytopes

Shahar Mendelson, S. Mendelson, 2019, Lecture Notes in Mathematics.

Minimax rate of convergence and the performance of empirical risk minimization in phase retrieval *

Shahar Mendelson, Guillaume Lecué, S. Mendelson, 2015 .

Embedding with a Lipschitz function

Shahar Mendelson, S. Mendelson, 2005 .

A remark on "Robust machine learning by median-of-means"

Shahar Mendelson, Gabor Lugosi, 2017 .

`local' vs. `global' parameters -- breaking the gaussian complexity barrier

Shahar Mendelson, S. Mendelson, 2015, 1504.02191.

Optimal Sample-Based Estimates of the Expectation of the Empirical Minimizer

Peter L. Bartlett, Shahar Mendelson, Petra Philips, 2005 .

General nonexact oracle inequalities for classes with a subexponential envelope

Shahar Mendelson, Guillaume Lecu'e, S. Mendelson, 2012, 1206.0871.