1️⃣A similarity func between stored patterns & noisy input
2️⃣A rapidly growing separation func (e.g., exponential)
Together, they reveal kernels (e.g., RBF) that can be approximated via the kernel trick & random features (Rahimi&Recht, 2007)
1️⃣A similarity func between stored patterns & noisy input
2️⃣A rapidly growing separation func (e.g., exponential)
Together, they reveal kernels (e.g., RBF) that can be approximated via the kernel trick & random features (Rahimi&Recht, 2007)
DenseAMs need new weights for each stored pattern–hurting scalability. Kernel methods let us add memories without adding weights!
Distributed memory for DenseAMs, unlocked🔓
DenseAMs need new weights for each stored pattern–hurting scalability. Kernel methods let us add memories without adding weights!
Distributed memory for DenseAMs, unlocked🔓