Ji, Chuanyi and Snapp, Robert R. and Psaltis, Demetri (1990) Generalizing smoothness constraints from discrete samples. Neural Computation, 2 (2). pp. 188-197. ISSN 0899-7667. http://resolver.caltech.edu/CaltechAUTHORS:JICnc90
- Published Version
See Usage Policy.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:JICnc90
We study how certain smoothness constraints, for example, piecewise continuity, can be generalized from a discrete set of analog-valued data, by modifying the error backpropagation, learning algorithm. Numerical simulations demonstrate that by imposing two heuristic objectives — (1) reducing the number of hidden units, and (2) minimizing the magnitudes of the weights in the network — during the learning process, one obtains a network with a response function that smoothly interpolates between the training data.
|Additional Information:||© 1990 Massachusetts Institute of Technology. Received 15 August 1989; accepted 20 February 1990. Posted Online March 13, 2008. We would like to thank our colleagues, Mr. Mark Neifeld, Dr. Jeff Yu, Dr. Fai Mok, and Mr. Alan Yamamura for helpful discussions. This work was supported by the JPL Director’s Discretionary Fund and in part by DARPA and the Air Force Office of Scientific Research.|
|Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||Tony Diaz|
|Deposited On:||17 Jun 2009 21:33|
|Last Modified:||26 Dec 2012 10:53|
Repository Staff Only: item control page