Feature Repulsion and Spectral Lock-in: An Empirical Study of Two-Layer Network Grokking
arXiv:2605.08119v1 Announce Type: new Abstract: Tian (2025) proves a repulsion theorem (Theorem 6) for the matrix $ B = (widetilde{F}^top widetilde{F} + eta I)^{-1} $ during the interactive feature-learning stage of grokking: similar features have negative off-diagonal entries $ B_{jell}…
