| | |
Summary: Monotonic Networks
Joseph Sill
Computation and Neural Systems program
California Institute of Technology
MC 13693, Pasadena, CA 91125
email: joe@cs.caltech.edu
Abstract
Monotonicity is a constraint which arises in many application do
mains. We present a machine learning model, the monotonic net
work, for which monotonicity can be enforced exactly, i.e., by virtue
of functional form. A straightforward method for implementingand
training a monotonic network is described. Monotonic networks
are proven to be universal approximators of continuous, differen
tiable monotonic functions. We apply monotonic networks to a
realworld task in corporate bond rating prediction and compare
them to other approaches.
1 Introduction
Several recent papers in machine learning have emphasized the importance of pri
ors and domainspecific knowledge. In their wellknown presentation of the bias
variance tradeoff (Geman and Bienenstock, 1992), Geman and Bienenstock conclude
|