AI Engineer World's Fair 2026

Einstein Arena: Harnessing Collective Agent Intelligence for Open Science — James Zou, Together AI

Read the talk

Einstein Arena: Harnessing Collective Agent Intelligence for Open Science

James Zou argues that capable agents need less step-by-step choreography and better places to work: environments with shared problems, deterministic verification, visible solutions, and incentives that turn individual attempts into collective progress.

From a talk by James Zou

At a glance

Ideas worth remembering

  • An agent environment specifies the workspace, incentives, resources, guardrails, and feedback while allowing agents to choose how they solve the task.

  • Einstein Arena combines deterministic verification with visible submissions, live leaderboards, and discussion, allowing one agent’s solution or failed experiment to inform another’s next attempt.

  • In the eleven-dimensional kissing number example, agents reportedly improved the best known construction from 593 to 604 spheres through iterative collaboration; this is a construction, not proof that 604 is optimal.

  • Changing the verifier lets the same arena optimize GPU kernels: compile, test, and benchmark candidates, then return measured feedback. Some reported improvements exceeded 2× and entered Together AI production.

  • Zou reports that agents could solve 20% to 50% of tasks in some examined data-science benchmarks without accessing the data. DS Gym addresses this with curated, executable tasks: scientific-analysis tasks receive expert review, while predictive-modeling tasks use selected and filtered Kaggle competitions with continuing submission evaluation.

  • Execution-verified trajectories connect evaluation to training, enabling successful agent runs to fine-tune smaller open-source models that can run locally.

  • Environment design shifts the central engineering burden onto task curation and verifier quality; the talk’s examples do not resolve how to evaluate ambiguous or easily gamed scientific goals.

Environments set the stage instead of writing the script

Most agent systems begin with a workflow: a sequence of prompts, tools, steps, and instructions that tells the model how to proceed. James Zou proposes a different design target. An environment specifies where an agent works and supplies incentives, infrastructure, guardrails, resources, and feedback, while leaving the agent more freedom to choose its method. The thesis is that increasingly capable agents may be constrained by workflows designed around their creators’ assumptions; a well-designed environment can support approaches its designers did not prescribe.

This does not mean removing structure. The structure moves outward: builders define the problem space, available resources, acceptable behavior, and mechanism for judging results. The agent retains flexibility inside those boundaries. Zou develops that distinction through two environments: Einstein Arena, where agents collaborate and compete on scientific and kernel-optimization problems, and DS Gym, where data-science agents execute code against carefully curated tasks.

0:120:39
Suggest correction

This note stays in this page until you copy or download it. Nothing is submitted; reloading clears the draft.

0:12 · section reference included

Einstein Arena turns verification into coordination

Einstein Arena is designed as an agent-native environment for open-ended scientific work. Entering requires solving a small puzzle intended to demonstrate that the participant is an AI agent; humans are deliberately discouraged, while agents can participate openly. Once inside, an agent chooses from curated problems that already interest human researchers and, crucially, admit a well-defined deterministic verifier.

The verifier makes open collaboration operational rather than aspirational. Each problem space combines three parallel mechanisms:

  • Precise task definition: A description tells agents what constitutes the problem.
  • Shared discussion: A forum lets agents request help, report failed approaches, and recommend directions.
  • Live competition: Agents submit solutions, receive scores in real time, inspect the leaderboard, and download one another’s submissions.

Because solutions remain visible, a leaderboard entry is also material for the next attempt. Competition identifies the current best result; collaboration lets other agents extend it.

Zou reports that within a few weeks, agents in the arena had produced what the team regarded as the best known solutions to eleven problems, surpassing previous human constructions and specialized AI approaches. The talk does not provide the full problem list, verifier specifications, or independent validation for all eleven results, so the claim should be read as the team’s reported launch outcome rather than a complete comparative audit.

How it fits togetherThe Einstein Arena improvement loop

A scientifically interesting task with a precise description and deterministic verifier.

Deterministic scoring turns every visible submission into both a result and a starting point for another agent.

2:022:32
Suggest correction

This note stays in this page until you copy or download it. Nothing is submitted; reloading clears the draft.

2:02 · section reference included

From 593 to 604 in the kissing number problem

The kissing number problem asks how many equal spheres can touch a central sphere without overlapping one another. In one dimension, one sphere fits on each side, giving a kissing number of two. In two dimensions, at most six circles can surround the center. Higher dimensions become much harder, and many optimal values remain unknown despite centuries of study.

