Research Scientist, Paradigms of Intelligence Team, Google Zurich

Zürich, Schweiz
Joined May 2017
Johannes Oswald retweeted
Very happy to share our recent work on The Agentic Scientist 🧑‍🔬, our next-generation system for orchestrating coding agents for automated scientific (co-)discovery. GitHub: github.com/SakanaAI/AI-Scien… Blog: pub.sakana.ai/agentic-scient… arXiv: arxiv.org/abs/2610.18933 Coding agents are powerful hill-climbers. But to illuminate the space of unknown unknowns, we need systems that can build on previously discovered knowledge, scale open-endedly with resources, and support human co-discovery and evidence-grounded communication. We hope that our system provides a step in this direction.
The Agentic Scientist: Orchestrating Coding Agents for Automated Scientific (Co-)Discovery Blog: pub.sakana.ai/agentic-scient… GitHub: github.com/SakanaAI/AI-Scien… arXiv: arxiv.org/abs/2610.18933 Since 2024, we’ve used The AI Scientist as a way to test how far AI alone can take scientific research, from v1 to v2 to the paper published in Nature earlier this year. The Agentic Scientist is the next step in that line of work, built for the era of coding agents. Coding agents such as Codex and Claude Code now carry out long software tasks on their own. Handing them a research problem, however, tends to produce a strong hyperparameter optimizer rather than a scientist: scores go up, but ideas stay narrow, and the reasons for the gain are rarely examined. The Agentic Scientist makes the research loop explicit. It wraps off-the-shelf coding agents in a scaffold that controls what they see, what they write, how they are evaluated, and how results are handed to the next stage. Parallel workers test hypotheses against rubrics defined before any experiment runs, share successes and failures through a common memory, and then ablate the winning program to generate evidence. We used an early version of the system to study Error Diffusion, a biologically motivated alternative to backpropagation. Our researchers set the question and the rubric, chose directions at each stage, and verified the results, references, and claims before submission. The resulting paper was accepted as an oral presentation at ALIFE 2026. In autonomous runs, the system also raised Doc-to-LoRA retrieval accuracy from 52% to 98% on multi-needle tasks and designed a learned evolution strategy that improves over its CMA-ES reference on unseen tasks. Alongside it we release AutoIllustrate, a pipeline for scientific figures that keeps an editable draw.io file as the source of truth, so every diagram can be corrected by hand. Humans define the question and the standards of evidence; agents expand the experiments researchers can run. We call this Co-Discovery, and we are releasing both systems as open source for the community to build on.
8
16
135
5,664
Johannes Oswald 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!
20
1
141
5,676
Johannes Oswald retweeted
Replying to @oswaldjoh
2
8
378
Johannes Oswald retweeted
New paper, and another dream come true. RCDL (or "softmax-key-value machines" as I used to call it) used to be just fiction, as an imaginary approach to build DL systems more powerful than any existing ones. That’s becoming reality now, thanks to the incredible Google Pi Team!!!
3
13
93
5,144
Johannes Oswald retweeted
The one and only Michael Jordan was interviewed last week by the French newspaper Libération. Here is an English translation. Enjoy! di.ens.fr/~fbach/MJordan_ITW…
6
40
8
235
42,507
Yesterday, our Project Suncatcher prototype satellite launched aboard the Transporter-18 rideshare mission with SpaceX, taking the first Google TPUs beyond Earth’s atmosphere.
12
10
2
150
9,814
Johannes Oswald retweeted
We are looking for new PIs!! The conditions are really, really excellent: the compute is amazing. Funding lets you start a medium-sized group without applying for grants. Pure intellectual freedom. No teaching obligation. Excellent student pool. Great colleagues. Many startups.
🚀 The ELLIS Institute Tübingen is hiring Principal Investigators as Hector Endowed Fellows! Enjoy globally competitive packages, full academic freedom & possible co-appointments w/ @MPI_IS and the Tübingen AI Center (@uni_tue). 📍 Tübingen, 🇩🇪 📅 Apply by Dec 13 🔗 institute-tue.ellis.eu/jobs/… #AI #MachineLearning #Hiring
1
6
60
4,566
Johannes Oswald retweeted
A robotic hand that walks away on its own fingers! 🪬 We finally have the Thing from Addams family in robotics, and it was developed at ETH Zürich. No wheels, no legs bolted underneath, no separate drive mechanism. The same fingers that grasp things also carry the hand across a surface and hold up its weight. A quadruped has four identical legs spaced evenly around its body, and most legged-locomotion reward functions quietly assume exactly that. A hand has fingers of different lengths, arranged unevenly around a palm, with a thumb that matches none of them. The team wrote a reward formulation for that unequal geometry, and in simulation it moves faster than tuned rewards borrowed from quadruped work. They kept the hand's existing finger design and its position controller, so this isn't a bespoke machine built for the demo. And power and computation sit onboard, so it runs untethered. → Crawling, steering, and recovery after being knocked over → While holding itself up, it executes a sequence of keyboard commands with no vision at all → It pushes an object to target positions using overhead visual feedback → The simulator was calibrated against measurements taken from the physical hardware A hand that walks to a task and then performs the task is a mobile manipulator with no locomotion hardware in it. Big shoutout to authors @amrhkzp! 😮‍💨 🔗 Here's the paper: arxiv.org/abs/2609.17172 ~~  ♻️ Join the weekly robotics newsletter, and never miss any news → ziegler.substack.com
63
130
36
965
62,760
Johannes Oswald retweeted
Scaling laws have become a central part of how we think about scaling LLMs, but it’s not always easy to build intuition for why they work. I made a tutorial on: - scaling laws in practice: classic papers and recent developments - an intuitive associative memory toy model, where scaling can be predicted from simple intuitions - a hands-on environment for learning how to use scaling laws I gave this tutorial at MLSS Tübingen last week, and thought the material was in a good enough shape to share! x nicolaszucchet.github.io/Tut…
9
38
1
370
26,345
Johannes Oswald retweeted
🤖🧠NEW PAPER🧠🤖 (The result of an 8-year project!) LLMs seem very different from symbolic systems. Yet LLMs excel in symbolic domains (e.g., language/code/math). How do they do it? Our finding: LLM representations have implicit symbolic structure! Link in thread ⬇️ 1/n
45
271
40
1,374
212,772
Johannes Oswald retweeted
For the first time, scientists have mapped the complete brain and central nervous system of an adult male fruit fly — a key model organism in science. 🪰 Working alongside HHMI Janelia Research Campus and the scientific community, @GoogleResearch scientists and researchers used AI to combine millions of 2D images into 3D neural shapes, reconstructing a record-breaking 166,000+ neurons. This foundational map of the adult male fruit fly brain can help accelerate our understanding of the brain, and is a major milestone in neuroscience.
453
3,011
1,195
30,293
16,827,536
Johannes Oswald retweeted
In the fight to defend openness in AI, the Marin project is a precious demonstration of openness in model training, with open code, data, recipes, even experimental results. Releasing AI research openly used to be the norm; I'm grateful for @percyliang's open lab approach.
🚢 Marin 535B-A23B started training this week! As usual, the whole process is open. Voyage plan: pretraining (80%) + midtraining (20%) on 18.75T tokens on 11 x GB200 NVL72 for ~3 months (2.7e24 FLOPs). Post-training will follow. Before kicking off the run, we trained a 4-rung scaling ladder from 1.6B-A61M (48B tokens) to 27.7B-A1.2B (926B tokens) to debug issues, and to make a forecast of our hero run. This is by far our biggest run, so definitely expecting the unexpected.
96
151
17
2,016
264,941
Johannes Oswald retweeted
We often ask how hard a task is for an LLM to learn, but what about individual tokens? Our new paper w/ @scott_linderman @hyundongleee digs into that question and reveals a curse of ambiguity: contexts with multiple possible next tokens are harder for LLMs to learn.
6
12
4
76
15,752
Johannes Oswald retweeted
Where much of the field saw flaws - Gwern understood that the fact it worked so well despite being so flawed meant unbelievable headroom. Models in 5 years will be as Fable to GPT3 - every part of what we do today could be radically better!
7
15
230
14,106
Johannes Oswald retweeted
Everyone is launching something now, so here's a preview of our (newly branded) lab in @SapienzaRoma ! 😅 We're a small team focused on explainable and efficient AI for science and tech - let me know if you have feedback or proposals for collaborations! sscardapane.it/snail/
4
9
2
68
5,284
Johannes Oswald retweeted
What happens when we remove the nonlinear activation from a (very) sparse MoE layer? Surprisingly, perplexity per FLOP improves and we get access to remarkably interpretable structure in the transformer FFN layers without having to train any SAEs/Transcoders/... 🧵👇
2
15
1
100
7,248
BenchPress is here! A way to predict benchmarks without running them. Basically can run 5 "principal" benchmarks and estimate the rest within <3.9%. Kinda nuts it works so well. Evals are rank 2 lol
💻Tired of running so many slow, expensive benchmark evals across every checkpoint? Try ✨BenchPress✨ at microsoft.github.io/benchpre…: provide a few benchmark scores, then get predictions for the remaining ~100 benchmarks, with trust probabilities and calibrated 90% prediction intervals. How does this work? In his original post (xitter.cf/DimitrisPapail/status/…), @DimitrisPapail first tried the idea as a fun question: collect model-by-benchmark scores into a matrix, find its low-rank structure, and use matrix completion to predict missing benchmark scores from a few observed ones. We expanded this into a full system: a fully audited 84-model x 133-benchmark score matrix, an optimized matrix-completion predictor, and a reliability layer for trust probabilities and 90% prediction intervals. Beyond predicting missing scores, we also suggest practical seed benchmark sets. The five-probe set {GPQA-D, HLE, Codeforces, MMLU-Pro, ARC-AGI-1} recovers the rest of a model's public score profile with a MedAE of 3.93 points. A lower-cost set {GPQA-D, MMLU-Pro, Aider Polyglot, MATH-500, AIME 2026} reaches 4.55 points. See more details below 🧵1/7 This work is with @DimitrisPapail at AI Frontiers, a boutique research lab inside @MSFTResearch.
11
12
3
136
31,223
In-context learning powered exploration and data collection is super intriguing and important … Lots more to come in this space!
Excited to introduce our new paper exploring the use of in-context learning to support intrinsic curiosity! This was with an amazing team at Google including @sangnie, @g_lajoie_, @derifatives, @neurosacramento, Rajaj Nasser, @oswaldjoh, and @blaiseaguera. arxiv.org/abs/2606.19476
1
9
787