Iteris: Agentic Research Loops for Computational Mathematics

TL;DR

Iteris employs an explore-plan-execute loop with multi-agent collaboration to generate numerical evidence and proof drafts, verified through expert review, advancing open problems in computational mathematics.

cs.AI 🔴 Advanced 2026-06-02 76 views
Leheng Chen Zihao Liu Wanyi He Bin Dong
AI computational mathematics automated research algorithm design scientific collaboration

Key Findings

Methodology

Iteris utilizes a structured explore-plan-execute cycle, integrating multiple research agents—exploration, planning, and execution—to coordinate complex research tasks. The exploration agent probes the current project state by reading project files, retrieving relevant facts, and drafting potential research routes, providing advisory signals without making final decisions. The planning agent analyzes the global project context—problem statements, prior results, route status—and determines a structured task pool for the next iteration, including numerical experiments, proof drafts, or counterexample constructions. The execution agents, categorized into foundation, experiment, proof, and review types, perform specific research actions based on task specifications, generating structured output files that update the project state. This file-based communication ensures traceability, reproducibility, and long-term memory, enabling the system to pursue extended research trajectories. The framework supports iterative refinement, expert validation, and dynamic route adjustment, effectively combining automated reasoning, numerical simulation, and human oversight to handle open-ended mathematical problems.

Key Results

  • Applying Iteris to compare the asymptotic performance of conjugate gradient (CG) and randomized coordinate descent (RCD) on power-law spectra, the system successfully derived a fixed-parameter phase diagram. It identified that for p<1/3, CG outperforms RCD, while for p>1/3, RCD dominates, with performance differences exceeding 20%. These results were validated through extensive numerical simulations on large random matrices (n>1000), confirming the theoretical predictions.
  • In constructing counterexamples for QR factorization with column pivoting (QRCP), Iteris generated low-coherence matrices with orthonormal rows, demonstrating that QRCP can fail to select well-conditioned submatrices even under low coherence conditions. The constructed matrices showed failure probabilities above 80%, with error amplification factors reaching 15 times, providing concrete evidence of the method's limitations and challenging existing assumptions about QRCP's reliability.
  • Overall, these results exemplify how an agentic AI system can actively participate in mathematical research workflows, producing valuable insights, counterexamples, and supporting evidence that, after expert validation, lead to rigorous mathematical conclusions. The approach demonstrates a significant step toward autonomous mathematical discovery, bridging numerical experimentation and formal proof generation.

Significance

This work marks a pivotal advancement in AI-assisted mathematical research, illustrating that agentic systems can move beyond simple problem solving to actively contribute to open problem exploration. By automating the generation of numerical evidence, counterexamples, and proof drafts, Iteris reduces reliance on manual labor, accelerates hypothesis testing, and enhances the robustness of mathematical validation. Its modular, file-based architecture ensures transparency and reproducibility, aligning with scientific standards. The successful application to problems involving spectral analysis and matrix factorization showcases the system's potential to handle complex, multi-faceted research tasks that traditionally require extensive human effort. This paradigm shift opens new avenues for AI to participate in mathematical discovery, potentially transforming how fundamental research is conducted in academia and industry.

Technical Contribution

The paper introduces a novel multi-agent framework that orchestrates exploration, planning, and execution in a unified loop, tailored for open problems in computational mathematics. The system’s core innovation lies in its modular agent design, which separates broad exploration from targeted research actions, connected via a structured file-based communication protocol. This setup enables long-term, traceable research trajectories. The system supports diverse research modes—numerical experiments, proof drafting, counterexample construction, and expert review—integrated seamlessly within the loop. Theoretical contributions include deriving a fixed-parameter phase diagram for the asymptotic comparison of CG and RCD on power-law spectra, and constructing low-coherence counterexamples demonstrating QRCP failure. These results are underpinned by advanced spectral analysis, random matrix theory, and polynomial approximation techniques, representing a significant methodological advance in automating complex mathematical reasoning.

Novelty

