Abstract
Computational Learning Theory has two goals: one, proposing rigorous models of learning tasks that can be carried out by computers. Two, designing algorithms that provably learn whole classes of concepts in these models within some efficiency criterion.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Angluin, D.: Learning regular sets from queries and counterexamples. Information and Computation 75, 87–106 (1987)
Angluin, D.: Queries and concept learning. Machine Learning 2, 319–342 (1988)
Gavaldà, R., Thérien, D.: Learning expressions over monoids. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol. 2010, pp. 283–293. Springer, Heidelberg (2001)
Gavaldà, R., Thérien, D., Tesson, P.: Learning expressions and programs over monoids. Technical Report R01–38, Departament LSI, Universitat Politecnica de Catalunya (2001) (Submitted to journal)
Barrington, D.: Bounded-width polynomial-size branching programs recognize exactly those languages in NC1. Journal of Computer and System Sciences 38, 150–164 (1989)
Barrington, D.M., Straubing, H., Thérien, D.: Non-uniform automata over groups. Information and Computation 89, 109–132 (1990)
Gavaldà, R., Thérien, D.: Algebraic characterization of small classes of boolean functions. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol. 2607, pp. 331–342. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gavaldá, R. (2005). An Algebraic View on Exact Learning from Queries. In: Cooper, S.B., Löwe, B., Torenvliet, L. (eds) New Computational Paradigms. CiE 2005. Lecture Notes in Computer Science, vol 3526. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11494645_19
Download citation
DOI: https://doi.org/10.1007/11494645_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26179-7
Online ISBN: 978-3-540-32266-5
eBook Packages: Computer ScienceComputer Science (R0)