Grant: Discovery Grants Program - Individual
University of Waterloo
$40,000.00
Theoretical analysis of emerging machine learning paradigms
FY 2011-12
Summary
The field of statistical and computational machine learning has had impressive successes, offering rigorous tools for learning to predict labels of data, based on training samples. Algorithmic paradigms like Support-Vector-Machines, Decision-Trees and Boosting grew from theoretical models into popular and vastly applicable software packages. Machine learning thus provides a resounding demonstration of the impact of theoretical analysis on the development of practical applications. However, many common applications of machine learning address scenarios that are more complex than what is modeled by the currently available mathematical theory. Consider, for example, medical research aimed to identify physiological markers that predict future development of dementia. Say the research took place in Denmark. Can one readily apply its conclusions to Canadian patients? Common learning methods for classification perform well when training and test data are drawn from the same population. However, as the above example demonstrates, in many application this is not the case. Under which conditions, and how, can we adapt a classifier trained on some source domain to apply to a different target domain? To cope with such scenarios, learning practitioners have developed heuristics that, while apparently working reasonably well, are not supported by existing mathematical analysis. Can the success of theoretical analysis of machine learning be extended to such scenarios? The proposed research aims to provide mathematical support for such emerging machine learning and data mining heuristic paradigms that, while being widely applied, lack rigorous theoretical underpinnings. In a series of recent papers, with several students of mine, we have made pioneering steps in that direction. Some examples of such work include: papers on popular model-selection heuristics for clustering (one of which awarded COLT Best Student Paper); a NIPS'06 paper on domain adaptation; a COLT08 paper on semi-supervised learning, and a NIPS'08 paper on the foundations of clustering. These papers, as well as related workshops that I have organized, are the start of an ambitious project that I will pursue with this grant.
Program
Discovery Grants Program - Individual
Recipient
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
312393-2009
Name nom
BenDavid, Shai
Department département
Computer Science, David R. Cheriton School of
Organization id
33
Institution établissement
University of Waterloo
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2011
Competition year année de concours
2009
Award amount
40000
Program id
RGPIN
Program nane 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
3
Nb partie
5
Application title
Theoretical analysis of emerging machine learning paradigms
Keyword
NSERC
Application summary
The field of statistical and computational machine learning has had impressive successes, offering rigorous tools for learning to predict labels of data, based on training samples. Algorithmic paradigms like Support-Vector-Machines, Decision-Trees and Boosting grew from theoretical models into popular and vastly applicable software packages. Machine learning thus provides a resounding demonstration of the impact of theoretical analysis on the development of practical applications. However, many common applications of machine learning address scenarios that are more complex than what is modeled by the currently available mathematical theory. Consider, for example, medical research aimed to identify physiological markers that predict future development of dementia. Say the research took place in Denmark. Can one readily apply its conclusions to Canadian patients? Common learning methods for classification perform well when training and test data are drawn from the same population. However, as the above example demonstrates, in many application this is not the case. Under which conditions, and how, can we adapt a classifier trained on some source domain to apply to a different target domain? To cope with such scenarios, learning practitioners have developed heuristics that, while apparently working reasonably well, are not supported by existing mathematical analysis. Can the success of theoretical analysis of machine learning be extended to such scenarios? The proposed research aims to provide mathematical support for such emerging machine learning and data mining heuristic paradigms that, while being widely applied, lack rigorous theoretical underpinnings. In a series of recent papers, with several students of mine, we have made pioneering steps in that direction. Some examples of such work include: papers on popular model-selection heuristics for clustering (one of which awarded COLT Best Student Paper); a NIPS'06 paper on domain adaptation; a COLT08 paper on semi-supervised learning, and a NIPS'08 paper on the foundations of clustering. These papers, as well as related workshops that I have organized, are the start of an ambitious project that I will pursue with this grant.