AgentFold explores 80 folding-model variants under matched compute
AgentFold, published on arXiv on 29 August, turns folding-model development into a closed-loop search over executable code variants: it proposes hypotheses, edits and debugs the code, evaluates variants, and keeps failed as well as successful interventions in a structured memory. Starting from ESMFold, the system explores about 80 variants on a codebase longer than 2,000 lines. Under a matched compute budget it raises the best lDDT by 7.5 per cent over independent Codex proposals. The search spends about 5,000 GPU-hours and 170 million model tokens, with an MCTS-style policy allocating resources. It is also measured against a random-search control and comes out ahead of that. The work is a preprint that has not been peer reviewed, and the gain was measured on one codebase and one starting model.[1]
