Connectionists: Stephen Hanson in conversation with Geoff Hinton

[Barak A. Pearlmutter]

On Mon, 18 Jul 2022 at 14:43, Danko Nikolic <danko.nikolic at gmail.com> wrote:
>
> [image: image.png]
>
> It is a hard problem to learn for a connectionist network.
>

We don't need to invent new terminology, like "inverters problem" or
"generalized xor." This is parity. Four (4) bit parity.

https://en.wikipedia.org/wiki/Parity_function

Parity is *not* a hard function to learn. Even for a connectionist network.

It is an interesting function for historic reasons (n-bit parity cannot be
loaded by a k-th order perceptron, for k<n, although there are loopholes if
a random bits are available or if you are allowed to only almost load it)
and because it's an interesting function for many mathematical
constructions. See the above wikipedia page for some details. But it is not
super difficult to learn.

--Barak Pearlmutter.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mailman.srv.cs.cmu.edu/pipermail/connectionists/attachments/20220718/5029232f/attachment.html>
-------------- next part --------------
A non-text attachment was scrubbed...
Name: image.png
Type: image/png
Size: 71360 bytes
Desc: not available
URL: <http://mailman.srv.cs.cmu.edu/pipermail/connectionists/attachments/20220718/5029232f/attachment.png>