Keywords
Simple (philosophy)Computer scienceNode (physics)Artificial neural networkSet (abstract data type)Representation (politics)Encoding (memory)AlgorithmTraining (meteorology)Nonlinear systemTheoretical computer scienceArtificial intelligence
Related Publications
Fast Training of Support Vector Machines Using Sequential Minimal Optimization
This chapter describes a new algorithm for training Support Vector Machines: Sequential Minimal Optimization, or SMO. Training a Support Vector Machine (SVM) requires the soluti...
Training Very Deep Networks
Theoretical and empirical evidence indicates that the depth of neural networks is crucial for their success. However, training becomes more difficult as depth increases, and tra...
Gaussian Processes for Machine Learning
We give a basic introduction to Gaussian Process regression models. We focus on understanding the role of the stochastic process and how it is used to define a distribution over...
Generalization of Back propagation to Recurrent and Higher Order Neural Networks
A general method for deriving backpropagation algorithms for networks with recurrent and higher order networks is introduced. The propagation of activation in these networks is ...
LRBM: A Restricted Boltzmann Machine Based Approach for Representation Learning on Linked Data
Linked data consist of both node attributes, e.g., Preferences, posts and degrees, and links which describe the connections between nodes. They have been widely used to represen...
Publication Info
- Year
- 1992
- Type
- article
- Volume
- 5
- Issue
- 1
- Pages
- 117-127
- Citations
- 541
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
541
OpenAlex
Cite This
Avrim Blum,
Ronald L. Rivest
(1992).
Training a 3-node neural network is NP-complete.
Neural Networks
, 5
(1)
, 117-127.
https://doi.org/10.1016/s0893-6080(05)80010-3
Identifiers
- DOI
- 10.1016/s0893-6080(05)80010-3