A Formal Proof of the Expressiveness of Deep Learning

Abstract : Deep learning has had a profound impact on computer science in recent years, with applications to image recognition, language processing, bioinformatics, and more. Recently , Cohen et al. provided theoretical evidence for the superiority of deep learning over shallow learning. We formalized their mathematical proof using Isabelle/HOL. The Isabelle development simplifies and generalizes the original proof, while working around the limitations of the HOL type system. To support the formalization, we developed reusable libraries of formalized mathematics, including results about the matrix rank, the Borel measure, and multivariate polynomials as well as a library for tensor analysis.
Document type :
Journal articles
Complete list of metadatas

Cited literature [43 references]  Display  Hide  Download

https://hal.inria.fr/hal-02296014
Contributor : Jasmin Blanchette <>
Submitted on : Tuesday, September 24, 2019 - 4:54:10 PM
Last modification on : Wednesday, September 25, 2019 - 1:19:18 AM

File

paper.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Alexander Bentkamp, Jasmin Blanchette, Dietrich Klakow. A Formal Proof of the Expressiveness of Deep Learning. Journal of Automated Reasoning, Springer Verlag, 2019, 63 (2), pp.347-368. ⟨10.1007/s10817-018-9481-5⟩. ⟨hal-02296014⟩

Share

Metrics

Record views

26

Files downloads

171