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.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
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
Theory of Classification: a Survey of Some Recent Advances
Boucheron, S., Bousquet, O., & Lugosi, G. (2005) · ESAIM: Probability and Statistics · doi:10.1051/ps:2005018 · Cited by 436
Self-citationDirect importance estimation for covariate shift adaptation
Sugiyama, M., Suzuki, T., Nakajima, S., Kashima, H., von Bünau, P., & Kawanabe, M. (2008) · Annals of the Institute of Statistical Mathematics · doi:10.1007/s10463-008-0197-x · Cited by 426
Why ResNet Works? Residuals Generalize
He, F., Liu, T., & Tao, D. (2020) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2020.2966319 · Cited by 406
Xu, H., & Mannor, S. (2012) · Machine Learning · doi:10.1007/s10994-011-5268-1 · Cited by 377
Policy Learning With Observational Data
Athey, S., & Wager, S. (2021) · Econometrica · doi:10.3982/ecta15732 · Cited by 372
Deep Neural Networks for Estimation and Inference
Farrell, M. H., Liang, T., & Misra, S. (2021) · Econometrica · doi:10.3982/ecta16901 · Cited by 327
On Mean Absolute Error for Deep Neural Network Based Vector-to-Vector Regression
Qi, J., Du, J., Siniscalchi, S. M., Ma, X., & Lee, C.-H. (2020) · IEEE Signal Processing Letters · doi:10.1109/lsp.2020.3016837 · Cited by 305
Boosting with early stopping: Convergence and consistency
Zhang, T., & Yu, B. (2005) · The Annals of Statistics · doi:10.1214/009053605000000255 · Cited by 281
Fast rates for support vector machines using Gaussian kernels
Steinwart, I., & Scovel, C. (2007) · The Annals of Statistics · doi:10.1214/009053606000001226 · Cited by 258
Harmless interpolation of noisy data in regression
Muthukumar, V., Vodrahalli, K., & Sahai, A. (2019) · 2019 IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2019.8849614 · Cited by 162
On the Existence of Simpler Machine Learning Models
Semenova, L., Rudin, C., & Parr, R. (2022) · 2022 ACM Conference on Fairness Accountability and Transparency · doi:10.1145/3531146.3533232 · Cited by 90
Quantum computing and supervised machine learning
Oneto, L., Ridella, S., & Anguita, D. (2017) · Quantum Inspired Computational Intelligence · doi:10.1016/b978-0-12-804409-4.00002-4 · Cited by 11
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.