Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Discovery Grants Program - Individual

University of Manitoba

$42,000.00

Large-Scale Machine Learning: Sparse Representations for Signal/Image Processing and System Modeling

FY 2016-17

Summary
Rapid advances in computer based technologies such as energy grid networks, web services, bioinformatics, and sensor networks, create a great demand for new pattern recognition/machine learning algorithms able to cope with massive data sets, multiple hypothesis, and data of high dimensionality. This defines the field referred to as large-scale machine learning. In this proposal, I wish to extend my current research on nonparametric/semiparametric learning methods to large-scale machine learning problems. This challenge includes not only the development of new mathematical techniques, but also to verify them in the framework of signal/image processing and system modeling tasks. Testing of the proposed methods in concrete applications within the areas of power engineering, microscopic imaging and multiple change-point detection for biological and network signals is also planned. Our research proposal relies on the idea of blending the modern nonparametric/semiparametric learning methodology with the concept of sparse representations of a given process. The sparsity is roughly defined as a solution to the examined problem based on the representation using a small number of dominating terms. The key is to discover a sparse (low-dimensional) representation and its form in a given setting. Thus far, sparse learning algorithms have mostly focused on parametric (finite dimensional) linear models, where an observed data point is expressed as a linear combination of a small number of vectors of the representation matrix (dictionary). In this proposal we aim at developing a class of nonparametric and semiparametric learning algorithms that utilize the inherent sparsity of a given object. Hence, we wish to go beyond the thus far used linear and finite dimensional sparsity models and apply these findings to problems stemming from multidimensional systems, computational symmetry and multiple change-point detection problems. We believe that the proposed sparse object representation methodology can substantially enlarge a scope of machine learning applications and improve the existing algorithms within the context of proposed case studies.
Program
Discovery Grants Program - Individual
Location
Manitoba, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data

As published

Application id
8131-2012
Name nom
Pawlak, Mirek
Department département
Electrical and Computer Engineering
Organization id
19
Institution établissement
University of Manitoba
Province en
Manitoba
Province fr
Manitoba
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2016
Competition year année de concours
2012
Award amount
42000
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
1200
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Advancement of knowledge
Area of application fr
Avancement des connaissances
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
5
Nb partie
5
Application title
Large-Scale Machine Learning: Sparse Representations for Signal/Image Processing and System Modeling
Keyword
NSERC
Application summary
Rapid advances in computer based technologies such as energy grid networks, web services, bioinformatics, and sensor networks, create a great demand for new pattern recognition/machine learning algorithms able to cope with massive data sets, multiple hypothesis, and data of high dimensionality. This defines the field referred to as large-scale machine learning. In this proposal, I wish to extend my current research on nonparametric/semiparametric learning methods to large-scale machine learning problems. This challenge includes not only the development of new mathematical techniques, but also to verify them in the framework of signal/image processing and system modeling tasks. Testing of the proposed methods in concrete applications within the areas of power engineering, microscopic imaging and multiple change-point detection for biological and network signals is also planned. Our research proposal relies on the idea of blending the modern nonparametric/semiparametric learning methodology with the concept of sparse representations of a given process. The sparsity is roughly defined as a solution to the examined problem based on the representation using a small number of dominating terms. The key is to discover a sparse (low-dimensional) representation and its form in a given setting. Thus far, sparse learning algorithms have mostly focused on parametric (finite dimensional) linear models, where an observed data point is expressed as a linear combination of a small number of vectors of the representation matrix (dictionary). In this proposal we aim at developing a class of nonparametric and semiparametric learning algorithms that utilize the inherent sparsity of a given object. Hence, we wish to go beyond the thus far used linear and finite dimensional sparsity models and apply these findings to problems stemming from multidimensional systems, computational symmetry and multiple change-point detection problems. We believe that the proposed sparse object representation methodology can substantially enlarge a scope of machine learning applications and improve the existing algorithms within the context of proposed case studies.