Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2403.13700 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913417022930944 |
|---|---|
| author | Affeldt, Reynald Bruni, Alessandro Komendantskaya, Ekaterina Ślusarz, Natalia Stark, Kathrin |
| author_facet | Affeldt, Reynald Bruni, Alessandro Komendantskaya, Ekaterina Ślusarz, Natalia Stark, Kathrin |
| contents | For performance and verification in machine learning, new methods have recently been proposed that optimise learning systems to satisfy formally expressed logical properties. Among these methods, differentiable logics (DLs) are used to translate propositional or first-order formulae into loss functions deployed for optimisation in machine learning. At the same time, recent attempts to give programming language support for verification of neural networks showed that DLs can be used to compile verification properties to machine-learning backends. This situation is calling for stronger guarantees about the soundness of such compilers, the soundness and compositionality of DLs, and the differentiability and performance of the resulting loss functions. In this paper, we propose an approach to formalise existing DLs using the Mathematical Components library in the Coq proof assistant. Thanks to this formalisation, we are able to give uniform semantics to otherwise disparate DLs, give formal proofs to existing informal arguments, find errors in previous work, and provide formal proofs to missing conjectured properties. This work is meant as a stepping stone for the development of programming language support for verification of machine learning. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_13700 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Taming Differentiable Logics with Coq Formalisation Affeldt, Reynald Bruni, Alessandro Komendantskaya, Ekaterina Ślusarz, Natalia Stark, Kathrin Logic in Computer Science F.3.1; I.2.6 For performance and verification in machine learning, new methods have recently been proposed that optimise learning systems to satisfy formally expressed logical properties. Among these methods, differentiable logics (DLs) are used to translate propositional or first-order formulae into loss functions deployed for optimisation in machine learning. At the same time, recent attempts to give programming language support for verification of neural networks showed that DLs can be used to compile verification properties to machine-learning backends. This situation is calling for stronger guarantees about the soundness of such compilers, the soundness and compositionality of DLs, and the differentiability and performance of the resulting loss functions. In this paper, we propose an approach to formalise existing DLs using the Mathematical Components library in the Coq proof assistant. Thanks to this formalisation, we are able to give uniform semantics to otherwise disparate DLs, give formal proofs to existing informal arguments, find errors in previous work, and provide formal proofs to missing conjectured properties. This work is meant as a stepping stone for the development of programming language support for verification of machine learning. |
| title | Taming Differentiable Logics with Coq Formalisation |
| topic | Logic in Computer Science F.3.1; I.2.6 |
| url | https://arxiv.org/abs/2403.13700 |