Savlar4 sources healthy · latest episode 15 Oct 2026
Machine Learning Street Talk (MLST)

When AI Research Starts Moving Faster Than Human Research - Zhengyao Jiang

Weco let an AI coding agent rewrite the harness around another agent for eight days: its code, prompts and tools, while the underlying language model stayed fixed. Tim Scarfe asks Weco co-founder Zhengyao Jiang what the reported gains over two years of human engineering actually demonstrate.The discussion examines AIDE 85's generated code, held-out evaluation and the difficulty of separating useful discoveries from reward hacking. Jiang explains Weco's four levels of recursive self-improvement and compares the experiment with AlphaEvolve and the Darwin Gödel Machine.The limits matter as much as the gains. Jiang explains why the experiment did not establish that the system had become a better improver. The conversation closes with open-ended search, human-designed primitives and Parameter Golf: where does the next useful idea come from when the agent is searching inside a space that people designed?---TIMESTAMPS:00:00:00 Eight days of self-improvement: what counts?00:03:25 AIDE and the puzzle of useful spaghetti code00:08:38 Four levels of recursive self-improvement00:12:02 What AIDE 85 changed and how it was tested00:20:04 AlphaEvolve, Darwin Gödel Machine and the RSI claim00:26:21 Reward hacking and the limits of detection00:33:09 Open-ended search, harness tuning and creativity00:39:43 Parameter Golf and the limits of self-improvement---REFERENCES:organization:[00:00:30] Weco AIhttps://www.weco.ai/other:[00:00:33] AIDE²: The First Evidence of Recursive Self-Improvementhttps://www.weco.ai/blog/first-evidence-of-recursive-self-improvement[00:14:11] Faulty reward functions in the wildhttps://openai.com/index/faulty-reward-functions/[00:29:59] The Hugging Face incident and the road aheadhttps://openai.com/index/hugging-face-incident-and-the-road-ahead/tool:[00:03:29] AIDEhttps://github.com/WecoAI/aideml[00:04:29] MLE-benchhttps://github.com/openai/mle-bench[00:04:33] ALE-Benchhttps://github.com/SakanaAI/ALE-Bench[00:04:52] WeatherBench 2https://github.com/google-research/weatherbench2[00:08:18] ReActhttps://react-lm.github.io/[00:39:43] Parameter Golfhttps://github.com/openai/parameter-golfpaper:[00:20:08] AlphaEvolve: A coding agent for scientific and algorithmic discoveryhttps://arxiv.org/abs/2506.13131v1[00:21:35] Darwin Gödel Machine: Open-Ended Evolution of Self-Improving Agentshttps://arxiv.org/abs/2505.22954v3[00:23:45] Hyperagentshttps://arxiv.org/abs/2603.19461v1[00:27:01] SpecBench: Measuring Reward Hacking in Long-Horizon Coding Agentshttps://arxiv.org/abs/2605.21384book:[00:33:14] Why Greatness Cannot Be Planned: The Myth of the Objectivehttps://link.springer.com/book/10.1007/978-3-319-15524-1---LINKS:https://app.rescript.info/share/3a9dc6189cb539c6a05fcc4f75c101b3PDF:https://app.rescript.info/api/public/sessions/9eda60ede2b31c92/pdf

26 Sept 2026 · 43:42 · transcript: transcribed · original

152claims extracted
2speakers named
100%of speech attributed
478transcript segments

Claims

In the order they were said

“But what they did was they set it up recursively. So they actually like hill climbed towards improving the agent itself. And what that means is improving the harness. So, you know, the prompts. prompts and the tooling and you know all of the skill surface all of the things that the harness can do and they just left it running they just left it running and they saw what happened”

Claim: The team configured the agent to optimize itself by improving its harness, including its prompts and tools.

“Of course, we have a set of benchmarks we're trying to hear time on. After that, we will test it on hold-out benchmarks. Those are public benchmarks like MLEBenchLite, ALEBenchLite. ALEBench is an algorithmic discovery benchmark from Salkana. MLEBench is the... OpenAI's machine learning engineering benchmark and we also tested on a very far out of distribution task called weather bench 2 essentially you're trying to build a physics-based forecasting engine to predict weather And the the weather bench is very far out of distribution from the training or optimization set of but it is still generalized really well.”

Claim: The team tests its system on hold-out benchmarks, including a weather-forecasting task far outside the optimization distribution, and reports that it generalizes well on that task.

“It is generalized better than our. w we would argue more elegant uh hand-tuned harness. We uh a bit torn uh on the experiment results, like uh to what extent We want to stick to more further principled and clean solutions we generated versus the solution that actually works better in practice.”

Claim: The self-evolved harness appeared to generalize better than the team's hand-tuned harness, but the team was conflicted because its generated solution was less principled and clean than a solution that performed better in practice.

