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 101–200 of 1,003
Chen, Q., Zhao, J., Fang, C. H., & Wang, D. (2007) · Spectrochimica Acta Part A: Molecular and Biomolecular Spectroscopy · doi:10.1016/j.saa.2006.03.038 · Cited by 263
Sample compression, learnability, and the Vapnik-Chervonenkis dimension
Floyd, S., & Warmuth, M. (1995) · Machine Learning · doi:10.1007/bf00993593 · Cited by 256
A deterministic view of random sampling and its use in geometry
Chazelle, B., & Friedman, J. (1990) · COMBINATORICA · doi:10.1007/bf02122778 · Cited by 258
Test-cost-sensitive attribute reduction
Min, F., He, H., Qian, Y., & Zhu, W. (2011) · Information Sciences · doi:10.1016/j.ins.2011.07.010 · Cited by 255
High-dimensional asymptotics of prediction: Ridge regression and classification
Dobriban, E., & Wager, S. (2018) · The Annals of Statistics · doi:10.1214/17-aos1549 · Cited by 211
Nearly-tight VC-dimension and pseudodimension bounds for piecewise linear neural networks
Bartlett, P. L., Harvey, N., Liaw, C., & Mehrabian, A. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1703.02930 · Cited by 188
A Randomized Algorithm for Closest-Point Queries
Clarkson, K. L. (1988) · SIAM Journal on Computing · doi:10.1137/0217052 · Cited by 248
Lee, J. J., Lee, J. W., Yi, J. H., Yun, C. B., & Jung, H. Y. (2005) · Journal of Sound and Vibration · doi:10.1016/j.jsv.2004.01.003 · Cited by 239
Performance of Orthogonal Beamforming for SDMA With Limited Feedback
Huang, K., Andrews, J. G., & Heath, R. W. (2009) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2008.925003 · Cited by 240
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
Kushilevitz, E., Ostrovsky, R., & Rabani, Y. (2000) · SIAM Journal on Computing · doi:10.1137/s0097539798347177 · Cited by 245
Learning from hints in neural networks
Abu-Mostafa, Y. S. (1990) · Journal of Complexity · doi:10.1016/0885-064x(90)90006-y · Cited by 241
Guérin, P. A., Feix, A., Araújo, M., & Brukner, Č. (2016) · Physical Review Letters · doi:10.1103/physrevlett.117.100502 · Cited by 213
Capacity of reproducing kernel spaces in learning theory
Zhou, D. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.813564 · Cited by 238
Markov Perfect Industry Dynamics with Many Firms
Weintraub, G., Benkard, C. L., & Van Roy, B. (2005) · National Bureau of Economic Research · doi:10.3386/w11900 · Cited by 228
Transformation Invariance in Pattern Recognition — Tangent Distance and Tangent Propagation
Simard, P. Y., LeCun, Y. A., Denker, J. S., & Victorri, B. (1998) · Lecture Notes in Computer Science · doi:10.1007/3-540-49430-8_13 · Cited by 229
Necessary and Sufficient Conditions for the Uniform Convergence of Means to their Expectations
Vapnik, V. N., & Chervonenkis, A. Y. (1982) · Theory of Probability and Its Applications · doi:10.1137/1126059 · Cited by 236
Self-citationMatoušek, J. (1992) · Discrete & Computational Geometry · doi:10.1007/bf02293051 · Cited by 234
Separators for sphere-packings and nearest neighbor graphs
Miller, G. L., Teng, S.-H., Thurston, W., & Vavasis, S. A. (1997) · Journal of the ACM · doi:10.1145/256292.256294 · Cited by 218
Randomized algorithms for robust controller synthesis using statistical learning theory
Vidyasagar, M. (2001) · Automatica · doi:10.1016/s0005-1098(01)00122-4 · Cited by 230
Properties of Support Vector Machines
Pontil, M., & Verri, A. (1998) · Neural Computation · doi:10.1162/089976698300017575 · Cited by 229
Holzinger, A., Dehmer, M., Emmert-Streib, F., Cucchiara, R., Augenstein, I., Ser, J. D., Samek, W., Jurisica, I., & Díaz-Rodríguez, N. (2022) · Information Fusion · doi:10.1016/j.inffus.2021.10.007 · Cited by 213
Assessment of the effectiveness of support vector machines for hyperspectral data
Pal, M., & Mather, P. M. (2004) · Future Generation Computer Systems · doi:10.1016/j.future.2003.11.011 · Cited by 219
Support vector learning for fuzzy rule-based classification systems
Chen, Y., & Wang, J. Z. (2003) · IEEE Transactions on Fuzzy Systems · doi:10.1109/tfuzz.2003.819843 · Cited by 220
Prediction in Marketing Using the Support Vector Machine
Cui, D., & Curry, D. (2005) · Marketing Science · doi:10.1287/mksc.1050.0123 · Cited by 216
A Survey of On-Device Machine Learning: An Algorithms and Learning Theory Perspective
Dhar, S., Guo, J., Liu, J., Tripathi, S., Kurup, U., & Shah, M. (2021) · ACM Transactions on Internet of Things · doi:10.1145/3450494 · Cited by 276
Statistical Learning Theory: Models, Concepts, and Results
Luxburg, U. V., & Schölkopf, B. (2011) · Handbook of the History of Logic · doi:10.1016/b978-0-444-52936-7.50016-1 · Cited by 189
On learning sets and functions
Natarajan, B. K. (1989) · Machine Learning · doi:10.1007/bf00114804 · Cited by 189
Mukherjee, S., Niyogi, P., Poggio, T., & Rifkin, R. (2006) · Advances in Computational Mathematics · doi:10.1007/s10444-004-7634-z · Cited by 198
A Selective Overview of Deep Learning
Fan, J., Ma, C., & Zhong, Y. (2021) · Statistical Science · doi:10.1214/20-sts783 · Cited by 166
Coefficient of determination in nonlinear signal processing
Dougherty, E. R., Kim, S., & Chen, Y. (2000) · Signal Processing · doi:10.1016/s0165-1684(00)00079-7 · Cited by 205
The Modern Mathematics of Deep Learning
Berner, J., Grohs, P., Kutyniok, G., & Petersen, P. (2022) · Cambridge University Press eBooks · doi:10.1017/9781009025096.002 · Cited by 234
Theory of Disagreement-Based Active Learning
Hanneke, S. (2014) · Foundations and Trends in Machine Learning · doi:10.1561/2200000037 · Cited by 174
Offline Multi-Action Policy Learning: Generalization and Optimization
Zhou, Z., Athey, S. C., & Wager, S. (2022) · Operations Research · doi:10.1287/opre.2022.2271 · Cited by 286
Randomized Strategies for Probabilistic Solutions of Uncertain Feasibility and Optimization Problems
Álamo, T., Tempo, R., & Camacho, E. F. (2009) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2009.2031207 · Cited by 193
Quasi-optimal range searching in spaces of finite VC-dimension
Chazelle, B., & Welzl, E. (1989) · Discrete & Computational Geometry · doi:10.1007/bf02187743 · Cited by 192
A linear lower bound on the unbounded error probabilistic communication complexity
Forster, J. (2002) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(02)00019-3 · Cited by 181
Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm
Littlestone, N. (1987) · 28th Annual Symposium on Foundations of Computer Science (sfcs 1987) · doi:10.1109/sfcs.1987.37 · Cited by 186
Bourgain, J., & Tzafriri, L. (1987) · Israel Journal of Mathematics · doi:10.1007/bf02772174 · Cited by 198
Hurtado, J. E. (2004) · Structural Safety · doi:10.1016/j.strusafe.2003.05.002 · Cited by 176
Support vector regression to predict porosity and permeability: Effect of sample size
Al-Anazi, A. F., & Gates, I. D. (2012) · Computers & Geosciences · doi:10.1016/j.cageo.2011.06.011 · Cited by 176
Balcan, M.-F., Beygelzimer, A., & Langford, J. (2009) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2008.07.003 · Cited by 169
The Information Bottleneck Problem and its Applications in Machine Learning
Goldfeld, Z., & Polyanskiy, Y. (2020) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2020.2991561 · Cited by 165
Learning Efficient Sparse and Low Rank Models
Sprechmann, P., Bronstein, A. M., & Sapiro, G. (2015) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2015.2392779 · Cited by 160
Divergence Estimation of Continuous Distributions Based on Data-Dependent Partitions
Wang, Q., Kulkarni, S. R., & Verdu, S. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.853314 · Cited by 180
Which problems have strongly exponential complexity?
Impagliazzo, R., Paturi, R., & Zane, F. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1998.743516 · Cited by 200
Bartlett, P. L., & Mendelson, S. (2006) · Probability Theory and Related Fields · doi:10.1007/s00440-005-0462-3 · Cited by 176
Research on probabilistic methods for control system design
Calafiore, G. C., Dabbene, F., & Tempo, R. (2011) · Automatica · doi:10.1016/j.automatica.2011.02.029 · Cited by 176
A typical reconstruction limit for compressed sensing based on Lp-norm minimization
Kabashima, Y., Wadayama, T., & Tanaka, T. (2009) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/2009/09/l09003 · Cited by 209
Consistency of data-driven histogram methods for density estimation and classification
Lugosi, G., & Nobel, A. (1996) · The Annals of Statistics · doi:10.1214/aos/1032894460 · Cited by 169
Learning conjunctive concepts in structural domains
Haussler, D. (1989) · Machine Learning · doi:10.1007/bf00114802 · Cited by 171
Improved Bounds on the Sample Complexity of Learning
Li, Y., Long, P. M., & Srinivasan, A. (2001) · Journal of Computer and System Sciences · doi:10.1006/jcss.2000.1741 · Cited by 171
Niyogi, P., & Girosi, F. (1996) · Neural Computation · doi:10.1162/neco.1996.8.4.819 · Cited by 172
Appraisal of land use/land cover of mangrove forest ecosystem using support vector machine
Singh, S. K., Srivastava, P. K., Gupta, M., Thakur, J. K., & Mukherjee, S. (2013) · Environmental Earth Sciences · doi:10.1007/s12665-013-2628-0 · Cited by 170
Fast approximation of betweenness centrality through sampling
Riondato, M., & Kornaropoulos, E. M. (2016) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-015-0423-0 · Cited by 164
Hrushovski, E., & Pillay, A. (2011) · Journal of the European Mathematical Society · doi:10.4171/jems/274 · Cited by 168
Capacity of power constrained ad-hoc networks
Negi, R., & Rajeswaran, A. (2004) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2004.1354516 · Cited by 167
A survey on domain adaptation theory: learning bounds and theoretical guaranteesPreprint
Redko, I., Morvant, E., Habrard, A., Sebban, M., & Bennani, Y. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2004.11829 · Cited by 216
Structural properties and convergence results for contours of sample statistical depth functions
Serfling, R., & Zuo, Y. (2000) · The Annals of Statistics · doi:10.1214/aos/1016218227 · Cited by 161
Statistical performance of support vector machines
Blanchard, G., Bousquet, O., & Massart, P. (2008) · The Annals of Statistics · doi:10.1214/009053607000000839 · Cited by 167
Tracking drifting concepts by minimizing disagreements
Helmbold, D. P., & Long, P. M. (1994) · Machine Learning · doi:10.1007/bf00993161 · Cited by 161
Statistical learning theory and randomized algorithms for control
(1998) · IEEE Control Systems · doi:10.1109/37.736014 · Cited by 163
Bellet, A., Habrard, A., & Sebban, M. (2015) · Synthesis lectures on artificial intelligence and machine learning · doi:10.2200/s00626ed1v01y201501aim030 · Cited by 185
Neural networks expand SP's horizons
Haykin, S. (1996) · IEEE Signal Processing Magazine · doi:10.1109/79.487040 · Cited by 189
Flying Insect Classification with Inexpensive Sensors
Chen, Y., Why, A., Batista, G., Mafra-Neto, A., & Keogh, E. (2014) · Journal of Insect Behavior · doi:10.1007/s10905-014-9454-4 · Cited by 151
Why Philosophers Should Care about Computational Complexity
Aaronson, S. (2013) · The MIT Press eBooks · doi:10.7551/mitpress/8009.003.0011 · Cited by 187
Learning pattern classification-a survey
Kulkarni, S. R., Lugosi, G., & Venkatesh, S. S. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720536 · Cited by 161
Tehrany, M. S., Pradhan, B., & Jebur, M. N. (2013) · Geocarto International · doi:10.1080/10106049.2013.768300 · Cited by 160
Back-propagation network and its configuration for blood vessel detection in angiograms
Nekovei, R., & Sun, Y. (1995) · IEEE Transactions on Neural Networks · doi:10.1109/72.363449 · Cited by 159
A Neyman–Pearson Approach to Statistical Learning
Scott, C. D., & Nowak, R. D. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.856955 · Cited by 159
Small sample issues for microarray‐based classification
Dougherty, E. R. (2001) · Comparative and Functional Genomics · doi:10.1002/cfg.62 · Cited by 159
Approximate aggregation for tracking quantiles and range countings in wireless sensor networks
He, Z., Cai, Z., Cheng, S., & Wang, X. (2015) · Theoretical Computer Science · doi:10.1016/j.tcs.2015.07.056 · Cited by 155
Evaluation and Selection of Biases in Machine Learning
Gordon, D. F., & desJardins, M. (1995) · Machine Learning · doi:10.1007/bf00993472 · Cited by 196
Epsilon-nets and simplex range queries
Haussler, D. H., & Welzl, E. (1986) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/10515.10522 · Cited by 154
Tight lower bounds for the distinct elements problem
Indyk, P., & Woodruff, D. P. (2004) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2003.1238202 · Cited by 153
Agarwal, P. K., Cormode, G., Huang, Z., Phillips, J. M., Wei, Z., & Yi, K. (2013) · ACM Transactions on Database Systems · doi:10.1145/2500128 · Cited by 153
MODULAR NEURAL NETWORKS: A SURVEY
Auda, G., & Kamel, M. S. (1999) · International Journal of Neural Systems · doi:10.1142/s0129065799000125 · Cited by 176
Guest Column: A Survey of Quantum Learning Theory
Arunachalam, S., & de Wolf, R. (2017) · ACM SIGACT News · doi:10.1145/3106700.3106710 · Cited by 152
The Vapnik-Chervonenkis Dimension: Information versus Complexity in Learning
Abu-Mostafa, Y. S. (1989) · Neural Computation · doi:10.1162/neco.1989.1.3.312 · Cited by 152
Using oceanic‐atmospheric oscillations for long lead time streamflow forecasting
Kalra, A., & Ahmad, S. (2009) · Water Resources Research · doi:10.1029/2008wr006855 · Cited by 151
Neural network prediction analysis: The bankruptcy case
Leshno, M., & Spector, Y. (1996) · Neurocomputing · doi:10.1016/0925-2312(94)00060-3 · Cited by 181
Transformation invariance in pattern recognition: Tangent distance and propagation
Simard, P. Y., Le Cun, Y. A., Denker, J. S., & Victorri, B. (2000) · International Journal of Imaging Systems and Technology · doi:10.1002/1098-1098(2000)11:3<181::aid-ima1003>3.0.co;2-e · Cited by 151
Efficient agnostic learning of neural networks with bounded fan-in
Lee, W. S., Bartlett, P. L., & Williamson, R. C. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.556601 · Cited by 165
Nonparametric estimation via empirical risk minimization
Lugosi, G., & Zeger, K. (1995) · IEEE Transactions on Information Theory · doi:10.1109/18.382014 · Cited by 163
Chen, Q., Zhao, J., & Lin, H. (2008) · Spectrochimica Acta Part A Molecular and Biomolecular Spectroscopy · doi:10.1016/j.saa.2008.12.002 · Cited by 147
Robust covariance and scatter matrix estimation under Huber’s contamination model
Chen, M., Gao, C., & Ren, Z. (2018) · The Annals of Statistics · doi:10.1214/17-aos1607 · Cited by 146
From On-line to Batch Learning
Littlestone, N. (1989) · Elsevier eBooks · doi:10.1016/b978-0-08-094829-4.50022-2 · Cited by 173
Okewu, E., Adewole, P., Misra, S., Maskeliūnas, R., & Damaševičius, R. (2021) · Applied Artificial Intelligence · doi:10.1080/08839514.2021.1922847 · Cited by 159
Devroye, L. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055865 · Cited by 143
Jinglin, D., Liu, Y., Yu, Y., & Yan, W. (2017) · Algorithms · doi:10.3390/a10020057 · Cited by 143
Some special vapnik-chervonenkis classes
Wenocur, R. S., & Dudley, R. M. (1981) · Discrete Mathematics · doi:10.1016/0012-365x(81)90274-0 · Cited by 143
Random Sampling over Joins Revisited
Zhao, Z., Christensen, R. R., Li, F., Hu, X., & Yi, K. (2018) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/3183713.3183739 · Cited by 142
On the maximum stable throughput problem in random networks with directional antennas
Peraki, C., & Servetto, S. D. (2003) · ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) · doi:10.1145/778415.778426 · Cited by 142
Prediction-preserving reducibility
Pitt, L., & Warmuth, M. K. (1990) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(90)90028-j · Cited by 159
Universal Donsker Classes and Metric Entropy
Dudley, R. M. (2010) · Springer eBooks · doi:10.1007/978-1-4419-5821-1_19 · Cited by 141
Asymptotic analysis of multistage cooperative broadcast in wireless networks
Sirkeci‐Mergen, B., Scaglione, A., & Mergen, G. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.874514 · Cited by 140
Bokser, M. (1992) · Proceedings of the IEEE · doi:10.1109/5.156470 · Cited by 139
Automatic pattern recognition: a study of the probability of error
Devroye, L. (1988) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.3915 · Cited by 144
A flexible convex relaxation for phase retrieval
Bahmani, S., & Romberg, J. (2017) · Electronic Journal of Statistics · doi:10.1214/17-ejs1378si · Cited by 138
Further Advantages of Data Augmentation on Convolutional Neural Networks
Hernández-García, Á., & König, P. (2018) · Lecture notes in computer science · doi:10.1007/978-3-030-01418-6_10 · Cited by 169
Miller, G. L., Teng, S., Thurston, W. P. H., & Vavasis, S. A. (1993) · The IMA volumes in mathematics and its applications · doi:10.1007/978-1-4613-8369-7_3 · Cited by 138
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.