Abstract
dc:description.abstractAs our world has become increasingly advanced so too has the pervasiveness of technology throughout it. This has led to a desire to have these technological capabilities embedded in the devices we interact with on a daily basis, this spans from entire industrial sectors down to individual consumer devices. Artificial intelligence, in particular machine learning, is one of these advancements which is progressing at an unprecedented rate. However, it is also becoming incredibly resource intensive to operate. Progressive intelligence is a solution to this issue, which approaches the machine learning inference process incrementally, first making low-cost--low-confidence predictions and improving on these incrementally according to application requirements.<br/><br/>This work explores progressive intelligence, and discusses where it fits in the machine learning field. Machine learning approaches can be split into data-based and model-based approaches, it is shown progressive intelligence can be implemented in both. In the data-based paradigm an upper bound on error as the number of samples increases is derived. In the model-based paradigm branched neural networks are selected as a good system on which to implement progressive intelligence ideas. A comprehensive study of progressive intelligence in branched neural networks is undertaken, from their training to their inference processes. Following this, the novel concept of an early-exit reject is introduced, where three scenarios are studied in which samples can be rejected at inference time to save on computational resources.
Degree
thesis:*- Name dc:type.qualificationname
- Ph.D.
- Level dc:type.qualificationlevel
- doctoral
- Grantor dc:publisher.institution
- University of Southampton
- Year dc:date.issued
- 2024
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Dymond, Jack
- Advisors dc:contributor.advisor
-
- Gunn, Steve
- Stein, Sebastian
- ORCID person:identifier.orcid
Rights
- Language dc:language
- English, eng