The DOI matches its Crossref record; 49 of the 49 references it cites were found in a registry or an index.
Structural risk minimization over data-dependent hierarchies
Abstract
The paper introduces some generalizations of Vapnik's (1982) method of structural risk minimization (SRM). As well as making explicit some of the details on SRM, it provides a result that allows one to trade off errors on the training sample against improved generalization performance. It then considers the more general case when the hierarchy of classes is chosen in response to the data. A result is presented on the generalization performance of classifiers with a "large margin". This theoretically explains the impressive generalization performance of the maximal margin hyperplane algorithm of Vapnik and co-workers (which is the basis for their support vector machines). The paper concludes with a more general result in terms of "luckiness" functions, which provides a quite general way for exploiting serendipitous simplicity in observed data to obtain better prediction accuracy from small training sets. Four examples are given of such functions, including the Vapnik-Chervonenkis (1971) dimension measured on the sample.
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
Cortes, C., & Vapnik, V. (1995) · Machine Learning · doi:10.1007/bf00994018 · Cited by 59,421
The Nature of Statistical Learning Theory
Vapnik, V. N. (1995) · doi:10.1007/978-1-4757-2440-0 · Cited by 39,138
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
System Identification: Theory for the User
Lennart Ljung, A. (1987) · Cited by 17,690
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2005) · doi:10.1002/047174882x · Cited by 13,791
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
A training algorithm for optimal margin classifiers
Boser, B. E., Guyon, I. M., & Vapnik, V. N. (1992) · Proceedings of the fifth annual workshop on Computational learning theory · doi:10.1145/130385.130401 · Cited by 11,992
Weak Convergence and Empirical Processes
van der Vaart, A. W., & Wellner, J. A. (1996) · Springer Series in Statistics · doi:10.1007/978-1-4757-2545-2 · Cited by 5,014
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
Vapnik, V. N., & Chervonenkis, A. Y. (2015) · Measures of Complexity · doi:10.1007/978-3-319-21852-6_3 · Cited by 3,105
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
Estimation of Dependences Based on Empirical Data
Vapnik, V. (2006) · Information Science and Statistics · doi:10.1007/0-387-34239-7 · Cited by 2,238
Convergence of Stochastic Processes.
Robinson, P. M., & Pollard, D. (1985) · Economica · doi:10.2307/2553898 · Cited by 2,184
Fundamentals of Artificial Neural Networks
Hassoun, M. H. (1996) · Proceedings of the IEEE · doi:10.1109/jproc.1996.503146 · Cited by 1,887
Convergence of Stochastic Processes
Pollard, D. (1984) · Springer Series in Statistics · doi:10.1007/978-1-4612-5254-2 · Cited by 1,841
Regularization Theory and Neural Networks Architectures
Girosi, F., Jones, M., & Poggio, T. (1995) · Neural Computation · doi:10.1162/neco.1995.7.2.219 · Cited by 1,349
Bartlett, P. L. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.661502 · Cited by 1,166
Self-citationPattern Classification and Scene Analysis.
Grenander, U., Duda, R. O., & Hart, P. E. (1974) · Journal of the American Statistical Association · doi:10.2307/2286028 · Cited by 1,006
Mackay, D. J. C. (1995) · Network Computation in Neural Systems · doi:10.1088/0954-898x/6/3/011 · Cited by 915
Fundamentals of Artificial Neural Networks
Hassoun, M. H., Intrator, N., McKay, S., & Christian, W. (1996) · Computers in Physics · doi:10.1063/1.4822376 · Cited by 844
Decision 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
Estimation of Dependences Based on Empirical Data.
Shoesmith, E., Vapnik, V., & Kotz, S. (1984) · The Statistician · doi:10.2307/2988246 · Cited by 764
Principles of Risk Minimization for Learning Theory
Vapnik, V. N. (1991) · neural information processing systems · Cited by 692
Fundamentals of artificial neural networks
(1996) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(96)90101-7 · Cited by 527
Minimum complexity density estimation
Barron, A. R., & Cover, T. M. (1991) · IEEE Transactions on Information Theory · doi:10.1109/18.86996 · Cited by 497
Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm
Littlestone, N. (1988) · Machine Learning · doi:10.1007/bf00116827 · Cited by 497
Approximation and estimation bounds for artificial neural networks
Barron, A. R. (1994) · Machine Learning · doi:10.1007/bf00993164 · Cited by 399
Efficient distribution-free learning of probabilistic concepts
Kearns, M. J., & Schapire, R. E. (1994) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(05)80062-5 · Cited by 373
Sample compression, learnability, and the Vapnik-Chervonenkis dimension
Floyd, S., & Warmuth, M. (1995) · Machine Learning · doi:10.1007/bf00993593 · Cited by 256
Relating Data Compression and Learnability
Littlestone, N., & Warmuth, M. K. (2003) · Cited by 208
Complexity Regularization with Application to Artificial Neural Networks
Barron, A. R. (1991) · Nonparametric Functional Estimation and Related Topics · doi:10.1007/978-94-011-3222-0_42 · Cited by 160
Nonparametric estimation via empirical risk minimization
Lugosi, G., & Zeger, K. (1995) · IEEE Transactions on Information Theory · doi:10.1109/18.382014 · Cited by 147
Fat-shattering and the learnability of real-valued functions
Bartlett, P. L., Long, P. M., & Williamson, R. C. (1994) · Annual Conference on Computational Learning Theory (COLT) · doi:10.1145/180139.181158 · Cited by 117
Self-citationStructural Risk Minimization for Character Recognition
Guyon, I., Vapnik, V. N., Boser, B. E., Bottou, L., & Solla, S. A. (1991) · neural information processing systems · Cited by 105
Neural Networks with Quadratic VC Dimension
Koiran, P., & Sontag, E. D. (1997) · Journal of Computer and System Sciences · doi:10.1006/jcss.1997.1479 · Cited by 91
A framework for structural risk minimisation
Shawe-Taylor, J. S., Bartlett, P. L., Williamson, R. C., & Anthony, M. (1996) · Conference on Learning Theory · doi:10.1145/238061.238070 · Cited by 79
Self-citationResults on learnability and the Vapnik-Chervonenkis dimension
Linial, N., Mansour, Y., & Rivest, R. L. (1991) · Information and Computation · doi:10.1016/0890-5401(91)90058-a · Cited by 69
Concept learning using complexity regularization
Lugosi, G., & Zeger, K. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.481777 · Cited by 64
Adaptive model selection using empirical complexities
Lugosi, G., & Nobel, A. B. (1999) · The Annals of Statistics · doi:10.1214/aos/1017939241 · Cited by 62
Bounding sample size with the Vapnik-Chervonenkis dimension
Shawe-Taylor, J. S., Anthony, M., & Biggs, N. L. (1993) · Discrete Applied Mathematics · doi:10.1016/0166-218x(93)90179-r · Cited by 58
Self-citationEfficient distribution-free learning of probabilistic concepts
Kearns, M. J., & Schapire, R. E. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/fscs.1990.89557 · Cited by 58
Function Learning from Interpolation
Anthony, M., & Bartlett, P. L. (2000) · Combinatorics Probability Computing · doi:10.1017/s0963548300004247 · Cited by 54
Self-citationScale-sensitive dimensions, uniform convergence, and learnability
Alon, N., Ben-David, S., Cesa‐Bianchi, N., & Haussler, D. H. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1993.366858 · Cited by 53
A result of Vapnik with applications
Anthony, M., & Shawe-Taylor, J. (1993) · Discrete Applied Mathematics · doi:10.1016/0166-218x(93)90126-9 · Cited by 48
Self-citationPrediction, Learning, Uniform Convergence, and Scale-Sensitive Dimensions
Bartlett, P. L., & Long, P. M. (1998) · Journal of Computer and System Sciences · doi:10.1006/jcss.1997.1557 · Cited by 48
Self-citationBAYESIAN MODEL COMPARISON AND BACKPROP NETS
Mackay, D. (1991) · CaltechAUTHORS (California Institute of Technology) · Cited by 37
The learnability of formal concepts
Anthony, M., Biggs, N., & Shawe-Taylor, J. S. (1990) · ePrints Soton (University of Southampton) · doi:10.5555/92571.92649 · Cited by 26
Self-citationLearning by canonical smooth estimation. II. Learning and choice of model complexity
Buescher, K. L., & Kumar, P. R. (1996) · IEEE Transactions on Automatic Control · doi:10.1109/9.489276 · Cited by 26
Learning by canonical smooth estimation. I. Simultaneous estimation
Buescher, K. L., & Kumar, P. R. (1996) · IEEE Transactions on Automatic Control · doi:10.1109/9.489275 · Cited by 24
Benedek, G. M., & Itai, A. (1994) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(05)80005-4 · Cited by 12
Cited by
Estimating the Support of a High-Dimensional Distribution
Schölkopf, B., Platt, J. C., Shawe-Taylor, J., Smola, A. J., & Williamson, R. C. (2001) · Neural Computation · doi:10.1162/089976601750264965 · Cited by 6,168
Self-citation(1999) · doi:10.1162/089976600300015565 · Cited by 2,799
Foundations of Machine Learning
Mohri, M., Rostamizadeh, A., & Talwalkar, A. (2018) · doi:10.7551/mitpress/10290.001.0001 · Cited by 1,122
Cristianini, N., Kandola, J., Elisseeff, A., & Shawe-Taylor, J. (2006) · Studies in Fuzziness and Soft Computing · doi:10.1007/3-540-33486-6_8 · Cited by 837
Self-citationBounds on Error Expectation for Support Vector Machines
Vapnik, V., & Chapelle, O. (2000) · Neural Computation · doi:10.1162/089976600300015042 · Cited by 624
Metadata
- Authors
- Shawe-Taylor, J., Bartlett, P. L., Williamson, R. C., & Anthony, M.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1998
- Volume
- 44
- Issue
- 5
- Pages
- 1926-1940
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2106491486
- Cited by
- 527
- References
- 49
- FWCI
- 28.88
- Type
- journal article
- Language
- en
- Open access
- closed
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.