PhD Student @MIT_CSAIL | Past: @togethercompute @LTIatCMU @MITIBMLab @UNCNLP, @SFResearch, @BaiduResearch | Machine Learning, NLP.

Joined August 2016
Han Guo retweeted
🚨 New preprint: AI agents learn from past experience, but what if that experience is wrong? We introduce ReHarness, a recurrent agent harness that enables online continual learning through backward revision. A joint work by #Meta × #MIT × #Yale! 📄 arxiv.org/abs/2610.12668
3
10
37
1,783
Very cool!
🚀 What if formal verification could make GPU kernels both safer and faster? Introducing SentryWard, an open-source formal verifier for GPU kernels. 👁⚡
17
2,873
Han Guo retweeted
🚀 What if formal verification could make GPU kernels both safer and faster? Introducing SentryWard, an open-source formal verifier for GPU kernels. 👁⚡
15
33
6
168
13,608
We now have state-of-the-art pre-trained base models in the 3T-parameter weight class, built entirely in-house at MAI. Post-training results coming soon -- stay tuned! Lots of details in our technical blog post. microsoft.ai/news/frontier-p…
145
353
160
3,444
1,330,666
Han Guo retweeted
TPUs have different bottlenecks from GPUs: few cores so you don’t need yo think about parallelism as much, large VMEM so easier to fuse kernels, but vector units have lower throughput so anything non matmul require much more care
Releasing FLAT: Flash Linear Attention on TPUs 🚀 Pallas training kernels for Linear Attention, Mamba-2 and GLA. On one TPU v6e, forward + backward is up to 3x faster than FLA on an H100 for GLA, and 1.5x faster for Mamba-2. 🧵
14
23
365
16,017
autoregressive models generate high quality text but slowly, just one token at a time. diffusion models generate many tokens in parallel, but sacrifice quality. excited to share ncm towards expanding frontier!! great work by @KumbongHermann and @ishanskhare 💫🚀
🚀 Introducing Next-Concept Modeling (NCM): our new paradigm for fast, parallel, coarse-to-fine text generation. Compared to strong diffusion language models (DLMs) at similar parameter size, NCM achieves: ⚡ Up to 31× faster generation on downstream tasks like summarization and machine translation with comparable or better quality. 🏎️ 10–21× faster unconditional generation across TinyStories, LM1B, and OpenWebText, with comparable or better generative perplexity and using 3–5× fewer training tokens. 🧩 Better performance on reasoning tasks like Sudoku, outperforming both AR and diffusion baselines with fewer sampling steps. With @ishanskhare, @IddahMlauzi, @ekellbuch, @simran_s_arora, @Azaliamirh, and @HazyResearch. More details in the thread 🧵👇
3
16
1
148
7,419
Releasing FLAT: Flash Linear Attention on TPUs 🚀 Pallas training kernels for Linear Attention, Mamba-2 and GLA. On one TPU v6e, forward + backward is up to 3x faster than FLA on an H100 for GLA, and 1.5x faster for Mamba-2. 🧵
14
45
8
260
45,292
Han Guo retweeted
SSMs had the nice asymptotics but kept missing out on the inference goodies Transformers get for free like spec decode and quantization. Turns out we were just not caching the right thing. Same IO-aware trick behind FlashAttention, Mamba scan, paged KV. A lot of the big wins weren’t new architectures, just people taking memory IO seriously.
ReplaySSM now runs in production in GLM-5.3-Flash and Kimi-K3, and ships in TensorRT-LLM, vLLM, FlashInfer, and SGLang! It speeds up standard decoding (up to 1.47x) and speculative decoding (up to 2.1x), and now also enables a low-precision SSM state whose rounding error never propagates through the recurrence. Building on our earlier ReplaySSM work, we collaborated with @NVIDIA to pin down what the method really unlocks. Caching SSM inputs instead of the state is what ReplaySSM does. What it changes is that computing the output and updating the state can be separated during decoding. All three gains follow from that separation. Joint blog post, paper, and code with @NVIDIA and @tri_dao 👇
18
58
4
633
28,686
New paper with Google PI: We derive a new learning paradigm coming from the sgd/linear-attention duality, where instead of updating linear layers with gd at every step during training, we maintain a growing “kv cache” of gradient signals we attend over (NN grows during training)
There is a beautiful dual view of gradient descent on dense linear weight layers: A linear layer trained by GD computes exactly the same function as its initial weights plus linear attention over its own training history. Each test input attends to every input the layer received during training ("keys") and recombines the backpropagated errors stored assoc. with them ("values"). This intriguing connection has been discovered and revisited before but is unfortunately still not really well-known! If you want a new perspective on one of the most fundamental things we do when training modern neural networks, I highly recommend studying this dual view, and thoroughly thinking about its implications. Taking this perspective seriously, we replaced the linear attention with more powerful kernels, such - obviously ;) - softmax attention. This (not trivial at all!) led to a new paradigm for neural network learning that we call Retrieval-Centric Deep Learning (RCDL): neural networks whose basic building blocks aren't classic linear weight matrices but growing, nonparametric databases of inputs and backpropagated errors, read out by nonlinear attention variants. Via the RCDL approach, we were furthermore able to find cool, insightful derivations for known ml tools such as the FOOF optimizer! In our new paper, we describe this RCDL in detail and study its behavior on simple learning tasks - it performs surprisingly well!  And of course, we also address the obvious current limitation: Linear growth in memory as the number of training points increases. To circumvent this, we propose some early ideas using a hybrid parametric/nonparametric approach. We are particularly excited to see what tricks can be found to adapt these growing layers to today's hardware constraints. But after all - this work was originally motivated by a simple idea: Compute is getting cheaper and cheaper, hence are there methods that seem wildly expensive today, but may be affordable and extremely powerful in the future? We think this RCDL paradigm offers a promising path :) There is a ton of possible follow-up work that can be done now and we are very excited to see what people will try and do with this new retrieval centric learning approach!
20
1
141
5,627
Han Guo retweeted
Really excited about this work! Super fun working on the systems side to make the much larger recurrent state efficient in practice. Cool to see the extra capacity actually pay off at long context!
Linear attention is arguably the most naive RNN, but still massively outperforms traditional RNNs by maintaining a matrix state. So... what if we use a (triadic) outer product of three vectors and maintain a three-dimensional state? Introducing: Triadic Linear Attention 🧵
1
5
431
Han Guo retweeted
Regression really does make a surprisingly good memory.
5
35
478
21,415
Can we have 4D linear attention 🤔
Linear attention is arguably the most naive RNN, but still massively outperforms traditional RNNs by maintaining a matrix state. So... what if we use a (triadic) outer product of three vectors and maintain a three-dimensional state? Introducing: Triadic Linear Attention 🧵
1
6
1
83
5,257
Han Guo retweeted
(1/7) Humans can acquire many capabilities without (catastrophically) forgetting previous ones. Why can't neural networks do the same? Local Support Learning (LSL) takes us a step closer towards this goal. In LLMs of up to 7B parameters, LSL augments gradient-based training to retain prior capabilities while learning new tasks at full capacity. Notably, it does so without access to prior data. Key idea: casting forgetting as a geometric problem, and optimizing for the worst case. Paper: arxiv.org/abs/2610.02126 Website and code: assafbk.github.io/lsl
15
87
12
757
46,216
CLM is one of the most elegant ideas we've worked on together. To me, it starts with a simple interaction need: there are many cases where I just want the agent to make surgical edits to the context. For example, when the agent finishes one task and prepares for another, it should ideally be able to clean up the context for the next one, just as a human would. And there are many such cases! Instead of hard-coding such rules into the harness (I doubt that's even possible), what would a first-principles solution to this problem look like? It turns out to be shockingly simple: ask the LLM to manage the context itself! Not only can this help the agent more efficiently solve the next task, but it can also be applied recursively to many more complex cases. This unlocks new agent capabilities across a variety of challenging, long-running, and open-ended tasks. For example, equipped with CLM, the agents can run continuously for hours on challenging tasks like EdgeBench or our new software world repository optimization tasks, and achieve really good results. Check out the CLM paper for more method details and many other cool results!
‼️The Bitter Lesson for context management: Giving LMs unrestricted control over their context beats human-designed SOTA! Introducing 🩵Context Language Models (CLMs)🩵 - Natively manage their own context - Treat context as a file - Learn policies in CLM weights, no harness
7
18
214
15,795
Han Guo retweeted
In our Nature paper, we introduce the first superhuman Stratego AI, which we built using general techniques that we developed for RL & test-time compute under imperfect information. 1/N
43
187
29
1,421
285,462
Very cool paper!
‼️The Bitter Lesson for context management: Giving LMs unrestricted control over their context beats human-designed SOTA! Introducing 🩵Context Language Models (CLMs)🩵 - Natively manage their own context - Treat context as a file - Learn policies in CLM weights, no harness
1
22
3,234
AI agents are becoming GPU kernel engineers. We're rethinking the compiler stack around them. Meet TIRx Harness: an open compiler harness that gives agents an environment to explore, debug, and optimize GPU kernels. 🧱 Minimal stable low-level compiler foundation for predictable GPU programming
🔍 Domain-specific compiler analysis to guide debugging and optimization
📚 Kernel zoo of 60+ kernels and hardware specs to reuse strategies and discover new ones
📊 Remote GPU evaluation for reliable benchmarks and profiling Agent-built Kimi Delta Attention kernels achieved geometric-mean speedups of 2.94x over FlashKDA (forward) and 6.84x over FLA (backward). Our bet: the next leap in agentic GPU programming will come from engineering the environment agents optimize in. Check out our blog: blog.mlc.ai/2026/09/29/tirx-…
9
58
10
353
74,551
ScaleML will be back on Thursday! Join the mailing list on scale-ml.org/
Scale ML is resuming this Fall with Alok from Jane Street! We will go over how to do data mixture experiments at scale! 🔥 Sign up for the zoom link via the website.
2
8
1,463
Han Guo retweeted
Scale ML is resuming this Fall with Alok from Jane Street! We will go over how to do data mixture experiments at scale! 🔥 Sign up for the zoom link via the website.
1
7
4
120
55,543
Han Guo retweeted
The best club at MIT is starting up again! We'll be hosting talks with speakers on various interesting topics. This Thursday will be Alok, who wrote the famous blog / video on group theory and positional encodings! Sign up for the mailing list: scale-ml.org
Scale ML is resuming this Fall with Alok from Jane Street! We will go over how to do data mixture experiments at scale! 🔥 Sign up for the zoom link via the website.
4
30
534
43,999