Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

University of Regina

$36,000.00

Algorithmic learning theory and typed pattern languages

EF 2012-13

Résumé
Computational Learning Theory (CLT) is a field within the scope of theoretical computer science, mathematics, and artificial intelligence. Its subject of research is the theoretical foundation of machine learning. My proposed research program addresses the gaps between certain formal CLT models and applications of machine learning to real-world problems. CLT models are formal abstractions of machine learning scenarios, in which assumptions are made about the real world, the learner, the source of information, and the criteria for successful learning. Within such a formal framework, one can prove that a specific machine learning task can be achieved (positive results) or cannot be achieved (negative results). The major gap between CLT and applied machine learning is that negative results in CLT are often due to assumptions that are unnecessarily pessimistic; positive results are often based on unrealistically optimistic assumptions. My proposed research is concerned with how practical aspects of machine learning can be better represented in formal models. With a new focus on efficient learning, I will study (a) variants of classical formal learning models, built on recursion theory, and (b) variants of formal models of the data and the way they are represented to the learner in machine learning scenarios, built on formal language theory. For (a), I will design and analyze new formal models of incremental learning, in which efficient learning from streaming data is modeled. For (b), my focus will be on typed variants of so-called pattern languages. Typed pattern languages are particularly useful for modeling data in bioinformatics and text mining applications but have not been studied systematically yet. Expected benefits of my research program are new theoretical insights in computational learning theory, formal language theory, and complexity theory, as well as the development of new efficient algorithms in machine learning, data mining, and bioinformatics.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Saskatchewan, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
386246-2010
Name nom
Zilles, Sandra
Department département
Computer Science
Organization id
17
Institution établissement
University of Regina
Province en
Saskatchewan
Province fr
Saskatchewan
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2012
Competition year année de concours
2010
Award amount
36000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
1507
Committee name en
Computer Science
Committee name fr
Sciences informatiques
Area of application code
9999
Area of application group en
Not available
Area of application group fr
Non disponible
Area of application en
Not available
Area of application fr
Non disponible
Research subject code
2805
Research subject group en
Artificial intelligence
Research subject group fr
Intelligence artificielle
Research subject en
Learning and inference theories
Research subject fr
Théories de l'apprentissage et l'inférence
Partie
3
Nb partie
5
Application title
Algorithmic learning theory and typed pattern languages
Keyword
NSERC
Application summary
Computational Learning Theory (CLT) is a field within the scope of theoretical computer science, mathematics, and artificial intelligence. Its subject of research is the theoretical foundation of machine learning. My proposed research program addresses the gaps between certain formal CLT models and applications of machine learning to real-world problems. CLT models are formal abstractions of machine learning scenarios, in which assumptions are made about the real world, the learner, the source of information, and the criteria for successful learning. Within such a formal framework, one can prove that a specific machine learning task can be achieved (positive results) or cannot be achieved (negative results). The major gap between CLT and applied machine learning is that negative results in CLT are often due to assumptions that are unnecessarily pessimistic; positive results are often based on unrealistically optimistic assumptions. My proposed research is concerned with how practical aspects of machine learning can be better represented in formal models. With a new focus on efficient learning, I will study (a) variants of classical formal learning models, built on recursion theory, and (b) variants of formal models of the data and the way they are represented to the learner in machine learning scenarios, built on formal language theory. For (a), I will design and analyze new formal models of incremental learning, in which efficient learning from streaming data is modeled. For (b), my focus will be on typed variants of so-called pattern languages. Typed pattern languages are particularly useful for modeling data in bioinformatics and text mining applications but have not been studied systematically yet. Expected benefits of my research program are new theoretical insights in computational learning theory, formal language theory, and complexity theory, as well as the development of new efficient algorithms in machine learning, data mining, and bioinformatics.