arxiv
PublishedMay 13, 2026 at 4:00 AM
Feature Repulsion and Spectral Lock-in: An Empirical Study of Two-Layer Network Grokking
Publisher summary· verbatim
arXiv:2605.08119v1 Announce Type: cross 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_{j\ell} $, p
Stay posted· Newsletter
A 5-min weekly brief — top movers, price watch, story of the week.
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivThe Steering Budget: Examples beat Knobs15harxivPolestar: Drift-Aware Cache Calibration and Token Commitment for Efficient Inference of Diffusion LLMs15harxivRxBrain: Embodied Cognition Foundation Model with Joint Language-Visual Reasoning and Imagination15harxivWhen a Verified World Model Still Loses: Play-Adequacy vs Prediction-Accuracy in LLM-Synthesized Code World Models15hThe Bubble Brief
WEEKLYRead AI insights every Tuesday — top movers, new releases, story of the week.
Originally published on arxiv ↗