1996
Cite Score
5
AI summary
The paper introduces a novel constructive algorithm for designing and training multilayer perceptrons by optimizing an objective function for internal representations, using class separability for discrimination and maximizing statistical measures for continuous function approximation, demonstrating improved performance and robustness.
Main Contributions
Abstract
A new constructive algorithm for designing and training multilayer perceptrons is proposed. This algorithm involves the optimization of an objective function for internal representations, which does not require any computation of the network's outputs. Coupled with a strategy for recruiting units during the learning process, this concept provides a scheme for training a multilayer network layer by layer, until self-encoding of the pattern categories is achieved in the final, highest-level representations. Two objective functions are proposed. For discrimination problems, recent experimental and theoretical results concerning back-propagation training of networks with one hidden layer and linear outputs suggest the introduction of a particular measure of class separability. For problems involving the approximation of a continuous function, we show that the minimization of the mean squared output error can be achieved by maximizing a statistical measure (the sample coefficient of multiple determination) in the last hidden layer. Simulations are used to illustrate the process of network construction, and to demonstrate the improvements brought by this approach over back-propagation in terms of performance and robustness.
Citation Graph
References [29]
D. E. Rumelhart, Geoffrey E. Hinton, Ronald J. Williams - 1986
46 papers in library cite
F. Rosenblatt - 1958
3 papers in library cite
Geoffrey E. Hinton - 1987
11 papers in library cite
R. O. Duda, P. E. Hart - 1973
9 papers in library cite
S. E. Fahlman, C. Lebiere - 1989
6 papers in library cite
E. B. Baum, D. Haussler - 1989
3 papers in library cite
V. N. Vapnik - 1983
2 papers in library cite
A. S. Weigend, D. E. Rumelhart, B. A. Huberman - 1991
2 papers in library cite
T. Grossman, R. Meir, E. Domany - 1989
2 papers in library cite
D. Haussler - 1988
2 papers in library cite
M. Marchand, M. Golea, P. Rujan - 1990
1 paper in library cites
A. Krogh, G. I. Thorebegsson, J. A. Hertz - 1990
1 paper in library cites
P. Courrieu - 1991
1 paper in library cites
A. Rechstschaffen, A. Kales - 1968
1 paper in library cites
H. Asoh, N. Otsu - 1990
1 paper in library cites
Kur Hornik - 1991
1 paper in library cites
Y. Hirose, K. Yamashita, S. Hijiya - 1991
1 paper in library cites
E. B. Baum, Kevin J. Lang - 1991
1 paper in library cites
R. Zollner, H. J. Schmitz, F. Wunsch, U. Krey - 1992
1 paper in library cites
K. Fukunaga - 1972
1 paper in library cites
M. Mezard, J. P. Nadal - 1989
1 paper in library cites
P. Gallinari, S. Thiria, F. F. Soulie - 1988
1 paper in library cites
N. Schaltenbrand, R. Lengelle, J. P. Macher - 1993
1 paper in library cites
P. Gallinari, S. Thiria, F. Badran, F. F. Soulie - 1991
1 paper in library cites
R. Lengelle, Thierry Denoeux - 1992
1 paper in library cites
R. M. Burton, W. G. Farris - 1991
1 paper in library cites
E. D. Sontag - 1991
1 paper in library cites
T. Kohonen, R. Chrisley, G. Barna - 1989
1 paper in library cites
A. R. Webb, D. Lowe - 1990
1 paper in library cites
Cited by
2
papers in your library
Cites
3
papers in your library
Read
on June 28, 2025
Your review
Tags
Paper Aliases
No aliases