The DOI matches its Crossref record.
Almost optimal lower bounds for small depth circuits
Abstract
Article Almost optimal lower bounds for small depth circuits Share on Author: J Hastad Applied Mathematics department and Laboratory of Computer Science, MIT Applied Mathematics department and Laboratory of Computer Science, MITView Profile Authors Info & Claims STOC '86: Proceedings of the eighteenth annual ACM symposium on Theory of computingNovember 1986 Pages 6–20https://doi.org/10.1145/12130.12132Online:01 November 1986Publication History 257citation973DownloadsMetricsTotal Citations257Total Downloads973Last 12 Months50Last 6 weeks6 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cited by
Representation Learning: A Review and New Perspectives
Bengio, Y., Courville, A., & Vincent, P. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2013.50 · Cited by 13,001
Learning Deep Architectures for AI
Bengio, Y. (2009) · now publishers, Inc. eBooks · doi:10.1561/9781601982957 · Cited by 4,941
Practical Recommendations for Gradient-Based Training of Deep Architectures
Bengio, Y. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-35289-8_26 · Cited by 2,259
Multimodal Neuroimaging Feature Learning for Multiclass Diagnosis of Alzheimer's Disease
Liu, S., Liu, S., Cai, W., Che, H., Pujol, S., Kikinis, R., Feng, D., Fulham, M. J., & ADNI (2015) · IEEE Transactions on Biomedical Engineering · doi:10.1109/tbme.2014.2372011 · Cited by 637
(2016) · Conference on Learning Theory · Cited by 443
Why Does Deep and Cheap Learning Work So Well?
Lin, H. W., Tegmark, M., & Rolnick, D. (2017) · Journal of Statistical Physics · doi:10.1007/s10955-017-1836-5 · Cited by 393
Threshold circuits of bounded depth
Hajnal, A., Maass, W., Pudlák, P., Szegedy, M., & Turán, G. (1993) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(93)90001-d · Cited by 237
On the Expressive Power of Deep Architectures
Bengio, Y., & Delalleau, O. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-24412-4_3 · Cited by 182
On the number of response regions of deep feed forward networks with piece-wise linear activations
Pascanu, R., Montufar, G., & Bengio, Y. (2013) · arXiv · doi:10.48550/arxiv.1312.6098 · Cited by 153
On the depth of deep neural networks: a theoretical view
Sun, S., Chen, W., Wang, L., Liu, X., & Liu, T.-Y. (2016) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v30i1.10243 · Cited by 147
Decision trees do not generalize to new variations
Bengio, Y., Delalleau, O., & Simard, C. (2010) · Computational Intelligence · doi:10.1111/j.1467-8640.2010.00366.x · Cited by 89
Metadata
- Authors
- Hastad, J.
- Venue
- Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86
- Publisher
- ACM Press
- Published
- 1986
- Pages
- 6-20
- OpenAlex
- W2165293955
- Cited by
- 620
- References
- 0
- FWCI
- 14.83
- Type
- conference paper
- 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.
