Discovery Early Career Researcher Award - Grant ID: DE200100200
Funder
Australian Research Council
Funding Amount
$418,398.00
Summary
Next generation causal inference methods for biological data. This project aims to develop next generation causal inference methods for analysing biological data especially the single cell sequencing data and their applications in cell biology. Although Artificial Intelligence and Statistical Machine Learning have been applied successfully in many fields, including biological research, there is still a serious lack of methods for interpreting and reasoning about the mechanism of biological syste ....Next generation causal inference methods for biological data. This project aims to develop next generation causal inference methods for analysing biological data especially the single cell sequencing data and their applications in cell biology. Although Artificial Intelligence and Statistical Machine Learning have been applied successfully in many fields, including biological research, there is still a serious lack of methods for interpreting and reasoning about the mechanism of biological systems, the ultimate goal of research in many areas. Efficient data-driven causality discovery approaches developed by the project will be a timely and significant contribution to the knowledge of biology and statistics as well as the battle against health threats.
Read moreRead less
Perturbations in Complex Systems and Games. This project aims to: advance the perturbation theory of dynamic and stochastic games; further develop approximations of infinite dimensional linear programs by their finite dimensional counterparts, and by finding asymptotic limits of spaces of occupational measures, by solution of successive layers of fundamental equations; explain and quantify the "exceptionality" of instances of systems that are genuinely difficult to solve; and, capitalise on the ....Perturbations in Complex Systems and Games. This project aims to: advance the perturbation theory of dynamic and stochastic games; further develop approximations of infinite dimensional linear programs by their finite dimensional counterparts, and by finding asymptotic limits of spaces of occupational measures, by solution of successive layers of fundamental equations; explain and quantify the "exceptionality" of instances of systems that are genuinely difficult to solve; and, capitalise on the outstanding performance of our Snakes-and-Ladders Heuristic (SLH) for the solution of the Hamiltonian cycle problem to identify its "fixed complexity orbits" and generalise this notion to other NP-complete problems.Read moreRead less