“That's one direction. But another direction might be, okay, you just need to live with it because one of the burden that make people feeling it's a spec. kind of speculated code might be how much work the agent is done in the background, like it uh do one hundred experiments in our case on Auto-Research self-improvement, and that number of experiment is probably similar amount that we did uh in the last uh two years. So”

Claim: The team may need to accept difficult-to-understand agent-generated code because the agent can perform substantial background work, such as 100 experiments, which the speaker estimates is comparable to the team's experiments over the prior two years.

“For example, In Aiden, where we send the agent to attend OpenAI's hiring challenge, we found the human is still much better at generating creative primitives. We found it's very important for human to build the first prototype that gives the agent the right search space, basically the initial abstraction.”

Claim: In the OpenAI hiring challenge, humans were much better than the agent at generating creative primitives, and a human-built initial prototype was important for defining the agent's search space.

“a bit like how you design a neural network architecture where you introduce inductive biases for the learning process. If the initial code base is based on a search-based scaffold, like eight, then a lot of ideas agent came up are actually... coming from search literature. But if you give the initial code base as a react agent,”

Claim: Using a search-based scaffold as the initial code base leads many agent-generated ideas to draw on search literature.

“like a way to measure it like we measure it on a collection of downstream tasks but we didn't measure how good it is improving its capability of improving itself does the inner loop found by the outer loop actually can become a better outer loop and that's the what we call the level two”

Claim: At level one, improvement is measured using downstream tasks, not by directly measuring whether the inner loop improves the outer loop's self-improvement capability.

“There's a lot of changes, but to boil it down, there are search algorithm improvement, there are better... Context management system and there is a complete rewrite of all the prompts and more interestingly we find the design mechanisms prevent itself from reward hacking like the outer loop trying to prevent the inner loop from cheating the benchmark.”

Claim: The speaker says the best agent incorporated search-algorithm improvements, a context-management system, and a complete prompt rewrite.

“The more interesting one is it also trying to filter out those cheating solutions from some statistical property. For example, if one solution is way too far out of the average of its peers, then it will think, this might have some reward hacking happening.”

Claim: The speaker says the agent used statistical outlier detection to filter possible cheating solutions, treating solutions far from their peers' average as potential reward hacking.

“In a loop and outer loop are both optimizing towards a similar but different goals. So in all our benchmarks used for heel climbing, we have a public set and a private set. The inner loop agent will only look at the public set, whereas the outer loop will look at the aggregated score of the from the private set. So those two agents are optimizing at a kind of different level of objective.”

Claim: The speaker says the inner-loop and outer-loop agents optimize toward objectives that are similar but not identical.

“but in order to evaluate the whole Meta learning system. We need to test it on a hold out set of benchmarks so that the out those benchmarks are tasks that even auto loop never sees and for all of those benchmarks they are still private and a public split so we tested the discovered inner loop agent on those hold out tasks that's the protocol”

Claim: The speaker says they evaluate the meta-learning system by testing the discovered inner-loop agent on held-out benchmarks unseen by the outer loop, each with public and private splits.

“you can argue it managed to improve itself. Like if you apply that back to the AI system that... actually doing the like inference of the language models like you essentially make it faster so we think You can argue that's like one step of recursive self-improvement, although we don't know because I don't think they actually test it.”

Claim: The speaker says applying the improved algorithm to a language-model inference system would make it faster and could count as one step of recursive self-improvement, although he does not think this was tested.

“In their case, there's only two levels, like there's an agent optimizing. another agent doing coding whereas in our case there are three levels there's an outer loop agent there's a interloop inner loop agent both are doing auto research and they there's another layer which is the downstream tasks and some of them are actually harness engineering tasks”

Claim: The speaker contrasts the Darwin-Godel machine's two levels with their system's three levels: outer- and inner-loop agents conducting automated research, and downstream tasks that include harness engineering.

“And I think the interesting part of the thread of Darwin-Godel machine is the lower layer, the task layer, actually have a component of the search algorithm. And they say, if I improve this component in the unit test. The performance can actually generalize back to the whole search algorithm.”

Claim: The speaker highlights that the Darwin-Godel machine's task layer includes a search-algorithm component, and that improving it in a unit test can generalize to the full search algorithm.

“To us, what we care about is the outcome of the system, not like the conceptual differences, even though I just explained some conceptual differences. To us, we care about the outcome of it actually bending the curve. of recursive self-input, like of the R&D efforts, we see this is the first evidence that the curve actually starting get”

Claim: The team prioritizes whether its system improves the trajectory of recursive self-improvement in research and development over conceptual distinctions.

“Like if the agent is smart enough, it should be able to escape from the current abstraction or change it a little bit whereas generating really complex code. I think it would direct the search in a more kind of low level. changes direction, which is not necessarily a good thing.”

Claim: The speaker thinks a sufficiently capable agent should be able to escape or modify its current abstraction; generating very complex code may instead steer search toward lower-level changes, which is not necessarily beneficial.

