Discovery Early Career Researcher Award - Grant ID: DE200100063
Funder
Australian Research Council
Funding Amount
$394,398.00
Summary
Nonmonotone Algorithms in Operator Splitting, Optimisation and Data Science. This project aims to develop the mathematical foundations for the analysis and development of optimisation algorithms used in data science. Despite their now ubiquitous use, machine learning software packages routinely rely on a number of algorithms from mathematical optimisation which are not properly understood. By moving beyond the traditional realms of Fejér monotone algorithms, this project expects to develop the m ....Nonmonotone Algorithms in Operator Splitting, Optimisation and Data Science. This project aims to develop the mathematical foundations for the analysis and development of optimisation algorithms used in data science. Despite their now ubiquitous use, machine learning software packages routinely rely on a number of algorithms from mathematical optimisation which are not properly understood. By moving beyond the traditional realms of Fejér monotone algorithms, this project expects to develop the mathematical theory required to rigorously justify the use of such algorithms and thereby ensure the integrity of the decision tools they produce. This mathematical framework is also expected to produce new algorithms for optimisation which benefit consumers of data science such as the health-care and cybersecurity sectors.Read moreRead less
Novel decomposition methods for large scale optimisation. This project will develop more effective problem decomposition methods that are critical for handling large scale problems (problems with up to several thousands of variables). The project will benefit practitioners from many different fields, and will put Australia at the very forefront of international research for large scale optimization.
Beyond black-box models: interaction in eXplainable Artificial Intelligence. This project addresses a key issue in automated decision making: explaining how a decision was reached by a computer system to its users. Its aim is to progress towards a new generation of explainable decision models, which would match the performance of current black-box systems while at the same time allow for transparency and detailed interpretation of the underlying logic. This project expects to generate new knowl ....Beyond black-box models: interaction in eXplainable Artificial Intelligence. This project addresses a key issue in automated decision making: explaining how a decision was reached by a computer system to its users. Its aim is to progress towards a new generation of explainable decision models, which would match the performance of current black-box systems while at the same time allow for transparency and detailed interpretation of the underlying logic. This project expects to generate new knowledge in modelling interdependencies of decision criteria using recent advances in the theory of capacities. The expected outcomes are sophisticated but tractable models in which mutual dependencies of decision rules and criteria are treated explicitly and can be thoroughly evaluated. Read moreRead less
Fast, practical and effective algorithms for clustering with advice. To maintain a safe and healthy society, government and industry need high quality immunization and national security databases. Since we cannot afford to have duplicate, incomplete and conflicting records that refer to the same person, we unify them by identifying clusters of related records.
In the emerging field of functional genomics, diagnosis of certain diseases is enhanced by determining which genes act together. Diffe ....Fast, practical and effective algorithms for clustering with advice. To maintain a safe and healthy society, government and industry need high quality immunization and national security databases. Since we cannot afford to have duplicate, incomplete and conflicting records that refer to the same person, we unify them by identifying clusters of related records.
In the emerging field of functional genomics, diagnosis of certain diseases is enhanced by determining which genes act together. Different experimental runs might result in different clusterings of genes: we need one consensus clustering that summarizes the experimental outcomes.
Cleaning databases and combining clusterings by hand would require vast amounts of time. This project will result in faster and more accurate computational procedures.Read moreRead less
Realising the promise of neural networks for practical optimisation: improving their efficiency and effectivess through chaotic dynamics and hardware implementation. Combinatorial optimisation problems such as transportation routing and assembly-line scheduling are critical to the efficiency of many industries, but their combinatorial explosion makes rapid solution difficult. Neural networks (NNs) hold much potential for rapid solution though hardware implementation, but we need to improve the q ....Realising the promise of neural networks for practical optimisation: improving their efficiency and effectivess through chaotic dynamics and hardware implementation. Combinatorial optimisation problems such as transportation routing and assembly-line scheduling are critical to the efficiency of many industries, but their combinatorial explosion makes rapid solution difficult. Neural networks (NNs) hold much potential for rapid solution though hardware implementation, but we need to improve the quality of their solutions before developing hardware. We have previously shown that the rich dynamics of chaos can improve the efficiency and effectiveness of NNs. We aim to develop new chaotic NN models, rigorously evaluate them on industrially significant problems such as those arising in manufacturing, logistics and telecommunications, and demonstrate their speed through hardware acceleration.Read moreRead less
Decomposition and Duality: New Approaches to Integer and Stochastic Integer Programming. Because of their rich modelling capabilities, integer programs are widely used in industry for decision making and planning. However their solution algorithms do not have the maturity of their cousins in convex optimisation, where the theory of strong duality is ubiquitous. Efficient methods for convex optimisation under uncertainty do not apply to the integer case, which is highly non-convex. Furthermore, i ....Decomposition and Duality: New Approaches to Integer and Stochastic Integer Programming. Because of their rich modelling capabilities, integer programs are widely used in industry for decision making and planning. However their solution algorithms do not have the maturity of their cousins in convex optimisation, where the theory of strong duality is ubiquitous. Efficient methods for convex optimisation under uncertainty do not apply to the integer case, which is highly non-convex. Furthermore, integer models usually assume the data is known with certainty, which is often not the case in the real world. This project will develop new theory and algorithms to enhance the analysis of integer models, including those that incorporating uncertainty, while also enabling the use of parallel computing paradigms. Read moreRead less