The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Computational limitations on learning from examples
Open accessAbstract
The computational complexity of learning Boolean concepts from examples is investigated. It is shown for various classes of concept representations that these cannot be learned feasibly in a distribution-free sense unless R = NP. These classes include (a) disjunctions of two monomials, (b) Boolean threshold functions, and (c) Boolean formulas in which each variable occurs at most once. Relationships between learning of heuristics and finding approximate solutions to NP-hard optimization problems are given.
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
(1979) · Cited by 43,841
Valiant, L. G. (1984) · Communications of the ACM · doi:10.1145/1968.1972 · Cited by 3,279
Self-citationA Greedy Heuristic for the Set-Covering Problem
Chvatal, V. (1979) · Mathematics of Operations Research · doi:10.1287/moor.4.3.233 · Cited by 2,581
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
Proceedings 35th Annual Symposium on Foundations of Computer Science
(1994) · doi:10.1109/sfcs.1994 · Cited by 1,087
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
Complexity of automaton identification from given data
Gold, E. M. (1978) · Information and Control · doi:10.1016/s0019-9958(78)90562-4 · Cited by 771
Inductive inference of formal languages from positive data
Angluin, D. (1980) · Information and Control · doi:10.1016/s0019-9958(80)90285-5 · Cited by 745
Computational Complexity of Probabilistic Turing Machines
Gill, J. (1977) · SIAM Journal on Computing · doi:10.1137/0206049 · Cited by 689
Cited by
(2015) · Cited by 2,857
The Strength of Weak Learnability
Schapire, R. E. (1990) · Machine Learning · doi:10.1007/bf00116037 · Cited by 4,600
Angluin, D. (1988) · Machine Learning · doi:10.1007/bf00116828 · Cited by 1,905
Learnability 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
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
Property testing and its connection to learning and approximation
Goldreich, O., Goldwasser, S., & Ron, D. (1998) · Journal of the ACM · doi:10.1145/285055.285060 · Cited by 1,020
Rivest, R. L. (1987) · Machine Learning · doi:10.1007/bf00058680 · Cited by 886
Cryptographic 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
Self-citationLearnability in Optimality Theory
Tesar, B., & Smolensky, P. (1998) · Linguistic Inquiry · doi:10.1162/002438998553734 · Cited by 684
Efficient noise-tolerant learning from statistical queries
Kearns, M. (1998) · Journal of the ACM · doi:10.1145/293347.293351 · Cited by 665
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
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
A general lower bound on the number of examples needed for learning
Ehrenfeucht, A., Haussler, D., Kearns, M., & Valiant, L. (1989) · Information and Computation · doi:10.1016/0890-5401(89)90002-3 · Cited by 403
Self-citationEfficient 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
Simplifying decision trees: A survey
BRESLOW, L. A., & AHA, D. W. (1997) · The Knowledge Engineering Review · doi:10.1017/s0269888997000015 · Cited by 337
Toward efficient agnostic learning
Kearns, M. J., Schapire, R. E., & Sellie, L. M. (1992) · Proceedings of the fifth annual workshop on Computational learning theory · doi:10.1145/130385.130424 · Cited by 330
Computational learning theory: survey and selected bibliography
Angluin, D. (1992) · Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92 · doi:10.1145/129712.129746 · Cited by 316
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
Self-citationIntroduction to Property Testing
Goldreich, O. (2017) · Cambridge University Press eBooks · doi:10.1017/9781108135252 · Cited by 270
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
Self-citationThe 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
Sample compression, learnability, and the Vapnik-Chervonenkis dimension
Floyd, S., & Warmuth, M. (1995) · Machine Learning · doi:10.1007/bf00993593 · Cited by 256
Kim, M., & Smaragdis, P. (2016) · arXiv · doi:10.48550/arxiv.1601.06071 · Cited by 166
Metadata
- Authors
- Pitt, L., & Valiant, L. G.
- Venue
- Journal of the ACM
- Published
- 1988-10
- Volume
- 35
- Issue
- 4
- Pages
- 965-984
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2117049614
- Cited by
- 515
- References
- 20
- FWCI
- 36.94
- 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.