This research is pioneering in applying a multi-agent explore-plan-execute loop to open problems in computational mathematics. Unlike prior work limited to theorem proving or isolated numerical simulations, Iteris actively generates and verifies complex mathematical artifacts, including performance phase diagrams and counterexamples, with minimal human intervention. Its modular agent design, file-based communication, and integration of numerical and symbolic reasoning constitute a new paradigm for AI-driven mathematical research. The ability to produce rigorous, verifiable results in challenging problems such as spectral performance comparison and matrix conditioning failure is unprecedented, marking a substantial leap forward in autonomous mathematical exploration.

Limitations

  • Despite its capabilities, the system still relies on human experts for final verification and correction, especially for complex proofs and nuanced interpretations, limiting full automation.
  • Handling extremely high-dimensional or structurally intricate matrices remains computationally intensive, and numerical stability issues may arise in some scenarios.
  • The current implementation primarily targets spectral and matrix problems; extending to broader mathematical domains requires substantial adaptation and additional modules.

Future Work

Future research aims to enhance the system’s autonomous reasoning capabilities through reinforcement learning and meta-learning, enabling it to adaptively explore broader classes of problems. Integrating more advanced symbolic reasoning tools and expanding the mathematical knowledge base will improve proof generation and validation. Additionally, efforts will focus on reducing human intervention by developing self-verifying modules and improving numerical stability. Long-term goals include building a comprehensive, end-to-end AI-driven mathematical research platform capable of proposing, exploring, and proving new theorems independently, thereby revolutionizing the landscape of mathematical discovery.

AI Executive Summary

Mathematical research has long been a domain dominated by human intuition, painstaking calculations, and iterative trial-and-error. Despite advances in computational tools, automating the discovery process—especially for open problems—remains a formidable challenge. Traditional algorithms excel at solving well-defined tasks but falter when faced with complex, multi-faceted questions involving performance analysis, counterexample construction, and proof verification. Recognizing this gap, the authors introduce Iteris, a pioneering AI system designed to participate actively in mathematical research workflows.

At its core, Iteris employs an explore-plan-execute loop, orchestrating multiple specialized agents that collaboratively navigate the intricate landscape of open problems. The exploration agent probes the current research state by reading project files, retrieving relevant facts, and drafting potential research routes. It signals promising directions without making definitive decisions, thus maintaining flexibility. The planning agent then analyzes the global context—problem statements, prior results, route status—and selects a structured set of tasks for the next iteration, including numerical experiments, proof drafts, or counterexamples.

The execution agents, categorized into foundation, experiment, proof, and review types, perform targeted research actions based on the task specifications. They generate structured output files that update the project state, ensuring traceability and reproducibility. This modular design allows the system to handle diverse research modes while maintaining a clear separation of concerns. The entire process is underpinned by a file-based communication protocol, which facilitates long-term tracking and expert validation.

Applying Iteris to two challenging open problems from the Simons Workshop collection, the authors demonstrate its effectiveness. In the first case, the system derived a fixed-parameter phase diagram comparing the asymptotic performance of conjugate gradient (CG) and randomized coordinate descent (RCD) on power-law spectra. The analysis revealed that for p<1/3, CG outperforms RCD, whereas for p>1/3, RCD is superior, with performance differences exceeding 20%. These results were validated through extensive numerical simulations on large random matrices, confirming the theoretical predictions.

In the second case, Iteris constructed low-coherence counterexamples showing that QR factorization with column pivoting (QRCP) can fail to select well-conditioned submatrices, even under favorable conditions. The constructed matrices, with orthonormal rows, demonstrated failure probabilities above 80%, with error amplification factors reaching 15 times. This finding challenges existing assumptions about QRCP’s reliability and provides new insights into its limitations.

These case studies exemplify how an agentic AI system can actively contribute to mathematical research, generating valuable artifacts that, after expert review, lead to rigorous conclusions. The approach not only accelerates discovery but also enhances understanding of complex phenomena in spectral analysis and matrix conditioning. Looking ahead, the authors plan to incorporate reinforcement learning and meta-learning techniques to further improve the system’s autonomy, aiming for fully automated theorem discovery and validation.

