Learning without Concentration
- 期刊名称Journal of the ACM
- 作者Mendelson, Shahar
- 卷第62卷
- 期第3期
- 印刷ISSN0004-5411
- 文件大小213.61KB
- 发表时间2015-06-30
- DOI10.1145/2699439
- 页码1-25
Reconstruction and subgaussian processesShahar Mendelson; Alain Pajor; Nicole Tomczak-Jaegermann · 2005
Embedding with a Lipschitz functionShahar Mendelson · 2005
On weakly bounded empirical processesShahar Mendelson · 2008
Empirical minimizationPeter L. Bartlett; Shahar Mendelson · Probability Theory and Related Fields · 2006
Aggregation via empirical risk minimizationGuillaume Lecué; Shahar Mendelson · 2009
Complexity measures of sign matricesNati Linial; Shahar Mendelson; Gideon Schechtman; Adi Shraibman · 2007
A subgaussian embedding theoremShahar Mendelson; Nicole Tomczak-Jaegermann · 2008
Abstraction in query processingImielinski, Tomasz · Journal of the ACM · 1991
The PCP theorem by gap amplificationDinur, Irit · Journal of the ACM · 2007
New Methods in Automatic ExtractingEdmundson, H. P. · Journal of the ACM · 1969
Inference of Reversible LanguagesAngluin, Dana · Journal of the ACM · 1982
Eigenvalues and expansion of regular graphsKahale, Nabil · Journal of the ACM · 1995
An Algorithm for Convex PolytopesChand, Donald R.; Kapur, Sham S. · Journal of the ACM · 1970
How to construct random functionsGoldreich, Oded; Goldwasser, Shafi; Micali, Silvio · Journal of the ACM · 1986
An Algorithm for Subgraph IsomorphismUllmann, J. R. · Journal of the ACM · 1976