A Computability Perspective on (Verified) Machine Learning

02/12/2021
by   Tonicha Crook, et al.
0

There is a strong consensus that combining the versatility of machine learning with the assurances given by formal verification is highly desirable. It is much less clear what verified machine learning should mean exactly. We consider this question from the (unexpected?) perspective of computable analysis. This allows us to define the computational tasks underlying verified ML in a model-agnostic way, and show that they are in principle computable.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/06/2017

The Fréchet distance of surfaces is computable

We show that the Fréchet distance of two-dimensional parametrised surfac...
research
11/24/2021

On computable learning of continuous features

We introduce definitions of computable PAC learning for binary classific...
research
08/10/2022

Capturing Dependencies within Machine Learning via a Formal Process Model

The development of Machine Learning (ML) models is more than just a spec...
research
06/10/2018

ML + FV = ? A Survey on the Application of Machine Learning to Formal Verification

Formal Verification (FV) and Machine Learning (ML) can seem incompatible...
research
06/18/2023

Isabelle Formalisation of Original Representation Theorems

In a recent paper, new theorems linking apparently unrelated mathematica...
research
10/19/2015

On the Computability of AIXI

How could we solve the machine learning and the artificial intelligence ...
research
10/11/2022

Strong negation in the theory of computable functionals TCF

We incorporate strong negation in the theory of computable functionals T...

Please sign up or login with your details

Forgot password? Click here to reset