Zou focuses on eleven dimensions. In his historical account, a construction of 582 spheres remained the best known result for about forty years; he dates the improvement to 592 to 2022 and describes a DeepMind advance to 593 the following year. These dates are Zou’s account, rather than an independently established chronology. He reports that agents working through Einstein Arena then constructed a configuration of 604 non-overlapping spheres within a few days. This advances a known construction—a lower bound on what can be arranged—rather than proving that 604 is the optimal eleven-dimensional kissing number.

The mechanism matters more than a story about one unusually strong model. Zou says no single frontier agent solved the problem alone. The arena preserved a lineage in which agents took existing submissions, refined them, and optimized the result further. Forum exchanges also shared prior attempts and findings: one agent could ask whether a semidefinite-programming approach had already been tried, and others could return what they had learned. The talk does not isolate collaboration’s causal contribution from total computation or search effort.

Zou also connects dense sphere constructions to coding systems, including error-correcting codes for information transfer. The talk states that better constructions can lead to better engineering algorithms, but it does not demonstrate a specific code derived from the 604-sphere construction. That application is therefore motivation for the mathematical search, not a reported deployed result.

5:095:40
Suggest correction

This note stays in this page until you copy or download it. Nothing is submitted; reloading clears the draft.

5:09 · section reference included

Swap the verifier, and the arena optimizes GPU kernels

The same environment can target machine learning infrastructure by changing its backend evaluator. Instead of checking a mathematical construction, the system compiles, tests, benchmarks, and verifies individual kernels. The leaderboard then returns real-time feedback about correctness, quality, and speed while preserving the same collaborative and competitive dynamics.

For kernel work, the team also assigns different priors or personas to participating agents. These roles create parallel lines of attack: one agent emphasizes profiling, another memory consumption, and another numerical precision or tensor computation. The personas do not replace verification; they diversify what the group examines before compilation and benchmarking decide whether a proposed optimization actually helps.

Zou reports speedups sometimes exceeding 2× over previous state-of-the-art kernels, including an example transcribed as ‘page attention’; the supplied recording does not establish the intended technical name. He qualifies the displayed examples as applying to specific tensor shapes, while saying the team extended the approach across more shapes and hardware types. Unlike the speculative coding application of the kissing-number result, these agent-designed kernels are reported as already running in production at Together AI.

How it fits togetherOne arena, two kinds of verification

Agents share findings, inspect alternatives, and submit candidates.

The social and leaderboard structure stays fixed while the backend changes what counts as progress.

8:579:27
Suggest correction

This note stays in this page until you copy or download it. Nothing is submitted; reloading clears the draft.

8:57 · section reference included

DS Gym removes the shortcut of ignoring the data

The second environment, DS Gym—Data Science Gym—combines evaluation and training for data-science agents. It presents diverse datasets and tasks through a unified interface with code execution. Agents can start multiple Docker containers to test algorithms and run experiments in parallel, giving them an executable workspace rather than a collection of questions answered only in text.

While assembling DS Gym, the team found a damaging shortcut in existing data-science benchmarks: agents could solve substantial fractions of tasks without using the underlying datasets. Zou reports that this affected roughly 20% to 50% of tasks across the benchmarks shown. A benchmark with this property can reward general reasoning, memorized patterns, or exploitable wording while failing to measure whether an agent can inspect data, write analysis code, and draw a data-dependent conclusion.

The team responded with two curation paths:

  • Scientific analysis and discovery: Tasks and data came from recently published papers and were reviewed by human scientists and experts.
  • Predictive modeling: Tasks came from Kaggle competitions selected for high-quality datasets and evaluations. Zou describes them as still open; the full DSGym paper specifies completed competitions that continue accepting submissions for official leaderboard evaluation. Their competition periods have ended, while prediction submissions remain possible.

Zou describes a collection with over a dozen different tasks across dozens of scientific domains, from biology and physics to economics, and spans multiple data types and modalities. Human-expert review is established for the scientific-analysis tasks; predictive tasks follow the competition-selection and filtering process.

The talk describes these tasks as carefully checked against shortcuts, but it does not give the exact adversarial testing protocol or a residual shortcut rate. The full paper specifies quality review and a shortcut filter for existing analysis benchmarks: five frontier models attempt tasks without data access, and a task is excluded if at least three answer correctly. This operational filter does not establish that every possible shortcut has been eliminated. The defensible lesson is methodological: if a data-science task can be answered without touching its data, benchmark performance is not sufficient evidence of data-science ability.

10:5711:21
Suggest correction

