The Center for Brains, Minds and Machines is a multi-institutional NSF Center dedicated to the study of the science and engineering of intelligence.

Cambridge, MA
Joined January 2017
Edge of Stability has been a thing for a while now. We can show that most training happens at the edge of stability. This is very surprising because of a "negative " fact: Most theory does not apply (e.g., Descent Lemma). The question becomes: Does the fact that training happens at the EoS impact performance? In what way? With what mechanisms? How is that affected by the architecture? To our knowledge, these questions they are unanswered to date and our new paper is the about the first step towards this! EoS picks what part of the distribution to learn and at what speed! arxiv.org/abs/2606.04212 In particular, the consequence is that for MLPs: EoS can improve robustness or OOD behavior, but only when the relevant subset is the one selected by EoS. If boundary points dominate, EoS helps near-boundary robustness. If distributional outliers dominate, EoS helps extrapolate toward the tail. Precisely: 1. We make EoS causal. We fork training from the same state at EoS onset: one branch stays at EoS, the other exits by lowering the learning rate. Same everything, only the stability constraint changes. 2. EoS is selective: it learns some parts of the data distribution faster, while slowing others. 3. The selector is surprisingly simple. A group benefits from EoS when its gradient is big and has high alignment with v_1, the top Hessian eigenvector. Translation: to benefit from EoS, a subset must (i) point in the sharpest direction, and (ii) keep a non-vanishing gradient. This gives concrete answers to the questions above: Does EoS affect performance? Yes, but not uniformly. It reallocates learning. In what way? It prioritizes the subset with largest curvature influence. By what mechanism? Self-stabilization at the sharpness boundary couples training to v_1; only groups aligned with v_1, and whose gradients persist, get the extra progress. How does architecture matter? Architecture changes the map from input geometry to gradient geometry. Thus it can change which subset dominates, but the same predictor remains: largest curvature influence wins. With the amazing Shauna Kwag, @anakha_g, and @TomasoPoggio!
1
12
1
94
6,729
Excited to share our theory on the universal compressibility of neural nets (led by @HYWangphy)! This leads to a new dynamical lottery ticket hypothesis and implications for improving neural scaling laws. arxiv.org/abs/2510.00504 Check out our ICLR poster!
4
14
1
127
10,270
CBMM retweeted
This is a very cool idea to decomposes sequence modeling into learning what to remember and how to update memory!
We never really knew how to train nonlinear RNNs well… BPTT struggled with vanishing grads (no long-range memory) and sequential rollout (hard to parallelizable). What if instead an oracle told us the optimal memory state m_t at each step? Then the RNN could do one-step supervised learning on (m_t, x_{t+1}) → m_{t+1} labels. We call this Supervised Memory Training (SMT): a replacement for BPTT that trains RNNs without unrolling them. SMT is time-parallelizable and solves vanishing gradients. Website: akarshkumar.com/smt/ arXiv: arxiv.org/abs/2606.06479
1
3
19
4,525
A common practitioner belief mechanistically: “weight decay stabilizes training.” We show it is wrong technically, a bit real In practice. - Training still happens at EoS with weight decay. - That said "it doesn't look like it"! The curvature at stabilization is much lower! - We properly charcaterize all we see by extending to weight decay the self-stabilization by @alex_damian_, @EshaanNichani, and @jasondeanlee and matching the result cleanly with an underdamped harmonic oscillator! - This however stabilizes/tames the dynamics in function space. Importantly: - This shows that regularized training at EoS even though "doesn't look like that", meaning curvature measures are lower than thresholds. Check out our paper: arxiv.org/pdf/2605.16622
2
11
87
6,062
1/ Many optimization problems are hard in theory. But real OR and NP-hard instances often have exploitable structure. Can an LLM agent discover that structure automatically and turn it into faster solver code?
5
34
3
205
25,994
Check the blog of Poggio Lab at MIT! We went online with some very nice blogs! The last one being about our multiagent system: poggio-lab.mit.edu/blogsupda…
3
6
959
Most AI for research work tries to maximize autonomy first and patch quality later. We think the near-term path is the reverse: Automating step-by-step holding the quality bar fixed. Today we’re open-sourcing PoggioAI/MSc for ML Theory Research
1
8
4
34
43,412
Simply adding Gaussian noise to LLMs (one step—no iterations, no learning rate, no gradients) and ensembling them can achieve performance comparable to or even better than standard GRPO/PPO on math reasoning, coding, writing, and chemistry tasks. We call this algorithm RandOpt. To verify that this is not limited to specific models, we tested it on Qwen, Llama, OLMo3, and VLMs. What's behind this? We find that in the Gaussian search neighborhood around pretrained LLMs, diverse task experts are densely distributed — a regime we term Neural Thickets. Paper: arxiv.org/pdf/2603.12228 Code: github.com/sunrainyg/RandOpt Website: thickets.mit.edu
91
462
105
3,166
790,843
🧵 New paper: LLM-ERM: Sample-Efficient Program Learning via LLM-Guided Search arxiv.org/abs/2510.14331 We use reasoning LLMs to learn tasks like IsPrime from ~200 samples by proposing short programs, making both the learned function *and* the learning process interpretable 🤯
2
10
3
36
8,621
Does SGD really “seek flat minima”? We show that SGD has no intrinsic preference for flatness, even for stable linear networks—going against ~10 years of folklore. Flatness emerges iff label noise is isotropic; anisotropic noise drives SGD to arbitrarily sharp solutions. This reveals a new flattening–sharpening mechanism in late training, unrelated to standard progressive sharpening or Edge-of-Stability effects.
10
36
2
396
24,804
Reinforcement Learning (RL) has long been the dominant method for fine-tuning, powering many state-of-the-art LLMs. Methods like PPO and GRPO explore in action space. But can we instead explore directly in parameter space? YES we can. We propose a scalable framework for full-parameter fine-tuning using Evolution Strategies (ES). By skipping gradients and optimizing directly in parameter space, ES achieves more accurate, efficient, and stable fine-tuning. Paper: arxiv.org/pdf/2509.24372 Code: github.com/VsonicV/es-fine-t…
88
381
64
2,589
415,921
Exciting news from Oslo! @Nancy_Kanwisher has received the @KavliPrize in Neuroscience at a royal ceremony in Norway with her fellow laureates @doristsao + Winrich Freiwald. Family and friends were present for the festivities - cheers to all! 🥂
11
3
115
15,304
Il programma del #FIE24 è ora disponibile! 👉 Scoprilo sul sito: festivalinternazionaledellec… Vi aspettiamo a #Torino dal 30 maggio al 2 giugno 2024 - Chi possiede la #Conoscenza - @editorilaterza @CollegioCA #TOLC @Tboeri – at Genoa, Liguria
2
18
5
36
23,992
I have no idea how that happened, but it's a thrill to share cool things about the brain with people all over the world. I am so proud of MIT for starting the online learning revolution 20 years ago with OCW!
In just a few short months, the first video for 9.13 Introduction to the Human Brain has garnered 7.5 million views on YouTube! Congratulations to @Nancy_Kanwisher and @mcgovernmit for this great work! Visit the course on YouTube here: bit.ly/3eS2b5w
24
53
10
561
New paper from our lab, by Mark Saddler and Ray Gonzalez: nature.com/articles/s41467-0… Shows that deep neural networks trained to estimate fundamental frequency reproduce the key features of human pitch perception, but only if trained on natural sounds in natural conditions. (1/n)
1
48
3
174