AI Engineer World's Fair 2026

We Let Claude Code and Codex Race Human Researchers — Elie Bakouch, Prime Intellect

Read the talk

We Let Claude Code and Codex Race Human Researchers

Elie Bakouch’s Optimizer Speedrun experiments show coding agents improving a hard-won community record. Their persistence, memory and literature search reveal useful research capabilities—and a gap between improving existing methods and discovering new ones.

From a talk by Elie Bakouch

At a glance

Ideas worth remembering

  • The Optimizer Speedrun constrains changes to optimizer-related methods, giving research agents a measurable target and a short experimental cycle.

  • Both agents reportedly improved the human record, but access to community submissions made this a test of extending available research as well as independent search.

  • Persistence, memory writing, delegation and token use differed substantially between agents; elapsed-time progress and output-token efficiency also produced different comparisons.

  • The agents combined existing ideas and improved records without producing a novel optimizer. The proposed next step adds qualitative judgment, human guidance and larger-scale tests to measured speedrun rewards.

Give automated research a result outsiders can check

Recursive self-improvement needs a test. In this recording, Elie Bakouch, a research engineer at Prime Intellect, starts with the prospect of models training models without human intervention. Large labs have described that prospect as approaching, but his concern is how researchers outside those labs can measure the capability for themselves.

Source frame: Give automated research a result outsiders can check
Source frame: Give automated research a result outsiders can check

The question reaches beyond AI training. If scientific research increasingly uses AI tools, researchers need to understand how those tools search, run experiments and respond to failure. A constrained training challenge offers a place to observe that behavior: an agent proposes a change, runs it and gets a measurable result.

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

From faster GPT-2 training to fewer optimizer steps

The starting point is the GPT-2 training speedrun. The challenge treats reaching a target validation loss as its finish line: train a model until its loss matches the GPT-2 reference, then compare how long that took. Matching this loss supplies a useful benchmark proxy; it does not establish that every aspect of the resulting model’s behavior matches GPT-2.

Source frame: From faster GPT-2 training to fewer optimizer steps
Source frame: From faster GPT-2 training to fewer optimizer steps

The community’s modded-nanogpt effort pushed the reported training time from roughly 90 minutes through 45 minutes to less than two minutes over about two years. That history matters: the agents would enter a challenge that talented researchers had already spent substantial effort improving, rather than collect an easy win against an untouched baseline.

Two versions of the challenge expose different kinds of improvement:

  • Training speedrun: Reach the target loss in the shortest time. The training and validation data stay fixed, while architecture and other implementation choices can change.
  • Optimizer Speedrun: Change only optimizer-related parameters and methods. The comparison focuses on reducing the training steps needed to reach the target, making the search more about the learning method than making the program execute faster.

Speedruns also make a plausible training environment for research agents. A record improvement can receive a positive reward; a failed attempt can receive zero or a negative reward. Clear rules make proposals checkable, and short experiments make iteration practical. Bakouch describes optimizer runs taking about 15–20 minutes, long enough to test a training method but short enough to try many candidates.

2:002:03
Suggest correction

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

1:53 · section reference included

Turn a proposal into a cluster experiment

The initial experiment put Claude Code and Codex on Prime Intellect’s cluster and let them iterate against the community. Runs labeled V1, V2 and V3 represented stopping and restarting the agents. Near the end, after newer human submissions had overtaken their results, the agents were explicitly asked to take the recent community records and improve them. A separate novelty track asked for improvements using novel ideas.

Source frame: Turn a proposal into a cluster experiment
Source frame: Turn a proposal into a cluster experiment

The harness was deliberately simple. A goal.md file supplied the objective, and an AGENTS.md file supplied rules. The agent proposed an experiment and submitted it with sbatch to a Slurm cluster. Jobs used available nodes under preemptible permissions: if another user needed a node, the experiment could be canceled. This let the search use spare compute while yielding capacity to other work.

After training, the agent read the logs and decided whether the candidate qualified as a record. Acceptance required passing a statistical threshold so that random variation would not masquerade as an optimizer improvement. How does an idea become evidence in this setup? The flow below separates proposing a change, obtaining compute and checking the result; writing a promising method is only the first step.

How it fits togetherFrom research proposal to checked result

goal.md and AGENTS.md define the task.

Cluster execution produces training logs; a statistical check determines whether an apparent gain counts as a record.

5:325:39
Suggest correction

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

5:32 · section reference included

