Incorporating Functional Knowledge in Neural Networks
Charles Dugas, Yoshua Bengio, François Bélisle, Claude Nadeau, René Garcia; 10(42):1239−1262, 2009.
Abstract
Incorporating prior knowledge of a particular task into the architecture of a learning algorithm can greatly improve generalization performance. We study here a case where we know that the function to be learned is non-decreasing in its two arguments and convex in one of them. For this purpose we propose a class of functions similar to multi-layer neural networks but (1) that has those properties, (2) is a universal approximator of Lipschitz functions with these and other properties. We apply this new class of functions to the task of modelling the price of call options. Experiments show improvements on regressing the price of call options using the new types of function classes that incorporate the a priori constraints.
[abs]
[pdf][bib]| © JMLR 2009. (edit, beta) |