The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Local Rademacher complexities
Open accessAbstract
We propose new bounds on the error of learning algorithms in terms of a data-dependent notion of complexity. The estimates we establish give optimal rates and are based on a local and empirical version of Rademacher averages, in the sense that the Rademacher averages are computed from the data, on a subset of functions with small empirical error. We present some applications to classification and prediction with convex function classes, and with kernel classes in particular.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Vaart, A. W. V. D. (1998) · doi:10.1017/cbo9780511802256 · Cited by 4,159
A Probabilistic Theory of Pattern Recognition
Devroye, L., Györfi, L., & Lugosi, G. (1996) · Stochastic Modelling and Applied Probability · doi:10.1007/978-1-4612-0711-5 · Cited by 3,274
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
Vapnik, V. N., & Chervonenkis, A. Y. (1971) · Theory of Probability & Its Applications · doi:10.1137/1116025 · Cited by 2,448
Rademacher and Gaussian Complexities: Risk Bounds and Structural Results
Bartlett, P. L., & Mendelson, S. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44581-1_15 · Cited by 1,949
Self-citationConvergence of Stochastic Processes
Pollard, D. (1984) · Springer Series in Statistics · doi:10.1007/978-1-4612-5254-2 · Cited by 1,841
A Distribution-Free Theory of Nonparametric Regression
Györfi, L., Kohler, M., Krzyżak, A., & Walk, H. (2002) · Springer Series in Statistics · doi:10.1007/b97848 · Cited by 1,738
Ledoux, M., & Talagrand, M. (1991) · doi:10.1007/978-3-642-20212-4 · Cited by 1,160
Convexity, Classification, and Risk Bounds
Bartlett, P. L., Jordan, M. I., & McAuliffe, J. D. (2006) · Journal of the American Statistical Association · doi:10.1198/016214505000000907 · Cited by 1,037
Self-citationDecision theoretic generalizations of the PAC model for neural net and other learning applications
Haussler, D. (1992) · Information and Computation · doi:10.1016/0890-5401(92)90010-d · Cited by 843
Uniform Central Limit Theorems
Dudley, R. M. (1999) · Cambridge University Press eBooks · doi:10.1017/cbo9780511665622 · Cited by 785
Sharper Bounds for Gaussian and Empirical Processes
Talagrand, M. (1994) · The Annals of Probability · doi:10.1214/aop/1176988847 · Cited by 480
Smooth discrimination analysis
Mammen, E., & Tsybakov, A. B. (1999) · The Annals of Statistics · doi:10.1214/aos/1017939240 · Cited by 377
Rademacher penalties and structural risk minimization
Koltchinskii, V. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.930926 · Cited by 373
Probabilistic Methods for Algorithmic Discrete Mathematics
Habib, M., McDiarmid, C., Alfonsín, J. L. R., & Reed, B. A. (1998) · Algorithms and combinatorics · doi:10.1007/978-3-662-12788-9 · Cited by 338
Model Selection and Error Estimation
Bartlett, P. L., Boucheron, S., & Lugosi, G. (2002) · Machine Learning · doi:10.1023/a:1013999503812 · Cited by 297
Self-citationSphere packing numbers for subsets of the Boolean n-cube with bounded Vapnik-Chervonenkis dimension
Haussler, D. (1995) · Journal of Combinatorial Theory, Series A · doi:10.1016/0097-3165(95)90052-7 · Cited by 288
About the constants in Talagrand's concentration inequalities for empirical processes
Massart, P. (2000) · The Annals of Probability · doi:10.1214/aop/1019160263 · Cited by 280
A Bennett concentration inequality and its application to suprema of empirical processes
Bousquet, O. (2002) · Comptes Rendus. Mathématique · doi:10.1016/s1631-073x(02)02292-6 · Cited by 262
Self-citationSome applications of concentration inequalities to statistics
Massart, P. (2000) · Annales de la Faculté des sciences de Toulouse : Mathématiques · doi:10.5802/afst.961 · Cited by 240
Concentration inequalities using the entropy method
Boucheron, S., Lugosi, G., & Massart, P. (2003) · The Annals of Probability · doi:10.1214/aop/1055425791 · Cited by 235
Rademacher Processes and Bounding the Risk of Function Learning
Koltchinskii, V., & Panchenko, D. (2000) · High Dimensional Probability II · doi:10.1007/978-1-4612-1358-1_29 · Cited by 209
A sharp concentration inequality with applications
Boucheron, S., Lugosi, G., & Massart, P. (2000) · Random Structures and Algorithms · doi:10.1002/(sici)1098-2418(200005)16:3<277::aid-rsa4>3.0.co;2-1 · Cited by 185
A Few Notes on Statistical Learning Theory
Mendelson, S. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36434-x_1 · Cited by 161
Self-citationThe importance of convexity in learning with squared loss
Lee, W. S., Bartlett, P. L., & Williamson, R. C. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.705577 · Cited by 98
Self-citationConcentration Inequalities for Sub-Additive Functions Using the Entropy Method
Bousquet, O. (2003) · Birkhäuser Basel eBooks · doi:10.1007/978-3-0348-8069-5_14 · Cited by 85
Self-citationRademacher averages and phase transitions in Glivenko-Cantelli classes
Mendelson, S. (2002) · IEEE Transactions on Information Theory · doi:10.1109/18.971753 · Cited by 79
Self-citationComplexity regularization via localized random penalties
Lugosi, G., & Wegkamp, M. (2004) · The Annals of Statistics · doi:10.1214/009053604000000463 · Cited by 55
Cited by
High-Dimensional Statistics: A Non-Asymptotic Viewpoint
Wainwright, M. J. (2019) · Cambridge University Press eBooks · doi:10.1017/9781108627771 · Cited by 882
Classification with Noisy Labels by Importance Reweighting
Liu, T., & Tao, D. (2016) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2015.2456899 · Cited by 782
Estimating Individualized Treatment Rules Using Outcome Weighted Learning
Zhao, Y., Zeng, D., Rush, A. J., & Kosorok, M. R. (2012) · Journal of the American Statistical Association · doi:10.1080/01621459.2012.695674 · Cited by 739
Perspectives on system identification
Ljung, L. (2010) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2009.12.001 · Cited by 707
Perspectives on System Identification
Ljung, L. (2008) · IFAC Proceedings Volumes · doi:10.3182/20080706-5-kr-1001.01215 · Cited by 438
Metadata
- Authors
- Bartlett, P. L., Bousquet, O., & Mendelson, S.
- Venue
- The Annals of Statistics
- Publisher
- Institute of Mathematical Statistics
- Published
- 2005-08-01
- Volume
- 33
- Issue
- 4
- Pages
- 1497-1537
- ISSN
- 0090-5364 (ISSN-L)
- OpenAlex
- W2063368770
- Cited by
- 372
- References
- 28
- FWCI
- 10.65
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.