6 points, SCA Band 2, 0.125 EFTSL
Undergraduate, Postgraduate - Unit
Refer to the specific census and withdrawal dates for the semester(s) in which this unit is offered.
- First semester 2019 (On-campus)
Enrolment in the Master of Mathematics
Computational statistical inference merges statistics with computational mathematics stochastic computation, computational linear algebra, and optimization to fully exploit the power of ever-increasing data sets, sophisticated mathematical models, and cutting-edge computer architectures. Driven by applied problems in finance, biology, geophysics, and data analytics, this unit aims to provide an integrated view of computational statistical inference and introduce advanced computational methods used in this emerging field.
This unit covers both practical algorithms and theoretical foundations of statistical inference, with cases studies on a selection of application problems. The main topics are parameter estimation and Bayesian inference, missing data problems and expectation maximisation, advanced Monte Carlo methods including importance sampling and Markov chain Monte Carlo, approximate Bayesian computation, linear and nonlinear filtering methods, classification, Gaussian processes, and kernel methods.
On completion of this unit students will be able to:
- Apply sophisticated computational statistical inference in a wide range of application problems that require the integration of mathematical modelling with observed data to provide credible interpretation of the underlying system.
- Explain the roles of likelihood models, missing data, and Bayesian inference and formalise parameter estimation problems in complex applications using these concepts.
- Develop and apply advanced expectation-maximization methods to missing data problems.
- Use the principle of Bayesian inference and apply expert computational methods to estimate parameters of statistical models and mathematical models.
- Implement advanced computational methods used in statistical inference, including importance sampling, filtering, and Markov chain Monte Carlo, and understand the asymptotic behaviour of these methods.
- Apply machine learning tools such as classification, Gaussian processes, and kernel methods to analyse and interpret complicate data sets and understand the computational aspects of these tools.
Examination (3 hours): 60% (Hurdle)
Continuous assessment: 40%
Hurdle requirement: To pass this unit a student must achieve at least 50% overall and at least 40% for the end-of-semester exam.
- 3 hours of lectures and 1h of tutorial per week
- 8 hours independent study per week
See also Unit timetable information
This unit applies to the following area(s) of study
Master of Mathematics