|
|
|
|
|
by PaulHoule
1519 days ago
|
|
A very simple one is "can you write a program that might never terminate?" If a neural network does a fixed amount of computation and that is that it is never going to be able to do things that require a program that may not terminate. There are numerous results of theoretical computer science that apply just as well to neural networks and other algorithms even though people seem to forget it. Another is "can an error discovered in late stage processing be fed back to an early stage and be repaired?" That's important if you are parsing a sentence like Squad helps dog bite victim.
It was funny because I saw Geoff Hinton give a talk in 2005, before he got super-famous, and he was talking about the idea that led to deep networks and he had a criticism of "blackboard" systems and other architectures that produced layered representations (say the radar of an anti-aircraft system that is going to start with raw signals, turn those into a set of 'blips', coalesce the 'blips' into tracks, interpret the tracks as aircraft, etc.)Hinton said that you should build the whole system in an integrated manner and train the whole thing working end-to-end and I thought "what a neat idea" but also "there is no way this would work for the systems I'm building because it doesn't have an answer for correcting itself. |
|