Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Discovery Grants Program - Individual

University of Alberta

$23,000.00

On-line methods in machine learning

FY 2007-08

Summary
The proposed research is focused on on-line learning and sequential decision making in stochastic environments. Examples of sequential decision making problems abound: controlling industrial plants, performing clinical trials, managing investments, monitoring pipeline-systems, etc. An on-line learning algorithm improves the performance of a system during its normal operation. In contrast, off-line learning algorithms are trained with a fixed amount of data and then used with learning turned off. In off-line learning the training data has to be fully representative of the system's behaviour or performance may be poor. On-line learning systems overcome this potential weakness because they never stop adapting.On-line learning is challenging since learning and control is interleaved. Current on-line learning solutions are limited to small finite domains or make strong assumptions (such as that the uncertainty is parametric) that seriously limit their applicability since complex environments do not meet this conditions.Here I propose to develop and study on-line learning algorithms that work in large, complex environments. I plan to concentrate on the following aspects: (i) Understanding what makes efficient on-line learning possible, (ii) characterizing the behaviour of on-line learning algorithms, (iii) developing on-line learning algorithms that are efficient in terms of both data and computation. In order to accomplish this goal, I analyse the performance of the algorithms theoretically, deriving bounds that show their strengths and reveal their weaknesses, followed by an effort to improve their weakest points.Although delivering good on-line performance in large-scale, realistic environments is an ambitious goal, progress on this area is likely to find significant future, real-world applications.
Program
Discovery Grants Program - Individual
Location
Alberta, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data

As published

Application id
341723-2007
Name nom
Szepesvari, Csaba
Department département
Computing Science
Organization id
9
Institution établissement
University of Alberta
Province en
Alberta
Province fr
Alberta
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2007
Competition year année de concours
2007
Award amount
23000
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
331
Committee name en
Computing and Information Sciences - B
Committee name fr
Informatique - B
Area of application code
802
Area of application group en
Information and communication services
Area of application group fr
Services d'information et de télécommunications
Area of application en
Information systems and technology
Area of application fr
Systèmes d'information et technologie de l'information
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
1
Nb partie
5
Application title
On-line methods in machine learning
Keyword
NA
Application summary
The proposed research is focused on on-line learning and sequential decision making in stochastic environments. Examples of sequential decision making problems abound: controlling industrial plants, performing clinical trials, managing investments, monitoring pipeline-systems, etc. An on-line learning algorithm improves the performance of a system during its normal operation. In contrast, off-line learning algorithms are trained with a fixed amount of data and then used with learning turned off. In off-line learning the training data has to be fully representative of the system's behaviour or performance may be poor. On-line learning systems overcome this potential weakness because they never stop adapting.On-line learning is challenging since learning and control is interleaved. Current on-line learning solutions are limited to small finite domains or make strong assumptions (such as that the uncertainty is parametric) that seriously limit their applicability since complex environments do not meet this conditions.Here I propose to develop and study on-line learning algorithms that work in large, complex environments. I plan to concentrate on the following aspects: (i) Understanding what makes efficient on-line learning possible, (ii) characterizing the behaviour of on-line learning algorithms, (iii) developing on-line learning algorithms that are efficient in terms of both data and computation. In order to accomplish this goal, I analyse the performance of the algorithms theoretically, deriving bounds that show their strengths and reveal their weaknesses, followed by an effort to improve their weakest points.Although delivering good on-line performance in large-scale, realistic environments is an ambitious goal, progress on this area is likely to find significant future, real-world applications.