Katakanlah kita memiliki jaringan saraf maju umpan tunggal dengan input k dan satu output. Ini menghitung fungsi dari , cukup mudah untuk melihat bahwa ini memiliki setidaknya kekuatan komputasi yang sama dengan A C 0 . Hanya untuk bersenang-senang, kita akan memanggil sekumpulan fungsi yang dapat dihitung oleh jaringan saraf lapis tunggal " N e u r a l ".
? Juga apakah kelas kompleksitas semacam ini telah dipelajari sebelumnya?
Jawaban:
There are some references I could find: General-purpose computation with neural networks: A survey of complexity theoretic results, 2003 and Counting hierarchies: polynomial time and constant depth circuits, 1993.
It appears that neural networks are considered threshold circuits; i.e. those circuits using MAJORITY gates. In (2) it is the case that a depthd neural network has complexity TC0d (here's a link to link to complexity zoo entry about TC0 ).
SinceTC0 containts ACC0 , which is AC0 with arbitrary MOD gates, then AC0⊂TC0 . Also, it is mentioned in the zoo that such circuits with depth 3 are strictly more powerful than those of depth 2.
In On the computational power of sigmoid versus Boolean threshold circuits,1991 it is mentioned that for a constant depthd , Boolean and real-valued threshold circuits (with polynomially bounded weights) are essentially the same.
sumber