Ann_Huang (@AnnHuang42) header
Ann_Huang (@AnnHuang42) profile picture

Comp Neuro, ML, Dynamical Systems 🧠🤖PhD student @PiN_Harvard @KempnerInst | prev @mcgillu @Mila_Quebec @EPFL | 💻: https://nitter.cf/t.co/BG5c7FkJ3D

Joined November 2020
Photo by Ann_Huang (@AnnHuang42)Photo by Ann_Huang (@AnnHuang42)Photo by Ann_Huang (@AnnHuang42)Photo by Ann_Huang (@AnnHuang42)Photo by Ann_Huang (@AnnHuang42)Photo by Ann_Huang (@AnnHuang42)Photo by Ann_Huang (@AnnHuang42)Photo by Ann_Huang (@AnnHuang42)Photo by Ann_Huang (@AnnHuang42)Photo by Ann_Huang (@AnnHuang42)
How much representational diversity exists around a trained network? A lot! Moving a ViT’s weights by 1.3% while preserving its predictions, its representations end up less similar to the original than a random-init ViT’s ‼️ New paper: Hessian Null Space Continuation (HNC) 💫🧵 (1/12)
9
55
8
357
30,761
Ann_Huang retweeted
New preprint out (first from my new group!) 🚨 "Predictive Grid Cell Coding Does Not Require Explicit Planning" biorxiv.org/content/10.64898… 1/
2
8
42
1,240
🧠 In RNNs trained on a memory task, HNC drives the networks to learn drastically different representations and dynamics. The canonical trained network stores memory as fixed points. These fixed points split, multiply, or disappear during HNC, while the networks maintain 100% task accuracy (5/12)
1
1
18
796
HNC is a scalable method for traversing connected regions of weight space while preserving network function. We define a function-matching loss and use its Hessian to find flat directions, where the loss barely changes, then step along them to find alternative networks. (3/12)
1
3
22
998
In each iteration, HNC takes a flat step, then restores function matching with a few gradient steps on the function-matching loss. We can also steer HNC toward networks with desired properties, such as maximally different representations. (4/12)
1
1
15
758
Mode connectivity shows that different trained networks can be connected by low-loss regions in weight space. But do these regions contain networks with different internal computations? 💡HNC reveals many diverse mechanisms within the connected low-loss region around a single network (2/12)
1
1
19
1,114
HNC is a scalable method for traversing connected regions of weight space while preserving network function. We define a function-matching loss and use its Hessian to find flat directions, where the loss barely changes, then step along them to find alternative networks. (3/12)
1
12
In each iteration, HNC takes a flat step, then restores function matching with a few gradient steps on the function-matching loss. We can also steer HNC toward networks with desired properties, such as maximally different representations. (4/12)
10
HNC is a scalable method for traversing connected regions of weight space while preserving network function. We define a function-matching loss and use its Hessian to find flat directions, where the loss barely changes, then step along them to find alternative networks. (3/12)
1
17
In each iteration, HNC takes a flat step, then restores function matching with a few gradient steps on the function-matching loss. We can also steer HNC toward networks with desired properties, such as maximally different representations. (4/12)
15