Persistence, scratchpads and the cost of staying busy

The first striking difference was whether the agents kept working. Claude Code stopped every nine or ten hours, concluding that it could not improve the record. Bakouch prompted it to continue exploring, after which it worked for another stretch and stopped again. Waiting for those interventions left it idle for roughly one-third of the time. Codex, by contrast, stayed active almost continuously and rarely asked questions.

Source frame: Persistence, scratchpads and the cost of staying busy
Source frame: Persistence, scratchpads and the cost of staying busy

The agents also had a scratchpad: files serving as active memory for the research process. Their behavior differed even after normalizing activity by active hours, so the differences were not merely a consequence of Codex running longer.

  • Memory writing: Codex wrote substantially more scratchpad material. Its notes recorded actions, decisions and next steps; Claude’s notes celebrated new records with a more excited tone and emojis.
  • Delegation: Codex spawned more subagents, distributing more work across agent processes.
  • Token use and compaction: Codex consumed more tokens in this initial experiment and compacted its context more frequently. The large total included cached input tokens, so it should not be read as an equivalent quantity of newly generated output.
7:427:49
Suggest correction

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

7:42 · section reference included

Beating the record—and deciding what that measures

Bakouch reports that both agents surpassed the human record. The reported gains were roughly tens of training steps against a baseline of roughly 2,990 steps; the captions leave the precise gains and their assignment to each agent uncertain. These are reported experimental results rather than an independently verified benchmark, and the comparison allowed agents to fetch new human records throughout the run. It therefore measures their ability to extend available research as well as their own search.

Source frame: Beating the record—and deciding what that measures
Source frame: Beating the record—and deciding what that measures

Claude’s restart provides a concrete example of that distinction. The community advanced the record while the experiment was running. Once restarted, Claude fetched the newer human result, used it as the starting point and improved it. The observable change was a better record after incorporating a better baseline. Access to current research altered the search’s starting point; the agent did not need to recreate all the progress that produced that baseline.

A more controlled benchmark was still under development. It would use multiple seeds and comparable conditions for models and harnesses, then separate three sources of research capability:

  • No external access: Work from knowledge stored in the model’s weights.
  • Paper access: Consult research papers, without receiving the full stream of community solutions.
  • Full access: Use external information, including the latest human records.

The plan covered both the original training speedrun and an optimizer challenge requiring novelty. Separating access conditions would make it easier to distinguish recalling a method, finding one in the literature and improving a known submission.

10:2010:23
Suggest correction

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

10:20 · section reference included

Add judgment and larger-scale tests to the search

The proposed next step changes the system around the agents. Inspired by AlphaEvolve, the design uses multiple generators—including closed models and cost-effective open models—to suggest ideas. Speedrun execution supplies a measurable reward, while a judge supplies qualitative feedback about the method. Humans can judge proposals and steer the search toward promising directions.

Source frame: Add judgment and larger-scale tests to the search
Source frame: Add judgment and larger-scale tests to the search

Which small-scale gains deserve a larger experiment? The proposed loop makes that selection explicit. Promising methods move to training with more parameters and more tokens, because a speedrun success may fail to carry over to large-scale training. Numerical reward identifies a local improvement; qualitative judgment helps select what to pursue; larger experiments test whether the improvement travels.

This was a discovery design being tried, with new discoveries still a hoped-for outcome. Another way to direct the search is to change the speedrun itself: different objectives and constraints create different search spaces. Rather than ask every generator the same broad question, a family of challenges can push exploration toward different kinds of methods.

How it fits togetherThe proposed path from ideas to scale

Closed and open models suggest methods.

A speedrun result and qualitative feedback inform which methods deserve larger training runs. Human guidance helps steer the search.

15:3615:41
Suggest correction

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

15:36 · section reference included

Build the research environment—and keep it open

Prime Intellect’s closing roadmap addresses the infrastructure needed to run this kind of search. Much of it was still unreleased: GPU sandboxes for experiments, agents that use a filesystem to write and retrieve information, programmatic tool use, and training open models to work well in that environment. The company also described already released tools for training and evaluating models across environments and agent harnesses.

Source frame: Build the research environment—and keep it open
Source frame: Build the research environment—and keep it open

The final motivation returns to participation. Researchers outside large labs need a way to understand how models do research and to take part in improving the process. Open experiments can expose the useful work—persistent iteration, literature search and tested combinations—alongside the point where the agents still fall short: inventing a new optimizer. That visibility is the foundation for deciding what to build next.

