跳到正文
返回论文列表
cs.AI提交于 已译

FARMS:面向自动化计算科学的可验证基础

FARMS: A Verifiable Foundation for Automated Computational Science

Di Wu · Ling Liang · Haizhao Yang

中文摘要

自动化计算科学有望通过选择、适配与开发数值方法来加速发现,但这一前景需要 AI 系统能够解释并复用、且带有显式保证的数学知识。FARMS 将计算数学转化为 AI 可用的计算知识,通过源准备、可复用表示与语义审查,把形式化陈述与源上下文、算法含义及定量保证连接起来。在随机数值线性代数与数值偏微分方程的 171 个目标中,157 个被流水线接受,各来源每目标平均估计成本为 0.85-2.29 美元。由显式源前提经 Lean 检查的蕴含关系将选定陈述与计算技能相连,并以热流求解与波响应压缩为例说明。FARMS 由此为可信的自动化计算科学提供低成本、可复用的知识基础。

关键要点

  1. 01自动化计算科学需要 AI 可解释、可复用且带显式保证的数学知识
  2. 02FARMS 通过源准备、可复用表示与语义审查连接形式化陈述与算法含义
  3. 03171 个随机数值线性代数与数值 PDE 目标中 157 个被接受,每目标成本 0.85-2.29 美元
  4. 04Lean 检查的蕴含关系将源前提与计算技能相连,示例含热流求解与波响应压缩

解读

尚无解读。

原始英文摘要

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.

同方向论文 · cs.AI

查看全部 →

反向发现 · 这篇论文相关的工具与提示词

去交叉发现 →

关联提示词 · 1