Variable Binding for Sparse Distributed Representations: Theory and Applications · HackerPapers discussionshttps://hackerpaper.kaipfister.de/p/2009.06734/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMTVariable Binding for Sparse Distributed Representations: Theory and Applications — mentioned by sayonaramanhttps://news.ycombinator.com/item?id=28632524urn:hackerpapers:mention:2009.06734:28632524Thu, 23 Sep 2021 17:45:11 GMT<p>you might also be interested in the recent work on &quot;resonator networks&quot; VSA architecture [1-4] by Olshausen lab at Berkeley (P. Kanerva who created the influential SDM model [5] is one of the lab members). It&#x27;s a continuation of Plate [6] and Kanerva work in the 90s and Olshausen&#x27; groundbreaking work on sparse coding [7] which inspired the popular autoencoders [8]. I find it especially promising they found this superposition based approach to be competitive with optimization so prevalent in modern neural nets. May be backprop will die one day and be replaced with something more energy…</p><p><a href="https://hackerpaper.kaipfister.de/p/2009.06734/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.NE