
PhD Student @MIT_CSAIL | Past: @togethercompute @LTIatCMU @MITIBMLab @UNCNLP, @SFResearch, @BaiduResearch | Machine Learning, NLP.
Joined August 2016
- Tweets3.6K
- Following4.5K
- Followers4.4K
- Likes13.2K
Han Guo retweeted
Hi all, I have a new result I'm excited to share. It turns out that *all existing implementations* of softmax and cross-entropy (that's JAX, PyTorch, textbooks, etc) have a subtle bug --- two bugs, actually. A simple rewrite fixes both, and eliminates "slingshots" when grokking:
Han Guo retweeted
We're open-sourcing RL360, the RL infrastructure behind K2 Horizon's six domain experts: 8,192 concurrent sandboxes, 150 steps in 7 days, ~1.3M rollouts.
Long-horizon agentic RL runs thousands of agents in real sandboxes on tasks that take minutes. Some of those sandboxes crash mid-task, and a crash arrives as the same low score as a wrong answer.
Without infrastructure that can keep up, GPUs are underutilized and the model gets penalized for system crashes rather than its own mistakes.
RL360 is built for this. We share how it works, what broke at scale, and what we learned in the thread.
Code: github.com/ifm-ai/RL360
Run: wandb.ai/mbzuai-llm/rl360-pu…
Han Guo retweeted
The most detailed open LLM data release yet: K2 Horizon's pre-training data and post-training data-generation pipelines are now open!
13 trillion pre-training tokens across 5 datasets and 24 subsets. Over 10 trillion tokens of synthetic data spanning mathematics, reasoning, coding, planning, and problem-solving.
Beyond the scale, four highlights for model builders (details in the threads):
- Scaling synthetic data without losing diversity. Our generation methods produce diverse training examples at scale, nearly matching natural web text in measured diversity.
- More verification isn't always better. Strict verification can throw away useful training signal.
- Small-scale wins can mislead. Our chosen data mix actually lost in smaller experiments.
- Beyond teacher imitation. Our post-training data generation methods produce training trajectories the teacher couldn't generate on its own.
Open pre-training datasets, post-training data-generation pipelines, and processing tools for researchers to inspect, reuse, and build on.
Pre-training data: huggingface.co/collections/I…
Post-training data-generation code & tools: github.com/ifm-ai/DATA_NAVIG…
Han Guo retweeted
We let agent swarms collaborate for 10K hours in simulated agent-owned GitHubs.
Gemini-3.8-flash collaborate the best while gpt-6-astra scores the worst among frontier models tested⁉️
What are the elements of successful agent collaboration at scale? Check World of SWECraft 🧵
Han Guo retweeted
At Recursive, we’re exploring the next generation of AI training.
Today, we’re releasing our first model: Recursive Flint, a state-of-the-art local model for coding agents, built with our automated research system. Its open weights are now available on Hugging Face.
Flint marks our first model release—and we’re already hard at work on what comes next.
Try Flint on something you’re building:docs.recursive.com
Huggingface: huggingface.co/RecursiveSI/f…
Blog post: recursive.com/updates/introd…
Han Guo retweeted
1/9 Current optimizers are static during training. What if the optimizer could think and react while the network trains?
We let an agent watch the training dynamics and rewrite the optimizer's source code as training goes: a reactive optimizer.
In every language and image setting we tried that has no tuned recipe, it matches or beats the best recipe one can one-shot, and it guards against loss spikes and overfitting by itself. In the near future, optimization decisions may belong to agents, not humans.
📝 xingjianbai.com/reactive-opt…
💻 Try it on your task: github.com/xingjian-bai/opal
🧵
Han Guo retweeted
⚡️ Along with this version, we've also released our DFlash 2 drafter for Qwen3.8-Flash-Next!
huggingface.co/incoai/Qwen3.…
We just shipped Splash 1.4.0!
Qwen3.8-Flash-Next on an M5 Pro (64GB): up to 120 tok/s decode and 1.3K tok/s prefill at 32K.
Over 30% faster prefill and decode than Strata. Up to 1M context, with bigger models fitting in less memory.
github.com/incoai/splash
Han Guo retweeted
Replying to @EkaRobotics
@EkaRobotics has raised a $150M Series A.
Generality v/s Performance is the fundamental tension at the frontier of robotics. Generality without performance is just a prototype. Performance without generality is just a single-purpose tool.
Customers shouldn’t have to choose. Eka breaks the tradeoff. Powered by our Vision-Force-Action (VFA) model, we deliver the performance and versatility customers need to put robots to work every day.
Eka is built on three convictions:
⚡️Force is the language of manipulation.
🚀 Reinforcement learning is how dexterous manipulation scales.
🎂 System 1—fast, reliable physical execution—is the bottleneck to solve.
With this funding, we will scale our model and accelerate customer deployments.
Grateful to be building alongside a dream team and investors who share our ambition.
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
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. 👁⚡
Han Guo retweeted
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…
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
Han Guo retweeted
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 🧵👇
Han Guo retweeted
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.
🧵
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 👇
Han Guo retweeted
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!
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!
Can we have 4D linear attention 🤔
































