The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Can threshold networks be trained directly?
Abstract
Neural networks with threshold activation functions are highly desirable because of the ease of hardware implementation. However, the popular gradient-based learning algorithms cannot be directly used to train these networks as the threshold functions are nondifferentiable. Methods available in the literature mainly focus on approximating the threshold activation functions by using sigmoid functions. In this paper, we show theoretically that the recently developed extreme learning machine (ELM) algorithm can be used to train the neural networks with threshold functions directly instead of approximating them with sigmoid functions. Experimental results based on real-world benchmark regression problems demonstrate that the generalization performance obtained by ELM is better than other algorithms used in threshold networks. Also, the ELM method does not need control variables (manually tuned parameters) and is much faster.
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
Cites
Learning Internal Representations by Error Propagation
Rumelhart, D. E., Hinton, G. E., & Williams, R. J. (1985) · doi:10.21236/ada164453 · Cited by 16,172
Extreme learning machine: a new learning scheme of feedforward neural networks
Huang, G.-B., Zhu, Q.-Y., & Siew, C.-K. (2005) · 2004 IEEE International Joint Conference on Neural Networks (IEEE Cat. No.04CH37541) · doi:10.1109/ijcnn.2004.1380068 · Cited by 4,084
Self-citationBartlett, P. L. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.661502 · Cited by 1,166
Learning capability and storage capacity of two-hidden-layer feedforward networks
Huang, G.-B. (2003) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2003.809401 · Cited by 810
Self-citationHuang, G.-B., & Babri, H. A. (1998) · IEEE Transactions on Neural Networks · doi:10.1109/72.655045 · Cited by 538
Self-citationCapabilities of a four-layered feedforward neural network: four layers versus three
Tamura, S., & Tateishi, M. (1997) · IEEE Transactions on Neural Networks · doi:10.1109/72.557662 · Cited by 422
On the capabilities of multilayer perceptrons
Baum, E. B. (1988) · Journal of Complexity · doi:10.1016/0885-064x(88)90020-9 · Cited by 379
An iterative method for training multilayer networks with threshold functions
Corwin, E. M., Logar, A. M., & Oldham, W. J. B. (1994) · IEEE Transactions on Neural Networks · doi:10.1109/72.286926 · Cited by 46
Using random weights to train multilayer networks of hard-limiting units
Barlett, P. L., & Downs, T. (1992) · IEEE Transactions on Neural Networks · doi:10.1109/72.125861 · Cited by 40
Training binary node feedforward neural networks by back propagation of error
Toms, D. J. (1990) · Electronics Letters · doi:10.1049/el:19901121 · Cited by 34
Cited by
Extreme learning machine: Theory and applications
Huang, G.-B., Zhu, Q.-Y., & Siew, C.-K. (2006) · Neurocomputing · doi:10.1016/j.neucom.2005.12.126 · Cited by 13,285
Self-citationUniversal Approximation using Incremental Constructive Feedforward Networks with Random Hidden Nodes
Huang, G.-B., Chen, L., & Siew, C.-K. (2006) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2006.875977 · Cited by 2,614
Self-citationA Fast and Accurate Online Sequential Learning Algorithm for Feedforward Networks
Liang, N.-Y., Huang, G.-B., Saratchandran, P., & Sundararajan, N. (2006) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2006.880583 · Cited by 1,965
Self-citationExtreme learning machines: a survey
Huang, G.-B., Wang, D. H., & Lan, Y. (2011) · International Journal of Machine Learning and Cybernetics · doi:10.1007/s13042-011-0019-y · Cited by 1,914
Self-citationAn Insight into Extreme Learning Machines: Random Neurons, Random Features and Kernels
Huang, G.-B. (2014) · Cognitive Computation · doi:10.1007/s12559-014-9255-2 · Cited by 957
Self-citation
Metadata
- Authors
- Huang, G.-B., Zhu, Q.-Y., Mao, K. Z., Siew, C.-K., Saratchandran, P., & Sundararajan, N.
- Venue
- IEEE Transactions on Circuits and Systems II: Express Briefs
- Published
- 2006-03
- Volume
- 53
- Issue
- 3
- Pages
- 187-191
- ISSN
- 1057-7130 (ISSN-L)
- OpenAlex
- W2161055889
- Cited by
- 266
- References
- 12
- FWCI
- 14.16
- Type
- journal article
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Can threshold networks be trained directly? https://app.cochat.ai/papers/10.1109/tcsii.2005.857540
- The paper
- Huang, G.-B., Zhu, Q.-Y., Mao, K. Z., Siew, C.-K., Saratchandran, P., & Sundararajan, N. (2006). Can threshold networks be trained directly? IEEE Transactions on Circuits and Systems II: Express Briefs. https://doi.org/10.1109/tcsii.2005.857540
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.