Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Discovery Grants Program - Individual

University of British Columbia

$25,000.00

Advanced sequential Monte Carlo methods and applications

FY 2006-07

Summary
Markov chain Monte Carlo (MCMC) are iterative algorithms which have emerged as the tools of choice for the analysis of complex stochastic models. These methods enable us to relax many restrictive assumptions and to attack and solve problems which were previously deemed to be too hard. Their introduction has led to a real revolution, especially in Bayesian statistics. They are also widely used in theoretical computer science to solve counting and optimization problems. However, many problems cannot be addressed using MCMC. When massive datasets are available MCMC algorithms are generally far too cumbersome. Also when data have to be processed "on-the-fly", these iterative algorithms are inadequate. The aim of this proposal is to develop and study an alternative class of non-iterative algorithms, known as Sequential Monte Carlo (SMC), which surmount these problems. The new algorithms will be applied to complex statistical models arising in bioinformatics, genetics, time series analysis or machine learning.
Program
Discovery Grants Program - Individual
Location
British Columbia, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data

As published

Application id
327017-2006
Name nom
Doucet, Arnaud
Department département
Statistics
Organization id
2
Institution établissement
University of British Columbia
Province en
British Columbia
Province fr
Colombie-Britannique
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2006
Competition year année de concours
2006
Award amount
25000
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
14
Committee name en
Statistical Sciences
Committee name fr
Statistique
Area of application code
1205
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Mathematical sciences
Area of application fr
Sciences mathématiques
Research subject code
3004
Research subject group en
Statistics and probability
Research subject group fr
Statistique et probabilité
Research subject en
Applied statistics
Research subject fr
Statistique appliquée
Partie
1
Nb partie
5
Application title
Advanced sequential Monte Carlo methods and applications
Keyword
NA
Application summary
Markov chain Monte Carlo (MCMC) are iterative algorithms which have emerged as the tools of choice for the analysis of complex stochastic models. These methods enable us to relax many restrictive assumptions and to attack and solve problems which were previously deemed to be too hard. Their introduction has led to a real revolution, especially in Bayesian statistics. They are also widely used in theoretical computer science to solve counting and optimization problems. However, many problems cannot be addressed using MCMC. When massive datasets are available MCMC algorithms are generally far too cumbersome. Also when data have to be processed "on-the-fly", these iterative algorithms are inadequate. The aim of this proposal is to develop and study an alternative class of non-iterative algorithms, known as Sequential Monte Carlo (SMC), which surmount these problems. The new algorithms will be applied to complex statistical models arising in bioinformatics, genetics, time series analysis or machine learning.