Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Discovery Grants Program - Individual

University of Toronto

$90,000.00

Statistical Computation and Information Retrieval from Multivariate Data

FY 2022-23

Summary
A Google search with the terms "Markov chain Monte Carlo (MCMC)" returns over 2 million hits. This is not surprising, as this class of algorithms has become in the last 30 years the main workhorse for statistical computation, especially for Bayesian inference. However, the evolution of scientific experiments, particularly the availability of large data and the complexity of posited models have brought MCMC to an inflection point. Significant difficulties are encountered when the data is massive or when the statistical model is complex enough to be analytically intractable. In the former case, the classical MCMC samplers scale poorly while in the latter only approximate versions of the model can be studied with little, or no theoretical guarantees of accuracy. Part of this research proposal is concerned with closing the larger theoretical gaps and developing computational algorithms that can overcome this type of challenges. It is expected that significant progress in computation will have a marked impact on a number of scientific fields struggling with large volumes of data and complex models. The grant holder has worked in computational statistics for the last 20 years and brings considerable expertise to this area of statistics. Another focus of the proposal concerns the use of statistical models for extracting information from multivariate data. One project will pursue automatic and data-driven strategies for unsupervised clustering via probabilistic methods for determining principal components of variation. The resulting methodology has many potential applications, but special attention will be given to genetics studies built around the applicant's acquired research experience in this area. A second project involves estimation of a joint distribution from incomplete data. Copulas-based structures will be the modelling vehicle while the targeted areas of applications include longitudinal studies and sample surveys. The resulting methodology is expected to provide practitioners with robust alternatives to existing methods. Dissemination and application will be enhanced by the development of freely available companion software packages.
Program
Discovery Grants Program - Individual
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data

As published

Application id
RGPIN-2018-05663
Name nom
Craiu, Virgil Radu
Department département
Statistical Sciences (St. George Campus) - Statistical Sciences (St. George Campus)
Organization id
31
Institution établissement
University of Toronto
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2022
Competition year année de concours
2018
Award amount
90000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
DISCOVERY RESEARCH
Group fr
RECHERCHE AXÉE SUR LA DÉCOUVERTE
Committee code
1508
Committee name en
Mathematics and Statistics
Committee name fr
Mathématiques et statistique
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
3000
Research subject group en
Statistics and probability
Research subject group fr
Statistique et probabilité
Research subject en
Statistics and probability
Research subject fr
Statistique et probabilité
Installment
inst:5;6
Partie
2
Nb partie
6
Application title
Statistical Computation and Information Retrieval from Multivariate Data
Application summary
A Google search with the terms "Markov chain Monte Carlo (MCMC)" returns over 2 million hits. This is not surprising, as this class of algorithms has become in the last 30 years the main workhorse for statistical computation, especially for Bayesian inference. However, the evolution of scientific experiments, particularly the availability of large data and the complexity of posited models have brought MCMC to an inflection point. Significant difficulties are encountered when the data is massive or when the statistical model is complex enough to be analytically intractable. In the former case, the classical MCMC samplers scale poorly while in the latter only approximate versions of the model can be studied with little, or no theoretical guarantees of accuracy. Part of this research proposal is concerned with closing the larger theoretical gaps and developing computational algorithms that can overcome this type of challenges. It is expected that significant progress in computation will have a marked impact on a number of scientific fields struggling with large volumes of data and complex models. The grant holder has worked in computational statistics for the last 20 years and brings considerable expertise to this area of statistics. Another focus of the proposal concerns the use of statistical models for extracting information from multivariate data. One project will pursue automatic and data-driven strategies for unsupervised clustering via probabilistic methods for determining principal components of variation. The resulting methodology has many potential applications, but special attention will be given to genetics studies built around the applicant's acquired research experience in this area. A second project involves estimation of a joint distribution from incomplete data. Copulas-based structures will be the modelling vehicle while the targeted areas of applications include longitudinal studies and sample surveys. The resulting methodology is expected to provide practitioners with robust alternatives to existing methods. Dissemination and application will be enhanced by the development of freely available companion software packages.