No Cover Image

Conference Paper/Proceeding/Abstract 204 views

A Computability Perspective on (Verified) Machine Learning

Jay Morgan Orcid Logo, Tonicha Crook, Jay Morgan Orcid Logo, Arno Pauly Orcid Logo, Markus Roggenbach Orcid Logo

Recent Trends in Algebraic Development Techniques, Volume: 13710, Pages: 63 - 80

Swansea University Authors: Jay Morgan Orcid Logo, Tonicha Crook, Arno Pauly Orcid Logo, Markus Roggenbach Orcid Logo

  • Accepted Manuscript under embargo until: 22nd October 2024

Abstract

In Computer Science there is a strong consensus that it is highly desirable to combine the versatility of Machine Learning (ML) with the assurances formal verification can provide. However, it is unclearwhat such ‘verified ML’ should look like.This paper is the first to formalise the concepts of cla...

Full description

Published in: Recent Trends in Algebraic Development Techniques
ISBN: 9783031433443 9783031433450
ISSN: 0302-9743 1611-3349
Published: Cham Springer Nature Switzerland 2023
Online Access: Check full text

URI: https://cronfa.swan.ac.uk/Record/cronfa63849
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract: In Computer Science there is a strong consensus that it is highly desirable to combine the versatility of Machine Learning (ML) with the assurances formal verification can provide. However, it is unclearwhat such ‘verified ML’ should look like.This paper is the first to formalise the concepts of classifiers and learners in ML in terms of computable analysis. It provides results about which properties of classifiers and learners are computable. By doing this we establish a bridge between the continuous mathematics underpinning ML and the discrete setting of most of computer science.We define the computational tasks underlying the newly suggested verified ML in a model-agnostic way, i.e., they work for all machine learning approaches including, e.g., random forests, support vector machines, and Neural Networks. We show that they are in principle computable.
Keywords: Machine Learning, adversarial examples, formal verification, computable analysis
College: Faculty of Science and Engineering
Start Page: 63
End Page: 80