Shahar Mendelson - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 35 from 35

2024

Fast Metric Embedding into the Hamming CubeSjoerd Dirksen, Shahar Mendelson, Alexander Stollenwerk. SICOMP, 53(2):315-345, 2024. [doi]

2022

Sharp Estimates on Random Hyperplane TessellationsSjoerd Dirksen, Shahar Mendelson, Alexander Stollenwerk. simods, 4(4):1396-1419, December 2022. [doi]

2021

Learning Bounded Subsets of LₚShahar Mendelson. TIT, 67(8):5269-5282, 2021. [doi]

2019

Mean Estimation and Regression Under Heavy-Tailed Distributions: A SurveyGábor Lugosi, Shahar Mendelson. focm, 19(5):1145-1190, 2019. [doi]

An Unrestricted Learning ProcedureShahar Mendelson. JACM, 66(6), 2019. [doi]

2017

Regularization and the small-ball method II: complexity dependent error ratesGuillaume Lecué, Shahar Mendelson. jmlr, 18, 2017. [doi]

2015

Learning without ConcentrationShahar Mendelson. JACM, 62(3):21, 2015. [doi]

2014

Learning without concentrationShahar Mendelson. colt 2014: 25-39 [doi]

2008

Lower Bounds for the Empirical Minimization AlgorithmShahar Mendelson. TIT, 54(8):3797-3803, 2008. [doi]

Obtaining fast error rates in nonconvex situationsShahar Mendelson. jc, 24(3):380-397, 2008. [doi]

2007

Gaussian averages of interpolated bodies and applications to approximate reconstructionY. Gordon, A. E. Litvak, Shahar Mendelson, A. Pajor. jat, 149(1):59-73, 2007. [doi]

Complexity measures of sign matricesNati Linial, Shahar Mendelson, Gideon Schechtman, Adi Shraibman. combinatorica, 27(4):439-463, 2007. [doi]

2005

Embedding with a Lipschitz functionShahar Mendelson. rsa, 27(1):25-45, 2005. [doi]

The Geometry of Random {-1, 1}-PolytopesShahar Mendelson, A. Pajor, M. Rudelson. dcg, 34(3):365-379, 2005. [doi]

On the Limitations of Embedding MethodsShahar Mendelson. colt 2005: 353-365 [doi]

Ellipsoid Approximation Using Random VectorsShahar Mendelson, A. Pajor. colt 2005: 429-443 [doi]

2004

Local Complexities for Empirical Risk MinimizationPeter L. Bartlett, Shahar Mendelson, Petra Philips. colt 2004: 270-284 [doi]

On the Importance of Small Coordinate ProjectionsShahar Mendelson, Petra Philips. jmlr, 5:219-238, 2004. [doi]

2003

On the Performance of Kernel ClassesShahar Mendelson. jmlr, 4:759-771, 2003. [doi]

Random Subclass BoundsShahar Mendelson, Petra Philips. colt 2003: 329-343 [doi]

2002

Rademacher and Gaussian Complexities: Risk Bounds and Structural ResultsPeter L. Bartlett, Shahar Mendelson. jmlr, 3:463-482, 2002. [doi]

Localized Rademacher ComplexitiesPeter L. Bartlett, Olivier Bousquet, Shahar Mendelson. colt 2002: 44-58 [doi]

Learnability in Hilbert Spaces with Reproducing KernelsShahar Mendelson. jc, 18(1):152-170, 2002. [doi]

Rademacher averages and phase transitions in Glivenko-Cantelli classesShahar Mendelson. TIT, 48(1):251-263, 2002.

Improving the sample complexity using global dataShahar Mendelson. TIT, 48(7):1977-1991, 2002.

Geometric Parameters of Kernel MachinesShahar Mendelson. colt 2002: 29-43 [doi]

Agnostic Learning Nonconvex Function ClassesShahar Mendelson, Robert C. Williamson. colt 2002: 1-13 [doi]

Entropy, Combinatorial Dimensions and Random AveragesShahar Mendelson, Roman Vershynin. colt 2002: 14-28 [doi]

A Few Notes on Statistical Learning TheoryShahar Mendelson. mlss 2003: 1-40 [doi]

2001

2000

Statistical Sufficiency for Classes in Empirical L::2:: SpacesShahar Mendelson, Naftali Tishby. colt 2000: 81-89

Sign in or sign up to see more results.

runs on WebDSL