Be nice to animals. Research Scientist @nvidia

Switzerland
Joined November 2017
Ilia Karmanov retweeted
Reflection Beam architecture explained in a single chart
Beam is now available across platforms, with open weights under the Apache 2.0 license - in collaboration with an ecosystem of 40+ partners. We're releasing: - Weights, tokenizer, and reference implementation - BF16, FP8 and NVFP4 weights and a DFlash2 drafter - The open source harness we built and trained Beam on: Mirror CLI Weights and model card on Hugging Face: huggingface.co/reflection
3
27
1,435
Reflection’s first model, Beam, scores 30 on the Artificial Analysis Intelligence Index, placing it #2 among US open weights models Beam is an open weights model with 501B total and 23B active parameters, released on @huggingface Congratulations to @reflection_ai on the release! Key takeaways: ➤ Second among US open weights models: Beam scores 30, behind only Meta's Muse Spark Open (39) and ahead of yesterday’s NVIDIA Nemotron 3.5 Super VL (26) release. Outside China, only Muse Spark Open and the UAE's K2 Horizon (31) score higher ➤ Token efficient for its intelligence: Beam uses ~26k output tokens per Intelligence Index task compared to K2 Horizon, one point ahead, which uses twice as many (~52k). Proprietary models still set the frontier, with GPT-6 Astra (max) scoring 53 on the same budget (~27k) ➤ Strong on agentic workflows, weaker in the terminal: Beam scores 48.5% on AutomationBench-AA, 11 percentage points ahead of K2 Horizon (37.2%) and level with Qwen3.8 27B (48.2%). Terminal-Bench 4.0 is a weak point, where Beam scores 3.0%, behind Qwen3.8 27B (5.6%) and Muse Spark Open (8.1%) ➤ Knows more, guesses more: On AA-Omniscience it answers 33% of questions correctly, well ahead of K2 Horizon (18%) and Qwen3.8 27B (16%). But its hallucination rate is 47%, against 26% for K2 Horizon and 30% for Qwen3.8 27B, giving Beam a net index score of 1.5, ahead of both peers (−3.0 and −10.0) Other model details Context window: 1M tokens Modalities: Text Parameters: 501B / 23B
64
54
39
612
88,814
And.... my personal favourite! We worked super hard on this model and are super excited to pioneer a bunch of techniques: from 2-bit QAD to LiLiCorr drafting - all making this model incredibly fast and smart! Try it out yourself! More details here: tinyurl.com/3jdvtxrk
NVIDIA Nemotron 3.5 Bolt 24GB puts powerful local agents within reach. ⚡ 74B-A9B parameters packed into 24GB of memory, balancing intelligence and speed while running alongside your apps. Optimized for RTX Spark and ready for your next project.
1
3
215
Very excited to announce our new models: Nemotron 3.5 Super and Lightning! This also feels like a good time to share that a few months ago I joined the amazing Nemotron Pretraining team. We're cooking some very large and very strong models for you! Here is a tech summary for 3.5: * Super is a 120B total / 12B active vision language model (VLM) * Lightning is a 30B total / 3B active text-only LLM * Super scores 51.78% on SWE-bench Pro (better than Nemotron 3 Ultra despite ~4.6× fewer active params!) * arch: MoE Hybrid Mamba-Transformer designed for efficient inference, with a 1M token ctx window, and native speculative decoding (via MTP) * training is done across our GB200 and GB300 (and deployment validated across all imaginable SKUs, including consumer (RTX) and DGX Spark) A few details on how we train these: -- Pretraining * pipeline: initialize with Nemotron 3 base -> custom MTP initialization + 100B-token MTP warm-up -> 1T-token distillation from the next larger N3 teacher * Lightning then goes through a 21B token long-context (LC) stage (@ 1M ctx) * Super goes through: - Indic CPT: 100B tokens at 8K (10B Indic + 90B replay, we built a synthetic corpus with 2.83T toks across 22 Indian langs! Indic benchmarks improve by up to 9.82%) - LC extension: 35B tokens at 1M - Agentic SWE mid-training: 65.4B tokens at 256K (uses whole repos, issue-PR pairs, commit histories, etc.); DeepSWE pass@1 improves from 6.4 -> 10.4 - LC recovery: 9B tokens at 1M (as we observed regression after mid-training) -- Post-training * Super: two-stage SFT -> joint RLVR/RLHF -> specialist teachers -> two-stage MOPD -> MTP boosting * Lightning uses a lighter text-only pipeline: single-stage SFT -> RLVR * Super's SFT transforms the text-only base into a VLM using vision, agentic, reasoning, chat, safety, LC data * A few examples of RLVR environments: - Olympiad-level competitive programming - Finance agents using SEC search, document parsing, evidence retrieval, and tool use * Specialist teachers include Agentic, Reasoning, Video reasoning and tracking, Vision tool-use, Vision-reasoning, and an Alignment/RLHF teacher * Two-stage MOPD consolidates these specialist capabilities into one model * Post-training ends with MTP boosting to better align the drafter and reduce recursive train–inference mismatch; this improves Super's SPEED-Bench acceptance length by 21.8% (to 4.612 tokens) -- Inference The model is highly optimized for inference (with plenty of quantized options to choose from)! A few data points: * On a GB200, Super reaches 4,856 output toks/s/GPU with ≥50 toks/s/user on a 20-turn agentic workload * Super provides 2.34x the throughput of Qwen3.5 122B-A10B and 1.90x the throughput of Qwen3.8 Flash-Next * Native MTP is complemented by standalone parallel drafters: LiLiCorr for Super, and DFlash and DSpark for Lightning Looking forward to seeing what you do with 3.5! Phase shift for Nemotron incoming! :)) (with the usual this will be our weakest model ever, but really really so) paper: research.nvidia.com/labs/nem…
31
18
3
326
13,723
David Silver is one of the all-time greats. He was the creator of AlphaGo, which changed the course of history by showing that neural nets could achieve superhuman performance for the first time. He also has a unique intuition and knack for forecasting when things will happen in AI. With computer Go, he predicted the Lee Sodol outcome 10 years before, right to the year. He got the year right for Starcraft and won a bet inside Deepmind. Same for AlphaProof. Same for the IMO. David's prediction for superintelligence: 3 years. !!! He has a strong sense that now is the time to build a superleaner, and that superlearners are now possible, thanks to the enormous progress in compute, simulators, autoresearch, and the sophistication of technology in the stack since the AlphaGo days. What is a “super learner”? A super learner discovers all knowledge from its own experience. Start from nothing (no internet pre-training), and go beyond human knowledge. Drop it into any stream of experience, simulated or physical, and the superlearner learns. He expects the progress will be rapid. When you get the recipe for a superlearner just right and remove humans from the development loop altogether, a superlearner can learn extremely quickly. Just look at AlphaGo. AlphaGo took two years to develop with humans in the loop. When David and his team at @GoogleDeepMind got the formula for AlphaZero correctly, it surpassed the human-developed algorithms in just a few hours. Human data is a shortcut, but you have to let go of the human data to shoot beyond it. In January, David left GDM to found @IneffableLabs, a research-led lab with one mission: build a "super learner" that discovers all knowledge from its own experience, and make first contact with superintelligence. He joins us with co-founder Lasse Espeholt, who built IMPALA and SEED RL, the foundations of scaled-up RL, and now runs Ineffable's compute. A few things we cover in this conversation. — What a super learner is: depth (start from nothing, go beyond human knowledge) and breadth (drop it into any stream of experience, simulated or physical). The human brain is the only existence proof — Why they're giving up human data: AlphaGo took two years with humans in the loop. AlphaZero outperformed it in a few hours. "You have to let go of the human data to shoot past the competition" — Crucibles: simulated worlds with enough emergent complexity (physics engines, millions of interacting agents) for an agent to rediscover technology, science, maths and language on its own — Simple rewards, emergent complexity: evolution optimized fitness and got all of life. Don't breadcrumb the objective, give the agent something simple to optimize in a world with a lot to learn about — Go as the existence proof: one agent is the most boring game imaginable, two agents is "an infinite onion of layers of complexity" — Why human language is probably not the endpoint for reasoning, and how training on it bakes in a flat earth and the four humors — Can superintelligence be built in simulation? If the sim is Turing complete, computation, economics, language and maths are all expressible, and it happens 10-100x faster and safer — Alignment: language-based monitoring is reaching its limits as agents learn to say one thing and do another. Shadow actions, superintelligences monitoring superintelligences, and building a real science of how they interact peacefully — Accelerate in simulation, pace in the real world: Ineffable will gate real-world deployment on evidence that it goes well — Timing as the determinant: Silver called Computer Go to the year, then StarCraft, then the IMO. He thinks this is the moment — Predictions: True superintelligence within three years. Timestamps: 0:00 – Introduction 1:09 – What held true from Go to today, and what the LLM era changed 3:35 – Why leave DeepMind to start a new lab 5:58 – Why "Ineffable" (and the secret second reason) 7:03 – Lasse's path: scaling RL at DeepMind and Google Brain 9:31 – Defining a super learner and first contact 12:35 – Super learners vs. LLMs that make discoveries 13:59 – Day to day: the RL stack, crucibles and human-journey milestones 16:13 – Don't breadcrumb the objective: simple rewards, emergent complexity 21:16 – What a crucible looks like 24:14 – Go: one agent is boring, two is infinite 25:41 – Will agents rediscover language? 27:22 – Removing human priors: AlphaGo to AlphaZero 32:05 – Keeping human bias out of the crucibles 33:35 – Confidence, timing and super forecasting 36:24 – Is compute the driver? 38:13 – The ceiling on simulation and Rich Sutton's objection 43:44 – Alignment and the science of superintelligence 47:45 – Monitoring agents that don't think in English 51:01 – Pacing the frontier 52:54 – The compute setup: Vera Rubin on GCP 55:18 – Training, inference, simulation and RL scaling laws 57:40 – IMPALA and SEED RL 1:00:58 – 20 people and the compute-per-person ratio 1:04:49 – A research-led culture 1:05:47 – Predictions
20
100
32
771
135,731
Ilia Karmanov retweeted
134 pages from ETH and EPFL on training a multimodal reasoning model I’ve had a lot of fun putting off various fires there, given the fully open source and data requirements, you won’t find a better report, especially a multimodal one
11
40
4
362
16,052
Ilia Karmanov retweeted
Training large models with RL typically runs on a fixed homogeneous cluster of the latest accelerators for numerical stability and faster throughput. This throws away inference optimization work done for other vendors and generations, limits the capacity you can utilize, and is unnecessarily expensive. So we trained a model on agentic coding tasks using fully asynchronous RL and mixed-precision, mixed-accelerator samplers. With off-policy correction, training stayed stable through convergence, on par with homogeneous samplers, at a lower cost.
32
129
64
1,665
164,258
Ilia Karmanov retweeted
Replying to @Duderichy
Someone should tell @meawoppl for the next time he needs to pack lunch
2
17
1,342
93,424
Ilia Karmanov retweeted
NVIDIA-backed Reflection is preparing to release a new open-weight AI model expected to compete with top Chinese 🇨🇳 models. Note: Reflection has signed major compute deals recently with Nebius and SpaceX.
39
48
27
807
107,857
Ilia Karmanov retweeted
Banger paper from Meta Superintelligence Labs. They find something super interesting and unexpected. (bookmark it) Base models with a light harness often solve more agentic tasks than their RL post-trained versions when both get enough samples. Post-trained models win on pass@1. At large K, base models frequently solve tasks the post-trained ones never solve on BFCL v4 multi-turn, ACEBench, and WebShop. This is because post-training pushes each task toward always solved or never solved. Consistency goes up, and coverage goes down. The authors call the lost test-time scalability the Sharpening Tax. Across 42 base and post-trained pairs, it shows up in most settings, grows with model size, and can be estimated from a few rollouts. Their fix, PTGS, sets the sampling temperature per prompt from its estimated difficulty during RL. It pays a smaller tax and also raises pass@1. Paper: academy.dair.ai/papers/sharp…
9
18
7
194
23,593
Ilia Karmanov retweeted
The idea of an intelligence explosion caused by recursive self improvement has been around for a long time but until very recently it did not seem imminent. Now many leading researchers think it may happen quite soon. You can read our paper about it here: casp.ac/reports/intelligence…
323
1,419
216
6,546
802,928
Ilia Karmanov retweeted
SFT is not dead! 🥳 We found a way to make SFT rival current prevailing posttraining methods, often generalizing better and forgetting less than RL and OPSD. 🤯 Following our prior work on reasoning with sampling, we now introduce sampling to the posttraining stack. 1/n
74
244
65
2,165
366,541
I just published my overview of the NVIDIA Nemotron series (focusing on post-training)... You can read it here: cameronrwolfe.substack.com/p… Among open models / resources, Nemotron is especially useful due to its transparency. Releases often include detailed tech reports, code, training recipes, and even data in some cases. There are many minute details involved in learning how to post-train LLMs at scale, but they are hard to learn without detailed accounts from teams that have actually trained frontier-scale models. NVIDIA Nemotron provides us with a rare opportunity to study these details directly and gain an understanding of how LLM post-training actually works. The overview covers the following, which encompasses the majority of recent Nemotron tech reports: - Llama-Nemotron: arxiv.org/abs/2505.00949 - AceReason-Nemotron: arxiv.org/abs/2505.16400 - Nemotron-Cascade: arxiv.org/abs/2512.13607 - Nemotron-Cascade 2: arxiv.org/abs/2603.19220 - Nemotron 3 Nano: arxiv.org/abs/2512.20848 - Nemotron 3 Super: arxiv.org/abs/2604.12374 - Nemotron 3 Ultra: arxiv.org/abs/2606.15007 Through these works, we can see a clear progression in post-training methodologies. Relatively simple pipelines slowly transform to become more agentic, and new components (e.g., MOPD and async / long horizon RL) are introduced over time. Beyond these high-level trends, we can see all of the small details that are useful for getting the most performance out of your model; e.g., curriculum learning, multiple training stages, synthetic data recipes, data filtering / curation / mixing, balancing reasoning efforts, harness exposure, and more. I highly recommend reading this blog (and the associated tech reports) for those who want a realistic view into the practical details of LLM post-training.
7
23
1
192
8,576
Ilia Karmanov retweeted
When I was 15, I escaped alone from a repressive regime, hiding in the back of a truck that rushed a border post and took bullets. When I was 16, I took asylum in a country I'd never seen, not knowing a word of the language. When I was 17, I came to America as a refugee and lived on food stamps for 6 months until my mother and I could find work. I went to a public high school in Oakland. I never got into an Ivy League school because I only applied to the one college closest to home. I worked my way through a (great) public college. I went to grad school only because I got a fellowship. I am not taken in by self-imposed conditions that make your life miserable just so you can spend VC money. Most talented people with real difficulties don't have a choice. Look there for your heroes. I just hope all the brilliant young people who will log on, lock in, and drop out will someday make their parents proud. I really do.
when i was 17, i flew 4,236 km to san francisco and turned down the most selective Ivy League program instead of college, i lived out of wework, hacked on AI models, while figuring out how to get an o1 visa as a teenager 🇺🇸 luckily i met @DavidSHolz who was kind enough to give me a place to sleep and warm clothing. while there i watched him quit his job to start a discord server... i thought mf was crazy. that became @midjourney at 18, i joined a hacker house and lived with @karpathy, @polynoamial. @Mascobot, and other brilliant ai researchers, scientists, engineers, founders it was amazing- whenever a new ai model dropped (whisper, dalle, stable diffusion) we invited our friends over to hack. in 2022, @8enmann (founder of an new ai lab) came over to our house to hack and invited us to try his new Slackbot as one of its first users. that became @claudeai, which launched publicly in 2023 i learned how to build by making dumb projects with cool tech alongside dope people - like putting stable diffusion into a minecraft server and showing karpathy homeless mark zuckerberg generated in real time with blocks my projects proved to other ppl that i could build stuff, which got me the opportunity to work with @naval who sponsored my o1 visa (ty 🐐) after much visa anxiety getting my o1 and airchat getting acquired, I started giving out "Alien of Extraordinary Ability" hoodies as a meme which serendipitously started @extraordinary. now Extraordinary helps the smartest people in the world come to 🇺🇸 and powers frontier companies like @Ramp, @Cognition, @llmh, @a16z building in san francisco has been incredible. There's no other place like it in the world - the concentration of genius talent is insane. ppl are so willing to help you if you are earnest. i couldn't be where i am today if i stayed in Canada or went to college! today @gaganbiyani, @bhorowitz, @pmarca, @eriktorenberg and @a16z are launching the Horowitz Andreessen Acadamy man i wish i had something like this when i first came to san francisco. it was so hard doing it myself i'm honored to be a mentor for the upcoming college opt-outs who want to spend their time building frotnier technology and making a dent on the universe! LFG
16
44
5
1,052
88,912
Ilia Karmanov retweeted
MiMo-V2.6-Pro: 1.02T-42B active MiMo-V2.6-Flash: 310B-15B active Top open model on Artificial Analysis + RL dashboard + tech report. Curious how adoption lands!
30
48
4
620
37,773
Ilia Karmanov retweeted
Sometimes wildlife isn’t invading our neighborhoods—we’re building into their home. Every road, light, and construction project changes the world they once knew. If a wild animal is simply trying to survive, maybe the question isn’t “Why is it here?” but “What happened to where it lived?”
30
413
12
875
7,513
Ilia Karmanov retweeted
GPT-6 Astra is the best vision model we have tested I put together our results on detection, segmentation, box prompting, counting, reasoning and video full post: blog.roboflow.com/gpt-6-astr… ↓ examples and trade-offs
7
46
5
324
53,106
Ilia Karmanov retweeted
This new paper tackles a blind spot in reasoning models that doesn't get talked about enough. Everyone’s throwing more compute at test-time search right now, but if your model fundamentally doesn't know how to approach a problem, running 64 rollouts just gives you 64 flavors of the exact same mistake. Test-time scaling can’t fix a total lack of reasoning coverage. The reason why standard RLVR falls into this trap is because parallel rollouts during training are too rigid. The model optimizes for quick wins on familiar paths instead of exploring genuinely new ground, so its pass@k basically stagnates. Their fix (DATPO) swaps out flat rollouts for an adaptive tree structure that only branches out when a problem is actually hard. And instead of splitting at random tokens, which usually just creates superficial variations, they fork at the sentence level guided by entropy, explicitly penalizing branches for repeating the same idea. It forces the model to actually try a different strategy when it's stuck, rather than just rewording its confusion. Its a really neat paper on the exploration problem in RLVR. Read the full paper here: arxiv.org/pdf/2609.08650
1
12
26
853
Ilia Karmanov retweeted
Nearly half a year of silence. We spent it studying one problem: how far RL can scale. MiMo-V2.6 is in the middle of its RL run right now. Three things we scaled: compute (~2B tokens per step, 1568 prompts × 16 rollouts, fully async), environments and harnesses (multi-task agentic RL, mixed across multiple harnesses in one run), and grader compute (agentic in-group credit assignment, with test-case and rubric-based rewards). We'll open-source the details piece by piece over the coming weeks. Streaming the run: mimo.xiaomi.com/rl/
424
977
555
9,894
3,134,583
Ilia Karmanov retweeted
An basic idea in scaling RL: Can we allocate more compute to the harder problems? We did this: If your GRPO group has all wrong completions, sample more with probability P (~0.9) -- in search of more GRPO batches with nonzero gradient. It works! Called "Never Give Up"
Is RL actually making your LLM better? Gains from RL are mostly on easy questions🤯 We're calling this the Matthew Effect for RL on LLMs. We then leverage async RL to solve harder problems by Never Giving Up! paper arxiv.org/abs/2609.13443 blog mnoukhov.github.io/posts/ngu… 🧵👇
37
74
9
868
82,062