Il Dipartimento di Ingegneria, Università degli Studi di Perugia organizza il seminario dal titolo Training Fully Connected Neural Networks is ∃R-Complete. Il seminario è tenuto da Paul Jungeblut, Karlsruhe Institute of Technology (KIT).

Abstract del seminario: we consider the algorithmic complexity of training fully connected neural networks. In particular, we see that this problem is ER-complete. This means that it is (up to polynomial transformations) equally difficult as finding the solutions of a system of polynomial equations and inequalities in several unknowns.
In the talk I will introduce the neural network training problem and give some background on ER-completeness. Then we combine both to get an idea how ER-completeness is proven.
The talk is based on our recent paper available at

Il seminario è tenuto all'interno del corso di dottorato in Ingegneria industriale e dell'informazione.

News by prof. Fabrizio Montecchiani, Dipartimento di Ingegneria, Università degli Studi di Perugia.

Share This

S5 Box

Cini Single Sign ON

This site only stores technical/functional cookies. If you want to know more, go to the Cookie Policy section.