ICML 2021 | Modern Hopfield Networks - Dr Sepp Hochreiter

[@afbf6522]

Super interesting content, thanks for uploading. Are they slides available somewhere?

[@ruffianeo3418]

If tic-tac-toe has around 4500 positions, along with a value for each position (d = 10), does this mean we can store all (positions, value) pairs in 100 (d^2) floats (i.e. 400 bytes) and retrieve them with exponential hopfield network? (exp 10) => 22026.465 ... as for chess, with some funny usage of equivalence classes, store the values of all legal positions? (exp 66) 4.6071865e28 in (expt 66 2) => 4356 floats (i.e. 17424 bytes)? If that is true, chess is as good as solved.