Inverse problems are solvable on real number signal processing hardware

Despite the success of Deep Learning (DL) serious reliability issues such as non-robustness persist. An interesting aspect is, whether these problems arise due to insufficient tools or fundamental limitations of DL. We study this question from the computability perspective by characterizing the limi...

Full description

Saved in:
Bibliographic Details
Published inApplied and computational harmonic analysis Vol. 74; p. 101719
Main Authors Boche, Holger, Fono, Adalbert, Kutyniok, Gitta
Format Journal Article
LanguageEnglish
Published Elsevier Inc 01.01.2025
Subjects
Online AccessGet full text
ISSN1063-5203
DOI10.1016/j.acha.2024.101719

Cover

Loading…
More Information
Summary:Despite the success of Deep Learning (DL) serious reliability issues such as non-robustness persist. An interesting aspect is, whether these problems arise due to insufficient tools or fundamental limitations of DL. We study this question from the computability perspective by characterizing the limits the applied hardware imposes. For this, we focus on the class of inverse problems, which, in particular, encompasses any task to reconstruct data from measurements. On digital hardware, a conceptual barrier on the capabilities of DL for solving finite-dimensional inverse problems has in fact already been derived. This paper investigates the general computation framework of Blum-Shub-Smale (BSS) machines, describing the processing and storage of arbitrary real values. Although a corresponding real-world computing device does not exist, research and development towards real number computing hardware, usually referred to by “neuromorphic computing”, has increased in recent years. In this work, we show that the framework of BSS machines does enable the algorithmic solvability of finite dimensional inverse problems. Our results emphasize the influence of the considered computing model in questions of accuracy and reliability.
ISSN:1063-5203
DOI:10.1016/j.acha.2024.101719