Shahar Mendelson

According to our database, Shahar Mendelson authored at least 43 papers between 2000 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

Fast Metric Embedding into the Hamming Cube.

Sjoerd Dirksen, Shahar Mendelson, Alexander Stollenwerk

SIAM J. Comput., 2024

2023

Fitting an ellipsoid to a quadratic number of random points.

Afonso S. Bandeira, Antoine Maillard, Shahar Mendelson, Elliot Paquette

CoRR, 2023

2022

Sharp Estimates on Random Hyperplane Tessellations.

Sjoerd Dirksen, Shahar Mendelson, Alexander Stollenwerk

SIAM J. Math. Data Sci., December, 2022

2021

Learning Bounded Subsets of Lₚ.

Shahar Mendelson

IEEE Trans. Inf. Theory, 2021

2020

Learning bounded subsets of L_p.

Shahar Mendelson

CoRR, 2020

2019

An Unrestricted Learning Procedure.

Shahar Mendelson

J. ACM, 2019

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

Gábor Lugosi, Shahar Mendelson

Found. Comput. Math., 2019

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

Olivier Guédon, Felix Krahmer, Christian Kümmerle, Shahar Mendelson, Holger Rauhut

CoRR, 2019

2018

Robust one-bit compressed sensing with partial circulant matrices.

Sjoerd Dirksen, Shahar Mendelson

CoRR, 2018

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

Sjoerd Dirksen, Shahar Mendelson

CoRR, 2018

Approximating the covariance ellipsoid.

Shahar Mendelson

CoRR, 2018

2017

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

Guillaume Lecué, Shahar Mendelson

J. Mach. Learn. Res., 2017

2016

Improved bounds for sparse recovery from subsampled random convolutions.

Shahar Mendelson, Holger Rauhut, Rachel A. Ward

CoRR, 2016

2015

Learning without Concentration.

Shahar Mendelson

J. ACM, 2015

2012

Phase Retrieval: Stability and Recovery Guarantees

Yonina C. Eldar, Shahar Mendelson

CoRR, 2012

Suprema of Chaos Processes and the Restricted Isometry Property

Felix Krahmer, Shahar Mendelson, Holger Rauhut

CoRR, 2012

2008

Lower Bounds for the Empirical Minimization Algorithm.

Shahar Mendelson

IEEE Trans. Inf. Theory, 2008

Obtaining fast error rates in nonconvex situations.

Shahar Mendelson

J. Complex., 2008

2007

Gaussian averages of interpolated bodies and applications to approximate reconstruction.

Y. Gordon, Alexander E. Litvak, Shahar Mendelson, Alain Pajor

J. Approx. Theory, 2007

Complexity measures of sign matrices.

Nati Linial, Shahar Mendelson, Gideon Schechtman, Adi Shraibman

Comb., 2007

2005

Embedding with a Lipschitz function.

Shahar Mendelson

Random Struct. Algorithms, 2005

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

Shahar Mendelson, Alain Pajor, Mark Rudelson

Discret. Comput. Geom., 2005

Ellipsoid Approximation Using Random Vectors.

Shahar Mendelson, Alain Pajor

Proceedings of the Learning Theory, 18th Annual Conference on Learning Theory, 2005

On the Limitations of Embedding Methods.

Shahar Mendelson

Proceedings of the Learning Theory, 18th Annual Conference on Learning Theory, 2005

2004

On the Importance of Small Coordinate Projections.

Shahar Mendelson, Petra Philips

J. Mach. Learn. Res., 2004

Local Complexities for Empirical Risk Minimization.

Peter L. Bartlett, Shahar Mendelson, Petra Philips

Proceedings of the Learning Theory, 17th Annual Conference on Learning Theory, 2004

2003

On the Performance of Kernel Classes.

Shahar Mendelson

J. Mach. Learn. Res., 2003

Random Subclass Bounds.

Shahar Mendelson, Petra Philips

Proceedings of the Computational Learning Theory and Kernel Machines, 2003

2002

Improving the sample complexity using global data.

Shahar Mendelson

IEEE Trans. Inf. Theory, 2002

Rademacher averages and phase transitions in Glivenko-Cantelli classes.

Shahar Mendelson

IEEE Trans. Inf. Theory, 2002

Rademacher and Gaussian Complexities: Risk Bounds and Structural Results.

Peter L. Bartlett, Shahar Mendelson

J. Mach. Learn. Res., 2002

Learnability in Hilbert Spaces with Reproducing Kernels.

Shahar Mendelson

J. Complex., 2002

A Few Notes on Statistical Learning Theory.

Shahar Mendelson

Proceedings of the Advanced Lectures on Machine Learning, 2002

Agnostic Learning Nonconvex Function Classes.

Shahar Mendelson, Robert C. Williamson

Proceedings of the Computational Learning Theory, 2002

Entropy, Combinatorial Dimensions and Random Averages.

Shahar Mendelson, Roman Vershynin

Proceedings of the Computational Learning Theory, 2002

Geometric Parameters of Kernel Machines.

Shahar Mendelson

Proceedings of the Computational Learning Theory, 2002

Localized Rademacher Complexities.

Peter L. Bartlett, Olivier Bousquet, Shahar Mendelson

Proceedings of the Computational Learning Theory, 2002

2001

Recurrence Methods in the Analysis of Learning Processes.

Shahar Mendelson, Israel Nelken

Neural Comput., 2001

A New On-Line Learning Model.

Shahar Mendelson

Neural Comput., 2001

On the Size of Convex Hulls of Small Sets.

Shahar Mendelson

J. Mach. Learn. Res., 2001

Learning Relatively Small Classes.

Shahar Mendelson

Proceedings of the Computational Learning Theory, 2001

Geometric Methods in the Analysis of Glivenko-Cantelli Classes.

Shahar Mendelson

Proceedings of the Computational Learning Theory, 2001

2000

Statistical Sufficiency for Classes in Empirical L₂ Spaces.

Shahar Mendelson, Naftali Tishby

Proceedings of the Thirteenth Annual Conference on Computational Learning Theory (COLT 2000), June 28, 2000