Language learning from texts: mindchanges, limited memory, and monotonicity
Information and Computation
On the impact of forgetting on learning machines
Journal of the ACM (JACM)
Incremental learning from positive data
Journal of Computer and System Sciences
Incremental concept learning for bounded data mining
Information and Computation
Results on memory-limited U-shaped learning
Information and Computation
Information and Computation
U-shaped, iterative, and iterative-with-counter learning
Machine Learning
Dynamic Modeling in Inductive Inference
ALT '08 Proceedings of the 19th international conference on Algorithmic Learning Theory
ALT '08 Proceedings of the 19th international conference on Algorithmic Learning Theory
Iterative learning from positive data and counters
ALT'11 Proceedings of the 22nd international conference on Algorithmic learning theory
| Hi-index | 5.23 |
We analyze iterative learning in the limit from positive data with the additional information provided by a counter. The simplest type of counter provides the current iteration number (counting up from 0 to infinity), which is known to improve learning power over plain iterative learning. We introduce five other (weaker) counter types, for example only providing some unbounded and non-decreasing sequence of numbers. Analyzing these types allows one to understand which properties of a counter learning can benefit from. For the iterative setting, we completely characterize the relative power of the learning criteria corresponding to the counter types. In particular, for our types, the only properties improving learning power are unboundedness and strict monotonicity. Furthermore, we show that each of our types of counter improves learning power over weaker ones in some settings; to this end, we analyze transductive and non-U-shaped learning. Finally we show that, for iterative learning criteria with one of our types of counter, separations of learning criteria are necessarily witnessed by classes containing only infinite languages.