17:5217:53
Suggest correction

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

17:47 · section reference included

Read the complete timestamped transcript
  1. 0:12

    Hey um hi everyone. Uh thanks for being

  2. 0:15

    here. Uh yeah, I'm super happy today to

  3. 0:18

    talk about uh automated eye research and

  4. 0:21

    uh especially uh all those like frontier

  5. 0:24

    model uh perform at uh automated eye

  6. 0:27

    research task. Um so I'm Elie. I worked

  7. 0:30

    at Prime Intellect as a research

  8. 0:32

    engineer and uh yeah I will go through

  9. 0:34

    our work on on this subject. So first I

  10. 0:38

    want to basically explain a bit why we

  11. 0:40

    are doing that and why we think it's

  12. 0:43

    super important to do that in the open.

  13. 0:45

    Um so first uh I think we we all agree

  14. 0:50

    that uh we've heard about like big labs

  15. 0:53

    saying that this bad thing called

  16. 0:55

    recursive self-improvement is coming

  17. 0:58

    very soon. Uh so recursive

  18. 1:00

    self-improvement is like model training

  19. 1:02

    models uh without uh human intervention

  20. 1:05

    basically. Um but uh we don't have any

  21. 1:09

    benchmark to basically quantify if this

  22. 1:11

    is true or not right. Uh and even less

  23. 1:15

    we don't have like a third party

  24. 1:17

    benchmark by non- big labs to to to see

  25. 1:21

    if it's something coming soon or not.

  26. 1:23

    And the other part is that we think that

  27. 1:26

    uh it's super important to understand

  28. 1:29

    all those model uh do research because

  29. 1:31

    we think that a lot of the scientific

  30. 1:33

    research that will come into the coming

  31. 1:35

    years uh will be based also on AI tools.

  32. 1:39

    So it's super important to understand

  33. 1:41

    how those model do research not just

  34. 1:43

    only AI research. So we try to build

  35. 1:46

    kind of this environment to test the

  36. 1:50

    capabilities of the model to do so. So

  37. 1:53

    it all started with uh Andre Karpati uh

  38. 1:56

    that's basically had fun by doing this

  39. 2:00

    video where he trained uh GPT2 from

  40. 2:03

    scratch in like 90 minutes like GPT2

  41. 2:07

    training takes like weeks and uh no in

  42. 2:10

    two years ago I think it only took like

  43. 2:12

    90 minutes. So what does it mean to

  44. 2:15

    reprod reproduce uh GPT2 in 90 minutes?

  45. 2:18

    It means that in 90 minutes you achieve

  46. 2:20

    this target loss. Um and yeah and that's

  47. 2:24

    at this point when you have the same

  48. 2:26

    loss than GPT2

  49. 2:29

    you consider that your model is somewhat

  50. 2:32

    of equal performance.

  51. 2:34

    Um

  52. 2:35

    then what happened is that the community

  53. 2:38

    took this repo uh this GitHub repo and

  54. 2:40

    create another one called moed nano GPT

  55. 2:43

    and this effort was leaded by someone

  56. 2:46

    called Keller Jordan. And what happened

  57. 2:48

    is that they basically

  58. 2:51

    took this 90 minutes then 45 minutes and

  59. 2:54

    then now we can train like GPT2

  60. 2:56

    validation loss model in less than two

  61. 2:59

    minutes which is honestly crazy and it

  62. 3:01

    took like two years to to achieve this.

  63. 3:04

    So it's a very strong benchmark where uh

  64. 3:06

    a lot of very talented researcher

  65. 3:09

    iterated on um yeah so we decided to

  66. 3:13

    take this environment of speedun so

  67. 3:17

    it's kind of a game so the goal of the

  68. 3:20

    game is to achieve this loss in the

  69. 3:22

    fewest in the shortest amount of time so

  70. 3:26

    this is the nano GPT1 and you can uh you

  71. 3:29

    don't have almost any constraints the

  72. 3:32

    only constraint that you shots that you

  73. 3:34

    need to use the same validation and

  74. 3:36

    training data, right? Um there is a new

  75. 3:39

    speedrun called the optimizer speedrun

  76. 3:41

    that was released uh a few months ago

  77. 3:44

    and here it's slightly different because

  78. 3:47

    uh you can only change the optimizer

  79. 3:49

    related parameters. So for instance nano

  80. 3:53

    GPT you can change the architecture uh

  81. 3:55

    do

  82. 3:57

    uh attention whatever uh optimizer sp

  83. 4:00

    you can only change like Adam to m

  84. 4:03

    shampoo or whatever optimizer is your

  85. 4:07

    favorite

  86. 4:08

    um yeah and so this is a bit more

  87. 4:12

    researchy because uh it's less about

  88. 4:15

    optimizing the program to be as fast as

  89. 4:18

    possible but more like finding the best

  90. 4:20

    method possible. no matter the the the

  91. 4:22

    time you put into the computer, right?

  92. 4:26

    So, um yeah, why take speedrun as an

  93. 4:29

    environment for automated AI research?

  94. 4:33

    First, uh we think that it's a good

  95. 4:35

    evaluation. We'll see later why. Uh and

  96. 4:38

    this is kind of the main focus of this

  97. 4:39

    talk. But we also think it's probably a

  98. 4:42

    good training environment because uh

  99. 4:45

    it's a way to give the model a reward.

  100. 4:47

    So the reward is positive if the model

  101. 4:50

    bit the speed run and beat the last

  102. 4:52

    record sorry and the reward is zero or

  103. 4:56

    negative if it didn't manage to to do

  104. 4:58

    it. So it's a good uh environment to

  105. 5:00

    train model. It's also quite fast like

  106. 5:02

    as you see uh previous record were

  107. 5:05

    around 2 minutes for the optimizer one.

  108. 5:08

    uh each run take about like 15 to 20

  109. 5:11

    minutes and uh yeah and there is like

  110. 5:13

    clear rules basically and we also think

  111. 5:17

    it's like a good environment to make

  112. 5:19

    discovery so like kind of breakthrough

  113. 5:22

    in our research because uh there is

  114. 5:24

    those clear rule that you can verify or

  115. 5:27

    not. Um yeah. So yeah.

  116. 5:32

    Um so what we did uh so the release was

  117. 5:36

    like about two months ago and uh there

  118. 5:39

    was this optimizer speedrun and we

  119. 5:41

    decided to basically compete with the

  120. 5:43

    community by launching two AI agents. So

  121. 5:47

    Codex and Cloud Code. Codex was like GPT

  122. 5:49

    5.5 with XI and uh cloud code was Opus

  123. 5:54

    4.8 with XI. Um and yeah, we decided to

  124. 5:59

    basically let the agent free on our

  125. 6:01

    cluster uh and uh and just iterate on

  126. 6:04

    it. So we have like V1, V2, V3 is just

  127. 6:07

    basically us stopping the agent and then

  128. 6:10

    restarting. V3 uh was like one or two

  129. 6:13

    day before the release because we saw

  130. 6:15

    that our agents no longer have the best

  131. 6:18

    record. So we were like okay take all

  132. 6:20

    the the human uh record in the last few

  133. 6:24

    week and just try to to improve upon it

  134. 6:27

    and and and it worked. Yeah. And we also

  135. 6:29

    have this novelty track where the goal

  136. 6:31

    is to uh beat the record with only novel

  137. 6:35

    ideas. Um and we'll see that this this

  138. 6:40

    was more complex for the the models.

  139. 6:43

    So our RS is very simple. Honestly, we

  140. 6:46

    could have just replaced it with

  141. 6:48

    slashgo, but they there was no SLG goal

  142. 6:50

    at the time. So, we made our own goalm.

  143. 6:53

    It's actually quite fun that we choose

  144. 6:55

    the same name and we had the goal. MD

  145. 6:58

    and kind of agents that MD that define

  146. 7:00

    the rules and we let the agent propose

  147. 7:03

    ids and then it can submit a job with

  148. 7:07

    sbatch on our slum cluster and uh

  149. 7:11

    basically the way it works is that it

  150. 7:14

    can submit on nodes that are available

  151. 7:16

    but only under a certain permission

  152. 7:18

    which means that if someone want to use

  153. 7:20

    this node uh the model just like cancel

  154. 7:23

    the job it's called preemptable

  155. 7:25

    permission. So yeah, then it measure the

  156. 7:28

    it read basically the training logs then

  157. 7:31

    decide if it's a record or not. To

  158. 7:32

    validate a record you need to basically

  159. 7:34

    pass a statistical threshold to make

  160. 7:36

    sure that it's just not see the

  161. 7:38

    optimization and is just not random.

  162. 7:40

    Right?

  163. 7:42

    So yeah a few results from this

  164. 7:44

    experiment. The first one that was

  165. 7:46

    honestly very painful to work with is

  166. 7:49

    that code clothes code keep stopping

  167. 7:52

    every nine or 10 hours and basically

  168. 7:54

    said yeah I cannot improve the record

  169. 7:57

    it's too hard for me there is no way to

  170. 8:00

    to go beyond it and then I was just like

  171. 8:03

    okay continue explore new direction hey

  172. 8:06

    just go again for 10 hours and then say

  173. 8:09

    yeah I cannot beat the recall and so on.

  174. 8:12

    So basically onethird of the time the

  175. 8:14

    cloud code agent was idle because I had

  176. 8:16

    no way to basically monitor it and

  177. 8:19

    codeex totally the opposite just worked

  178. 8:23

    for all the all the time and uh yeah

  179. 8:26

    almost never idle never asked for

  180. 8:28

    question and and and very impressive in

  181. 8:30

    that way. Um

  182. 8:33

    we also give the option for the model to

  183. 8:36

    basically write uh a bunch of stuff into

  184. 8:39

    what we call a scratch pad which is

  185. 8:41

    basically the active memory of the

  186. 8:43

    model. Uh we observe that basically

  187. 8:47

    codeex writes a lot on the scratch

  188. 8:50

    patch. So each plot that I will show are

  189. 8:52

    kind of normalized by the number of

  190. 8:54

    active order. So this is not only about

  191. 8:57

    codex working more it's it's really

  192. 9:00

    different behavior.

  193. 9:02

    So yeah, you see that uh writes a lot

  194. 9:04

    more to to this scratch pad to this

  195. 9:07

    memory and uh the shape of the like the

  196. 9:10

    the I don't know the tone of the the

  197. 9:13

    each file was also super different like

  198. 9:15

    CL was super excited about getting new

  199. 9:17

    record with a bunch of emoji and so on

  200. 9:20

    and CEX was just like here is what I do

  201. 9:24

    here is the decision I take what I will

  202. 9:26

    do next like super robotic kind of um

  203. 9:31

    Yeah, we also have this plot where

  204. 9:34

    basically we saw that codex was spawning

  205. 9:36

    much more sub aents than cloud. Uh we

  206. 9:39

    saw that codex burn much more token than

  207. 9:42

    code. So I think in total it was like

  208. 9:45

    kind billion of token but it's like

  209. 9:48

    there is obviously this input tok uh

  210. 9:50

    input caching that make it it's not like

  211. 9:54

    one billion output token. Uh so yeah we

  212. 9:57

    also see that codex did a lot of

  213. 9:58

    compaction because it only had like 250k

  214. 10:02

    context window and cloud only do it like

  215. 10:04

    one per hour and codex is more like

  216. 10:08

    no it's even less than one power for I

  217. 10:11

    mean one for the full run for code and

  218. 10:13

    codex was like one uh was 20 every one

  219. 10:17

    hour. So yeah

  220. 10:20

    um yeah here is the main results. So

  221. 10:23

    what this plot shows is that basically

  222. 10:26

    we so in in white you see that the human

  223. 10:32

    record progression right and in red you

  224. 10:35

    see cloud I mean it's supposed to be

  225. 10:37

    orange but whatever and in blue uh you

  226. 10:40

    see codeex right and you see that at

  227. 10:43

    almost every time uh cloud and codex are

  228. 10:46

    better than the human record and code is

  229. 10:48

    super good at the beginning very very

  230. 10:50

    fast to achieve very good

  231. 10:53

    Um yeah and one thing that is super

  232. 10:56

    important is that the model have the

  233. 10:57

    ability to basically fetch the human

  234. 11:00

    records at any time and that's what

  235. 11:02

    codex did that's what cloud did sorry

  236. 11:05

    because when I restarted it it basically

  237. 11:07

    fetch the new record from human and

  238. 11:09

    improve upon it um yeah so the result is

  239. 11:13

    that uh I think at the time the best uh

  240. 11:17

    record was like uh 2,990

  241. 11:22

    step and we beat it by like uh uh 50 or

  242. 11:26

    60 step for code and codeex was like 20

  243. 11:29

    step above. So I think it's both

  244. 11:31

    impressive and and yeah um

  245. 11:34

    so we so this is like not released yet.

  246. 11:38

    This is something that we are working on

  247. 11:39

    currently and basically the idea is that

  248. 11:42

    this is a cool experiment to do but it

  249. 11:45

    lack of structured right. uh if you want

  250. 11:47

    to do a real benchmark, you want to do

  251. 11:50

    multiple seed, you want to do uh yeah

  252. 11:53

    proper uh thing where you you you you

  253. 11:56

    basically put all the model and

  254. 11:58

    earnestness in the same condition,

  255. 11:59

    right? So this is what we are working on

  256. 12:02

    right now and basically um the idea is

  257. 12:06

    to do three different track uh one

  258. 12:08

    without any access to really like

  259. 12:11

    measure the capability of the models to

  260. 12:13

    do AI research based on only the model

  261. 12:16

    weight knowledge one with only archive

  262. 12:19

    paper and one with like full access. So

  263. 12:22

    it also have access to the the like the

  264. 12:25

    latest record by human. And for this we

  265. 12:28

    plan to do both uh the nano GPT track

  266. 12:31

    one which is the original one and the

  267. 12:33

    optimizer speedun where we we only

  268. 12:36

    launch uh we only constrain the the

  269. 12:39

    optimizer to be to be novel basically.

  270. 12:42

    Um yeah so I will present some result on

  271. 12:45

    the optimizer speedrun. Uh this is

  272. 12:48

    basically what we got. So we let the

  273. 12:51

    agent iterate for six day almost five

  274. 12:54

    days let's say and we see that uh codeex

  275. 12:58

    k and clothes uh are super effective so

  276. 13:02

    for GLM this is not finished run right

  277. 13:05

    so the model is actually still iterating

  278. 13:08

    on the cluster right now but we see that

  279. 13:11

    cloud is once again very good at it and

  280. 13:13

    we see that surprisingly Kim is also

  281. 13:15

    very competitive and kind of have this

  282. 13:18

    breakthrough on day four where he kind

  283. 13:21

    of beat Codex with a new record, right?

  284. 13:24

    It's also interesting to see that uh

  285. 13:28

    Claude is much more like progressive in

  286. 13:30

    the way it improved the record and Kim

  287. 13:32

    has really this step function where I

  288. 13:34

    kind of do a breakthrough and so on. Uh

  289. 13:37

    so this is an interesting plot because I

  290. 13:40

    mean six day is quite a lot for anal uh

  291. 13:43

    uh but you you can change this uh axis

  292. 13:46

    by also the number of output token and

  293. 13:48

    then kind of tell a different story

  294. 13:50

    because in max mode consumes so much

  295. 13:54

    more token than codeex and kimmy and you

  296. 13:57

    also see that Kimmy is actually super

  297. 13:59

    efficient uh for the number of token

  298. 14:02

    that uh it uses. So it's scheming K2.7

  299. 14:05

    code. Um so yeah uh we also see that

  300. 14:10

    they have a different approach to uh

  301. 14:13

    using the literature and papers. Um so

  302. 14:17

    for instance like code is doing a lot of

  303. 14:20

    search on papers and actually include

  304. 14:22

    found a paper that no other model found

  305. 14:24

    and it actually lead to the best record.

  306. 14:27

    So it's kind of funny and uh yeah um one

  307. 14:33

    of the main issue of all of this is that

  308. 14:36

    uh when I when I launched this this

  309. 14:39

    agent and I think that's something

  310. 14:41

    important that I want you to to kind of

  311. 14:44

    uh remember for this co this talk is

  312. 14:47

    that when I launched this these

  313. 14:48

    different agents I was expecting them to

  314. 14:51

    come up with some crazy ideas on

  315. 14:53

    optimizer that's like no one of discover

  316. 14:56

    but honestly it wasn't the case. Uh they

  317. 14:58

    did some clever trick where basically

  318. 15:00

    they combine different papers. uh they

  319. 15:04

    kind of do plus one improvement over a

  320. 15:06

    bunch of method but there was really

  321. 15:08

    like no novel optimizer or mechanism

  322. 15:11

    that was uh coming from those model and

  323. 15:14

    I think that's kind of telling that even

  324. 15:17

    on something that is not simple but I'd

  325. 15:20

    say that it's kind of accessible for

  326. 15:23

    people right for like human researcher

  327. 15:26

    uh spending like days and weeks for the

  328. 15:29

    the model like cannot like find new uh

  329. 15:33

    optimizer and mechanism. So we believe

  330. 15:36

    that there is a way to basically make it

  331. 15:41

    more um make it better for discovery

  332. 15:44

    instead of evaluation and this is coming

  333. 15:46

    from uh this is very inspired from alpha

  334. 15:49

    evolve by Google and also a bunch of

  335. 15:52

    papers that have been released since

  336. 15:53

    then. It's kind of this multi- aent

  337. 15:55

    system that interact together uh bunch

  338. 15:58

    of generator. You have closed model but

  339. 16:02

    you also have open source model here

  340. 16:03

    that are super effective for the cost

  341. 16:05

    right. Uh they can suggest ideas then

  342. 16:08

    you run the speedrun so you get the

  343. 16:10

    reward then you have a judge that

  344. 16:12

    basically give a quality feedback can

  345. 16:14

    also be like the judge also have this

  346. 16:17

    taste. you can kind of have like the

  347. 16:20

    judge have a taste about the the method

  348. 16:23

    if it's good or not uh if it's outside

  349. 16:26

    the loop and then you can uh basically

  350. 16:30

    decide which method you want to scale to

  351. 16:33

    a larger number of parameters and number

  352. 16:36

    of token. Um so this is kind of the

  353. 16:39

    scale part of the speedrun because some

  354. 16:42

    a lot of method in the the speedrun

  355. 16:44

    community uh people are often saying

  356. 16:47

    that they doesn't work at large scale.

  357. 16:48

    So I think it's very important to also

  358. 16:50

    put scale elements in this loop. Uh and

  359. 16:54

    I think also that uh human are super

  360. 16:58

    useful here to basically judge the ID of

  361. 17:01

    agents kind of steer them in the right

  362. 17:03

    direction and so on. Um yeah so we

  363. 17:06

    didn't try it yet I mean we are kind of

  364. 17:09

    trying it right now and uh we hope that

  365. 17:12

    this will lead to to to new discovery in

  366. 17:15

    AI research at least and also a way is

  367. 17:18

    that you can define multiple speedrun so

  368. 17:22

    this is the next slide if you like it's

  369. 17:24

    from safe bank slides but if you if you

  370. 17:28

    don't have the reference good for you

  371. 17:29

    means that that you're not too online uh

  372. 17:32

    but the idea is that uh by changing the

  373. 17:34

    object objective and the constraints of

  374. 17:37

    the speedrun you can basically create a

  375. 17:39

    lot of diversity and constrain the model

  376. 17:41

    to go into a certain direction and uh

  377. 17:44

    yeah and make those discovery.

  378. 17:47

    So uh at HIM in Ind.

  379. 17:52

    Uh there is a bunch of stuff here that

  380. 17:53

    we I mean most of it we didn't release

  381. 17:55

    yet but we are working on GPU sandboxing

  382. 17:59

    to allow model to iterate into sandbox

  383. 18:02

    because you need GPU sandbox for this

  384. 18:04

    kind of stuff. We are working on our own

  385. 18:07

    agents that are very efficient for like

  386. 18:12

    RM framework. So it means like you have

  387. 18:14

    a file system and you can write

  388. 18:16

    information read from it. Uh and you

  389. 18:18

    also do like this programmatic tool

  390. 18:20

    coding thing. We also training a model

  391. 18:22

    to be good at it on top of like open

  392. 18:24

    source model. And uh the thing that we

  393. 18:27

    already released is that we have those

  394. 18:29

    set of liberation and product called

  395. 18:31

    verifier primaril training where you can

  396. 18:34

    basically train evaluate any

  397. 18:36

    environments on any RS and the model

  398. 18:40

    that you can train can be like GNM 5.2

  399. 18:42

    too which is very big and and yeah we

  400. 18:44

    have like we work a lot on making those

  401. 18:46

    li very efficient to to ship the best

  402. 18:49

    quality for for our clients. Yeah. Uh I

  403. 18:54

    mean yeah super excited about this

  404. 18:55

    domain. Once again I think it's super

  405. 18:57

    important to have uh a part of like this

  406. 19:01

    recursive self-improvement to happen in

  407. 19:03

    the open because there is actually a lot

  408. 19:05

    of people working that are not on big

  409. 19:08

    labs. So you need to basically uh yeah

  410. 19:12

    make it easy for people to understand

  411. 19:13

    all those model work to do research and

  412. 19:15

    so on. So that's kind of our goal and uh

  413. 19:18

    yeah thanks a lot.