Function minimization for dynamic programming using connectionist networks

Learning controllers based on dynamic programming require some means of storing arbitrary functions and finding global minima within cross sections of those functions. A method is presented for learning and finding the minima of all cross sections of an arbitrary, smooth function. This method is applicable to any general function approximation system that learns smooth functions from examples. Mathematical properties of this approach are described. Applications to learning control are discussed, and simulation results are presented.<>