Learning, Approximating and Minimising Streaming Automata for Large-scale Optimisation
Lead Research Organisation:
University of East Anglia
Department Name: Computing Sciences
Abstract
The proposed research lies at the interface of the areas of verification and machine learning, interactions of which are attracting a lot of attention currently and of potential huge benefits for both sides.
Verification is this domain of computer science aiming at checking and certifying computer systems. Computer systems are increasingly used at all levels of society and peoples' lives and it is paramount to verify that they behave the way they are designed to and that we expect (examples of crucial importance, among many others, are embedded software for planes auto-pilot or self-driving cars). Unfortunately, the verification of complex systems encounters limits: there is no universal fully automated way to verify every system and one needs to find a good trade-off between the constraints of time, memory space and accuracy, which are often difficult to overcome.
Machine learning has been studied since the 50's and regained much attention recently with breakthroughs in speech recognition, image processing or game playing. The development of neural networks (studied since the 60's) awarded Hinton, LeCun, and Bengio the Turing award 2019 and using deep learning, the British firm DeepMind developed its successful AlphaGo and AlphaGo Zero which were impressive steps forward and reaffirmed the amazing potential of machine learning.
This project proposes to apply learning techniques in verification to improve the efficiency of some algorithms which certify computer systems and to compute fast accurate models for real-life systems.
Automata are one of the mathematical tools used in verification to model computer or real-life systems. Giving certifications on these systems often boils down to running some algorithms on the corresponding automata. The efficiency of such algorithms usually depends on the size of the considered automaton. Minimising automata is thus a paramount problem in verification, as a way to verify large computer or real-life systems faster.
This proposal aims at studying the minimisation of some streaming models of quantitative automata using machine learning techniques. The kind of automata we are going to focus on, are streaming models, in the sense that the input is not stored but received as a stream of data and dealt with on the fly, thus being particularly suitable for the treatment of big data. They are also suited to deal with optimisation problems such as minimising the resource consumption of a system or computing the worst-case running time of a program, for example.
Minimising these kind of automata is highly challenging and linked with the long-standing open problem of the determinisation of max-plus automata. This proposal gives several directions of research, such as using learning methods to tackle it.
Verification is this domain of computer science aiming at checking and certifying computer systems. Computer systems are increasingly used at all levels of society and peoples' lives and it is paramount to verify that they behave the way they are designed to and that we expect (examples of crucial importance, among many others, are embedded software for planes auto-pilot or self-driving cars). Unfortunately, the verification of complex systems encounters limits: there is no universal fully automated way to verify every system and one needs to find a good trade-off between the constraints of time, memory space and accuracy, which are often difficult to overcome.
Machine learning has been studied since the 50's and regained much attention recently with breakthroughs in speech recognition, image processing or game playing. The development of neural networks (studied since the 60's) awarded Hinton, LeCun, and Bengio the Turing award 2019 and using deep learning, the British firm DeepMind developed its successful AlphaGo and AlphaGo Zero which were impressive steps forward and reaffirmed the amazing potential of machine learning.
This project proposes to apply learning techniques in verification to improve the efficiency of some algorithms which certify computer systems and to compute fast accurate models for real-life systems.
Automata are one of the mathematical tools used in verification to model computer or real-life systems. Giving certifications on these systems often boils down to running some algorithms on the corresponding automata. The efficiency of such algorithms usually depends on the size of the considered automaton. Minimising automata is thus a paramount problem in verification, as a way to verify large computer or real-life systems faster.
This proposal aims at studying the minimisation of some streaming models of quantitative automata using machine learning techniques. The kind of automata we are going to focus on, are streaming models, in the sense that the input is not stored but received as a stream of data and dealt with on the fly, thus being particularly suitable for the treatment of big data. They are also suited to deal with optimisation problems such as minimising the resource consumption of a system or computing the worst-case running time of a program, for example.
Minimising these kind of automata is highly challenging and linked with the long-standing open problem of the determinisation of max-plus automata. This proposal gives several directions of research, such as using learning methods to tackle it.
Planned Impact
The proposed research is at the boundary of verification and machine learning. The study of the interactions between these two fields is attracting a lot of attention currently as they are potentially hugely beneficial for each other:
- the development of machine learning and the amazing results obtained recently in image processing, speech recognition and game-playing, give reasons to think that learning techniques can be used to speed-up verification processes in order to certify large scale complex computer or real-life systems fast. This project will have immediate impact in this direction.
- it is commonly accepted now that there is an urgent need to develop models able to verify artificial intelligence systems and make them trustworthy. By carrying out her project, the PI will gain expertise in machine learning with the aim of developing a future project in verification of artificial intelligence systems.
A first immediate impact of the project will be academic, as developed in the Academic Impact section in the Case for Support. A longer-term impact will be in applying this research in the two directions mentioned above. The proposed research will open new directions of research and long-term projects. The collaborations proposed by the PI with experts in Machine Learning who have links with industrial partners, as well as the environment she is working in at City, in particular her already established collaborations with some members of the Centre for Software Reliability, provide an avenue to explore to increase the impact of the proposed research.
The Pathways to Impact document details how the impact of the project will be enhanced via dissemination of the results, collaborations with other institutions and organisation of a workshop.
- the development of machine learning and the amazing results obtained recently in image processing, speech recognition and game-playing, give reasons to think that learning techniques can be used to speed-up verification processes in order to certify large scale complex computer or real-life systems fast. This project will have immediate impact in this direction.
- it is commonly accepted now that there is an urgent need to develop models able to verify artificial intelligence systems and make them trustworthy. By carrying out her project, the PI will gain expertise in machine learning with the aim of developing a future project in verification of artificial intelligence systems.
A first immediate impact of the project will be academic, as developed in the Academic Impact section in the Case for Support. A longer-term impact will be in applying this research in the two directions mentioned above. The proposed research will open new directions of research and long-term projects. The collaborations proposed by the PI with experts in Machine Learning who have links with industrial partners, as well as the environment she is working in at City, in particular her already established collaborations with some members of the Centre for Software Reliability, provide an avenue to explore to increase the impact of the proposed research.
The Pathways to Impact document details how the impact of the project will be enhanced via dissemination of the results, collaborations with other institutions and organisation of a workshop.
Publications
Daviaud L
(2023)
Feasability of Learning Weighted Automata on a Semiring
El-Naggar N.
(2023)
Formal and Empirical Studies of Counting Behaviour in ReLU RNNs
in Proceedings of Machine Learning Research
El-Naggar, N.
(2023)
Formal and Empirical Studies of Counting Behaviour in ReLU RNNs
in Proceedings of Machine Learning Research
Related Projects
| Project Reference | Relationship | Related To | Start | End | Award Value |
|---|---|---|---|---|---|
| EP/T018313/1 | 31/08/2020 | 30/05/2023 | £249,527 | ||
| EP/T018313/2 | Transfer | EP/T018313/1 | 31/05/2023 | 30/08/2024 | £31,889 |
| Description | One way towards ensuring that computer systems are trustworthy and reliable is as follows: - model them with mathematical representations, - check the properties that are satisfied by these mathematical representations, - understand what guarantees on the system are ensured by these properties. Key findings in this project are: 1 - the building of a general framework in extracting by learning these representations. Understanding when this works well, and when it does not and the limitations of such an approach. 2 - the developement of algorithms to analyse these representations. The methods developed there are at the border of what can be done by a computer system. 3 - the minimisation of the size of these representations in order to get more efficient procedures. 4 - the application of mathematical methods to specific AI system (recurrent neural network). |
| Exploitation Route | The extraction of mathematical representations by learning can be applied to the verification of computer systems and in particular AI systems (neural network). This will ultimately contribute to ensuring trustworthiness of computer systems, and in particular AI systems that are deemed unreliable. |
| Sectors | Digital/Communication/Information Technologies (including Software) |
| Description | The findings are of a fundamental nature and have impacted in academia the understanding of learning of computational models for verification purposes. Potential impacts outside academia will only be seen in several years time. Additionnally, the research done in this award is linked to topics used for outreach and engagement activities to raise awareness of the public on the computational powers of computers and AI and their limitations (see engagement section for details of activities.) |
| First Year Of Impact | 2024 |
| Sector | Digital/Communication/Information Technologies (including Software) |
| Impact Types | Cultural |
| Description | Studentship PhD - Awarded by City, University of London, School of Science and Technology (amount left blank below = equivalent of 3 years oversea PhD student funding) |
| Amount | £0 (GBP) |
| Organisation | City, University of London |
| Sector | Academic/University |
| Country | United Kingdom |
| Start | 02/2023 |
| End | 01/2026 |
| Description | Collaboration with David Purser on the decidability of Big-O for Max-Plus automata |
| Organisation | University of Liverpool |
| Department | Department of Computer Science |
| Country | United Kingdom |
| Sector | Academic/University |
| PI Contribution | Collaboration with David Purser (initially at the University of Warsaw, now at the University of Liverpool). We worked on the study of a mathematical model of computation (max-plus automata) and proved together the decidability of the big-O problem for this class. The result was obtained by working together on this problem, both partners contributed in the research work and the writting up of the results and proofs equally. |
| Collaborator Contribution | Collaboration with David Purser (initially at the University of Warsaw, now at the University of Liverpool). We worked on the study of a mathematical model of computation (max-plus automata) and proved together the decidability of the big-O problem for this class. The result was obtained by working together on this problem, both partners contributed in the research work and the writting up of the results and proofs equally. |
| Impact | Paper submitted, not yet published. |
| Start Year | 2020 |
| Description | Collaboration with Marianne Johnson on learning weighted automata |
| Organisation | University of Manchester |
| Department | School of Mathematics |
| Country | United Kingdom |
| Sector | Academic/University |
| PI Contribution | Collaboration with Dr Marianne Johnson (University of Liverpool). Marianne and I are working on building a framework of learning weighted automata (in general, on any semiring). Marianne did 3 research visits (one week each) funded by the University of Manchester. Some first results have arised and we are working on the writting up. Both partners contributed equally on the research and writte-up. |
| Collaborator Contribution | Collaboration with Dr Marianne Johnson (University of Liverpool). Marianne and I are working on building a framework of learning weighted automata (in general, on any semiring). Marianne did 3 research visits (one week each) funded by the University of Manchester. Some first results have arised and we are working on the writting up. Both partners contributed equally on the research and writte-up. |
| Impact | Multi-disciplinary: mathematics and computer science. |
| Start Year | 2021 |
| Description | Collaboration with Pierre-Alain Reynier on minimising cost register automata |
| Organisation | Aix-Marseille University |
| Country | France |
| Sector | Academic/University |
| PI Contribution | Collaboration with Prof. Pierre-Alain Reynier (Aix-Marseille University) on minimising cost-register automata models and finding the exact ambiguity. We are currently writting up the results we obtained. Both partners contributed equally in the research and write-up. |
| Collaborator Contribution | Collaboration with Prof. Pierre-Alain Reynier (Aix-Marseille University) on minimising cost-register automata models and finding the exact ambiguity. We are currently writting up the results we obtained. Both partners contributed equally in the research and write-up. |
| Impact | Write-up in progress. |
| Start Year | 2021 |
| Description | Norwich Science Festival |
| Form Of Engagement Activity | Participation in an activity, workshop or similar |
| Part Of Official Scheme? | No |
| Geographic Reach | Regional |
| Primary Audience | Public/other audiences |
| Results and Impact | Stand at the Norwich Science Festival both in 2024 and 2025. The Norwich Science Festival is held every year to popularize science. The stand "The funfair of impossible problems" proposed games to understand what can be done/not done by computers (decidability/undecidability), which is one of the key concept studied in this award. Interaction with several hundreds visitors, including many children and teenagers, to raise awareness and make science attractive to young public. |
| Year(s) Of Engagement Activity | 2024,2025 |
| Description | Talk Channel Talent |
| Form Of Engagement Activity | A talk or presentation |
| Part Of Official Scheme? | No |
| Geographic Reach | National |
| Primary Audience | Schools |
| Results and Impact | Interactive online talks to Year 12/13 students (in March and June 2024), organised by Channel Talent. Students could join individually or as part of a School. The talk gave a taster to the topic of "mathematics behind AI", which is linked to this award, looking at interaction between mathematics, formal methods and learning. Aim was to attract A-level student to study mathematics and computer science. Some student said they would be more likely to apply to study maths/computer science at university after the talk. |
| Year(s) Of Engagement Activity | 2024 |
| Description | Workshop on maths for AI |
| Form Of Engagement Activity | Participation in an activity, workshop or similar |
| Part Of Official Scheme? | No |
| Geographic Reach | Regional |
| Primary Audience | Schools |
| Results and Impact | Workshop on maths for AI at "The East Maths Community Outreach events" that UEA was hosting in collaboration with the Inspiration Trust. Targeted at Year 10 (ages 14-15) pupils from 4 or 5 different schools. Titled "Maths Beyond GCSE", that aims to answer the question of "What is the importance of studying Maths in Year 10 and where could it take you?" |
| Year(s) Of Engagement Activity | 2025 |