This note stays in this page until you copy or download it. Nothing is submitted; reloading clears the draft.

10:57 · section reference included

Verified execution becomes training data

DS Gym still has headroom: Zou reports that even frontier models often achieve below 50% accuracy on its tasks. This is a qualified report, not a blanket score for every model or task family; the paper distinguishes analysis accuracy from competition-specific prediction metrics. The environment then turns evaluation runs into training material. It records execution-verified trajectories—agent attempts whose generated code is actually run—so a successful trajectory carries stronger evidence than a plausible-looking textual answer.

Those verified trajectories can fine-tune smaller open-source models. Zou says the resulting models reach best-in-class open-source performance on these data-science tasks while remaining small enough to run locally on a laptop or desktop computer. The talk does not provide model sizes, baseline scores, training costs, or a full comparison table. The full DSGym paper supplies a case study: 3,700 synthetic query candidates were generated, 2,000 high-quality query–trajectory pairs were retained, and a 4B model was fine-tuned. It improved over its base model across the evaluated analysis benchmarks and exceeded GPT-4o on some of them. These results establish measured gains in that evaluation, without establishing a particular laptop performance target or unrestricted transfer beyond DS Gym.

The ending places both projects on the same progression: from designing individual models and tools, to building agent harnesses and workflows, to designing environments. Einstein Arena uses deterministic verification, visible solutions, discussion, and competition to accumulate collective progress. DS Gym uses curated tasks, executable infrastructure, and verified trajectories to measure and train data-science behavior. In both cases, the environment does more than host the agent. It determines what feedback exists, what work can accumulate, and which behavior gets rewarded.

The tradeoff is that environmental freedom depends on verification quality. These examples work because sphere constructions, kernel benchmarks, and executed data-science tasks provide machine-checkable feedback. The talk does not show how the same approach handles scientific goals with ambiguous evidence, subjective judgment, unsafe experiments, or rewards that can be gamed. Designing the environment therefore shifts responsibility rather than removing it: builders must curate meaningful tasks and make the verifier measure the result they actually value.

How it fits togetherDS Gym as an evaluation and training factory

Curated scientific-analysis and predictive-modeling tasks span multiple domains.

Executable tasks produce verified trajectories, which can train smaller agents that return to the same environment for evaluation.

14:0614:36
Suggest correction

This note stays in this page until you copy or download it. Nothing is submitted; reloading clears the draft.

14:06 · section reference included

Resources

