Goto

Collaborating Authors

 modular polynomial


Grokking Modular Polynomials

Doshi, Darshil, He, Tianyu, Das, Aritra, Gromov, Andrey

arXiv.org Machine Learning

Neural networks readily learn a subset of the modular arithmetic tasks, while failing to generalize on the rest. This limitation remains unmoved by the choice of architecture and training strategies. On the other hand, an analytical solution for the weights of Multi-layer Perceptron (MLP) networks that generalize on the modular addition task is known in the literature. In this work, we (i) extend the class of analytical solutions to include modular multiplication as well as modular addition with many terms. Additionally, we show that real networks trained on these datasets learn similar solutions upon generalization (grokking).