Shahar Mendelson

Publication Activity (10 Years)

Years Active: 2000-2024
Publications (10 Years): 17

Top Topics

Ordinary Least Squares

Compressed Sensing

Top Venues

IEEE Trans. Inf. Theory

SIAM J. Math. Data Sci.

Publications

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