Shahar Mendelson

51 papers A* 10Journal 36Unranked 4
YearRankTypeTitle / Venue / Authors
2025 J jnl
Do we really need the Rademacher complexities?
CoRR
Daniel Bartl, Shahar Mendelson
2024 J jnl
Fast Metric Embedding into the Hamming Cube.
SIAM J. Comput.
Sjoerd Dirksen, Shahar Mendelson, Alexander Stollenwerk
2023 J jnl
Fitting an ellipsoid to a quadratic number of random points.
CoRR
Afonso S. Bandeira, Antoine Maillard, Shahar Mendelson, Elliot Paquette
2022 J jnl
Fast metric embedding into the Hamming cube.
CoRR
Sjoerd Dirksen, Shahar Mendelson, Alexander Stollenwerk
2022 J jnl
Sharp Estimates on Random Hyperplane Tessellations.
SIAM J. Math. Data Sci.
Sjoerd Dirksen, Shahar Mendelson, Alexander Stollenwerk
2022 J jnl
Sharp estimates on random hyperplane tessellations.
CoRR
Sjoerd Dirksen, Shahar Mendelson, Alexander Stollenwerk
2021 J jnl
Learning Bounded Subsets of Lₚ.
IEEE Trans. Inf. Theory
Shahar Mendelson
2020 J jnl
Learning bounded subsets of L
CoRR
Shahar Mendelson
2019 J jnl
An Unrestricted Learning Procedure.
J. ACM
Shahar Mendelson
2019 J jnl
Mean Estimation and Regression Under Heavy-Tailed Distributions: A Survey.
Found. Comput. Math.
Gábor Lugosi, Shahar Mendelson
2019 J jnl
Mean estimation and regression under heavy-tailed distributions-a survey.
CoRR
Gábor Lugosi, Shahar Mendelson
2019 J jnl
On the geometry of polytopes generated by heavy-tailed random vectors.
CoRR
Olivier Guédon, Felix Krahmer, Christian Kümmerle, Shahar Mendelson, Holger Rauhut
2018 J jnl
Approximating the covariance ellipsoid.
CoRR
Shahar Mendelson
2018 J jnl
Robust one-bit compressed sensing with non-Gaussian measurements.
CoRR
Sjoerd Dirksen, Shahar Mendelson
2018 J jnl
Robust one-bit compressed sensing with partial circulant matrices.
CoRR
Sjoerd Dirksen, Shahar Mendelson
2017 J jnl
Regularization and the small-ball method II: complexity dependent error rates.
J. Mach. Learn. Res.
Guillaume Lecué, Shahar Mendelson
2016 J jnl
Improved bounds for sparse recovery from subsampled random convolutions.
CoRR
Shahar Mendelson, Holger Rauhut, Rachel A. Ward
2015 J jnl
Learning without Concentration.
J. ACM
Shahar Mendelson
2014 J jnl
Learning without Concentration.
CoRR
Shahar Mendelson
2014 A* conf
Learning without concentration.
COLT
Shahar Mendelson
2012 J jnl
Phase Retrieval: Stability and Recovery Guarantees
CoRR
Yonina C. Eldar, Shahar Mendelson
2012 J jnl
Suprema of Chaos Processes and the Restricted Isometry Property
CoRR
Felix Krahmer, Shahar Mendelson, Holger Rauhut
2008 J jnl
Lower Bounds for the Empirical Minimization Algorithm.
IEEE Trans. Inf. Theory
Shahar Mendelson
2008 J jnl
Obtaining fast error rates in nonconvex situations.
J. Complex.
Shahar Mendelson
2007 J jnl
Complexity measures of sign matrices.
Comb.
Nati Linial, Shahar Mendelson, Gideon Schechtman, Adi Shraibman
2007 J jnl
Gaussian averages of interpolated bodies and applications to approximate reconstruction.
J. Approx. Theory
Y. Gordon, Alexander E. Litvak, Shahar Mendelson, Alain Pajor
2005 A* conf
Ellipsoid Approximation Using Random Vectors.
COLT
Shahar Mendelson, Alain Pajor
2005 J jnl
Embedding with a Lipschitz function.
Random Struct. Algorithms
Shahar Mendelson
2005 A* conf
On the Limitations of Embedding Methods.
COLT
Shahar Mendelson
2005 J jnl
The Geometry of Random {-1, 1}-Polytopes.
Discret. Comput. Geom.
Shahar Mendelson, Alain Pajor, Mark Rudelson
2004 A* conf
Local Complexities for Empirical Risk Minimization.
COLT
Peter L. Bartlett, Shahar Mendelson, Petra Philips
2004 J jnl
On the Importance of Small Coordinate Projections.
J. Mach. Learn. Res.
Shahar Mendelson, Petra Philips
2003 — ed.
Advanced Lectures on Machine Learning, Machine Learning Summer School 2002, Canberra, Australia, February 11-22, 2002, Revised Lectures
Machine Learning Summer School
Shahar Mendelson, Alexander J. Smola
2003 J jnl
On the Performance of Kernel Classes.
J. Mach. Learn. Res.
Shahar Mendelson
2003 A* conf
Random Subclass Bounds.
COLT
Shahar Mendelson, Petra Philips
2002 — conf
A Few Notes on Statistical Learning Theory.
Machine Learning Summer School
Shahar Mendelson
2002 A* conf
Agnostic Learning Nonconvex Function Classes.
COLT
Shahar Mendelson, Robert C. Williamson
2002 A* conf
Entropy, Combinatorial Dimensions and Random Averages.
COLT
Shahar Mendelson, Roman Vershynin
2002 A* conf
Geometric Parameters of Kernel Machines.
COLT
Shahar Mendelson
2002 J jnl
Improving the sample complexity using global data.
IEEE Trans. Inf. Theory
Shahar Mendelson
2002 J jnl
Learnability in Hilbert Spaces with Reproducing Kernels.
J. Complex.
Shahar Mendelson
2002 A* conf
Localized Rademacher Complexities.
COLT
Peter L. Bartlett, Olivier Bousquet, Shahar Mendelson
2002 J jnl
Rademacher and Gaussian Complexities: Risk Bounds and Structural Results.
J. Mach. Learn. Res.
Peter L. Bartlett, Shahar Mendelson
2002 J jnl
Rademacher averages and phase transitions in Glivenko-Cantelli classes.
IEEE Trans. Inf. Theory
Shahar Mendelson
2001 J jnl
A New On-Line Learning Model.
Neural Comput.
Shahar Mendelson
2001 — conf
Geometric Methods in the Analysis of Glivenko-Cantelli Classes.
COLT/EuroCOLT
Shahar Mendelson
2001 — conf
Learning Relatively Small Classes.
COLT/EuroCOLT
Shahar Mendelson
2001 J jnl
On the Size of Convex Hulls of Small Sets.
J. Mach. Learn. Res.
Shahar Mendelson
2001 — conf
Rademacher and Gaussian Complexities: Risk Bounds and Structural Results.
COLT/EuroCOLT
Peter L. Bartlett, Shahar Mendelson
2001 J jnl
Recurrence Methods in the Analysis of Learning Processes.
Neural Comput.
Shahar Mendelson, Israel Nelken
2000 A* conf
Statistical Sufficiency for Classes in Empirical L
COLT
Shahar Mendelson, Naftali Tishby