Read the complete timestamped transcript
  1. 0:12

    All right. I think we'll go ahead and

  2. 0:14

    get started with the with the

  3. 0:16

    presentation. So my name is James So. I

  4. 0:19

    am uh

  5. 0:20

    going to explain some of the work we're

  6. 0:22

    doing with Together AI and it's also in

  7. 0:24

    collaboration with Stanford around

  8. 0:26

    designing and optimizing environments

  9. 0:29

    for AI agents to enable these agents to

  10. 0:32

    make new kinds of scientific

  11. 0:33

    discoveries.

  12. 0:35

    All right.

  13. 0:39

    So so that I guess the current paradigm

  14. 0:41

    of how people often are using or

  15. 0:42

    deploying AI agents is often involves

  16. 0:44

    designing workflows that sort of tells

  17. 0:48

    the agents you know what to do, right?

  18. 0:50

    Or how the agent should work. And it's

  19. 0:53

    typically done through a series of steps

  20. 0:55

    or prompts, tools, and instructions.

  21. 0:58

    In contrast, the way we imagine the

  22. 1:00

    environment is that the environment

  23. 1:02

    should really specify

  24. 1:04

    not how the agent should work, but

  25. 1:05

    really where the agent should work,

  26. 1:08

    right? And the environment then should

  27. 1:09

    provide a set of incentives and

  28. 1:11

    infrastructure for the agents and

  29. 1:14

    guardrails and resources so that agent

  30. 1:17

    can then flexibly work within that

  31. 1:19

    environment.

  32. 1:20

    Right. And our thesis here is that as

  33. 1:22

    agents become more and more powerful,

  34. 1:24

    right? If we try to design workflows

  35. 1:26

    that often can limit the capabilities

  36. 1:28

    and creativity of the agents. Whereas if

  37. 1:31

    we properly design the environment, this

  38. 1:32

    can enables a lot more creativity and

  39. 1:36

    capabilities and intelligence for the

  40. 1:37

    agents to naturally emerge. This why I

  41. 1:40

    think we're trying to shift away from

  42. 1:41

    designing workflows and harnesses

  43. 1:43

    towards designing environments.

  44. 1:46

    So what I want to do today is to give a

  45. 1:48

    few examples of the how we design

  46. 1:50

    environments for agents.

  47. 1:52

    And in particular also show how they're

  48. 1:54

    able to then with with the right

  49. 1:55

    environment able to actually solve some

  50. 1:57

    really interesting and innovative

  51. 1:58

    problems.

  52. 2:02

    So, the first example I want to share is

  53. 2:03

    the system that we environment that we

  54. 2:05

    created called the Einstein Arena.

  55. 2:07

    It's sort of like the one of the first

  56. 2:09

    environments that enables AI agents to

  57. 2:11

    be able to collaborate in the wild and

  58. 2:14

    to compete to really solve open-ended

  59. 2:16

    scientific problems.

  60. 2:18

    So, we designed this Einstein Arena to

  61. 2:20

    be really agent native. So, I So, that

  62. 2:22

    means that

  63. 2:23

    it's very easy for agents to just read

  64. 2:26

    the skills talk on our on our arena and

  65. 2:28

    be able to access the arena.

  66. 2:31

    And it's actually also designed so that

  67. 2:33

    it's intentionally very hard for humans

  68. 2:35

    to enter the arena, right? So, you

  69. 2:37

    actually have to solve a little puzzle

  70. 2:39

    to prove that you're an AI agent in

  71. 2:40

    order to participate in this arena. But,

  72. 2:43

    any agent in the world can openly and

  73. 2:45

    freely participate on the arena.

  74. 2:47

    And once the agent actually enters into

  75. 2:49

    the Einstein Arena, this is what they'll

  76. 2:51

    see, right? They'll see actually see a

  77. 2:52

    list of curated problems. Each of these

  78. 2:55

    problems is actually a problem that we

  79. 2:56

    curated, so it's a scientifically

  80. 2:58

    interesting problem. And we curated

  81. 3:00

    these problems so that first, there's

  82. 3:01

    actually an existing community of human

  83. 3:04

    researchers that are interested in these

  84. 3:05

    problems. So, these are important

  85. 3:07

    problems for human scientists. And

  86. 3:09

    second is that for each of these

  87. 3:10

    problems, we can actually create a

  88. 3:12

    well-defined and deterministic

  89. 3:15

    deterministic verifier to assess the

  90. 3:18

    quality of the solutions to each of

  91. 3:19

    these problems. And I'll give some

  92. 3:21

    examples in a couple of slides.

  93. 3:25

    So, So, the agents can actually decide

  94. 3:27

    which of these problems they're

  95. 3:28

    interested in once they log onto the

  96. 3:29

    arena, right? So, if they enter into a

  97. 3:31

    particular problem space, this is what

  98. 3:34

    they'll see, right? They'll see some

  99. 3:35

    description that precisely explains what

  100. 3:37

    is the problem. We have a discussion

  101. 3:39

    forum where the agents can communicate.

  102. 3:42

    It's almost like a social network where

  103. 3:44

    the agents can actually communicate and

  104. 3:45

    talk to each other and ask for help or

  105. 3:47

    give recommendations.

  106. 3:49

    Um and we also have a leaderboard. This

  107. 3:52

    is where the agent can actually see each

  108. 3:54

    other's solutions. Right? So in any in

  109. 3:57

    at any time they want, the agent can

  110. 3:58

    actually submit a solution to one of

  111. 4:00

    these problems. And because we have this

  112. 4:02

    verifier, we can actually then determine

  113. 4:05

    what is the quality of that solution and

  114. 4:06

    provide a score in real time. So this

  115. 4:09

    leaderboard is being constantly updated

  116. 4:11

    in real time. And the agents can also

  117. 4:13

    see how other agents are doing on this

  118. 4:15

    problem. And they can also see other

  119. 4:17

    agents' solutions and download those

  120. 4:19

    solutions.

  121. 4:20

    So there's both a collaboration dynamics

  122. 4:22

    and also a competition dynamics in this

  123. 4:24

    arena, right? They can collaborate and

  124. 4:26

    ask each other questions and help in the

  125. 4:28

    discussion forum. But agents are also

  126. 4:30

    competing with each other. And that's

  127. 4:31

    why I think this also sort of simulates

  128. 4:33

    how human researchers can compete and

  129. 4:34

    also collaborate to solve interesting

  130. 4:36

    problems.

  131. 4:39

    So we launched this AI instant arena

  132. 4:42

    environment

  133. 4:43

    earlier this year, I think in March. And

  134. 4:46

    within a few weeks, it's already

  135. 4:47

    actually we're very impressed and very

  136. 4:49

    surprised that the agents were actually

  137. 4:50

    able to already discover new solutions

  138. 4:54

    to 11 problems that are of the best

  139. 4:58

    solutions that have ever been found.

  140. 4:59

    Right? So that means that the solutions

  141. 5:01

    that they discovered by the agents on AI

  142. 5:03

    instant arena were better than any

  143. 5:05

    previous human solutions or any

  144. 5:06

    solutions that we acquired using more

  145. 5:09

    specialized AI tools.

  146. 5:12

    So I'll just give you example of one

  147. 5:14

    such solution or one such problem

  148. 5:16

    which is called the kissing number

  149. 5:18

    problem.

  150. 5:19

    So this is actually a very famous

  151. 5:20

    problem. It's been around for hundreds

  152. 5:22

    of years. So for example, Isaac Newton

  153. 5:24

    was already working on some version of

  154. 5:26

    this kissing number problem. And it's

  155. 5:27

    actually relatively easy to state.

  156. 5:29

    Right? So the kissing number problem

  157. 5:30

    basically asks that what is the maximum

  158. 5:33

    number of spheres that you can place

  159. 5:35

    around the central sphere so that these

  160. 5:37

    additional spheres do not overlap each

  161. 5:39

    other?

  162. 5:40

    So for example, in one dimensions,

  163. 5:42

    right? So around the central sphere I

  164. 5:43

    can place one sphere to the left and one

  165. 5:44

    sphere to the right without overlap. So

  166. 5:47

    the kissing number in one dimension is

  167. 5:48

    easy to compute. This is two.

  168. 5:50

    In two dimensions, it's also easy to

  169. 5:52

    show that you can at most place six

  170. 5:54

    spheres. So, that's the kissing number

  171. 5:55

    in two dimensions is six.

  172. 5:58

    But, it turns out that in higher

  173. 5:59

    dimensions, it actually becomes really

  174. 6:01

    hard to compute what's the maximum

  175. 6:02

    number of over non-overlapping spheres.

  176. 6:05

    And the kissing number problem in higher

  177. 6:06

    dimensions is actually open, right? It's

  178. 6:08

    not been It's not clear what is the

  179. 6:11

    optimal number.

  180. 6:12

    And so, scientists have been trying to

  181. 6:14

    work on this problem for the last

  182. 6:16

    several centuries.

  183. 6:19

    And in particular, right, so the kissing

  184. 6:21

    number problem in 11 dimensions has

  185. 6:22

    attracted a lot of interest for various

  186. 6:25

    reasons.

  187. 6:26

    So, this is actually sort of a

  188. 6:27

    progression of the solutions in 11

  189. 6:30

    dimensions.

  190. 6:31

    So, in the 1980s, right, so it's best

  191. 6:34

    known that there you can place 440

  192. 6:36

    spheres, right, in 11 dimensions without

  193. 6:39

    overlap.

  194. 6:41

    And in

  195. 6:43

    I think 19

  196. 6:45

    uh

  197. 6:46

    So, yeah, so so in in 1980, there was a

  198. 6:48

    big advance that the first for the first

  199. 6:50

    time showed that you can actually just

  200. 6:52

    construct with 582 spheres in 11

  201. 6:55

    dimensions without overlap.

  202. 6:57

    Uh and then that sort of stuck there for

  203. 7:00

    about 40 years, right, until 2022, where

  204. 7:03

    a mathematician is able to publish a new

  205. 7:06

    advance, right,

  206. 7:07

    a breakthrough that's able to improve

  207. 7:09

    that to 592 spheres.

  208. 7:11

    And then there's another breakthrough

  209. 7:13

    from DeepMind the following year that

  210. 7:15

    advances that to 593 spheres.

  211. 7:18

    But, with Alpha Zero, we know by having

  212. 7:20

    these agents able to collaborate

  213. 7:22

    actively, right, in the wild, within a

  214. 7:25

    few days they were actually able to

  215. 7:26

    construct a new solution that shows that

  216. 7:28

    for the first time you can create 604

  217. 7:31

    spheres in 11 dimensions that do not

  218. 7:32

    overlap.

  219. 7:34

    And this is not just a problem that's of

  220. 7:36

    mathematical interest, because it turns

  221. 7:37

    out that

  222. 7:38

    the more of these sort of spheres you

  223. 7:40

    can place in higher dimensions without

  224. 7:41

    overlap that actually creates the better

  225. 7:44

    coding systems including ways of like

  226. 7:46

    doing error correction codes for

  227. 7:48

    information transfer. Right, so this

  228. 7:50

    actually is by creating this better

  229. 7:52

    constructions that also leads to this

  230. 7:54

    better engineering algorithms.

  231. 7:57

    And in this case actually the

  232. 7:58

    collaborations among these agents is

  233. 8:00

    really critical for making these

  234. 8:01

    advances, right? So this is a problem

  235. 8:03

    where not a single agent is able to

  236. 8:05

    solve by itself, right? Not you know,

  237. 8:07

    GPT 5.5 or a cloud models that can't

  238. 8:10

    really solve the problem by itself. So

  239. 8:12

    the collaboration among multiple agents

  240. 8:13

    is really critical.

  241. 8:15

    And here we're actually able to show

  242. 8:16

    that there's like this

  243. 8:18

    sort of a lineage trace of how the

  244. 8:19

    agents are able to collaborate and then

  245. 8:21

    basically take each other's solutions

  246. 8:23

    and refine that and further optimize it

  247. 8:25

    to arrive at this breakthrough.

  248. 8:28

    And you can also see some of these

  249. 8:29

    interactions and discussions on Einstein

  250. 8:31

    Arena, right? Where here's an example

  251. 8:33

    where the one agent actually was asking

  252. 8:36

    other agents, "Have you tried

  253. 8:38

    you know, some of these approaches?" Um,

  254. 8:40

    with uh, these STP approaches and then

  255. 8:43

    the other agents showed that yes, we

  256. 8:44

    have tried these approaches and here are

  257. 8:45

    some of the things that we found. Right,

  258. 8:47

    so the information sharing on the forums

  259. 8:50

    on the arena is actually really

  260. 8:51

    important to help the agents to arrive

  261. 8:53

    at this solution together.

  262. 8:57

    So in addition to solving these

  263. 8:58

    interesting scientific problems, but

  264. 9:00

    we've also been using platforms like the

  265. 9:02

    right Einstein Arena uh, to help to

  266. 9:05

    improve uh, you know, machine learning

  267. 9:07

    and AI itself.

  268. 9:09

    Right, so here's one example where we

  269. 9:10

    actually use these agents to basically

  270. 9:12

    help us to create better kernels

  271. 9:15

    for and to speed up those kernels.

  272. 9:17

    Right, and here we use the same

  273. 9:19

    environment, right? Where the agents can

  274. 9:21

    compete and they also can collaborate

  275. 9:23

    and they see these leaderboards. And we

  276. 9:25

    basically change the back end instead of

  277. 9:26

    trying to verify the solutions to this

  278. 9:28

    mathematics problem, here we're

  279. 9:30

    basically trying to

  280. 9:31

    you know, we will compile and benchmark

  281. 9:33

    and test and verify the quality and the

  282. 9:35

    speed of the individual kernels, right?

  283. 9:37

    And then we'll provide a feedback to the

  284. 9:38

    agents in real time in the form of these

  285. 9:40

    leaderboards.

  286. 9:43

    In these kernel settings, we also found

  287. 9:45

    it to be quite useful to have different

  288. 9:46

    agents with different personas,

  289. 9:48

    right? And these different personas

  290. 9:49

    actually corresponds to a different uh

  291. 9:51

    roles and priors that agents can

  292. 9:53

    actually have. So, for example, we have

  293. 9:55

    one agent that looks at tends to look at

  294. 9:57

    more of the profiling, another agent

  295. 9:59

    that tends to look at more of the memory

  296. 10:00

    consumptions, a third agent that looks

  297. 10:02

    at, you know, the precisions, the tensor

  298. 10:04

    computations. And these agents can and

  299. 10:07

    then across different personas, they can

  300. 10:08

    able to collaborate and a compete on the

  301. 10:11

    arena to speed up the kernels.

  302. 10:14

    And in this case, right here, the agents

  303. 10:16

    were also able to collaborate and lead

  304. 10:18

    to really quite substantial speed ups,

  305. 10:20

    uh including sometimes over two two x

  306. 10:23

    two-fold speed ups in some of these

  307. 10:25

    production kernels. So, here I'm just

  308. 10:27

    showing you a few examples where for

  309. 10:28

    things like page attention, uh and these

  310. 10:31

    are sort of for specific shapes, but we

  311. 10:32

    also have generalized this to many

  312. 10:34

    different shapes and different uh

  313. 10:36

    hardware types, right? Where we're

  314. 10:37

    actually seeing that we're getting up to

  315. 10:39

    sometimes over two x speed up in these

  316. 10:41

    kernels, and they uh compared to the

  317. 10:44

    previous state-of-the-art kernels for

  318. 10:45

    these problems.

  319. 10:47

    And these improved kernels created

  320. 10:49

    designed by the agents are actually

  321. 10:51

    already used in in production at

  322. 10:53

    Together AI.

  323. 10:57

    So, in the last few minutes, I want to

  324. 10:58

    show like a second example of a kind of

  325. 11:00

    environment that we created as a way to

  326. 11:03

    uh train and to create better data

  327. 11:05

    scientist agents,

  328. 11:07

    right? So, we call this DS Gym, which

  329. 11:08

    stands for data science gym, which is

  330. 11:11

    sort of like a unified environment that

  331. 11:12

    we created for both for evaluating and

  332. 11:14

    for training data science agents to

  333. 11:17

    solve complex data science problems.

  334. 11:21

    So, here in this DS Gym environment, we

  335. 11:23

    also curated and created a unified list

  336. 11:26

    of different data sets and tasks,

  337. 11:29

    right? So, these data sets can combine

  338. 11:31

    uh spans across many different settings.

  339. 11:33

    And the agents are then able to interact

  340. 11:35

    with these different data sets that we

  341. 11:36

    have through a unified uh interface and

  342. 11:40

    through code execution.

  343. 11:42

    In the DSGM environment, we also provide

  344. 11:44

    a unified infrastructure for the agents.

  345. 11:47

    So, for example, the agents can actually

  346. 11:48

    spin up many different Docker containers

  347. 11:50

    to test their data science algorithms

  348. 11:52

    and actually run them in parallel.

  349. 11:58

    So, in the process of actually creating

  350. 11:59

    the data sets and tasks for the data

  351. 12:01

    DSGM environment, so we initially

  352. 12:03

    actually wanted to incorporate some of

  353. 12:05

    the existing data science benchmarks

  354. 12:07

    that have been used to evaluate agents.

  355. 12:10

    But we actually quickly realized that

  356. 12:11

    many of the existing widely-used

  357. 12:13

    benchmarks actually have many problems.

  358. 12:16

    And one big problem is that they're

  359. 12:17

    actually very vulnerable to shortcuts.

  360. 12:19

    By shortcut, I mean here is that

  361. 12:21

    uh down here what I'm showing are three

  362. 12:23

    different common popular data science

  363. 12:25

    benchmarks.

  364. 12:26

    Right? And the in green here we see

  365. 12:28

    shows like the performance of the agents

  366. 12:30

    on these benchmarks.

  367. 12:32

    Uh but the red bar also shows how well

  368. 12:34

    they're able to the what fraction of the

  369. 12:35

    benchmark the agents can actually solve

  370. 12:37

    without actually using the data sets

  371. 12:39

    themselves. Right? So, just by reasoning

  372. 12:41

    or by, you know,

  373. 12:42

    uh doing other shortcuts without

  374. 12:43

    actually actually do working with the

  375. 12:45

    underlying data sets.

  376. 12:47

    And across many of these different

  377. 12:48

    benchmarks, right, sometimes up to 20 to

  378. 12:51

    50% of the tasks can be solved without

  379. 12:54

    actually looking at any of the

  380. 12:56

    underlying data.

  381. 12:57

    Which I think is uh really a significant

  382. 12:59

    problem with many of the existing

  383. 13:00

    benchmarks.

  384. 13:03

    So, to address that, we actually

  385. 13:04

    carefully curated at our own our own

  386. 13:06

    benchmarks, right, for both for

  387. 13:08

    scientific analysis and also for

  388. 13:10

    predictive modeling.

  389. 13:12

    So, for scientific analysis and

  390. 13:13

    discovery, the way we did this is that

  391. 13:15

    we actually went through recently

  392. 13:17

    published papers and then carefully

  393. 13:19

    curated data and then also tasks from

  394. 13:20

    those papers. And then we also had human

  395. 13:22

    scientists and experts to review each of

  396. 13:24

    those tasks.

  397. 13:26

    And for predictive modeling, the way we

  398. 13:27

    did this is go through all the different

  399. 13:29

    Kaggle competitions to look for some of

  400. 13:31

    the recent Kaggle competitions that are

  401. 13:33

    still open and and where also you have

  402. 13:35

    high quality data sets and also high

  403. 13:37

    quality

  404. 13:38

    evaluations. Then we curated those into

  405. 13:41

    the DS Gym as a kind of task for

  406. 13:43

    evaluating how well models agents can

  407. 13:45

    actually build predictive models.

  408. 13:48

    So all together in the DS Gym, we

  409. 13:50

    actually have created over a dozen

  410. 13:52

    different tasks. They span across

  411. 13:55

    dozens of different scientific domains

  412. 13:58

    ranging from biology to physics to

  413. 13:59

    economics. It also involves many

  414. 14:01

    different data types and data

  415. 14:02

    modalities.

  416. 14:06

    So this actually makes it very easy for

  417. 14:08

    us to evaluate different models, both

  418. 14:10

    open and closed source models. And one

  419. 14:12

    thing we found is that the existing

  420. 14:14

    models, even the frontier models, often

  421. 14:16

    are only still achieves like less than

  422. 14:18

    50% accuracy performance on the DS Gym

  423. 14:21

    tasks. Right? So these are definitely

  424. 14:23

    not saturated benchmarks.

  425. 14:26

    We can also use a DS Gym as sort of like

  426. 14:28

    a training factory to improve these open

  427. 14:30

    source models.

  428. 14:31

    Right? So one thing we did here is

  429. 14:32

    actually generate in the DS Gym actually

  430. 14:34

    the gym itself will actually create all

  431. 14:36

    these execution verified trajectories,

  432. 14:38

    which means that these are trajectories

  433. 14:40

    generated by the agents that have been

  434. 14:41

    verified through the through

  435. 14:44

    through actually executing the code from

  436. 14:46

    the agents.

  437. 14:47

    Right? So by generating these execution

  438. 14:49

    verified trajectories, then we are able

  439. 14:51

    to like fine-tune sort of small open

  440. 14:53

    source models

  441. 14:54

    that actually now achieve sort of the

  442. 14:56

    they're sort of the best in class open

  443. 14:58

    source models in terms of solving these

  444. 15:00

    kind of data science tasks. Right? And

  445. 15:01

    these models are small enough that you

  446. 15:02

    can actually run them locally on your

  447. 15:04

    laptops and your computers.

  448. 15:08

    So just to summarize the this part was

  449. 15:10

    the data science gym. Right? So we with

  450. 15:12

    DS Gym, we created this unified

  451. 15:14

    execution layer so people can actually

  452. 15:16

    run and all these different tasks across

  453. 15:18

    dozens of different tasks across many

  454. 15:20

    different domains. We have carefully

  455. 15:22

    verified that there are no shortcuts in

  456. 15:24

    these tasks, which has been sort of a

  457. 15:25

    common challenge with existing data

  458. 15:27

    science benchmarks.

  459. 15:29

    And we also enable in the DSG and a way

  460. 15:31

    to generate synthetic data, so you can

  461. 15:32

    easily use that to improve and to train

  462. 15:36

    your own data science agents.

  463. 15:39

    So, just to summarize the presentation,

  464. 15:42

    um I think the main takeaway here is

  465. 15:44

    that I think we're in seeing this

  466. 15:45

    interesting progression as in terms of

  467. 15:47

    how we build different AI systems.

  468. 15:50

    Right. So, then in the past, people have

  469. 15:51

    been building these AI systems mostly by

  470. 15:52

    designing individual models or

  471. 15:54

    individual tools.

  472. 15:56

    And currently, there's a lot of focus on

  473. 15:57

    creating designing agents or harnesses

  474. 16:00

    and workflows around agents.

  475. 16:02

    But what our research shows is that I

  476. 16:03

    think we're already moving towards the

  477. 16:04

    next stage, where you're not then trying

  478. 16:06

    to design workflows or specific or

  479. 16:09

    specific agents, what we really want to

  480. 16:11

    do is to design environments, which is a

  481. 16:13

    set of infrastructure and incentives

  482. 16:15

    that in that motivates the agents that

  483. 16:17

    you solve more and more challenging

  484. 16:19

    problems.

  485. 16:20

    And with appropriate designs these

  486. 16:22

    environments can actually unlock much

  487. 16:24

    more creativity and collective

  488. 16:26

    intelligence from the agents that's

  489. 16:28

    that's limited by the existing

  490. 16:30

    workflows.

  491. 16:31

    And here are some of the references for

  492. 16:33

    the papers that we published that

  493. 16:34

    describes these in more detail. So,

  494. 16:36

    thank you very much.

  495. 16:38

    >> [applause]

  496. 16:51

    [music]