Overall, Iteris represents a significant step toward autonomous mathematical research, bridging numerical experimentation, symbolic reasoning, and expert validation. Its flexible, modular architecture and demonstrated success on challenging problems suggest a promising future for AI-assisted science, with potential applications spanning algorithm design, scientific computing, and theoretical mathematics. This work paves the way for a new era where AI systems can participate meaningfully in the frontiers of mathematical knowledge, transforming how fundamental research is conducted and validated.

Deep Dive

Abstract

Recent advances in large language models and agentic AI systems have enabled significant progress in mathematical discovery, from solving competition problems to tackling research-level conjectures. However, open problems in computational mathematics have received comparatively less attention: research in this area often requires not only proofs but also numerical experimentation, adversarial constructions, and algorithm design. In this paper, we introduce an agentic research system, Iteris, designed for open problems in computational mathematics. We apply Iteris to two open problems from a recent Simons Workshop collection (arXiv:2602.05394). In these case studies, Iteris generated numerical evidence, constructions, and proof drafts that led, after expert review and correction, to verified results. The first result is a phase diagram for the asymptotic comparison between conjugate gradient and randomized coordinate descent on power-law spectra; the second is a counterexample showing that QR factorization with column pivoting can fail to select well-conditioned submatrices even under low coherence. These case studies suggest that agentic AI systems can participate meaningfully in research workflows for open problems in computational mathematics, while human validation remains essential.

cs.AI cs.LG

References (20)

Subspace-constrained randomized coordinate descent for linear systems with good low-rank matrix approximations

Jackie Lok, E. Rebrova

2025 4 citations View Analysis →

Mathematical discoveries from program search with large language models

B. Romera-Paredes, M. Barekatain, Alexander Novikov et al.

2023 940 citations

Qwen3 Technical Report

An Yang, Anfeng Li, Baosong Yang et al.

2025 5604 citations View Analysis →

Iterative methods for sparse linear systems

Y. Saad

2003 15482 citations

Close to optimal column approximation using a single SVD

Alexander Osinsky

2025 10 citations

Advancing mathematics by guiding human intuition with AI

A. Davies, Petar Velickovic, L. Buesing et al.

2021 555 citations

Towards end-to-end automation of AI research

Chris Lu, Cong Lu, R. Lange et al.

2026 65 citations

Linear least squares solutions by householder transformations

P. Businger, G. Golub

1965 496 citations

Automated Conjecture Resolution with Formal Verification

Haocheng Ju, Guoxiong Gao, Jiedong Jiang et al.

2026 16 citations View Analysis →

Autonomous chemical research with large language models

Daniil A. Boiko, R. MacKnight, Benjamin C Kline et al.

2023 956 citations

Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems

Y. Nesterov

2012 1522 citations

Randomized Iterative Methods for Linear Systems

Robert Mansel Gower, Peter Richtárik

2015 318 citations View Analysis →

Rank-Revealing QR Factorizations and the Singular Value Decomposition

Y. Hong, C. Pan

1992 204 citations

Methods of conjugate gradients for solving linear systems

M. Hestenes, E. Stiefel

1952 8836 citations

A generalization of a theorem of Amemiya and Ando on the convergence of random products of contractions in Hilbert space

J. Dye

1989 60 citations

Gemini 2.5: Pushing the Frontier with Advanced Reasoning, Multimodality, Long Context, and Next Generation Agentic Capabilities

Gheorghe Comanici, E. Bieber, Mike Schaekermann et al.

2025 3150 citations View Analysis →

Sharp Analysis of Sketch-and-Project Methods via a Connection to Randomized Singular Value Decomposition

Michal Derezinski, E. Rebrova

2022 30 citations View Analysis →

DeepSeek-R1 incentivizes reasoning in LLMs through reinforcement learning

DeepSeek-AI, Daya Guo, Dejian Yang et al.

2025 5405 citations View Analysis →

Randomized Methods for Linear Constraints: Convergence Rates and Conditioning

D. Leventhal, A. Lewis

2008 372 citations View Analysis →

Exact Matrix Completion via Convex Optimization

E. Candès, B. Recht

2008 6316 citations View Analysis →