Simulating viral evolution and genetic complexity. This project has direct relevance to understanding the growth of viral infections, and therefore has possible practical applications in disease research and control. Examples of these are emerging diseases in humans such as those caused by HIV-1, SARS coronavirus and Dengue virus, which cause considerable human suffering throughout the world. A major part of current research into these diseases involves attempts to model the evolutionary geneti ....Simulating viral evolution and genetic complexity. This project has direct relevance to understanding the growth of viral infections, and therefore has possible practical applications in disease research and control. Examples of these are emerging diseases in humans such as those caused by HIV-1, SARS coronavirus and Dengue virus, which cause considerable human suffering throughout the world. A major part of current research into these diseases involves attempts to model the evolutionary genetics and dynamics of virus populations in order to understand how to control epidemics, develop vaccines and design drugs. The research program is designed to provide new computational modelling tools for this purpose, which may have wider applications as well.
Read moreRead less
Stochastic majorization--minimization algorithms for data science. The changing nature of acquisition and storage data has made the process of drawing inference infeasible with traditional statistical and machine learning methods. Modern data are often acquired in real time, in an incremental nature, and are often available in too large a volume to process on conventional machinery. The project proposes to study the family of stochastic majorisation-minimisation algorithms for computation of inf ....Stochastic majorization--minimization algorithms for data science. The changing nature of acquisition and storage data has made the process of drawing inference infeasible with traditional statistical and machine learning methods. Modern data are often acquired in real time, in an incremental nature, and are often available in too large a volume to process on conventional machinery. The project proposes to study the family of stochastic majorisation-minimisation algorithms for computation of inferential quantities in an incremental manner. The proposed stochastic algorithms encompass and extend upon a wide variety of current algorithmic frameworks for fitting statistical and machine learning models, and can be used to produce feasible and practical algorithms for complex models, both current and future.
Read moreRead less
Discovery Early Career Researcher Award - Grant ID: DE170101134
Funder
Australian Research Council
Funding Amount
$360,000.00
Summary
Feasible algorithms for big inference. This project aims to develop algorithms for computationally-intensive statistical tools to analyse Big Data. Big Data is ubiquitous in science, engineering, industry and finance, but needs special machine learning to conduct correct inferential analysis. Computational bottlenecks make many tried-and-true tools of statistical inference inadequate. This project will develop tools including false discovery rate control, heteroscedastic and robust regression an ....Feasible algorithms for big inference. This project aims to develop algorithms for computationally-intensive statistical tools to analyse Big Data. Big Data is ubiquitous in science, engineering, industry and finance, but needs special machine learning to conduct correct inferential analysis. Computational bottlenecks make many tried-and-true tools of statistical inference inadequate. This project will develop tools including false discovery rate control, heteroscedastic and robust regression and mixture models, via Big Data-appropriate optimisation and composite-likelihood estimation. It will make open, well-documented, and accessible software available for the scalable and distributable analysis of Big Data. The expected outcome is a suite of scalable algorithms to analyse Big Data.Read moreRead less