{"slug": "a-transformer-derived-iterative-preconditioner", "title": "A Transformer-Derived Iterative Preconditioner", "summary": "A paper submitted to arXiv on 17 November 2026 shows that a softmax-attention transformer trained to solve linear systems Xw=y implicitly improves matrix conditioning, and tracing XX^T revealed an iterative preconditioning primitive the authors developed into RAPID, a standalone algorithm with no learned components. RAPID is an anytime preconditioner for symmetric positive definite matrices that uses randomized mixing and sparse local corrections; proof-of-concept experiments on synthetic and real-world problems consistently improved conditioning and reduced the conjugate gradient iterations needed to reach a target accuracy. For a Haar-mixing idealization, the authors prove convergence to any fixed target condition number regardless of spectral distribution, with only logarithmic dependence on initial conditioning.", "body_md": "# Computer Science > Machine Learning\n\n  [Submitted on 17 Nov 2026]\n\n# Title:A Transformer-Derived Iterative Preconditioner\n\n[View PDF](https://arxiv.org/pdf/2611.22941)\n\n[HTML (experimental)](https://arxiv.org/html/2611.22941v1)\n\nAbstract:Transformers trained on in-context prediction problems can learn known numerical algorithms, e.g., gradient descent. We go further, showing that their internal computations can reveal new algorithms with provable guarantees. A softmax-attention transformer trained to solve linear systems $Xw=y$ implicitly improves matrix conditioning. Tracing $XX^\\top$ reveals an iterative preconditioning primitive, which we develop into RAPID, a standalone algorithm requiring no learned components.\n\nRAPID is an anytime preconditioner for symmetric positive definite (SPD) matrices, using randomized mixing and sparse local corrections to improve conditioning. Proof-of-concept experiments on synthetic and real-world problems consistently improve conditioning and reduce conjugate gradient iterations needed to reach a target accuracy. For a Haar-mixing idealization, we prove convergence to any fixed target condition number regardless of spectral distribution, with only logarithmic dependence on initial conditioning. Together, these results show how a transformer can discover a broadly applicable numerical algorithm.\n\n### Additional Features\n\n### References & Citations\n\nLoading...\n\n# Bibliographic and Citation Tools\n\nBibliographic Explorer \n\n*(*[What is the Explorer?](https://info.arxiv.org/labs/showcase.html#arxiv-bibliographic-explorer))\nConnected Papers \n\n*(*[What is Connected Papers?](https://www.connectedpapers.com/about))\nLitmaps \n\n*(*[What is Litmaps?](https://www.litmaps.co/))\nscite Smart Citations \n\n*(*[What are Smart Citations?](https://www.scite.ai/))\n# Code, Data and Media Associated with this Article\n\nalphaXiv \n\n*(*[What is alphaXiv?](https://alphaxiv.org/))\nCatalyzeX Code Finder for Papers \n\n*(*[What is CatalyzeX?](https://www.catalyzex.com))\nDagsHub \n\n*(*[What is DagsHub?](https://dagshub.com/))\nGotit.pub \n\n*(*[What is GotitPub?](http://gotit.pub/faq))\nHugging Face \n\n*(*[What is Huggingface?](https://huggingface.co/huggingface))\nScienceCast \n\n*(*[What is ScienceCast?](https://sciencecast.org/welcome))\n# Demos\n\n# Recommenders and Search Tools\n\nInfluence Flower \n\n*(*[What are Influence Flowers?](https://influencemap.cmlab.dev/))\nCORE Recommender \n\n*(*[What is CORE?](https://core.ac.uk/services/recommender))\nIArxiv Recommender\n\n*(*[What is IArxiv?](https://iarxiv.org/about))\n# arXivLabs: experimental projects with community collaborators\n\narXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.\n\nBoth 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.\n\nHave an idea for a project that will add value for arXiv's community? [**Learn more about arXivLabs**](https://info.arxiv.org/labs/index.html).", "url": "https://wpnews.pro/news/a-transformer-derived-iterative-preconditioner", "canonical_source": "https://arxiv.org/abs/2611.22941", "published_at": "2026-11-18 06:20:23+00:00", "updated_at": "2026-11-18 06:45:20.676560+00:00", "lang": "en", "topics": ["machine-learning", "ai-research", "artificial-intelligence"], "entities": ["arXiv", "RAPID"], "also_reported_by": [], "takeaway": "A transformer trained on in-context linear-system prediction yielded RAPID, an anytime SPD preconditioner whose Haar-mixing idealization provably reaches any fixed target condition number with only logarithmic dependence on initial conditioning and cut conjugate gradient iterations in proof-of-conce", "recommendation": null, "alternates": {"html": "https://wpnews.pro/news/a-transformer-derived-iterative-preconditioner", "markdown": "https://wpnews.pro/news/a-transformer-derived-iterative-preconditioner.md", "text": "https://wpnews.pro/news/a-transformer-derived-iterative-preconditioner.txt", "jsonld": "https://wpnews.pro/news/a-transformer-derived-iterative-preconditioner.jsonld"}}