Conservativeness and monotonicity for learning algorithms

Eiji Takimoto, Akira Maruoka

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

1 被引用数 (Scopus)


In the framework of PAC-learning model, relationships between learning processes and information compressing processes are investigated. Information compressing processes are formulated as weak Occam algorithms. A weak Occam algorithm is a deterministic polynomial time algorithm that, when given m examples of unknown function, outputs, with high probability, a representation of a function that is consistent with the examples and belongs to a function class with complexity o(m). It has been shown that a weak Occam algorithm is also a consistent PAC-learning algorithm. In this extended abstract, it is shown that the converse does not hold by giving a PAC-learning algorithm that is not a weak Occam algorithm, and also some natural properties, called conservativeness and monotonicity, for learning algorithms that might help the converse hold are given. In particular, the conditions that make a conservative PAC-learning algorithm a weak Occam algorithm are given, and it is shown that, under some natural conditions, a monotone PAC-learning algorithm for a hypothesis class can be transformed to a weak Occam algorithm without changing the hypothesis class.

ホスト出版物のタイトルProc 6 Annu ACM Conf Comput Learn Theory
出版社Publ by ACM
ISBN(印刷版)0897916115, 9780897916110
出版ステータス出版済み - 1993
イベントProceedings of the 6th Annual ACM Conference on Computational Learning Theory - Santa Cruz, CA, USA
継続期間: 7 26 19937 28 1993


名前Proc 6 Annu ACM Conf Comput Learn Theory


その他Proceedings of the 6th Annual ACM Conference on Computational Learning Theory
CitySanta Cruz, CA, USA

All Science Journal Classification (ASJC) codes

  • 工学(全般)


「Conservativeness and monotonicity for learning algorithms」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。