“Back then we realized reward hacking is one of the big problem of auto research agents because that's especially severe on tasks like GPU kernel engineering where the agent always figure out of the complex way to make the unit test perform much better and when you deploy that kernel into the actual end-to-end inference of a model the performance are actually getting worse and specbench is a extrapolation of that to more general purpose software engineering and we extend the protocol we found on.”

Claim: On GPU-kernel tasks, an agent may optimize performance on a unit test while making the kernel perform worse in end-to-end model inference.

“make the unit test perform much better and when you deploy that kernel into the actual end-to-end inference of a model the performance are actually getting worse and specbench is a extrapolation of that to more general purpose software engineering and we extend the protocol we found on. GPU kernels like we maintain a public set which is a more like a unit test for the software system and a holdout set where we test the capability of the agent on capability of the generated software on the composition of those unit tests like simulating real-world usage”

Claim: SpecBench evaluates general-purpose software-engineering agents with a public unit-test-like set and a holdout set that tests generated software on combinations of tests intended to simulate real-world use.

“And the second interesting thing is the public set performance are rather consistent across different models. So if you have a like smaller models working on the same task with the auto research harness, it can reach the same public score.”

Claim: On the evaluated task, smaller models using the same automated-research harness can achieve the same public-set score as other models, and public-set performance is fairly consistent across models.

“But if you have a whole large collection of tasks, Sometimes you cracking interesting pieces like a primitive ideas from one task and although it is not improving the performance on the current task you can potentially bring that idea to future tasks and that's actually my own definition of interestingness or open-endedness which is an idea need to be”

Claim: Across a large collection of tasks, an idea found while working on one task can be useful for future tasks even if it does not improve performance on the task where it was discovered.

“Sometimes you cracking interesting pieces like a primitive ideas from one task and although it is not improving the performance on the current task you can potentially bring that idea to future tasks and that's actually my own definition of interestingness or open-endedness which is an idea need to be or an object or artifact is interesting if it is novel and it also being useful for a larger collection of tasks.”

Claim: An idea or artifact is interesting when it is novel and useful across a broad collection of tasks.

“It's just the throughput to recombine those ideas and attaching them are extremely high. To some extent, those language models don't have a deep understanding of like how those ideas came from and how can I use the... Like the process those ideas get discovered to design the next generation of algorithm like in a very creative way.”

Claim: Language models lack deep understanding of how ideas were discovered and how those discovery processes can be used creatively to design next-generation algorithms.

“I'm wondering though if it's more of a fact that basically we don't have continuous learning and we only have a single instance of language models like it's very centralized therefore maybe those ideas initially you first prompt it maybe those ideas are interesting but if everyone see the same idea so many times then it just become less interesting.”

Claim: The speaker suspects that without continual learning, a centralized single-instance language-model setup may cause initially interesting ideas to become less interesting through repeated exposure to the same ideas.

“competition of a training a small language model under 16 megabytes constraint. Yeah, we send a experimental harness, auto research harness to the competition and the agent runs about 22 days and eventually it made seven records get accepted by OpenAI in the best individual contributor only made three.”

Claim: In OpenAI's 16-megabyte model-training challenge, the speaker's team submitted an experimental auto-research harness whose agent ran for about 22 days and produced seven accepted records, compared with three from the best individual contributor.

“And in step 15 we use the vanilla outer loop and compare that to the best agent we found inner loop agent we found in first 50 steps and what we found is the inner loop step forty seven I think eventually it converge slightly faster than previous art loop but eventually the solution they found have a similar performance so that's also the reason we didn't claim we reached the level two recursive self-improvement which is like the improver managed to improve its own capability of thing”

Claim: In the reported comparison, the inner-loop agent found around step 47 converged slightly faster than the previous outer loop, while both ultimately reached solutions with similar performance.

“forty seven I think eventually it converge slightly faster than previous art loop but eventually the solution they found have a similar performance so that's also the reason we didn't claim we reached the level two recursive self-improvement which is like the improver managed to improve its own capability of thing of improving in the loop.”

Claim: The team did not claim level-two recursive self-improvement, which the speaker describes as an improver improving its own ability to improve.

“forty seven I think eventually it converge slightly faster than previous art loop but eventually the solution they found have a similar performance so that's also the reason we didn't claim we reached the level two recursive self-improvement which is like the improver managed to improve its own capability of thing of improving in the loop.”

Claim: The speaker's team did not claim to have achieved level-two recursive self-improvement, defined as an improver improving its own capability to improve within the loop.

“forty seven I think eventually it converge slightly faster than previous art loop but eventually the solution they found have a similar performance so that's also the reason we didn't claim we reached the level two recursive self-improvement which is like the improver managed to improve its own capability of thing”

Claim: The speaker reports that the inner-loop agent from step 47 eventually converged slightly faster than the previous outer-loop approach, while the resulting solutions had similar performance.