An algebraic view on exact learning from queries

Authors:
Ricard Gavaldá
Affiliations:
Department of Software (LSI), Universitat Politécnica de Catalunya, Barcelona, Spain
Venue:
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Year:
2005

Citing 7
Cited 0

Learning regular sets from queries and counterexamples

Information and Computation
Bounded-width polynomial-size branching programs recognize exactly those languages in NC1

Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Non-uniform automata over groups

Information and Computation
Queries and Concept Learning

Machine Learning
Queries and Concept Learning

Machine Learning
Learning Expressions over Monoids

STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Algebraic Characterizations of Small Classes of Boolean Functions

STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.