Self-Improvement Memory Enables Continual Recursive Self-Improvement A paper submitted to arXiv on 13 Nov 2026 proposes Self-Improvement Memory (SIM), a memory mechanism for the harness optimizer rather than the task-solving policy, to support Continual Recursive Self-Improvement (CRSI) across compatible benchmarks or policy models. SIM groups edits by recurring harness problem and records their rationale, predicted and observed outcomes, and evaluation context; across four domains it beat harness-only and root-cause-only continuation in cross-dataset and pairwise cross-model comparisons. In coding, across ten independent source runs, paired continuations with SIM raised final scores by an average of 2.36 points over harness-only continuation (p=0.003). Computer Science Machine Learning Submitted on 13 Nov 2026 Title:Self-Improvement Memory Enables Continual Recursive Self-Improvement View PDF https://arxiv.org/pdf/2611.18856 HTML experimental https://arxiv.org/html/2611.18856v1 Abstract:Harness optimization is often studied with a fixed policy model and benchmark. When either changes, the optimizer must decide which parts of an evolved harness to reuse or revise, but the harness alone may not explain why earlier edits were made or how they performed. In this work, we study Continual Recursive Self-Improvement CRSI , a setting for continuing existing harness-optimization methods across compatible benchmarks or policy models. We propose Self-Improvement Memory SIM for the harness optimizer, rather than the task-solving policy. SIM groups edits by recurring harness problem and records their rationale, predicted and observed outcomes, and evaluation context. New attempts extend this history as optimization continues. In our experiments across four domains, SIM achieves higher final scores than harness-only and root-cause-only continuation in cross-dataset and pairwise cross-model comparisons. Across ten independent source runs in coding, paired continuations with SIM improve final scores by an average of 2.36 points over harness-only continuation $p=0.003$ . Additional Features References & Citations Loading... Bibliographic and Citation Tools Bibliographic Explorer What is the Explorer? https://info.arxiv.org/labs/showcase.html arxiv-bibliographic-explorer Connected Papers What is Connected Papers? https://www.connectedpapers.com/about Litmaps What is Litmaps? https://www.litmaps.co/ scite Smart Citations What are Smart Citations? https://www.scite.ai/ Code, Data and Media Associated with this Article alphaXiv What is alphaXiv? https://alphaxiv.org/ CatalyzeX Code Finder for Papers What is CatalyzeX? https://www.catalyzex.com DagsHub What is DagsHub? https://dagshub.com/ Gotit.pub What is GotitPub? http://gotit.pub/faq Hugging Face What is Huggingface? https://huggingface.co/huggingface ScienceCast What is ScienceCast? https://sciencecast.org/welcome Demos Recommenders and Search Tools Influence Flower What are Influence Flowers? https://influencemap.cmlab.dev/ CORE Recommender What is CORE? https://core.ac.uk/services/recommender IArxiv Recommender What is IArxiv? https://iarxiv.org/about arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs https://info.arxiv.org/labs/index.html .