default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShahar Mendelson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j22]Sjoerd Dirksen, Shahar Mendelson, Alexander Stollenwerk:
Fast Metric Embedding into the Hamming Cube. SIAM J. Comput. 53(2): 315-345 (2024)- 2023
- [i13]Afonso S. Bandeira, Antoine Maillard, Shahar Mendelson, Elliot Paquette:
Fitting an ellipsoid to a quadratic number of random points. CoRR abs/2307.01181 (2023) - 2022
- [j21]Sjoerd Dirksen, Shahar Mendelson
, Alexander Stollenwerk:
Sharp Estimates on Random Hyperplane Tessellations. SIAM J. Math. Data Sci. 4(4): 1396-1419 (2022) - [i12]Sjoerd Dirksen, Shahar Mendelson, Alexander Stollenwerk:
Sharp estimates on random hyperplane tessellations. CoRR abs/2201.05204 (2022) - [i11]Sjoerd Dirksen, Shahar Mendelson, Alexander Stollenwerk:
Fast metric embedding into the Hamming cube. CoRR abs/2204.04109 (2022) - 2021
- [j20]Shahar Mendelson:
Learning Bounded Subsets of Lₚ. IEEE Trans. Inf. Theory 67(8): 5269-5282 (2021) - 2020
- [i10]Shahar Mendelson:
Learning bounded subsets of Lp. CoRR abs/2002.01182 (2020)
2010 – 2019
- 2019
- [j19]Gábor Lugosi, Shahar Mendelson:
Mean Estimation and Regression Under Heavy-Tailed Distributions: A Survey. Found. Comput. Math. 19(5): 1145-1190 (2019) - [j18]Shahar Mendelson:
An Unrestricted Learning Procedure. J. ACM 66(6): 42:1-42:42 (2019) - [i9]Gábor Lugosi, Shahar Mendelson:
Mean estimation and regression under heavy-tailed distributions-a survey. CoRR abs/1906.04280 (2019) - [i8]Olivier Guédon, Felix Krahmer, Christian Kümmerle, Shahar Mendelson, Holger Rauhut:
On the geometry of polytopes generated by heavy-tailed random vectors. CoRR abs/1907.07258 (2019) - 2018
- [i7]Shahar Mendelson:
Approximating the covariance ellipsoid. CoRR abs/1804.05402 (2018) - [i6]Sjoerd Dirksen, Shahar Mendelson:
Robust one-bit compressed sensing with non-Gaussian measurements. CoRR abs/1805.09409 (2018) - [i5]Sjoerd Dirksen, Shahar Mendelson:
Robust one-bit compressed sensing with partial circulant matrices. CoRR abs/1812.06719 (2018) - 2017
- [j17]Guillaume Lecué, Shahar Mendelson:
Regularization and the small-ball method II: complexity dependent error rates. J. Mach. Learn. Res. 18: 146:1-146:48 (2017) - 2016
- [i4]Shahar Mendelson, Holger Rauhut, Rachel A. Ward:
Improved bounds for sparse recovery from subsampled random convolutions. CoRR abs/1610.04983 (2016) - 2015
- [j16]Shahar Mendelson:
Learning without Concentration. J. ACM 62(3): 21:1-21:25 (2015) - 2014
- [c14]Shahar Mendelson:
Learning without concentration. COLT 2014: 25-39 - [i3]Shahar Mendelson:
Learning without Concentration. CoRR abs/1401.0304 (2014) - 2012
- [i2]Felix Krahmer, Shahar Mendelson, Holger Rauhut:
Suprema of Chaos Processes and the Restricted Isometry Property. CoRR abs/1207.0235 (2012) - [i1]Yonina C. Eldar, Shahar Mendelson:
Phase Retrieval: Stability and Recovery Guarantees. CoRR abs/1211.0872 (2012)
2000 – 2009
- 2008
- [j15]Shahar Mendelson:
Obtaining fast error rates in nonconvex situations. J. Complex. 24(3): 380-397 (2008) - [j14]Shahar Mendelson:
Lower Bounds for the Empirical Minimization Algorithm. IEEE Trans. Inf. Theory 54(8): 3797-3803 (2008) - 2007
- [j13]Nati Linial, Shahar Mendelson, Gideon Schechtman, Adi Shraibman:
Complexity measures of sign matrices. Comb. 27(4): 439-463 (2007) - [j12]Y. Gordon, Alexander E. Litvak, Shahar Mendelson, Alain Pajor:
Gaussian averages of interpolated bodies and applications to approximate reconstruction. J. Approx. Theory 149(1): 59-73 (2007) - 2005
- [j11]Shahar Mendelson, Alain Pajor, Mark Rudelson:
The Geometry of Random {-1, 1}-Polytopes. Discret. Comput. Geom. 34(3): 365-379 (2005) - [j10]Shahar Mendelson:
Embedding with a Lipschitz function. Random Struct. Algorithms 27(1): 25-45 (2005) - [c13]Shahar Mendelson:
On the Limitations of Embedding Methods. COLT 2005: 353-365 - [c12]Shahar Mendelson, Alain Pajor:
Ellipsoid Approximation Using Random Vectors. COLT 2005: 429-443 - 2004
- [j9]Shahar Mendelson, Petra Philips:
On the Importance of Small Coordinate Projections. J. Mach. Learn. Res. 5: 219-238 (2004) - [c11]Peter L. Bartlett, Shahar Mendelson, Petra Philips:
Local Complexities for Empirical Risk Minimization. COLT 2004: 270-284 - 2003
- [j8]Shahar Mendelson:
On the Performance of Kernel Classes. J. Mach. Learn. Res. 4: 759-771 (2003) - [c10]Shahar Mendelson, Petra Philips:
Random Subclass Bounds. COLT 2003: 329-343 - [e1]Shahar Mendelson, Alexander J. Smola:
Advanced Lectures on Machine Learning, Machine Learning Summer School 2002, Canberra, Australia, February 11-22, 2002, Revised Lectures. Lecture Notes in Computer Science 2600, Springer 2003, ISBN 3-540-00529-3 [contents] - 2002
- [j7]Shahar Mendelson:
Learnability in Hilbert Spaces with Reproducing Kernels. J. Complex. 18(1): 152-170 (2002) - [j6]Peter L. Bartlett, Shahar Mendelson:
Rademacher and Gaussian Complexities: Risk Bounds and Structural Results. J. Mach. Learn. Res. 3: 463-482 (2002) - [j5]Shahar Mendelson:
Rademacher averages and phase transitions in Glivenko-Cantelli classes. IEEE Trans. Inf. Theory 48(1): 251-263 (2002) - [j4]Shahar Mendelson:
Improving the sample complexity using global data. IEEE Trans. Inf. Theory 48(7): 1977-1991 (2002) - [c9]Shahar Mendelson, Robert C. Williamson:
Agnostic Learning Nonconvex Function Classes. COLT 2002: 1-13 - [c8]Shahar Mendelson, Roman Vershynin:
Entropy, Combinatorial Dimensions and Random Averages. COLT 2002: 14-28 - [c7]Shahar Mendelson:
Geometric Parameters of Kernel Machines. COLT 2002: 29-43 - [c6]Peter L. Bartlett, Olivier Bousquet, Shahar Mendelson:
Localized Rademacher Complexities. COLT 2002: 44-58 - [c5]Shahar Mendelson:
A Few Notes on Statistical Learning Theory. Machine Learning Summer School 2002: 1-40 - 2001
- [j3]Shahar Mendelson:
On the Size of Convex Hulls of Small Sets. J. Mach. Learn. Res. 2: 1-18 (2001) - [j2]Shahar Mendelson:
A New On-Line Learning Model. Neural Comput. 13(4): 935-957 (2001) - [j1]Shahar Mendelson, Israel Nelken:
Recurrence Methods in the Analysis of Learning Processes. Neural Comput. 13(8): 1839-1861 (2001) - [c4]Peter L. Bartlett, Shahar Mendelson:
Rademacher and Gaussian Complexities: Risk Bounds and Structural Results. COLT/EuroCOLT 2001: 224-240 - [c3]Shahar Mendelson:
Geometric Methods in the Analysis of Glivenko-Cantelli Classes. COLT/EuroCOLT 2001: 256-272 - [c2]Shahar Mendelson:
Learning Relatively Small Classes. COLT/EuroCOLT 2001: 273-288 - 2000
- [c1]Shahar Mendelson, Naftali Tishby:
Statistical Sufficiency for Classes in Empirical L2 Spaces. COLT 2000: 81-89
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-13 00:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
