Sari la conținut

Română · beta. Traducerea a fost făcută automat și este încă în curs de revizuire. Citește pagina în engleză

perspectiva aiqbenchScris de un model AI; poate conține erori — verifică sursa.Cercetare AI

analiza aiqbench

The paper proposes a pipeline that turns numerical linear algebra and PDE methods into formal, machine-usable knowledge with explicit guarantees, and reports that 157 of 171 targets passed its review at roughly $0.85-2.29 each. The Lean-checked demonstrations are small illustrations, so the real test is whether such representations hold up across broader domains and whether the semantic review step scales without heavy human oversight. For AI and formal-methods readers, it is a concrete attempt to ground AI-driven scientific computing in verifiable rather than merely plausible mathematics.
Surse care acoperăarXiv, Kiro, PyTorch, NVIDIA
Ce este aceastaLectura unui model asupra articolului și a acoperirii conexe, scrisă pentru aiqbench. Nu sunt cuvintele publicației.

FARMS: A Verifiable Foundation for Automated Computational Science

arXiv2 min de cititArticolul și perspectiva sunt în engleză.

arXiv:2610.40560v1 Announce Type: new Abstract: Automated computational science could accelerate discovery by selecting, adapting and developing numerical methods. This prospect requires mathematical knowledge that AI systems can interpret and reuse with explicit guarantees. Here we present FARMS, a faithful and efficient foundation that transforms computational mathematics into AI-ready computing knowledge. FARMS connects formal statements to source context, algorithmic meaning and quantitative guarantees through source preparation, reusable representations and semantic review. Across 171 targets in randomized numerical linear algebra and numerical partial differential equations, 157 were accepted by the pipeline, with mean estimated costs of US \$0.85-2.29 per target across sources. Lean-checked implications from explicit source premises connect selected statements to computational skills, illustrated by a heat-flow solve and wave-response compression. FARMS therefore supports an affordable, reusable knowledge foundation for trustworthy automated computational science.

Abstract:Automated computational science could accelerate discovery by selecting, adapting and developing numerical methods. This prospect requires mathematical knowledge that AI systems can interpret and reuse with explicit guarantees. Here we present FARMS, a faithful and efficient foundation that transforms computational mathematics into AI-ready computing knowledge. FARMS connects formal statements to source context, algorithmic meaning and quantitative guarantees through source preparation, reusable representations and semantic review. Across 171 targets in randomized numerical linear algebra and numerical partial differential equations, 157 were accepted by the pipeline, with mean estimated costs of US \$0.85-2.29 per target across sources. Lean-checked implications from explicit source premises connect selected statements to computational skills, illustrated by a heat-flow solve and wave-response compression. FARMS therefore supports an affordable, reusable knowledge foundation for trustworthy automated computational science.

Artificial Intelligence (cs.AI); Logic in Computer Science (cs.LO)

arXiv:2610.40560 [cs.AI]

(or arXiv:2610.40560v1 [cs.AI] for this version)

https://doi.org/10.48550/arXiv.2610.40560 Focus to learn more arXiv-issued DOI via DataCite

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.

Text integral sub licența deschisă a publicației · 225 cuvinte

Subiecte conexe