On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“revealing the inverse relationship between model capacity and forgetting severity”
In the citing paper
“establishing that the minimum capacity required to maintain bounded forgetting grows sublinearly with task sequence length39”
Citations
Cites
An Introduction to Probability Theory and Its Applications, Vol. 2
Feller, W., & Teichmann, T. (1967) · Physics Today · doi:10.1063/1.3034322 · Cited by 1,280
Research works printed but not linked: 3
- Vapnik V. N., 1968, Dokl. Akad. Nauk SSSR, 181, 781
- Gnedenko B. V., 1968, Theory of Probability
- Hinčin A. Ya., 1956, Uspehi Mat. Nauk (N.S.), 11, 17
Cited by
Items 301–400 of 1,003
Continuous privacy preserving publishing of data streams
Zhou, B., Han, Y., Pei, J., Jiang, B., Tao, Y., & Jia, Y. (2009) · International Conference on Extending Database Technology (EDBT) · doi:10.1145/1516360.1516435 · Cited by 88
Property testing and its connection to learning and approximation
Goldreich, O., Goldwasser, S., & Ron, D. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1996.548493 · Cited by 88
Statistical algorithms and a lower bound for detecting planted cliques
Feldman, V., Grigorescu, E., Reyzin, L., Vempala, S., & Xiao, Y. (2013) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/2488608.2488692 · Cited by 127
Conceptual challenges for interpretable machine learning
Watson, D. S. (2022) · Synthese · doi:10.1007/s11229-022-03485-5 · Cited by 87
Statistical Learning Theory: A Primer
Evgeniou, T., Pontil, M., & Poggio, T. (2000) · International Journal of Computer Vision · doi:10.1023/a:1008110632619 · Cited by 86
A generalization of Sauer's lemma
Haussler, D. H., & Long, P. M. (1995) · Journal of Combinatorial Theory Series A · doi:10.1016/0097-3165(95)90001-2 · Cited by 86
Every, P. M. V., Rodriguez, M., Jones, C. B., Mammoli, A. A., & Martínez‐Ramón, M. (2017) · Energy and Buildings · doi:10.1016/j.enbuild.2017.05.053 · Cited by 92
Rates of growth and sample moduli for weighted empirical processes indexed by sets
Alexander, K. S. (1987) · Probability Theory and Related Fields · doi:10.1007/bf00318708 · Cited by 85
Banerjee, R., & Srivastava, P. K. (2013) · Land Use Policy · doi:10.1016/j.landusepol.2013.03.005 · Cited by 85
Generalized Fourier Descriptors with Applications to Objects Recognition in SVM Context
Smach, F., Lemaître, C., Gauthier, J.-P., Mitéran, J., & Atri, M. (2007) · Journal of Mathematical Imaging and Vision · doi:10.1007/s10851-007-0036-3 · Cited by 85
Krzyżak, A., Linder, T., & Lugosi, G. (1996) · IEEE Transactions on Neural Networks · doi:10.1109/72.485681 · Cited by 85
An Information-Theoretic Perspective on Overfitting and Underfitting
Bashir, D., Montañez, G. D., Sehra, S., Segura, P. S., & Lauw, J. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-64984-5_27 · Cited by 108
Lower Bound Methods and Separation Results for On-Line Learning Models
Maass, W., & Tur�n, G. (1992) · Machine Learning · doi:10.1007/bf00992674 · Cited by 84
The Logic of Graph Neural Networks
Grohe, M. (2021) · ACM/IEEE Symposium on Logic in Computer Science (LICS) · doi:10.1109/lics52264.2021.9470677 · Cited by 167
Chen, Q., Guo, Z., & Zhao, J. (2008) · Journal of Pharmaceutical and Biomedical Analysis · doi:10.1016/j.jpba.2008.09.016 · Cited by 83
Novel Maximum-Margin Training Algorithms for Supervised Neural Networks
Ludwig, O., & Nunes, U. (2010) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2010.2046423 · Cited by 83
Strong universal consistency of neural network classifiers
Faragó, A., & Lugosi, G. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.243433 · Cited by 81
Matoušek, J. (1990) · Discrete & Computational Geometry · doi:10.1007/bf02187804 · Cited by 83
Three-dimensional coverage planning for an underwater inspection robot
Englot, B., & Hover, F. S. (2013) · The International Journal of Robotics Research · doi:10.1177/0278364913490046 · Cited by 90
Comparing Support Vector Machines and Maximum Likelihood Classifiers for Mapping of Urbanization
Rimal, B., Rijal, S., & Kunwar, R. M. (2019) · Journal of the Indian Society of Remote Sensing · doi:10.1007/s12524-019-01056-9 · Cited by 82
Minimum Class Variance Support Vector Machines
Zafeiriou, S. P., Tefas, A., & Pitas, I. (2007) · IEEE Transactions on Image Processing · doi:10.1109/tip.2007.904408 · Cited by 82
Kivinen, J., Warmuth, M. K., & Auer, P. L. (1997) · Artificial Intelligence · doi:10.1016/s0004-3702(97)00039-8 · Cited by 82
A survey on symbolic data-based music genre classification
Corrêa, D., & Rodrigues, F. A. (2016) · Expert Systems with Applications · doi:10.1016/j.eswa.2016.04.008 · Cited by 93
The explanation game: a formal framework for interpretable machine learning
Watson, D. S., & Floridi, L. (2021) · Synthese · doi:10.1007/s11229-020-02629-9 · Cited by 71
Convergence of depth contours for multivariate datasets
He, X., & Wang, G. (1997) · The Annals of Statistics · doi:10.1214/aos/1031833661 · Cited by 88
Discrepancy and approximations for bounded VC-dimension
Matoušek, J., Welzl, E., & Wernisch, L. (1993) · COMBINATORICA · doi:10.1007/bf01303517 · Cited by 81
Mathematical Aspects of Deep Learning
Berner, J., Grohs, P., Kutyniok, G., & Petersen, P. (2022) · Cambridge University Press eBooks · doi:10.1017/9781009025096 · Cited by 111
Ram, P., & Gray, A. (2011) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2020408.2020507 · Cited by 80
A two-level neural network approach for dynamic FE model updating including damping
Lu, Y., & Tu, Z. (2003) · Journal of Sound and Vibration · doi:10.1016/s0022-460x(03)00796-x · Cited by 80
Interpreting nowhere dense graph classes as a classical notion of model theory
Adler, H., & Adler, I. (2013) · European Journal of Combinatorics · doi:10.1016/j.ejc.2013.06.048 · Cited by 80
Learnability can be undecidable
Ben-David, S., Hrubeš, P., Moran, S., Shpilka, A., & Yehudayoff, A. (2018) · Nature Machine Intelligence · doi:10.1038/s42256-018-0002-3 · Cited by 80
Bounding the Vapnik-Chervonenkis Dimension of Concept Classes Parameterized by Real Numbers
Goldberg, P. W., & Jerrum, M. (1995) · Machine Learning · doi:10.1007/bf00993408 · Cited by 149
Helmbold, D. P., Sloan, R. H., & Warmuth, M. K. (1992) · SIAM Journal on Computing · doi:10.1137/0221019 · Cited by 80
Generalization bounds for function approximation from scattered noisy data
Niyogi, P., & Girosi, F. (1999) · Advances in Computational Mathematics · doi:10.1023/a:1018966213079 · Cited by 89
Bounds on the sample complexity for private learning and private data release
Beimel, A., Brenner, H., Kasiviswanathan, S. P., & Kobbi Nissim, B. (2013) · Machine Learning · doi:10.1007/s10994-013-5404-1 · Cited by 129
Regularization Strategy for Point Cloud via Rigidly Mixed Sample
Lee, D., Lee, J., Lee, J., Lee, H., Lee, M., Woo, S., & Lee, S. (2021) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr46437.2021.01564 · Cited by 117
The uniform convergence of the nadaraya‐watson regression function estimate
Devroye, L. (1978) · Canadian Journal of Statistics · doi:10.2307/3315046 · Cited by 79
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
An optimal convex hull algorithm and new results on cuttings
Chazelle, B. (1991) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1991.185345 · Cited by 79
Predicting (0, 1)-functions on randomly drawn points
Haussler, D. H., Littlestone, N., & Warmuth, M. K. (1988) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1988.21928 · Cited by 88
Modeling Appearances with Low-Rank SVM
Wolf, L., Jhuang, H., & Hazan, T. (2007) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2007.383099 · Cited by 78
On the Generalization Ability of GRLVQ Networks
Hammer, B., Marc Strickert, A., & Villmann, T. (2005) · Neural Processing Letters · doi:10.1007/s11063-004-1547-1 · Cited by 78
Universal smoothing factor selection in density estimation: theory and practice
Devroye, D., Beirlant, J., Cao, R., Fraiman, R., Hall, P., Jones, M. C., Lugosi, G., Mammen, E., Marron, J. S., Sánchez-Sellero, C., et al. (1997) · Test · doi:10.1007/bf02564701 · Cited by 78
Separators in two and three dimensions
Miller, G. L., & Thurston, W. P. H. (1990) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/100216.100255 · Cited by 78
Stability and Generalization of Bipartite Ranking Algorithms
Agarwal, S., & Niyogi, P. (2005) · Lecture notes in computer science · doi:10.1007/11503415_3 · Cited by 77
Algorithms for strategyproof classification
Meir, R., Procaccia, A. D., & Rosenschein, J. S. (2012) · Artificial Intelligence · doi:10.1016/j.artint.2012.03.008 · Cited by 77
Optimal sampling from distributed streams
Cormode, G., Muthukrishnan, S., Yi, K., & Zhang, Q. (2010) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/1807085.1807099 · Cited by 76
Regularity Partitions and The Topology of Graphons
Lovász, L., & Szegedy, B. (2010) · Bolyai Society mathematical studies · doi:10.1007/978-3-642-14444-8_12 · Cited by 76
Regularization and statistical learning theory for data analysis
Evgeniou, T., Poggio, T., Pontil, M., & Verri, A. (2002) · Computational Statistics & Data Analysis · doi:10.1016/s0167-9473(01)00069-x · Cited by 76
Bshouty, N. H., Eiron, N., & Kushilevitz, E. (2002) · Theoretical Computer Science · doi:10.1016/s0304-3975(01)00403-0 · Cited by 76
Sampling based sensor-network deployment
Ister, V., Kannan, S., & Daniilidis, K. (2005) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2004.1389654 · Cited by 76
Towards a computational theory of experience.
Fekete, T., & Edelman, S. (2011) · Consciousness and Cognition · doi:10.1016/j.concog.2011.02.010 · Cited by 69
Mitra, A. P., Almal, A. A., George, B., Fry, D. W., Lenehan, P. F., Pagliarulo, V., Côté, R. J., Datar, R. H., & Worzel, W. P. (2006) · BMC Cancer · doi:10.1186/1471-2407-6-159 · Cited by 79
Har-Peled, S. (2004) · Discrete & Computational Geometry · doi:10.1007/s00454-004-2822-7 · Cited by 75
Minimax group fairness: algorithms and experiments
Diana, E., Gill, W., Kearns, M., Kenthapadi, K., & Roth, A. (2021) · Proceedings of the 2021 AAAI/ACM Conference on AI, Ethics, and Society · doi:10.1145/3461702.3462523 · Cited by 74
Apple color grading based on organization feature parameters
Xiaobo, Z., Jiewen, Z., & Li, Y. (2007) · Pattern Recognition Letters · doi:10.1016/j.patrec.2007.06.001 · Cited by 74
An Introduction to Reconfigurable Systems
Lyke, J., Christodoulou, C. G., Vera, G. A., & Edwards, A. H. (2015) · Proceedings of the IEEE · doi:10.1109/jproc.2015.2397832 · Cited by 107
FTIR Imaging of Tissues: Techniques and Methods of Analysis
Małek, K., Wood, B. R., & Bambery, K. R. (2013) · Challenges and advances in computational chemistry and physics · doi:10.1007/978-94-007-7832-0_15 · Cited by 73
A machine learning nowcasting method based on real‐time reanalysis data
Han, L., Sun, J., Zhang, W., Xiu, Y., Feng, H., & Lin, Y. (2017) · Journal of Geophysical Research Atmospheres · doi:10.1002/2016jd025783 · Cited by 75
VC-Dimension and Shortest Path Algorithms
Abraham, I., Delling, D., Fiat, A., Goldberg, A. V., & Werneck, R. F. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-22006-7_58 · Cited by 73
Sensitive Error Correcting Output Codes
Langford, J. C., & Beygelzimer, A. (2005) · Lecture notes in computer science · doi:10.1007/11503415_11 · Cited by 85
New approaches to statistical learning theory
Bousquet, O. (2003) · Annals of the Institute of Statistical Mathematics · doi:10.1007/bf02530506 · Cited by 73
Introduction to MAchine Learning & Knowledge Extraction (MAKE)
Holzinger, A. (2017) · Machine Learning and Knowledge Extraction · doi:10.3390/make1010001 · Cited by 65
Inclusion-exclusion: Exact and approximate
Kahn, J., Linial, N., & Samorodnitsky, A. (1996) · COMBINATORICA · doi:10.1007/bf01271266 · Cited by 72
Performance Measures for Neyman–Pearson Classification
Scott, C. D. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.901152 · Cited by 72
Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems
Diakonikolas, I., & Yannakakis, M. (2009) · SIAM Journal on Computing · doi:10.1137/080724514 · Cited by 71
Learning Quantum States and Unitaries of Bounded Gate Complexity
Zhao, H., Lewis, L., Kannan, I., Quek, Y., Huang, H.-Y., & Caro, M. C. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.040306 · Cited by 102
Engels, J., Claessens, B., & Deconinck, G. (2019) · Applied Energy · doi:10.1016/j.apenergy.2019.03.128 · Cited by 75
Langerman, S., & Morin, P. (2004) · Discrete & Computational Geometry · doi:10.1007/s00454-004-1108-4 · Cited by 70
Improved sample complexity estimates for statistical learning control of uncertain systems
Koltchinskii, V. I., Abdallah, C. T., Ariola, M., Dorato, P., & Panchenko, D. (2000) · IEEE Transactions on Automatic Control · doi:10.1109/9.895579 · Cited by 72
The Vapnik–Chervonenkis dimension of graph and recursive neural networks
Scarselli, F., Tsoi, A. C., & Hagenbuchner, M. (2018) · Neural Networks · doi:10.1016/j.neunet.2018.08.010 · Cited by 69
Results 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
Nonasymptotic universal smoothing factors, kernel complexity and Yatracos classes
Devroye, L., & Lugosi, G. (1997) · The Annals of Statistics · doi:10.1214/aos/1030741088 · Cited by 69
Cavitation detection of butterfly valve using support vector machines
Yang, B., Hwang, W.-W., Ko, M.-H., & Lee, S.-J. (2004) · Journal of Sound and Vibration · doi:10.1016/j.jsv.2004.10.033 · Cited by 69
An Experimental and Theoretical Comparison of Model Selection Methods
Kearns, M. J., Mansour, Y., Ng, A. Y., & Ron, D. (1997) · Machine Learning · doi:10.1023/a:1007344726582 · Cited by 98
Integrated feature architecture selection
Steppe, J. M., Bauer, K. W., & Rogers, S. K. (1996) · IEEE Transactions on Neural Networks · doi:10.1109/72.508942 · Cited by 69
Quantum enhancements for deep reinforcement learning in large spaces
Jerbi, S., Trenkwalder, L. M., Nautrup, H. P., Briegel, H. J., & Dunjko, V. (2019) · arXiv · doi:10.48550/arxiv.1910.12760 · Cited by 69
Mieth, B., Rozier, A., Rodríguez, J. A., Höhne, M., Görnitz, N., & Müller, K. (2021) · NAR Genomics and Bioinformatics · doi:10.1093/nargab/lqab065 · Cited by 75
Share Conversion and Private Information Retrieval
Beimel, A., Ishai, Y., Kushilevitz, E., & Orlov, I. (2012) · IEEE Conference on Computational Complexity (CCC) · doi:10.1109/ccc.2012.23 · Cited by 75
Highway Dimension and Provably Efficient Shortest Path Algorithms
Abraham, I., Delling, D., Fiat, A., Goldberg, A. V., & Werneck, R. F. (2016) · Journal of the ACM · doi:10.1145/2985473 · Cited by 82
Learning Quantum Processes and Hamiltonians via the Pauli Transfer Matrix
Caro, M. C. (2024) · ACM Transactions on Quantum Computing · doi:10.1145/3670418 · Cited by 68
Hierarchical Cooperation in Ad Hoc Networks: Optimal Clustering and Achievable Throughput
Ghaderi, J., Xie, L., & Shen, X. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2023681 · Cited by 67
Guarding galleries where no point sees a small area
Valtr, P. (1998) · Israel Journal of Mathematics · doi:10.1007/bf02897056 · Cited by 67
Evolving neural networks for strategic decision-making problems
Kohl, N., & Miikkulainen, R. P. (2009) · Neural Networks · doi:10.1016/j.neunet.2009.03.001 · Cited by 67
Information theory methods in communication complexity
Bar-Yossef, Z., Jayram, T. S., Kumar, R., & Sivakumar, D. (2003) · IEEE Conference on Computational Complexity (CCC) · doi:10.1109/ccc.2002.1004344 · Cited by 67
Guest editorial vapnik-chervonenkis (vc) learning theory and its applications
(1999) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.1999.788639 · Cited by 67
Margellos, K., Prandini, M., & Lygeros, J. (2015) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2015.2394874 · Cited by 66
Probabilistic solutions to some NP-hard matrix problems
Vidyasagar, M., & Blondel, V. D. (2001) · Automatica · doi:10.1016/s0005-1098(01)00089-9 · Cited by 66
Bounds for the uniform deviation of empirical measures
Devroye, L. (1982) · Journal of Multivariate Analysis · doi:10.1016/0047-259x(82)90083-5 · Cited by 66
Pyrga, E., & Ray, S. (2008) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/1377676.1377708 · Cited by 65
Statistical complexity of quantum circuits
Bu, K., Koh, D. E., Li, L., Luo, Q., & Zhang, Y. (2022) · Physical Review A · doi:10.1103/physreva.105.062431 · Cited by 82
Sequential complexities and uniform martingale laws of large numbers
Rakhlin, A., Sridharan, K., & Tewari, A. (2014) · Probability Theory and Related Fields · doi:10.1007/s00440-013-0545-5 · Cited by 136
Covering numbers, Vapnik–Červonenkis classes and bounds for the star-discrepancy
Hinrichs, A. (2004) · Journal of Complexity · doi:10.1016/j.jco.2004.01.001 · Cited by 64
Finding small balanced separators
Feige, U., & Mahdian, M. (2006) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1132516.1132573 · Cited by 64
Simultaneous partitions of measures by K-fans
Bárány, I., & Matoušek, J. (2001) · Discrete & Computational Geometry · doi:10.1007/s00454-001-0003-5 · Cited by 64
Concept learning using complexity regularization
Lugosi, G., & Zeger, K. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.481777 · Cited by 64
Whole Slide Image Quality in Digital Pathology: Review and Perspectives
Brixtel, R., Bougleux, S., Lézoray, O., Caillot, Y., Lemoine, B., Fontaine, M., Nebati, D., & Renouf, A. (2022) · IEEE Access · doi:10.1109/access.2022.3227437 · Cited by 79
Empirical entropy, minimax regret and minimax risk
Rakhlin, A., Sridharan, K., & Tsybakov, A. B. (2017) · Bernoulli · doi:10.3150/14-bej679 · Cited by 63
Feature selection for linear SVM with provable guarantees
Paul, S., Magdon‐Ismail, M., & Petros Drineas, B. (2016) · Pattern Recognition · doi:10.1016/j.patcog.2016.05.018 · Cited by 63
Tight upper bounds for the discrepancy of half-spaces
Matoušek, J. (1995) · Discrete & Computational Geometry · doi:10.1007/bf02574066 · Cited by 63
Metadata
- Authors
- Vapnik, V. N., & Chervonenkis, A. Y.
- Venue
- Theory of Probability & Its Applications
- Published
- 1971-01
- Volume
- 16
- Issue
- 2
- Pages
- 264-280
- ISSN
- 0040-585X (ISSN-L)
- 1095-7219
- OpenAlex
- W4238284510
- Cited by
- 2,448
- References
- 1
- Citations by year
- 2026: 51 · 2025: 60 · 2024: 83 · 2023: 80 · 2022: 101 · 2021: 105 · 2020: 95 · 2019: 105 · 2018: 71 · 2017: 77 · 2016: 60 · 2015: 99 · 2014: 69 · 2013: 86 · 2012: 78
- FWCI
- 0.00
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- Theory of Probability and Its Applications (publishedVersion)
- Topics
- Physical Sciences › Mathematics › Statistics and Probability › Probability and Statistical Research
- Physical Sciences › Mathematics › Mathematical Physics › Stochastic processes and statistical mechanics
- Physical Sciences › Mathematics › Mathematical Physics › Mathematical Dynamics and Fractals
- Keywords
- uniform convergence, relative frequency, probability, law of large numbers
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.