Distributed Optimisation without Central Coordination. This project will develop the mathematical foundations for discovery and analysis of iterative methods for optimisation problems in distributed computing systems. Most methods in distributed optimisation were not designed for distributed computing, rather they were adapted for purpose post-hoc. By building on recent advances in monotone operator splitting, this project expects to develop a mathematical theory for decentralised optimisation a ....Distributed Optimisation without Central Coordination. This project will develop the mathematical foundations for discovery and analysis of iterative methods for optimisation problems in distributed computing systems. Most methods in distributed optimisation were not designed for distributed computing, rather they were adapted for purpose post-hoc. By building on recent advances in monotone operator splitting, this project expects to develop a mathematical theory for decentralised optimisation algorithms specially designed for distributed systems. The framework is expected to produce a suite of algorithms, each customised to exploit a specific network configuration. The project will provide significant benefits in distributed machine learning applications such as federated learning.Read moreRead less
Discovery Early Career Researcher Award - Grant ID: DE210101056
Funder
Australian Research Council
Funding Amount
$395,775.00
Summary
Realising the potential of hyperbolic programming. This project aims to develop and analyse new mathematical and algorithmic methods for polynomial optimisation and decision problems. In doing so it expects to generate knowledge and tools in mathematical optimisation that build on recent developments in the theory of hyperbolic polynomials. Expected outcomes include more scalable and/or reliable methods for polynomial optimisation and safety verification of dynamical systems, and theory explain ....Realising the potential of hyperbolic programming. This project aims to develop and analyse new mathematical and algorithmic methods for polynomial optimisation and decision problems. In doing so it expects to generate knowledge and tools in mathematical optimisation that build on recent developments in the theory of hyperbolic polynomials. Expected outcomes include more scalable and/or reliable methods for polynomial optimisation and safety verification of dynamical systems, and theory explaining the power and limitations of these methods when compared with existing approaches. Possible benefits include safer and more reliable complex engineered systems, such as the power grid or interacting autonomous vehicles, verified by methods built on those developed in the project.Read moreRead less
An optimisation-based framework for non-classical Chebyshev approximation. This project aims to solve open mathematical problems in multivariate and piecewise polynomial approximations, two directions that correspond to fundamental obstacles to extending classical approximation results. Through an innovative combination of optimisation and algebraic technique, the project intends to develop foundations for new results in approximation theory, and new insights into other areas of mathematics, mos ....An optimisation-based framework for non-classical Chebyshev approximation. This project aims to solve open mathematical problems in multivariate and piecewise polynomial approximations, two directions that correspond to fundamental obstacles to extending classical approximation results. Through an innovative combination of optimisation and algebraic technique, the project intends to develop foundations for new results in approximation theory, and new insights into other areas of mathematics, most notably optimisation. The techniques and methods developed should also have significant benefits in the many disciplines where approximation problems appear, such as engineering, physics or data mining. The research outputs resulting from this project will be used in a wide range of fields to help implement programs, policies and improve decision making.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
Large scale nonsmooth, nonconvex optimisation. This project aims to develop, analyse, test and apply (sub) gradient-based methods for solving large scale nonsmooth, nonconvex optimisation problems. Large scale problems with complex nonconvex objective and/or constraint functions are among the most difficult in optimisation. This project will generate new knowledge in numerical optimisation and machine learning. The use of structures and sparsity of large scale problems will lead to the developme ....Large scale nonsmooth, nonconvex optimisation. This project aims to develop, analyse, test and apply (sub) gradient-based methods for solving large scale nonsmooth, nonconvex optimisation problems. Large scale problems with complex nonconvex objective and/or constraint functions are among the most difficult in optimisation. This project will generate new knowledge in numerical optimisation and machine learning. The use of structures and sparsity of large scale problems will lead to the development of better models, and more accurate and robust methods. The expected outcomes of the project are ready-to-implement and apply numerical methods for solving large-scale, nonsmooth, nonconvex optimisation problems, as well as problems in machine learning and regression analysis.Read moreRead less
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
Stability of Generalised Equations and Variational Systems. This project seeks to advance a new mathematical theory of variational analysis which may lead to applications in optimisation. The emphasis will be on extensions of regularity concepts appropriate for studying stability (the ‘radius of good behaviour’) of solutions to optimisation problems, particularly those of semi-infinite optimisation and programs with equilibrium constraints, when standard assumptions are not satisfied. The expect ....Stability of Generalised Equations and Variational Systems. This project seeks to advance a new mathematical theory of variational analysis which may lead to applications in optimisation. The emphasis will be on extensions of regularity concepts appropriate for studying stability (the ‘radius of good behaviour’) of solutions to optimisation problems, particularly those of semi-infinite optimisation and programs with equilibrium constraints, when standard assumptions are not satisfied. The expected outcomes may have an impact in enhancing the convergence of numerical methods and facilitating the post-optimal analysis of solutions. It may also generate new tools for increasing efficiencies and cost reductions in engineering, logistics, economics, financial systems, and environmental science.Read moreRead less
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