Abstract
If neural networks are to be used on a large scale, they have to be implemented in hardware. However, the cost of the hardware implementation is critically sensitive to factors like the precision used for the weights, the total number of bits of information and the maximum fan-in used in the network. This paper presents a version of the Constraint Based Decomposition training algorithm which is able to produce networks using limited precision integer weights and units with limited fan-in. The algorithm is tested on the 2-spiral problem and the results are compared with other existing algorithms.
Original language | English |
---|---|
Pages | 145-150 |
Number of pages | 6 |
Publication status | Published - 1997 |
Externally published | Yes |
Event | Proceedings of the 1997 Artificial Neural Networks in Engineering Conference, ANNIE'97 - St.Louis, MO, USA Duration: Nov 9 1997 → Nov 12 1997 |
Other
Other | Proceedings of the 1997 Artificial Neural Networks in Engineering Conference, ANNIE'97 |
---|---|
City | St.Louis, MO, USA |
Period | 11/9/97 → 11/12/97 |
ASJC Scopus subject areas
- Software