Discovery Early Career Researcher Award - Grant ID: DE230101329
Funder
Australian Research Council
Funding Amount
$432,355.00
Summary
Trading Privacy, Bandwidth and Accuracy in Algorithmic Machine Learning. This project aims to investigate the trade-offs between privacy, communication costs and accuracy of results when learning from users' sensitive data. The project intends to design faster and more accurate algorithms for a wide range of machine learning tasks by developing a novel and widely-applicable algorithmic framework. Expected outcomes of this project include new theoretical tools to guide the design of data-driven d ....Trading Privacy, Bandwidth and Accuracy in Algorithmic Machine Learning. This project aims to investigate the trade-offs between privacy, communication costs and accuracy of results when learning from users' sensitive data. The project intends to design faster and more accurate algorithms for a wide range of machine learning tasks by developing a novel and widely-applicable algorithmic framework. Expected outcomes of this project include new theoretical tools to guide the design of data-driven decision systems and rigorously analyse their performance and privacy guarantees. Privacy of individuals' information in data analytics pipelines is a key societal concern. This project should lead to significant benefits by strengthening privacy in these pipelines while also improving accuracy and cost-efficiency.Read moreRead less
Algorithms for Future-Proof Networks. This project will design algorithms to construct, augment and route on geometric graphs in the presence of obstacles. Such graphs have many real-world applications, including transport networks. This project aims to give solutions with hard guarantees on the timeliness of the delivery of the people, goods, or information being transported in these networks. Expected outcomes of this project include efficient and innovative algorithms for realistic geometric ....Algorithms for Future-Proof Networks. This project will design algorithms to construct, augment and route on geometric graphs in the presence of obstacles. Such graphs have many real-world applications, including transport networks. This project aims to give solutions with hard guarantees on the timeliness of the delivery of the people, goods, or information being transported in these networks. Expected outcomes of this project include efficient and innovative algorithms for realistic geometric graphs, which both advances the knowledge in this field of computer science and make our existing networks more reliable. This should provide significant benefits in the maintenance and utilisation of the communication and transport networks we use every day.Read moreRead less