Titlebook: Algorithmic Learning Theory; 17th International C José L. Balcázar,Philip M. Long,Frank Stephan Conference proceedings 2006 Springer-Verlag

fastness

ARIA

附錄

On Exact Learning from Random WalkWe consider a few particular exact learning models based on a random walk stochastic process, and thus more restricted than the well known general exact learning models. We give positive and negative results as to whether learning in these particular models is easier than in the general learning models.

膽汁

irradicable

Teaching Memoryless Randomized Learners Without Feedbackandomized learners is provided and, based on it, optimal teaching teaching times for certain classes are established. Second, the problem of determining the . is shown to be .-hard. Third, an algorithm for approximating the optimal teaching time is given. Finally, two heuristics for teaching are studied, i.e., cyclic teachers and greedy teachers.

向外