The DOI matches its Crossref record; 78 of the 78 references it cites were found in a registry or an index.
Computational learning theory: survey and selected bibliography
Open accessAbstract
Give a rigorous, computationally detailed and plausible account of how learning can be done.
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
How to construct random functions
Goldreich, O., Goldwasser, S., & Micali, S. (1986) · Journal of the ACM · doi:10.1145/6490.6503 · Cited by 2,115
Learning regular sets from queries and counterexamples
Angluin, D. (1987) · Information and Computation · doi:10.1016/0890-5401(87)90052-6 · Cited by 2,114
Self-citationAngluin, D. (1988) · Machine Learning · doi:10.1007/bf00116828 · Cited by 1,905
Self-citationLearnability and the Vapnik-Chervonenkis dimension
Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M. K. (1989) · Journal of the ACM · doi:10.1145/76359.76371 · Cited by 1,839
Boosting a Weak Learning Algorithm by Majority
Freund, Y. (1995) · Information and Computation · doi:10.1006/inco.1995.1136 · Cited by 1,674
Public-key cryptosystems provably secure against chosen ciphertext attacks
Naor, M., & Yung, M. (1990) · Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90 · doi:10.1145/100216.100273 · Cited by 1,088
Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M. K. (1987) · Information Processing Letters · doi:10.1016/0020-0190(87)90114-1 · Cited by 1,054
Inductive Inference: Theory and Methods
Angluin, D., & Smith, C. H. (1983) · ACM Computing Surveys · doi:10.1145/356914.356918 · Cited by 887
Self-citationRivest, R. L. (1987) · Machine Learning · doi:10.1007/bf00058680 · Cited by 886
Angluin, D., & Laird, P. (1988) · Machine Learning · doi:10.1007/bf00116829 · Cited by 827
Self-citationCryptographic limitations on learning Boolean formulae and finite automata
Kearns, M., & Valiant, L. (1994) · Journal of the ACM · doi:10.1145/174644.174647 · Cited by 733
Finding patterns common to a set of strings
Angluin, D. (1980) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(80)90041-0 · Cited by 616
Self-citationConstant depth circuits, Fourier transform, and learnability
Linial, N., Mansour, Y., & Nisan, N. (1993) · Journal of the ACM · doi:10.1145/174130.174138 · Cited by 572
Vovk, V. G. (1990) · Conference on Learning Theory · doi:10.5555/92571.92672 · Cited by 551
Computational limitations on learning from examples
Pitt, L., & Valiant, L. G. (1988) · Journal of the ACM · doi:10.1145/48014.63140 · Cited by 515
Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm
Littlestone, N. (1988) · Machine Learning · doi:10.1007/bf00116827 · Cited by 497
(1986) · Cited by 482
Quantifying inductive bias: AI learning algorithms and Valiant's learning framework
Haussler, D. (1988) · Artificial Intelligence · doi:10.1016/0004-3702(88)90002-1 · Cited by 479
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
Vovk, V. G. (1990) · Colt Proceedings 1990 · doi:10.1016/b978-1-55860-146-8.50032-1 · Cited by 328
The weighted majority algorithm
Littlestone, N., & Warmuth, M. K. (1989) · 30th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1989.63487 · Cited by 295
On the learnability of Boolean formulae
Kearns, M., Li, M., Pitt, L., & Valiant, L. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.28426 · Cited by 284
Crytographic limitations on learning Boolean formulae and finite automata
Kearns, M., & Valiant, L. G. (1989) · Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 · doi:10.1145/73007.73049 · Cited by 266
The strength of weak learnability
Schapire, R. E. (1989) · 30th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1989.63451 · Cited by 257
Machine Learning: A Theoretical Approach
NATARAJAN, B. K. (1992) · CERN Document Server (European Organization for Nuclear Research) · Cited by 253
Computational Complexity of Machine Learning
Kearns, M. J. (1990) · Cited by 226
Negative results for equivalence queries
Angluin, D. (1990) · Machine Learning · doi:10.1007/bf00116034 · Cited by 220
Self-citationLearning read-once formulas with queries
Angluin, D., Hellerstein, L., & Karpinski, M. (1993) · Journal of the ACM · doi:10.1145/138027.138061 · Cited by 196
Self-citationWhen won't membership queries help?
Angluin, D., & Kharitonov, M. (1991) · Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91 · doi:10.1145/103418.103420 · Cited by 190
Self-citationOn learning sets and functions
Natarajan, B. K. (1989) · Machine Learning · doi:10.1007/bf00114804 · Cited by 189
Learning conjunctive concepts in structural domains
Haussler, D. (1989) · Machine Learning · doi:10.1007/bf00114802 · Cited by 171
Boosting a weak learning algorithm by majority
Freund, Y. (1990) · Colt Proceedings 1990 · doi:10.1016/b978-1-55860-146-8.50019-9 · Cited by 163
Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension
Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M. (1986) · Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86 · doi:10.1145/12130.12158 · Cited by 159
The minimum consistent DFA problem cannot be approximated within any polynomial
Pitt, L., & Warmuth, M. K. (1993) · Journal of the ACM · doi:10.1145/138027.138042 · Cited by 153
ON THE COMPUTATIONAL COMPLEXITY OFAPPROXIMATING DISTRIBUTIONS BY PROBABILISTIC AUTOMATA
Abe, N., & Warmuth, M. K. (1990) · doi:10.5555/92571.92587 · Cited by 147
Learning decision trees from random examples
Ehrenfeucht, A., & Haussler, D. H. (1989) · Information and Computation · doi:10.1016/0890-5401(89)90001-1 · Cited by 143
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 142
Learning decision trees using the Fourier spectrum
Kushilevitz, E., & Mansour, Y. (1991) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/103418.103466 · Cited by 139
Natarajan, B. K. (1987) · doi:10.1145/28395.28427 · Cited by 139
Boosting a weak learning algorithm by majority
Freund, Y. (1990) · Conference on Learning Theory · doi:10.5555/92571.92640 · Cited by 130
Learning from Good and Bad Data
Laird, P. D. (1988) · Kluwer international series in engineering and computer science · doi:10.1007/978-1-4613-1685-5 · Cited by 129
Learning in the presence of malicious errors
Kearns, M. J., & Li, M. (1988) · doi:10.1145/62212.62238 · Cited by 127
Teachability in computational learning
Shinohara, A., & Miyano, S. (1991) · New Generation Computing · doi:10.1007/bf03037091 · Cited by 120
LEARNING DNF UNDER THE UNIFORM DISTRIBUTION IN QUASI-POLYNOMIAL TIME
Verbeurgt, K. (1990) · Elsevier eBooks · doi:10.1016/b978-1-55860-146-8.50027-8 · Cited by 119
Research in the theory of inductive inference by GDR mathematicians—A survey
Klette, R., & Wiehagen, R. (1980) · Information Sciences · doi:10.1016/s0020-0255(80)80006-5 · Cited by 98
The design and analysis of efficient learning algorithms
Schapire, R. E. (1992) · Cited by 97
Learning Nested Differences of Intersection-Closed Concept Classes
Helmbold, D. P., Sloan, R. H., & Warmuth, M. K. (1990) · Machine Learning · doi:10.1023/a:1022696716689 · Cited by 95
A learning criterion for stochastic rules
Yamanishi, K. (1990) · Conference on Learning Theory · doi:10.5555/92571.92590 · Cited by 86
Learning DNF under the uniform distribution in quasi-polynomial time
Verbeurgt, K. (1990) · Conference on Learning Theory · doi:10.5555/92571.92659 · Cited by 78
On learning a union of half spaces
Baum, E. B. (1990) · Journal of Complexity · doi:10.1016/0885-064x(90)90012-3 · Cited by 76
Equivalence of models for polynomial learnability
Haussler, D. H., Kearns, M. J., Littlestone, N., & Warmuth, M. K. (1988) · Conference on Learning Theory · doi:10.5555/93025.93040 · Cited by 76
On the Computational Complexity of Approximating Distributions by Probabilistic Automata
Abe, N., & Warmuth, M. K. (1992) · Machine Learning · doi:10.1007/bf00992677 · Cited by 75
Types of noise in data for concept learning
Sloan, R. H. (1988) · Conference on Learning Theory · doi:10.5555/93025.93060 · Cited by 72
Haussler, D. H. (1989) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1989.63453 · Cited by 61
Improved Learning of AC0 Functions
Furst, M. L., Jackson, J. C., & Smith, S. W. (1991) · Elsevier eBooks · doi:10.1016/b978-1-55860-213-7.50032-8 · Cited by 58
SPACE-BOUNDED LEARNING AND THE VAPNIK-CHERVONENKIS DIMENSION
Floyd, S. (1989) · Elsevier eBooks · doi:10.1016/b978-0-08-094829-4.50028-3 · Cited by 58
On the necessity of Occam algorithms
R. Board, & Pitt, L. (1990) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/100216.100223 · Cited by 56
Towards a DNA sequencing theory (learning a string)
Li, M. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/fscs.1990.89531 · Cited by 54
Space-bounded learning and the Vapnik-Chervonenkis dimension
Floyd, S. (1989) · Conference on Learning Theory · doi:10.5555/93335.93379 · Cited by 53
Exact learning of read-twice DNF formulas
Aizenstein, H. J., & Pitt, L. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1991.185366 · Cited by 47
Valiant, L. G. (1988) · Conference on Learning Theory · doi:10.5555/93025.93038 · Cited by 45
On-line learning of linear functions
Littlestone, N., Long, P. M., & Warmuth, M. K. (1991) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/103418.103467 · Cited by 44
On Learning Ring-Sum-Expansions
Fischer, P., & Simon, H. U. (1992) · SIAM Journal on Computing · doi:10.1137/0221014 · Cited by 42
On the complexity of learning from counterexamples and membership queries
Maass, W., & Turán, G. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/fscs.1990.89539 · Cited by 42
Learning conjunctions of Horn clauses
Angluin, D., Frazier, M., & Pitt, L. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/fscs.1990.89537 · Cited by 35
Self-citationExact identification of circuits using fixed points of amplification functions
Goldman, S. A., Kearns, M. J., & Schapire, R. E. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/fscs.1990.89538 · Cited by 35
On learning from queries and counterexamples in the presence of noise
Sakakibara, Y. (1991) · Information Processing Letters · doi:10.1016/0020-0190(91)90220-c · Cited by 34
Pattern languages are not learnable
Schapire, R. E. (1990) · Conference on Learning Theory · doi:10.5555/92571.92613 · Cited by 33
A Markovian extension of Valiant's learning model
Aldous, D., & Vazirani, U. V. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/fscs.1990.89558 · Cited by 28
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
Tracking drifting concepts using random examples
Helmbold, D. P., & Long, P. M. (1991) · Conference on Learning Theory · doi:10.5555/114836.114839 · Cited by 24
On-line learning with an oblivious environment and the power of randomization
Maass, W. (1991) · Conference on Learning Theory · doi:10.5555/114836.114852 · Cited by 20
Learning binary relations and total orders
Goldman, S. A., Rivest, R. L., & Schapire, R. E. (1989) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1989.63454 · Cited by 20
Learning from good data and bad
Laird, P. D. (1987) · Yale University eBooks · Cited by 19
A parametrization scheme for classifying models of learnability
(1989) · doi:10.5555/93335.93366 · Cited by 19
A View of Computational Learning Theory
Valiant, L. G. (2007) · Springer eBooks · doi:10.1007/978-0-585-27366-2_8 · Cited by 15
Ben-David, S., Itai, A., & Kushilevtiz, E. (1990) · Conference on Learning Theory · doi:10.5555/92571.92644 · Cited by 10
Valiant, L. G. (2026) · Foundations of Computation and Machine Learning · doi:10.1145/3749740.3749746
Cited by
(1998) · Springer eBooks · doi:10.1007/978-1-4615-5529-2 · Cited by 1,235
Principles and methods of testing finite state machines-a survey
Lee, D., & Yannakakis, M. (1996) · Proceedings of the IEEE · doi:10.1109/5.533956 · Cited by 1,228
Statistical strategies for avoiding false discoveries in metabolomics and related experiments
Broadhurst, D. I., & Kell, D. B. (2007) · Metabolomics · doi:10.1007/s11306-006-0037-z · Cited by 817
From Boolean to probabilistic Boolean networks as models of genetic regulatory networks
Shmulevich, I., Dougherty, E. R., & Zhang, W. (2002) · Proceedings of the IEEE · doi:10.1109/jproc.2002.804686 · Cited by 641
Wrapper induction: Efficiency and expressiveness
Kushmerick, N. (2000) · Artificial Intelligence · doi:10.1016/s0004-3702(99)00100-9 · Cited by 553
Metadata
- Authors
- Angluin, D.
- Venue
- Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92
- Publisher
- ACM Press
- Published
- 1992
- Pages
- 351-369
- OpenAlex
- W2018198423
- Cited by
- 316
- References
- 78
- FWCI
- 16.48
- Type
- conference paper
- 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.