Abstract
The present paper introduces a new model for teaching randomized learners. Our new model, though based on the classical teaching dimension model, allows to study the influence of various parameters such as the learner’s memory size, its ability to provide or to not provide feedback, and the influence of the order in which examples are presented. Furthermore, within the new model it is possible to investigate new aspects of teaching like teaching from positive data only or teaching with inconsistent teachers.
Furthermore, we provide characterization theorems for teachability from positive data for both ordinary teachers and inconsistent teachers with and without feedback.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Angluin, D.: Queries and concept learning. Machine Learning 2(4), 319–342 (1988)
Angluin, D.: Queries revisited. Theoret. Comput. Sci. 313(2), 175–194 (2004)
Angluin, D., Kriķis, M.: Teachers, learners and black boxes. In: Proc. of the 10th Annual Conference on Computational Learning Theory, pp. 285–297. ACM Press, New York (1997)
Angluin, D., Kriķis, M.: Learning from different teachers. Machine Learning 51(2), 137–163 (2003)
Anthony, M., Brightwell, G., Cohen, D., Shawe-Taylor, J.: On exact specification by examples. In: Proc. of the 5th Annual ACM Workshop on Computational Learning Theory, pp. 311–318. ACM Press, New York (1992)
Bertsekas, D.P.: Dynamic Programming and Optimal Control. Athena Scientific
Feige, U.: A threshold of ln n for approximating set cover. J. of the ACM 45(4), 634–652 (1998)
Freivalds, R., Kinber, E.B., Wiehagen, R.: On the power of inductive inference from good examples. Theoret. Comput. Sci. 110(1), 131–144 (1993)
Goldman, S.A., Kearns, M.J.: On the complexity of teaching. J. Comput. Syst. Sci. 50(1), 20–31 (1995)
Goldman, S.A., Mathias, H.D.: Teaching a smarter learner. J. Comput. Syst. Sci. 52(2), 255–267 (1996)
Goldman, S.A., Rivest, R.L., Schapire, R.E.: Learning binary relations and total orders. SIAM J. on Computing 22(5), 1006–1034 (1993)
Jackson, J., Tomkins, A.: A computational model of teaching. In: Proc. of the 5th Annual ACM Workshop on Computational Learning Theory, pp. 319–326. ACM Press, New York (1992)
Jain, S., Lange, S., Nessel, J.: Learning of r.e. languages from good examples. In: Li, M. (ed.) ALT 1997. LNCS (LNAI), vol. 1316, pp. 32–47. Springer, Heidelberg (1997)
Madani, O., Hanks, S., Condon, A.: On the undecidability of probabilistic planning and infinite-horizon partially observable Markov decision problems. In: Proc. of the 16th National Conference on Artificial Intelligence and 11th Conference on Innovative Applications of Artificial Intelligence, pp. 541–548. AAAI Press/The MIT Press, Menlo Park (1999)
Mathias, H.D.: A model of interactive teaching. J. Comput. Syst. Sci. 54(3), 487–501 (1997)
Mundhenk, M., Goldsmith, J., Lusena, C., Allender, E.: Complexity of finite-horizon Markov decision process problems. J. of the ACM 47(4), 681–720 (2000)
Puterman, M.L.: Markov Decision Processes: Discrete Stochastic Dynamic Programming. John Wiley & Sons, Chichester (1994)
Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In: Proc. of the 29th ACM Symposium on Theory of Computing, pp. 475–484 (1997)
Shinohara, A., Miyano, S.: Teachability in computational learning. New Generation Computing 8(4), 337–348 (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Balbach, F.J., Zeugmann, T. (2006). Teaching Randomized Learners. In: Lugosi, G., Simon, H.U. (eds) Learning Theory. COLT 2006. Lecture Notes in Computer Science(), vol 4005. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11776420_19
Download citation
DOI: https://doi.org/10.1007/11776420_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35294-5
Online ISBN: 978-3-540-35296-9
eBook Packages: Computer ScienceComputer Science (R0)