Math & computer science | @AIatMeta (2025-2025) | @GoogleDeepmind (2023-2025) | @GoogleAI (Brain) (2017-2023) | CS PhD @Georgiatech | CS @IITKanpur

San Francisco
Joined February 2025
Excited to share what I worked on during my time at Meta. - We introduce a Triton-accelerated Transformer with *2-simplicial attention*—a tri-linear generalization of dot-product attention - We show how to adapt RoPE to tri-linear forms - We show 2-simplicial attention scales better under token constraints than dot product attention It was fun collaborating with amazing folks including @dvsaisurya @_arohan_ and others
26
96
25
810
149,867
Aurko Roy retweeted
wow, amazing technical blog post about microsoft's new 3T pre-training with very rare and clear insights on how to train models of this size first let's get an overview of the shape of this model, it's a sparser model than Kimi K3 (80B active vs 104B), same sliding window hybrid pattern, with this time more kv heads for the sliding window layers (a bit different from stepfun and poolside that add query head). they added a shared expert and also removed the interleaved MoE/Dense pattern of MAI 1 the scaling ladder is very similar to MAI 1 with the same mechanism, each rung depends only on the number of layers. they mention that one of the key improvements is how they handle the smaller rung data distribution where they make sure to have the same repetition as the final corpus. they already did that for MAI-1 but only for data ablation iirc their prediction is almost identical to the final run loss, very impressive they compare the model with different base models such as deepseek v4 pro and MAI 1, tho in the case of deepseek v4 pro i'd say it's quite hard to distinguish how much the data mixture "overfitting" to the scaling ladder has an impact here (they mention it's both), need to always be a bit careful about EG metrics for data in general they have VERY NICE scaling laws for weight decay and learning rate, for the learning rate they express it as a function of tokens per parameter (N/D) and steps (hence depending on the batch size). they also do the same for dropout where it's a function of active params only, they also find the usual sqrt(k) scaling for learning rate and batch size (other scaling laws often also converge to that) a bunch of other stability stuff, they use Muon this time and activation gradient clipping, the efficiency gain here is actually pretty crazy at larger scale. they also increase the training horizon to ~40T text (20T unique) + a new 10T (4.5T unique) multimodal since the model is natively multimodal imo this is a safe but very clean scaling! very exciting for the tech report and MAI-base-3, congrats!!
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…
20
101
4
1,199
59,331
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…
148
357
161
3,491
1,369,075
Aurko Roy retweeted
eventually they will all come around to the fact that we must computemaxx full attention or even more, like 2-simplical attention (but probably still hybrids) and of course loopmaxxing
Could long-context architectures “find all contradictions” in a science literature? Not yet! 🧵 We study a new class of "high-complexity” tasks whose difficulty scales quadratically with corpus size (as opposed to linearly), reversing common LCLM decisions! (block-sparse attention, hybrid models…)
4
3
67
7,830
Super cool results with some clever sharding and sparse updates to the 65B n-gram table obliterating the previous nanoGPT record!
New historic NanoGPT record at 39.9s (-27.7s) from @DevenPzak , obliterating the prior record of 67.6s! This record introduces a new paradigm of thinking to NanoGPT: instead of optimizing matmuls or adding more expressive operations, optimize at the individual flop level with incredibly clever engineering and ML judgement. If a flop is low value on a particular step, skip it. Specifically: -(~8s) Sampled softmax. If a token doesn’t appear in a batch, skip its lm_head fwd/bwd some fraction of the time. -Sparse values. Only run an optimizer step for ngram embeddings that occurred in the batch. Set beta1 to zero to enable this. Beta2 is applied retroactively when the row is later used. -Sparse updates. Only update ngram and value embeddings once every 4 steps instead of once every 2. -Sparse communication. Shard the n-gram table across GPUs, and only pass the rows receiving updates on each step. -Sparse optimizer states. For the n-gram table, reduce from 2 floats in Adam optimizer per param, to 1 float per 768 params. -Hand-rolled flash attention for 64 dim heads. There are several additions that add accuracy too: -(~4s) EMA during last 300 steps, combined with lifting final_lr to 0.3 instead of 0.15. -(~1s) A new optimizer, Anvil2, which expands muon via a second tracked momentum buffer, improves the ortho coefficients, and modifies the cautious weight decay application. -A couple additional dynamic skip connections in the network. The most striking consequence of the ‘flop aware paradigm’ is you can grow parameters arbitrarily large, only limited by the available memory, since you can selectively choose how to expend flops on those parameters on each step. NanoGPT has kept active parameters below 124M, but total is unbounded, and has grown to 640M through embedding sparsity over the last year. This PR takes that to its logical conclusion on the 8xH100, scaling up to 65B sparse embedding parameters, which accounts for 25% of the PR’s gains. At frontier scale, where one is not bounded by an 8xH100, one could imagine where this paradigm could lead. github.com/KellerJordan/modd… As this was a very notable PR, I spoke with Deven for an hour to learn how he did it. Here’s his story on the changes: hyperstition.cc/training-nan…
2
1
16
1,314
The real innovation behind Moonshot's breakthrough was never Kimi Delta Attention (KDA)—it was Kimi Distillation Attack (KDA).
We're publishing our most detailed threat intelligence report to date. It covers how people tried to misuse Claude—for cyberattacks, influence operations, surveillance, biology, and building weapons—and how we found and stopped them. We disrupted every operation in the report, and used the lessons from them to strengthen our safeguards. Where appropriate, we also shared what we found with authorities and other AI companies. These cases are not typical: we’re highlighting some of the most sophisticated misuse we’ve seen. But they’re especially important to discuss, because they show us where AI misuse is headed, where our safeguards work, and where they need to improve. We’re publishing this report so others can spot the same activity on their own platforms, and so we can give the public a clearer view of how emerging threats develop. Read the report: anthropic.com/threat-intelli…
2
21
2,129
"The model looks up what it already knows for FREE and spends its compute purely on thinking. " This is the right intuition for why N-gram embeddings help.
Qwen3.8-Flash-Next Drops TOMORROW And I'm Deploying It LIVE 🚨 The architecture is wild: 125B brain, only 6B active per token, PLUS a 51B lookup table of pre-baked phrases. It's not more brain, it's flashcards 🧠⚡️ The model looks up what it already knows for FREE and spends its compute purely on thinking. Same quality as their flagship at 1/9th the training cost. Their last model this size ran 10B active. This runs 6. That's the speed unlock 📈 Tomorrow 11 AM I'm going live to crack this on the DGX Sparks. FP8 on TP2 first, then the community quant hunt begins. Can we fit it on ONE Spark? Can it run on four 3090s? We find out together 🔥 Stay tuned. You already know the numbers get posted here first 🎯
1
8
1,624
51B N-gram table is massive!
Qwen 3.8 Flash Next is releasing Tomorrow. 125B paramters +51B N-gram and 6B active. Its based on the next generation Qwen 4 architecture. Qwen 4 is coming
4
15
3,458
Nice to see MiniMax and others pushing content based sparse attention forward. Back in 2020 the field was exploding with several efficient attention variants: - Local/Sliding window attention - Fixed sparsity patterns - Strided attention - Recurrence ( T-XL, compressive transformers) - Chunked attention - Linear attention and SSMs The right prior which has stood the test of time is a combination of: a) local attention for modeling local context and b) a top-k content based sparsity to route queries to the most relevant keys (blocks of keys). What has changed in the last 6 years is better hardware-algorithm codesign.
Hey everyone — our high-performance MSA kernel library is now open-source. The M3 weights are expected to drop this Friday. Thanks for waiting! Github: github.com/MiniMax-AI/MSA Paper:github.com/MiniMax-AI/MSA/bl…
4
13
1
120
22,982
As someone who watched Rohan train LLMs with shampoo and brainstorm ideas for making it cheaper/more scalable back in 2021-2022 (low-rank shampoo for very large weights etc), I think it's fair to say that Shampoo was certainly a step change over Adam. That said Muon also introduced several innovations and it may be an over-simplification to say that it's just Shampoo with b2=0. - For one the use of Nesterov momentum - Second the observation that computing inverse roots is inherently more numerically unstable than orthogonalization - Clever use of Newton-Schulz which makes it more GPU friendly than eigh or QR or coupled newton - Scaling the update rms norm to match 0.2 (Adam update rms in the limit) which made grafting with Adam unnecessary I think both optimizers are awesome and I learned a lot from studying both of them. Progress doesn't happen in a vacuum, we all stand on the shoulders of giants.
not sure how you can say the first major innovation since adam was muon and not shampoo. although I'll admit that muon is much simpler to implement in practice! unless you are saying muon is a special case of shampoo with b2=0?
4
1
2
122
40,175
Still remember implementing the Miller–Rabin primality test as an undergrad — one of those rare algorithms that feels almost magical in its simplicity. RIP.
2
14
2,156
For a decade it was open whether Frank-Wolfe's O(1/√ε) rate on strongly convex sets is tight. We show it is: Ω(1/√ε), even for a simple quadratic on a unit ball. With J. Halbey, D. Deza, @maxzimmerberlin, @chrisrx13, @b_stellato. 1/2
1
9
1
86
8,612
Aurko Roy retweeted
Meet MAI‑Image‑2. Built with creatives, for real creative work. Ranked #5 on @arena’s text‑to‑image leaderboard. Available now: msft.it/6014QUCBe
61
116
36
822
116,936
Wait so everyone is scaling N-grammer now?
🚀 Scaling embeddings, not just experts—introducing a new path for efficient LLMs. Key Finding: In high-sparsity scenarios, N-gram embeddings yield a better Pareto frontier than just adding more MoE experts. Therefore, we introduce LongCat-Flash-Lite—the first opensource model built on this insight. ⚙️ 68.5B Total Params(37.13B non-embedding) | 2.9B~4.5B Active 📊 High Performance: SWE-Bench 54.4 | τ²-Bench 72.8 | TerminalBench 33.75 📃 256K Context Window (YARN-powered) ✨ Optimized for Agentic/Coding, strong in general reasoning ⚡ ~700 tokens/s peak inference speed The result: Achieves competitive performance within its scale at a significantly lower cost and latency. Hugging Face: huggingface.co/meituan-longc… Tech Report: huggingface.co/meituan-longc…
2
26
3,902
Aurko Roy retweeted
Okay so, we just found that over 50 papers published at @Neurips 2025 have AI hallucinations I don't think people realize how bad the slop is right now It's not just that researchers from @GoogleDeepMind, @Meta, @MIT, @Cambridge_Uni are using AI - they allowed LLMs to generate hallucinations in their papers and didn't notice at all. It's insane that these made it through peer review👇
277
1,369
415
6,204
1,007,336
Rnj-1-Instruct is now the #1 trending text generation model on HF!
22
34
5
395
62,154