DMCA
Generalized Notions of Mind Change Complexity (1997)
Cached
Download Links
- [i11www.ira.uka.de]
- [math.uni-heidelberg.de]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings of the Tenth Annual Conference on Computational Learning Theory |
| Citations: | 12 - 6 self |
BibTeX
@INPROCEEDINGS{Sharma97generalizednotions,
author = {Arun Sharma and Frank Stephan and Yuri Ventsov},
title = {Generalized Notions of Mind Change Complexity},
booktitle = {In Proceedings of the Tenth Annual Conference on Computational Learning Theory},
year = {1997},
pages = {96--108},
publisher = {ACM Press}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Speed of convergence in Gold's identification in the limit model can be measured by deriving bounds on the number of mind changes made by a learner before the onset of convergence. Two approaches to date are bounds given by constants (referred here as Type 1) and bounds expressed as constructive ordinals (referred as Type 2). The use of ordinals has recently been successfully employed to measure the mind change complexity of learning rich concept classes such as unions of pattern languages, elementary formal systems and logic programs. Motivated by these applications, the present work introduces two more general approaches to bounding mind changes. These are based on counting by going down in a linearly ordered set (Type 3) and on counting by going down in a partially ordered set (Type 4). In both cases the set must not contain infinite, descending, and computable sequences. These four types of mind changes yield a hierarchy and there are identifiable classes that cannot be learned wit...
