Published 1998
| Published
Book Section - Chapter
Open
Monotonic Networks
- Creators
- Sill, Joseph
Chicago
Abstract
Monotonicity is a constraint which arises in many application domains. We present a machine learning model, the monotonic network, for which monotonicity can be enforced exactly, i.e., by virtue of functional form . A straightforward method for implementing and training a monotonic network is described. Monotonic networks are proven to be universal approximators of continuous, differentiable monotonic functions. We apply monotonic networks to a real-world task in corporate bond rating prediction and compare them to other approaches.
Additional Information
© 1998 Massachusetts Institute of Technology. The author is very grateful to Yaser Abu-Mostafa for considerable guidance. I also thank John Moody for supplying the data. Amir Atiya, Eric Bax, Zehra Cataltepe, Malik Magdon-Ismail, Alexander Nicholson, and Xubo Song supplied many useful comments.Attached Files
Published - 1358-monotonic-networks.pdf
Files
1358-monotonic-networks.pdf
Files
(1.5 MB)
Name | Size | Download all |
---|---|---|
md5:56d2df29e13b87edbfe18fdfe4f33d79
|
1.5 MB | Preview Download |
Additional details
- Eprint ID
- 64702
- Resolver ID
- CaltechAUTHORS:20160223-163030288
- Created
-
2016-02-24Created from EPrint's datestamp field
- Updated
-
2019-10-03Created from EPrint's last_modified field
- Series Name
- Advances in Neural Information Processing Systems
- Series Volume or Issue Number
- 10