← All papersPaper collection

Self-Improving Agents

Research on agents that use feedback or experience to improve lasting components such as weights, prompts, memory, skills, code, workflows, evaluators, or training curricula.

540
papers

Discover and explore top AI papers with

npx @dair-ai/mcp setup
  1. 01
  2. 02
  3. 03
  4. 04
  5. 05
  6. 06
  7. 07
  8. 08
  9. 09
  10. 10
  11. 11
  12. 12
  13. 13
  14. 14
  15. 15
  16. 16
  17. 17
  18. 18
  19. 19
  20. 20
  21. 21
  22. 22
  23. 23
  24. 24
  25. 25
  26. 26
  27. 27
  28. 28
  29. 29
  30. 30
  31. 31
  32. 32
  33. 33
  34. 34
  35. 35
  36. 36
  37. 37
  38. 38
  39. 39
  40. 40
  41. 41
  42. 42
  43. 43
  44. 44
  45. 45
  46. 46
  47. 47
  48. 48
  49. 49
  50. 50
  51. 51
  52. 52
  53. 53
  54. 54
  55. 55
  56. 56
  57. 57
  58. 58
  59. 59
  60. 60
  61. 61
  62. 62
  63. 63
  64. 64
  65. 65
  66. 66
  67. 67
  68. 68
  69. 69
  70. 70
  71. 71
  72. 72
  73. 73
  74. 74
  75. 75
  76. 76
  77. 77
  78. 78
  79. 79
  80. 80
  81. 81
  82. 82
  83. 83
  84. 84
  85. 85
  86. 86
  87. 87
  88. 88
  89. 89
  90. 90
  91. 91
  92. 92
  93. 93
  94. 94
  95. 95
  96. 96
  97. 97
  98. 98
  99. 99
  100. 100
  101. 101
  102. 102
  103. 103
  104. 104
  105. 105
  106. 106
  107. 107
  108. 108
  109. 109
  110. 110
  111. 111
  112. 112
  113. 113
  114. 114
  115. 115
  116. 116
  117. 117
  118. 118
  119. 119
  120. 120
  121. 121
  122. 122
  123. 123
  124. 124
  125. 125
  126. 126
  127. 127
  128. 128
  129. 129
  130. 130
  131. 131
  132. 132
  133. 133
  134. 134
  135. 135
  136. 136
  137. 137
  138. 138
  139. 139
  140. 140
  141. 141
  142. 142
  143. 143
  144. 144
  145. 145
  146. 146
  147. 147
  148. 148
  149. 149
  150. 150
  151. 151
  152. 152
  153. 153
  154. 154
  155. 155
  156. 156
  157. 157
  158. 158
  159. 159
  160. 160
  161. 161
  162. 162
  163. 163
  164. 164
  165. 165
  166. 166
  167. 167
  168. 168
  169. 169
  170. 170
  171. 171
  172. 172
  173. 173
  174. 174
  175. 175
  176. 176
  177. 177
  178. 178
  179. 179
  180. 180
  181. 181
  182. 182
  183. 183
  184. 184
  185. 185
  186. 186
  187. 187
  188. 188
  189. 189
  190. 190
  191. 191
  192. 192
  193. 193
  194. 194
  195. 195
  196. 196
  197. 197
  198. 198
  199. 199
  200. 200
  201. 201
  202. 202
  203. 203
  204. 204
  205. 205
  206. 206
  207. 207
  208. 208
  209. 209
  210. 210
  211. 211
  212. 212
  213. 213
  214. 214
  215. 215
  216. 216
  217. 217
  218. 218
  219. 219
  220. 220
  221. 221

    Recursive self-improvement of AI research agents

    Dhruv Srikanth et al. · 2026

    AIDE2 improved its own code across an eight-day autonomous run, discovering seven successive changes from a new search policy to memory compression. The gains transferred to held-out benchmarks and reward hacking fell from 55% to 32%.

  222. 222
  223. 223
  224. 224
  225. 225
  226. 226
  227. 227
  228. 228
  229. 229
  230. 230
  231. 231
  232. 232
  233. 233
  234. 234
  235. 235
  236. 236
  237. 237
  238. 238
  239. 239
  240. 240
  241. 241
  242. 242
  243. 243
  244. 244
  245. 245
  246. 246
  247. 247
  248. 248
  249. 249
  250. 250
  251. 251

    Self Improvement via Fast Tree-search

    Xinghong Fu, Aravinth Kulanthaivelu, Yutaro Yamada · 2026
  252. 252
  253. 253
  254. 254
  255. 255
  256. 256
  257. 257
  258. 258
  259. 259
  260. 260
  261. 261
  262. 262
  263. 263
  264. 264
  265. 265
  266. 266
  267. 267
  268. 268
  269. 269
  270. 270
  271. 271
  272. 272
  273. 273
  274. 274
  275. 275
  276. 276
  277. 277
  278. 278
  279. 279
  280. 280
  281. 281
  282. 282
  283. 283
  284. 284
  285. 285

    The Last AI Built by Humans: Toward Genuine Recursive Self-Improvement

    Yi Duan et al. · 2026

    The field map, published September 2026. It distinguishes the non-RSI reference baseline B0 from five RSI autonomy levels, L1 through L5, progressing from improvement execution to recursive meta-improvement. It examines evaluation requirements at each level. Twenty of the papers above appear in its reference list, which is a useful way to see what this collection adds and what it leaves out.

  286. 286
  287. 287
  288. 288
  289. 289
  290. 290
  291. 291
  292. 292
  293. 293
  294. 294
  295. 295
  296. 296
  297. 297
  298. 298
  299. 299
  300. 300
  301. 301
  302. 302
  303. 303
  304. 304
  305. 305
  306. 306
  307. 307
  308. 308
  309. 309
  310. 310
  311. 311
  312. 312
  313. 313
  314. 314
  315. 315
  316. 316
  317. 317
  318. 318
  319. 319
  320. 320
  321. 321
  322. 322
  323. 323
  324. 324
  325. 325
  326. 326
  327. 327
  328. 328
  329. 329
  330. 330
  331. 331
  332. 332
  333. 333
  334. 334
  335. 335
  336. 336
  337. 337
  338. 338
  339. 339
  340. 340
  341. 341
  342. 342
  343. 343
  344. 344
  345. 345
  346. 346
  347. 347
  348. 348
  349. 349
  350. 350
  351. 351
  352. 352
  353. 353
  354. 354
  355. 355
  356. 356
  357. 357
  358. 358
  359. 359
  360. 360
  361. 361

    RLMF

    Gabrielle Kaili-May Liu et al. · 2026
  362. 362
  363. 363
  364. 364
  365. 365
  366. 366

    Skill-MAS

    Hehai Lin, Qi Yang, Chengwei Qin · 2026
  367. 367
  368. 368
  369. 369
  370. 370
  371. 371
  372. 372
  373. 373
  374. 374
  375. 375

    AutoScientists

    Shanghua Gao, Ada Fang, Marinka Zitnik · 2026
  376. 376
  377. 377
  378. 378
  379. 379
  380. 380
  381. 381
  382. 382
  383. 383
  384. 384
  385. 385
  386. 386
  387. 387
  388. 388
  389. 389
  390. 390
  391. 391
  392. 392
  393. 393
  394. 394
  395. 395
  396. 396
  397. 397
  398. 398
  399. 399
  400. 400
  401. 401
  402. 402
  403. 403

    Hyperagents

    Jenny Zhang et al. · 2026

    Merges the task agent and the meta agent into a single editable program, so the procedure that generates improvements can itself be modified. It drops the assumption that a better coding agent is automatically a better self-improver, which only holds when the task is coding.

  404. 404

    PostTrainBench: Can LLM Agents Automate LLM Post-Training?

    Ben Rank et al. · 2026

    Hands an agent one base model, one GPU and ten hours, then asks it to post-train the model on its own. It measures AI automating AI training more directly than any other benchmark here, and audits the reward hacking that follows.

  405. 405
  406. 406
  407. 407
  408. 408
  409. 409
  410. 410
  411. 411
  412. 412
  413. 413
  414. 414

    ALMA

    Yiming Xiong, Shengran Hu, Jeff Clune · 2026
  415. 415

    Group-Evolving Agents: Open-Ended Self-Improvement via Experience Sharing

    Zhaotian Weng et al. · 2026

    Evolves a group of agents that share experience across branches instead of a tree of isolated variants, and reports the strongest coding results in this lineage. The most convincing successor to the Darwin Gödel Machine so far.

  416. 416
  417. 417
  418. 418
  419. 419
  420. 420
  421. 421
  422. 422
  423. 423
  424. 424
  425. 425
  426. 426
  427. 427
  428. 428

    Sophia

    Mingyang Sun, Feng Hong, Weinan Zhang · 2025
  429. 429
  430. 430
  431. 431
  432. 432
  433. 433
  434. 434
  435. 435
  436. 436
  437. 437

    Huxley-Gödel Machine: Human-Level Coding Agent Development by an Approximation of the Optimal Self-Improving Machine

    Wenyi Wang et al. · 2025

    Shows that an agent's benchmark score predicts its descendants' improvement poorly, names that the Metaproductivity-Performance Mismatch, and offers a measurable substitute aggregated over a clade. It answers which variant a self-modification search should expand next.

  438. 438
  439. 439

    Agentic Context Engineering: Evolving Contexts for Self-Improving Language Models

    Qizheng Zhang et al. · 2025

    Treats context as a playbook that grows through small incremental edits rather than wholesale rewrites, and names context collapse, the failure where repeated rewriting erodes detail. It is the current reference design for improving an agent through context alone.

  440. 440

    Your Agent May Misevolve: Emergent Risks in Self-evolving LLM Agents

    Shuai Shao et al. · 2025

    Self-evolution drifts into unsafe behavior along four paths, which are the model, its memory, its tools and its workflow. The first broad safety study of self-evolving agents, and the counterweight to everything above it.

  441. 441
  442. 442
  443. 443
  444. 444
  445. 445
  446. 446
  447. 447
  448. 448
  449. 449
  450. 450
  451. 451

    AlphaEvolve: A coding agent for scientific and algorithmic discovery

    Alexander Novikov et al. · 2025

    An evolutionary coding agent that discovered new algorithms and optimized Google's own infrastructure. It accelerated training of the model that powers it, which makes it the clearest published case of a deployed system improving its own production pipeline.

  452. 452

    Self-Adapting Language Models

    Adam Zweiger et al. · 2025

    The model writes self-edits, meaning its own finetuning data and update directives, and reinforcement learning rewards each edit by how well the updated model then performs. The update procedure becomes an output of the model.

  453. 453
  454. 454
  455. 455

    Darwin Gödel Machine: Open-Ended Evolution of Self-Improving Agents

    Jenny Zhang et al. · 2025

    Keeps an archive of coding agents, has one rewrite its own code, scores the child on benchmarks, and returns it to the archive. It is the reference system for this branch, and the source of the objective-hacking evidence every builder should read.

  456. 456
  457. 457
  458. 458
  459. 459
  460. 460
  461. 461

    Absolute Zero: Reinforced Self-play Reasoning with Zero Data

    Andrew Zhao et al. · 2025

    One model proposes its own coding and reasoning tasks, solves them, and uses code execution as the verifier, with no external data at all. It shows the curriculum can be self-generated when the checker is reliable.

  462. 462
  463. 463

    A Self-Improving Coding Agent

    Maxime Robeyns, Martin Szummer, Laurence Aitchison · 2025

    A coding agent with ordinary tools edits its own codebase and improves from 17% to 53% on a random subset of SWE-bench Verified, with no gradient updates. The simplest demonstration that one agent can be both the system under repair and the engineer doing it.

  464. 464

    AgentRxiv

    Samuel Schmidgall, Michael Moor · 2025
  465. 465
  466. 466
  467. 467
  468. 468

    LADDER

    Toby Simonds, Akira Yoshiyama · 2025
  469. 469
  470. 470
  471. 471
  472. 472
  473. 473
  474. 474
  475. 475
  476. 476
  477. 477

    Mind the Gap: Examining the Self-Improvement Capabilities of Large Language Models

    Yuda Song et al. · 2024

    Formalizes self-improvement around the generation-verification gap, the gain a model gets from filtering its own output with its own judgment. It gives the working rule for this collection, which is that a system improves itself only where it verifies better than it generates.

  478. 478

    RE-Bench: Evaluating frontier AI R&D capabilities of language model agents against human experts

    Hjalmar Wijk et al. · 2024

    Open-ended machine learning research environments scored for both AI agents and human experts under matched time budgets. It is the measurement behind the question the labs are actually asking, which is whether AI can do AI research.

  479. 479
  480. 480
  481. 481
  482. 482
  483. 483

    Gödel Agent: A Self-Referential Agent Framework for Recursive Self-Improvement

    Xunjian Yin et al. · 2024

    An agent that reads and rewrites its own logic at runtime, including the logic it uses to rewrite itself, guided only by a high-level objective. It is the first language-model framework to implement the Gödel machine structure directly, with evaluation in place of proof.

  484. 484
  485. 485
  486. 486
  487. 487

    Automated Design of Agentic Systems

    Shengran Hu, Cong Lu, Jeff Clune · 2024

    A meta agent writes new agent designs as code, evaluates them, and files them in an archive that informs the next design. It moved the search space from prompts to whole agent programs, and the Darwin Gödel Machine later turned that loop on itself.

  488. 488

    The AI Scientist: Towards Fully Automated Open-Ended Scientific Discovery

    Chris Lu et al. · 2024

    Generates research ideas, runs the experiments, writes the paper, and reviews it. The reference end-to-end research loop, later peer reviewed in Nature as an end-to-end automation of AI research.

  489. 489
  490. 490
  491. 491
  492. 492
  493. 493
  494. 494
  495. 495
  496. 496
  497. 497
  498. 498
  499. 499
  500. 500
  501. 501
  502. 502
  503. 503
  504. 504
  505. 505
  506. 506

    Self-Rewarding Language Models

    Weizhe Yuan et al. · 2024

    The model scores its own responses as a judge, and iterative training on those scores improves both the answers and the scoring. It removes the frozen reward model, so the evaluator improves along with the policy.

  507. 507
  508. 508
  509. 509

    Mathematical discoveries from program search with large language models

    Bernardino Romera-Paredes et al. · 2023

    Evolutionary search over programs an LLM writes, filtered by a systematic evaluator, produced new results in extremal combinatorics. It is the direct predecessor of AlphaEvolve and the first case of a language model making a discovery on an established open problem.

  510. 510
  511. 511
  512. 512

    Eureka: Human-Level Reward Design via Coding Large Language Models

    Yecheng Jason Ma et al. · 2023

    An LLM writes reward functions as code and evolves them against training results, so the learning signal itself becomes the object being improved. It is the bridge from self-improving text systems to robot learning.

  513. 513
  514. 514

    Self-Taught Optimizer (STOP): Recursively Self-Improving Code Generation

    Eric Zelikman et al. · 2023

    A seed improver calls a language model to improve a program, then is run on its own source, producing an improved improver. The smallest complete recursive experiment, and the first in this line to report a sandbox-evasion measurement next to its gains.

  515. 515

    Large Language Models Cannot Self-Correct Reasoning Yet

    Jie Huang et al. · 2023

    Without external feedback, a model asked to correct its own reasoning does not improve and often gets worse. This is the empirical limit that separates a self-improvement loop with a real signal from one talking to itself.

  516. 516

    Promptbreeder: Self-Referential Self-Improvement Via Prompt Evolution

    Chrisantha Fernando et al. · 2023

    Evolves task prompts using mutation prompts, and evolves the mutation prompts too, so the instructions for improving prompts improve alongside them. It is the first system in the language-model era whose improvement operator is itself under optimization.

  517. 517
  518. 518
  519. 519
  520. 520
  521. 521

    The Curse of Recursion: Training on Generated Data Makes Models Forget

    Ilia Shumailov et al. · 2023

    Training generative models on their own output irreversibly erases the tails of the original distribution, a failure the authors call model collapse. It explains why every working loop on this list keeps an external signal in play.

  522. 522

    Voyager: An Open-Ended Embodied Agent with Large Language Models

    Guanzhi Wang et al. · 2023

    A Minecraft agent writes code for new skills, verifies them in the world, and stores them in a library it searches later. The skill library is the ancestor of the skill files agents ship with today.

  523. 523

    Sophia

    Mingyang Sun, Feng Hong, Weinan Zhang · 2023
  524. 524
  525. 525
  526. 526

    Reflexion: Language Agents with Verbal Reinforcement Learning

    Noah Shinn et al. · 2023

    After a failure the agent writes a reflection into memory and the next attempt reads it, which turns an environment signal into text that survives the episode. It is the most cited paper in this collection.

  527. 527
  528. 528
  529. 529
  530. 530

    STaR: Bootstrapping Reasoning With Reasoning

    Eric Zelikman et al. · 2022

    Generate rationales, keep the ones that reach the correct answer, fine-tune on those, and repeat. Every later self-training loop is a variant of this, and its first author went on to write STOP.

  531. 531
  532. 532
  533. 533

    AutoML-Zero: Evolving Machine Learning Algorithms From Scratch

    Esteban Real et al. · 2020

    Evolves entire learning algorithms from primitive mathematical operations, with no human-designed components to build on. The pre-language-model ancestor of AI discovering the methods that train AI.

  534. 534
  535. 535

    Paired Open-Ended Trailblazer (POET): Endlessly Generating Increasingly Complex and Diverse Learning Environments and Their Solutions

    Rui Wang et al. · 2019

    Co-evolves environments with the agents that solve them, so the curriculum never settles. This is where open-ended self-improvement starts, years before language models entered the picture.

  536. 536
  537. 537
  538. 538
  539. 539
  540. 540

    Goedel Machines: Self-Referential Universal Problem Solvers Making Provably Optimal Self-Improvements

    Juergen Schmidhuber · 2003

    The founding definition. A problem solver may rewrite any part of its own code, including the part that searches for rewrites, once it has proved the rewrite is useful. Three later systems on this list take its name.