Cross-Entropy Methods in Complex Biological Systems. The Cross-Entropy method provides a powerful new way to find superior solutions to complicated optimisation problems in biology, ranging from better design and implementation of medical treatments to an increased understanding of complex ecosystems.
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
Frontiers in inference about risk. The project aims to develop new methods for robust risk evaluation and minimisation under various constraints and scenarios. Risk evaluation, estimation and prediction using past data is a central activity in diverse areas such as finance, insurance, superannuation and environmental regulation. The project aims to propose and solve innovatively robust risk optimisation problems under constraints, taking into account the time dynamics. Applications include risk ....Frontiers in inference about risk. The project aims to develop new methods for robust risk evaluation and minimisation under various constraints and scenarios. Risk evaluation, estimation and prediction using past data is a central activity in diverse areas such as finance, insurance, superannuation and environmental regulation. The project aims to propose and solve innovatively robust risk optimisation problems under constraints, taking into account the time dynamics. Applications include risk management around natural catastrophes and long-term asset investment of pension funds. The solutions and outcomes are expected to deliver optimal resource allocation proposals and better management of risk exposure in practice.Read moreRead less
Doubly Stochastic Matrices & The Hamiltonian Cycle Problem. The classical hard problem of determining whether a given graph possesses a Hamiltonian cycle contains the essential difficulty of the famous 'Travelling Salesman Problem'. A characterisation of this difficulty in terms of variability of returns (to the initial state) in a controlled stochastic process will be a significant conceptual advance with repercussions in a number of fields including optimisation and theoretical computer scien ....Doubly Stochastic Matrices & The Hamiltonian Cycle Problem. The classical hard problem of determining whether a given graph possesses a Hamiltonian cycle contains the essential difficulty of the famous 'Travelling Salesman Problem'. A characterisation of this difficulty in terms of variability of returns (to the initial state) in a controlled stochastic process will be a significant conceptual advance with repercussions in a number of fields including optimisation and theoretical computer science. Algorithmic advances exploiting such a characterisation will significantly contribute to existing technologies for solving problems in applications ranging from logistics to cryptography. Since TSP describes certain efficient ways of routing its applicability to information networks is clear.Read moreRead less
Graph isomorphism and quantisation of longest cycles by means of determinants and spectra. A characterisation of the difficulty of the Hamiltonian cycle problem and the graphs isomorphism problem will be a significant conceptual advancement with repercussions in a number of fields including combinatorial optimisation and theoretical computer science, in particular, the Google PageRank. Applications of tensor networks technique will lead to a design of a quantum computer that enumerates all Hamil ....Graph isomorphism and quantisation of longest cycles by means of determinants and spectra. A characterisation of the difficulty of the Hamiltonian cycle problem and the graphs isomorphism problem will be a significant conceptual advancement with repercussions in a number of fields including combinatorial optimisation and theoretical computer science, in particular, the Google PageRank. Applications of tensor networks technique will lead to a design of a quantum computer that enumerates all Hamiltonian cycles in a graph. Analysis of the determinant objective function in terms of the eigenvalues may lead to new spectral properties of stochastic matrices. Algorithmic advances exploiting such a characterisation will significantly contribute to existing technologies for solving problems in a wide range of applications.Read moreRead less