Conservativeness and Monotonicity for Learning Algorithms
Abstract
Article Free Access Share on Conservativeness and monotonicity for learning algorithms Authors: Eiji Takimoto View Profile , Akira Maruoka View Profile Authors Info & Claims COLT '93: Proceedings of the sixth annual conference on Computational learning theoryAugust 1993Pages 377–383https://doi.org/10.1145/168304.168381Published:01 August 1993Publication History 1citation126DownloadsMetricsTotal Citations1Total Downloads126Last 12 Months6Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited. To manage your alert preferences, click on the button below. Manage my AlertsNew Citation Alert!Please log in to your account Publisher SiteeReaderPDF
Cite
Text
Takimoto and Maruoka. "Conservativeness and Monotonicity for Learning Algorithms." Annual Conference on Computational Learning Theory, 1993. doi:10.1145/168304.168381Markdown
[Takimoto and Maruoka. "Conservativeness and Monotonicity for Learning Algorithms." Annual Conference on Computational Learning Theory, 1993.](https://mlanthology.org/colt/1993/takimoto1993colt-conservativeness/) doi:10.1145/168304.168381BibTeX
@inproceedings{takimoto1993colt-conservativeness,
title = {{Conservativeness and Monotonicity for Learning Algorithms}},
author = {Takimoto, Eiji and Maruoka, Akira},
booktitle = {Annual Conference on Computational Learning Theory},
year = {1993},
pages = {377-383},
doi = {10.1145/168304.168381},
url = {https://mlanthology.org/colt/1993/takimoto1993colt-conservativeness/}
}