Very concise summary of the procedure described in this paper:
1. Run the model once across a dataset to estimate loss curvature per MLP weight matrix via K-FAC (activation/gradient covariances).
2. Decompose each weight matrix into curvature-ordered components; low-curvature directions correspond most to verbatim memorization, higher curvature to shared/general mechanisms.
3. Edit by dropping the low-curvature subspace and keep only the top directions.
> Our work enhances the understanding of memorization in neural networks with practical applications towards removing it
Cool stuff. In a recent podcast Karpathy was also talking about this. He sees this as the next "target": models that don't memorise, because you can look it up in an oracle, but still keep the "reasoning" qualities.
5 comments
[ 4.3 ms ] story [ 24.0 ms ] thread1. Run the model once across a dataset to estimate loss curvature per MLP weight matrix via K-FAC (activation/gradient covariances).
2. Decompose each weight matrix into curvature-ordered components; low-curvature directions correspond most to verbatim memorization, higher curvature to shared/general mechanisms.
3. Edit by dropping the low-curvature subspace and keep only the top directions.
https://youtu.be/UyK3DgWY7yw?si=NN3f9Erik8o_Nfbs
Cool stuff. In a recent podcast Karpathy was also talking about this. He sees this as the next "target": models that don't memorise, because you can look it up in an oracle, but still keep the "reasoning" qualities.
From Spikes to Heavy Tails: Unveiling the Spectral Evolution of Neural Networks (https://openreview.net/pdf?id=DJHB8eBUnt)