AI Engineer World's Fair 2026
Einstein Arena: Harnessing Collective Agent Intelligence for Open Science — James Zou, Together AI
Read the talk
Einstein Arena: Designing Environments for Collective Agent Intelligence
James Zou explains how shared solutions, executable feedback, and carefully chosen tasks support agent research—from new sphere constructions and faster kernels to training data science models.
From a talk by James Zou
At a glance
Ideas worth remembering
Environment design shifts control toward resources, incentives, and feedback. Einstein Arena makes this concrete through deterministic verification, public solutions, forums, and live rankings.
The reported 604-sphere construction improves the known 11-dimensional result from 593, but does not establish the optimum. Zou attributes the advance to agents repeatedly refining shared solutions and exchanging experimental findings.
The arena pattern transfers to kernel optimization by replacing mathematical verification with compilation, testing, and benchmarking. Reported speedups exceed twofold for some kernels, with results dependent on shapes and hardware.
A data science benchmark must test whether success requires the data. Zou reports that 20–50% of tasks in some existing benchmarks could be solved without it, motivating DSGym's curated scientific and predictive-modeling tasks.
Execution infrastructure can support both evaluation and training: DSGym checks agent trajectories by running their code, then uses those trajectories to fine-tune small open-source models that Zou says can run locally.
Give agents an environment in which to work
James Zou introduces research with Together AI and Stanford on designing environments that help AI agents make scientific discoveries. His starting distinction concerns where developers put their effort. A workflow specifies how an agent should work through a sequence of prompts, tools, steps, and instructions. An environment supplies the infrastructure, resources, incentives, and guardrails within which an agent can choose its approach.
The distinction matters as agents become more capable. Zou's thesis is that prescribing their working methods can constrain their creativity, while a well-designed environment leaves room for useful behavior to emerge. This still requires deliberate engineering: developers must decide what resources agents receive, what boundaries apply, and what the system rewards. The proposed shift moves that engineering effort from prescribing a procedure toward establishing the conditions for productive exploration.
Suggest correction
This note stays in this page until you copy or download it. Nothing is submitted; reloading clears the draft.
Einstein Arena makes results and conversations shared resources
Einstein Arena is an environment where agents can collaborate and compete on open scientific problems. Entry is intentionally oriented toward agents: they can read the arena's access material, and participation requires solving a puzzle intended to demonstrate that the participant is an AI agent. Zou describes access as open and free for agents worldwide, while deliberately difficult for humans. The puzzle establishes the intended participation model; the talk does not explain its implementation or how reliably it distinguishes agents from people.
Problem selection supplies an essential constraint. Each curated problem must interest an existing community of human researchers and admit a well-defined, deterministic verifier that assesses solution quality. Scientific relevance gives the work a purpose; verifiability gives the environment a dependable feedback mechanism. This design applies most directly to problems whose candidate solutions can be checked and scored in that way.
Agents choose which problem to pursue. Inside its problem space, they find a precise description, a discussion forum, and a leaderboard. The forum supports questions, requests for help, and recommendations. An agent can submit a candidate whenever it wants; the verifier evaluates it and supplies a score in real time. The leaderboard continually updates, and agents can inspect and download one another's solutions.
These features create two complementary incentives. Ranking encourages agents to improve on existing results, while public solutions and discussions let them build on work already done. A submission becomes both a competitive result and a resource for another participant. Zou compares this mixture of collaboration and competition to the behavior of human research communities.
Suggest correction
This note stays in this page until you copy or download it. Nothing is submitted; reloading clears the draft.
A better construction in eleven dimensions
Zou reports that within a few weeks of launch, agents had found best-known solutions to 11 problems, exceeding previous human solutions and solutions obtained with specialized AI tools. He illustrates that claim with the kissing number problem: how many spheres can touch a central sphere without overlapping one another?
The low-dimensional examples make the question concrete. In one dimension, a sphere can have one neighbor to its left and another to its right, giving a kissing number of two. In two dimensions, the maximum is six. Higher-dimensional instances become much harder: constructing a large non-overlapping arrangement is already difficult, and the optimal number can remain unknown.
For 11 dimensions, Zou traces a sequence of constructions containing 440, 582, 592, and 593 spheres. He describes the 582-sphere result as standing for about 40 years before a 2022 improvement to 592, followed by a DeepMind advance to 593. His account of the earliest dates is less definite, but the central comparison is clear: collaborating agents produced a construction with 604 spheres within a few days.
The distinction between a construction and an optimum is crucial. A valid 604-sphere arrangement demonstrates that at least 604 spheres are possible; it does not prove that a larger arrangement is impossible. Zou also connects these geometric constructions to coding systems, including error-correction codes for information transfer. He presents better constructions as useful ingredients for engineering algorithms, without deriving a particular code or quantifying its performance benefit.
Suggest correction
This note stays in this page until you copy or download it. Nothing is submitted; reloading clears the draft.
How agents build on one another's work
Zou attributes the advance to collaboration, reporting that individual agents could not reach the result by themselves. The mechanism he describes is iterative reuse: agents take another agent's solution, refine it, and optimize it further. A lineage of submissions records how those improvements accumulate. This makes the shared candidate solutions part of the search process, rather than merely artifacts displayed after the work is finished.
The forum carries a different kind of reusable information: what participants have already attempted and what they learned. Zou describes an agent asking whether others had tried a family of approaches and receiving accounts of earlier attempts and findings. Such exchanges let agents use prior experimental knowledge alongside prior solutions. The talk gives this qualitative example and the solution lineage, but does not provide a controlled comparison separating collaboration's effect from differences in total computation or search effort.
Suggest correction
This note stays in this page until you copy or download it. Nothing is submitted; reloading clears the draft.
Replace the verifier to optimize kernels
The next application uses the same competitive and collaborative environment to improve computational kernels. The main change is the evaluation backend. Instead of checking a mathematical construction, it compiles submitted kernels, tests them, benchmarks them, and verifies their quality and speed. Results return to agents through the leaderboard in real time. This preserves the shared search environment while changing what constitutes a successful submission.
For kernels, Zou finds it useful to give agents different personas, meaning different roles and priors about where to look for improvements. One focuses on profiling, another on memory consumption, and a third on precision and tensor computations. These roles direct attention toward distinct aspects of the implementation while allowing the agents to exchange solutions and compete on the same measured outcome.
Zou reports speedups exceeding twofold for some production kernels relative to previous state-of-the-art implementations. He qualifies the examples as applying to specific shapes, while saying the work extends across multiple shapes and hardware types. These are kernel-level results, not a claim that every workload or complete application becomes twice as fast. He also says the improved kernels are already used in production at Together AI; the presentation does not give the detailed hardware configurations or benchmark procedures needed to reproduce the comparisons.
Suggest correction
This note stays in this page until you copy or download it. Nothing is submitted; reloading clears the draft.
DSGym asks whether agents actually use the data
Zou then introduces DSGym, short for data science gym, as a unified environment for evaluating and training data science agents. It brings datasets and tasks from different settings behind a common interface, with code execution as the means of interacting with the data. Its infrastructure lets agents launch multiple Docker containers to test algorithms and run experiments in parallel.
The team initially planned to incorporate existing data science benchmarks, but found that many allowed shortcuts. Their diagnostic was simple: measure how many tasks agents could solve without using the underlying datasets. An agent might reason its way to an accepted answer or exploit another shortcut while never performing the intended data analysis.
Zou reports that in some of these benchmarks, 20–50% of tasks could be solved without looking at any underlying data. That creates a measurement problem: a high score can reflect abilities other than the data science competence the benchmark intends to assess. The reported range concerns the benchmarks examined, rather than establishing a universal shortcut rate for data science evaluations.
Suggest correction
This note stays in this page until you copy or download it. Nothing is submitted; reloading clears the draft.
Curate tasks around scientific analysis and prediction
DSGym addresses this problem through two sources of tasks. For scientific analysis and discovery, the team extracts data and questions from recently published papers, then has human scientists and experts review each task. For predictive modeling, it selects recent Kaggle competitions that are still open and offer high-quality datasets and evaluations. The two tracks test different activities: analyzing scientific data and building models whose predictions can be evaluated.
Zou describes over a dozen tasks spanning dozens of scientific domains, including biology, physics, and economics, with multiple data types and modalities. The unified environment supports comparisons across open- and closed-source models. In the evaluations he reports, even frontier models often achieve less than 50% accuracy on DSGym tasks, leaving substantial room for improvement. The talk does not provide enough detail about individual task metrics or aggregation to turn that figure into a more specific model ranking.
Suggest correction
This note stays in this page until you copy or download it. Nothing is submitted; reloading clears the draft.
Turn executed work into training data
DSGym also acts as a training factory. Agents generate trajectories as they work through tasks, and the environment verifies those trajectories by actually executing the agents' code. The resulting training material is therefore tied to observed execution, rather than consisting only of plausible descriptions of how an analysis might proceed. Zou says the team uses these execution-verified trajectories to fine-tune small open-source models.
He describes the resulting models as best in class among open-source models for these kinds of data science tasks and small enough to run locally on laptops and other computers. The practical aim is to convert work performed inside the environment into improved capabilities in a smaller model. Exact model sizes, local hardware requirements, and comparative scores are not specified, so the claim supports local feasibility without establishing a particular laptop performance target.
Zou closes the DSGym discussion by bringing together its execution layer, task curation, and synthetic-data generation. The shared infrastructure runs tasks across domains; the team says it has checked those tasks for shortcuts; and the verified runs supply data for training further agents. The shortcut claim describes the team's validation, although the presentation does not spell out the checks needed to assess how comprehensively they exclude alternative ways of reaching an accepted answer.
His closing argument places environment design in a progression: individual models and tools, then agents and their workflows, and now infrastructure and incentives that motivate agents to solve increasingly challenging problems. The opportunity he emphasizes is collective intelligence—capabilities that emerge from how agents work within a designed setting. He ends by pointing to the team's papers for further detail and thanking the audience.
Suggest correction
This note stays in this page until you copy or download it. Nothing is submitted; reloading clears the draft.
Read the complete timestamped transcript
- 0:12
All right. I think we'll go ahead and
- 0:14
get started with the with the
- 0:16
presentation. So my name is James So. I
- 0:19
am uh
- 0:20
going to explain some of the work we're
- 0:22
doing with Together AI and it's also in
- 0:24
collaboration with Stanford around
- 0:26
designing and optimizing environments
- 0:29
for AI agents to enable these agents to
- 0:32
make new kinds of scientific
- 0:33
discoveries.
- 0:35
All right.
- 0:39
So so that I guess the current paradigm
- 0:41
of how people often are using or
- 0:42
deploying AI agents is often involves
- 0:44
designing workflows that sort of tells
- 0:48
the agents you know what to do, right?
- 0:50
Or how the agent should work. And it's
- 0:53
typically done through a series of steps
- 0:55
or prompts, tools, and instructions.
- 0:58
In contrast, the way we imagine the
- 1:00
environment is that the environment
- 1:02
should really specify
- 1:04
not how the agent should work, but
- 1:05
really where the agent should work,
- 1:08
right? And the environment then should
- 1:09
provide a set of incentives and
- 1:11
infrastructure for the agents and
- 1:14
guardrails and resources so that agent
- 1:17
can then flexibly work within that
- 1:19
environment.
- 1:20
Right. And our thesis here is that as
- 1:22
agents become more and more powerful,
- 1:24
right? If we try to design workflows
- 1:26
that often can limit the capabilities
- 1:28
and creativity of the agents. Whereas if
- 1:31
we properly design the environment, this
- 1:32
can enables a lot more creativity and
- 1:36
capabilities and intelligence for the
- 1:37
agents to naturally emerge. This why I
- 1:40
think we're trying to shift away from
- 1:41
designing workflows and harnesses
- 1:43
towards designing environments.
- 1:46
So what I want to do today is to give a
- 1:48
few examples of the how we design
- 1:50
environments for agents.
- 1:52
And in particular also show how they're
- 1:54
able to then with with the right
- 1:55
environment able to actually solve some
- 1:57
really interesting and innovative
- 1:58
problems.
- 2:02
So, the first example I want to share is
- 2:03
the system that we environment that we
- 2:05
created called the Einstein Arena.
- 2:07
It's sort of like the one of the first
- 2:09
environments that enables AI agents to
- 2:11
be able to collaborate in the wild and
- 2:14
to compete to really solve open-ended
- 2:16
scientific problems.
- 2:18
So, we designed this Einstein Arena to
- 2:20
be really agent native. So, I So, that
- 2:22
means that
- 2:23
it's very easy for agents to just read
- 2:26
the skills talk on our on our arena and
- 2:28
be able to access the arena.
- 2:31
And it's actually also designed so that
- 2:33
it's intentionally very hard for humans
- 2:35
to enter the arena, right? So, you
- 2:37
actually have to solve a little puzzle
- 2:39
to prove that you're an AI agent in
- 2:40
order to participate in this arena. But,
- 2:43
any agent in the world can openly and
- 2:45
freely participate on the arena.
- 2:47
And once the agent actually enters into
- 2:49
the Einstein Arena, this is what they'll
- 2:51
see, right? They'll see actually see a
- 2:52
list of curated problems. Each of these
- 2:55
problems is actually a problem that we
- 2:56
curated, so it's a scientifically
- 2:58
interesting problem. And we curated
- 3:00
these problems so that first, there's
- 3:01
actually an existing community of human
- 3:04
researchers that are interested in these
- 3:05
problems. So, these are important
- 3:07
problems for human scientists. And
- 3:09
second is that for each of these
- 3:10
problems, we can actually create a
- 3:12
well-defined and deterministic
- 3:15
deterministic verifier to assess the
- 3:18
quality of the solutions to each of
- 3:19
these problems. And I'll give some
- 3:21
examples in a couple of slides.
- 3:25
So, So, the agents can actually decide
- 3:27
which of these problems they're
- 3:28
interested in once they log onto the
- 3:29
arena, right? So, if they enter into a
- 3:31
particular problem space, this is what
- 3:34
they'll see, right? They'll see some
- 3:35
description that precisely explains what
- 3:37
is the problem. We have a discussion
- 3:39
forum where the agents can communicate.
- 3:42
It's almost like a social network where
- 3:44
the agents can actually communicate and
- 3:45
talk to each other and ask for help or
- 3:47
give recommendations.
- 3:49
Um and we also have a leaderboard. This
- 3:52
is where the agent can actually see each
- 3:54
other's solutions. Right? So in any in
- 3:57
at any time they want, the agent can
- 3:58
actually submit a solution to one of
- 4:00
these problems. And because we have this
- 4:02
verifier, we can actually then determine
- 4:05
what is the quality of that solution and
- 4:06
provide a score in real time. So this
- 4:09
leaderboard is being constantly updated
- 4:11
in real time. And the agents can also
- 4:13
see how other agents are doing on this
- 4:15
problem. And they can also see other
- 4:17
agents' solutions and download those
- 4:19
solutions.
- 4:20
So there's both a collaboration dynamics
- 4:22
and also a competition dynamics in this
- 4:24
arena, right? They can collaborate and
- 4:26
ask each other questions and help in the
- 4:28
discussion forum. But agents are also
- 4:30
competing with each other. And that's
- 4:31
why I think this also sort of simulates
- 4:33
how human researchers can compete and
- 4:34
also collaborate to solve interesting
- 4:36
problems.
- 4:39
So we launched this AI instant arena
- 4:42
environment
- 4:43
earlier this year, I think in March. And
- 4:46
within a few weeks, it's already
- 4:47
actually we're very impressed and very
- 4:49
surprised that the agents were actually
- 4:50
able to already discover new solutions
- 4:54
to 11 problems that are of the best
- 4:58
solutions that have ever been found.
- 4:59
Right? So that means that the solutions
- 5:01
that they discovered by the agents on AI
- 5:03
instant arena were better than any
- 5:05
previous human solutions or any
- 5:06
solutions that we acquired using more
- 5:09
specialized AI tools.
- 5:12
So I'll just give you example of one
- 5:14
such solution or one such problem
- 5:16
which is called the kissing number
- 5:18
problem.
- 5:19
So this is actually a very famous
- 5:20
problem. It's been around for hundreds
- 5:22
of years. So for example, Isaac Newton
- 5:24
was already working on some version of
- 5:26
this kissing number problem. And it's
- 5:27
actually relatively easy to state.
- 5:29
Right? So the kissing number problem
- 5:30
basically asks that what is the maximum
- 5:33
number of spheres that you can place
- 5:35
around the central sphere so that these
- 5:37
additional spheres do not overlap each
- 5:39
other?
- 5:40
So for example, in one dimensions,
- 5:42
right? So around the central sphere I
- 5:43
can place one sphere to the left and one
- 5:44
sphere to the right without overlap. So
- 5:47
the kissing number in one dimension is
- 5:48
easy to compute. This is two.
- 5:50
In two dimensions, it's also easy to
- 5:52
show that you can at most place six
- 5:54
spheres. So, that's the kissing number
- 5:55
in two dimensions is six.
- 5:58
But, it turns out that in higher
- 5:59
dimensions, it actually becomes really
- 6:01
hard to compute what's the maximum
- 6:02
number of over non-overlapping spheres.
- 6:05
And the kissing number problem in higher
- 6:06
dimensions is actually open, right? It's
- 6:08
not been It's not clear what is the
- 6:11
optimal number.
- 6:12
And so, scientists have been trying to
- 6:14
work on this problem for the last
- 6:16
several centuries.
- 6:19
And in particular, right, so the kissing
- 6:21
number problem in 11 dimensions has
- 6:22
attracted a lot of interest for various
- 6:25
reasons.
- 6:26
So, this is actually sort of a
- 6:27
progression of the solutions in 11
- 6:30
dimensions.
- 6:31
So, in the 1980s, right, so it's best
- 6:34
known that there you can place 440
- 6:36
spheres, right, in 11 dimensions without
- 6:39
overlap.
- 6:41
And in
- 6:43
I think 19
- 6:45
uh
- 6:46
So, yeah, so so in in 1980, there was a
- 6:48
big advance that the first for the first
- 6:50
time showed that you can actually just
- 6:52
construct with 582 spheres in 11
- 6:55
dimensions without overlap.
- 6:57
Uh and then that sort of stuck there for
- 7:00
about 40 years, right, until 2022, where
- 7:03
a mathematician is able to publish a new
- 7:06
advance, right,
- 7:07
a breakthrough that's able to improve
- 7:09
that to 592 spheres.
- 7:11
And then there's another breakthrough
- 7:13
from DeepMind the following year that
- 7:15
advances that to 593 spheres.
- 7:18
But, with Alpha Zero, we know by having
- 7:20
these agents able to collaborate
- 7:22
actively, right, in the wild, within a
- 7:25
few days they were actually able to
- 7:26
construct a new solution that shows that
- 7:28
for the first time you can create 604
- 7:31
spheres in 11 dimensions that do not
- 7:32
overlap.
- 7:34
And this is not just a problem that's of
- 7:36
mathematical interest, because it turns
- 7:37
out that
- 7:38
the more of these sort of spheres you
- 7:40
can place in higher dimensions without
- 7:41
overlap that actually creates the better
- 7:44
coding systems including ways of like
- 7:46
doing error correction codes for
- 7:48
information transfer. Right, so this
- 7:50
actually is by creating this better
- 7:52
constructions that also leads to this
- 7:54
better engineering algorithms.
- 7:57
And in this case actually the
- 7:58
collaborations among these agents is
- 8:00
really critical for making these
- 8:01
advances, right? So this is a problem
- 8:03
where not a single agent is able to
- 8:05
solve by itself, right? Not you know,
- 8:07
GPT 5.5 or a cloud models that can't
- 8:10
really solve the problem by itself. So
- 8:12
the collaboration among multiple agents
- 8:13
is really critical.
- 8:15
And here we're actually able to show
- 8:16
that there's like this
- 8:18
sort of a lineage trace of how the
- 8:19
agents are able to collaborate and then
- 8:21
basically take each other's solutions
- 8:23
and refine that and further optimize it
- 8:25
to arrive at this breakthrough.
- 8:28
And you can also see some of these
- 8:29
interactions and discussions on Einstein
- 8:31
Arena, right? Where here's an example
- 8:33
where the one agent actually was asking
- 8:36
other agents, "Have you tried
- 8:38
you know, some of these approaches?" Um,
- 8:40
with uh, these STP approaches and then
- 8:43
the other agents showed that yes, we
- 8:44
have tried these approaches and here are
- 8:45
some of the things that we found. Right,
- 8:47
so the information sharing on the forums
- 8:50
on the arena is actually really
- 8:51
important to help the agents to arrive
- 8:53
at this solution together.
- 8:57
So in addition to solving these
- 8:58
interesting scientific problems, but
- 9:00
we've also been using platforms like the
- 9:02
right Einstein Arena uh, to help to
- 9:05
improve uh, you know, machine learning
- 9:07
and AI itself.
- 9:09
Right, so here's one example where we
- 9:10
actually use these agents to basically
- 9:12
help us to create better kernels
- 9:15
for and to speed up those kernels.
- 9:17
Right, and here we use the same
- 9:19
environment, right? Where the agents can
- 9:21
compete and they also can collaborate
- 9:23
and they see these leaderboards. And we
- 9:25
basically change the back end instead of
- 9:26
trying to verify the solutions to this
- 9:28
mathematics problem, here we're
- 9:30
basically trying to
- 9:31
you know, we will compile and benchmark
- 9:33
and test and verify the quality and the
- 9:35
speed of the individual kernels, right?
- 9:37
And then we'll provide a feedback to the
- 9:38
agents in real time in the form of these
- 9:40
leaderboards.
- 9:43
In these kernel settings, we also found
- 9:45
it to be quite useful to have different
- 9:46
agents with different personas,
- 9:48
right? And these different personas
- 9:49
actually corresponds to a different uh
- 9:51
roles and priors that agents can
- 9:53
actually have. So, for example, we have
- 9:55
one agent that looks at tends to look at
- 9:57
more of the profiling, another agent
- 9:59
that tends to look at more of the memory
- 10:00
consumptions, a third agent that looks
- 10:02
at, you know, the precisions, the tensor
- 10:04
computations. And these agents can and
- 10:07
then across different personas, they can
- 10:08
able to collaborate and a compete on the
- 10:11
arena to speed up the kernels.
- 10:14
And in this case, right here, the agents
- 10:16
were also able to collaborate and lead
- 10:18
to really quite substantial speed ups,
- 10:20
uh including sometimes over two two x
- 10:23
two-fold speed ups in some of these
- 10:25
production kernels. So, here I'm just
- 10:27
showing you a few examples where for
- 10:28
things like page attention, uh and these
- 10:31
are sort of for specific shapes, but we
- 10:32
also have generalized this to many
- 10:34
different shapes and different uh
- 10:36
hardware types, right? Where we're
- 10:37
actually seeing that we're getting up to
- 10:39
sometimes over two x speed up in these
- 10:41
kernels, and they uh compared to the
- 10:44
previous state-of-the-art kernels for
- 10:45
these problems.
- 10:47
And these improved kernels created
- 10:49
designed by the agents are actually
- 10:51
already used in in production at
- 10:53
Together AI.
- 10:57
So, in the last few minutes, I want to
- 10:58
show like a second example of a kind of
- 11:00
environment that we created as a way to
- 11:03
uh train and to create better data
- 11:05
scientist agents,
- 11:07
right? So, we call this DS Gym, which
- 11:08
stands for data science gym, which is
- 11:11
sort of like a unified environment that
- 11:12
we created for both for evaluating and
- 11:14
for training data science agents to
- 11:17
solve complex data science problems.
- 11:21
So, here in this DS Gym environment, we
- 11:23
also curated and created a unified list
- 11:26
of different data sets and tasks,
- 11:29
right? So, these data sets can combine
- 11:31
uh spans across many different settings.
- 11:33
And the agents are then able to interact
- 11:35
with these different data sets that we
- 11:36
have through a unified uh interface and
- 11:40
through code execution.
- 11:42
In the DSGM environment, we also provide
- 11:44
a unified infrastructure for the agents.
- 11:47
So, for example, the agents can actually
- 11:48
spin up many different Docker containers
- 11:50
to test their data science algorithms
- 11:52
and actually run them in parallel.
- 11:58
So, in the process of actually creating
- 11:59
the data sets and tasks for the data
- 12:01
DSGM environment, so we initially
- 12:03
actually wanted to incorporate some of
- 12:05
the existing data science benchmarks
- 12:07
that have been used to evaluate agents.
- 12:10
But we actually quickly realized that
- 12:11
many of the existing widely-used
- 12:13
benchmarks actually have many problems.
- 12:16
And one big problem is that they're
- 12:17
actually very vulnerable to shortcuts.
- 12:19
By shortcut, I mean here is that
- 12:21
uh down here what I'm showing are three
- 12:23
different common popular data science
- 12:25
benchmarks.
- 12:26
Right? And the in green here we see
- 12:28
shows like the performance of the agents
- 12:30
on these benchmarks.
- 12:32
Uh but the red bar also shows how well
- 12:34
they're able to the what fraction of the
- 12:35
benchmark the agents can actually solve
- 12:37
without actually using the data sets
- 12:39
themselves. Right? So, just by reasoning
- 12:41
or by, you know,
- 12:42
uh doing other shortcuts without
- 12:43
actually actually do working with the
- 12:45
underlying data sets.
- 12:47
And across many of these different
- 12:48
benchmarks, right, sometimes up to 20 to
- 12:51
50% of the tasks can be solved without
- 12:54
actually looking at any of the
- 12:56
underlying data.
- 12:57
Which I think is uh really a significant
- 12:59
problem with many of the existing
- 13:00
benchmarks.
- 13:03
So, to address that, we actually
- 13:04
carefully curated at our own our own
- 13:06
benchmarks, right, for both for
- 13:08
scientific analysis and also for
- 13:10
predictive modeling.
- 13:12
So, for scientific analysis and
- 13:13
discovery, the way we did this is that
- 13:15
we actually went through recently
- 13:17
published papers and then carefully
- 13:19
curated data and then also tasks from
- 13:20
those papers. And then we also had human
- 13:22
scientists and experts to review each of
- 13:24
those tasks.
- 13:26
And for predictive modeling, the way we
- 13:27
did this is go through all the different
- 13:29
Kaggle competitions to look for some of
- 13:31
the recent Kaggle competitions that are
- 13:33
still open and and where also you have
- 13:35
high quality data sets and also high
- 13:37
quality
- 13:38
evaluations. Then we curated those into
- 13:41
the DS Gym as a kind of task for
- 13:43
evaluating how well models agents can
- 13:45
actually build predictive models.
- 13:48
So all together in the DS Gym, we
- 13:50
actually have created over a dozen
- 13:52
different tasks. They span across
- 13:55
dozens of different scientific domains
- 13:58
ranging from biology to physics to
- 13:59
economics. It also involves many
- 14:01
different data types and data
- 14:02
modalities.
- 14:06
So this actually makes it very easy for
- 14:08
us to evaluate different models, both
- 14:10
open and closed source models. And one
- 14:12
thing we found is that the existing
- 14:14
models, even the frontier models, often
- 14:16
are only still achieves like less than
- 14:18
50% accuracy performance on the DS Gym
- 14:21
tasks. Right? So these are definitely
- 14:23
not saturated benchmarks.
- 14:26
We can also use a DS Gym as sort of like
- 14:28
a training factory to improve these open
- 14:30
source models.
- 14:31
Right? So one thing we did here is
- 14:32
actually generate in the DS Gym actually
- 14:34
the gym itself will actually create all
- 14:36
these execution verified trajectories,
- 14:38
which means that these are trajectories
- 14:40
generated by the agents that have been
- 14:41
verified through the through
- 14:44
through actually executing the code from
- 14:46
the agents.
- 14:47
Right? So by generating these execution
- 14:49
verified trajectories, then we are able
- 14:51
to like fine-tune sort of small open
- 14:53
source models
- 14:54
that actually now achieve sort of the
- 14:56
they're sort of the best in class open
- 14:58
source models in terms of solving these
- 15:00
kind of data science tasks. Right? And
- 15:01
these models are small enough that you
- 15:02
can actually run them locally on your
- 15:04
laptops and your computers.
- 15:08
So just to summarize the this part was
- 15:10
the data science gym. Right? So we with
- 15:12
DS Gym, we created this unified
- 15:14
execution layer so people can actually
- 15:16
run and all these different tasks across
- 15:18
dozens of different tasks across many
- 15:20
different domains. We have carefully
- 15:22
verified that there are no shortcuts in
- 15:24
these tasks, which has been sort of a
- 15:25
common challenge with existing data
- 15:27
science benchmarks.
- 15:29
And we also enable in the DSG and a way
- 15:31
to generate synthetic data, so you can
- 15:32
easily use that to improve and to train
- 15:36
your own data science agents.
- 15:39
So, just to summarize the presentation,
- 15:42
um I think the main takeaway here is
- 15:44
that I think we're in seeing this
- 15:45
interesting progression as in terms of
- 15:47
how we build different AI systems.
- 15:50
Right. So, then in the past, people have
- 15:51
been building these AI systems mostly by
- 15:52
designing individual models or
- 15:54
individual tools.
- 15:56
And currently, there's a lot of focus on
- 15:57
creating designing agents or harnesses
- 16:00
and workflows around agents.
- 16:02
But what our research shows is that I
- 16:03
think we're already moving towards the
- 16:04
next stage, where you're not then trying
- 16:06
to design workflows or specific or
- 16:09
specific agents, what we really want to
- 16:11
do is to design environments, which is a
- 16:13
set of infrastructure and incentives
- 16:15
that in that motivates the agents that
- 16:17
you solve more and more challenging
- 16:19
problems.
- 16:20
And with appropriate designs these
- 16:22
environments can actually unlock much
- 16:24
more creativity and collective
- 16:26
intelligence from the agents that's
- 16:28
that's limited by the existing
- 16:30
workflows.
- 16:31
And here are some of the references for
- 16:33
the papers that we published that
- 16:34
describes these in more detail. So,
- 16:36
thank you very much.
- 16:38
>> [applause]
- 16:51
[music]