跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+0新增论文
+0其中 AI 相关
+0已有论文修订
+93新增 AI 导读

arXiv 最近完成扫描:2026-11-16 01:34 · 全站最近入库:2026-11-14 15:09各信源进度 →

统计口径与数据新鲜度

统计 2026-11-15 07:53 — 2026-11-16 07:53(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-16 01:34最近发现新增版本:2026-11-14 15:09库内论文最新更新时间:2026-11-13 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

23,348 已收录论文19,580 AI 相关6,729 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 2 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-16 01:33(北京时间)
新论文 · v1arXiv:2611.04469

EvoCG: Self-Evolving Precision Control for Faster Conjugate Gradient

Jiaqi Zhai, Haozhi Han, Kaiyi Huang, Wenju Zhao, Yifeng Chen, Yunquan Zhang, Ting Cao, Yunxin Liu 等 11 位作者

原文摘要

Modern GPUs offer far higher throughput in low precision than in FP64, but exploiting this in conjugate gradient (CG) solvers is difficult because tolerance to reduced precision evolves with the Krylov state. We present EvoCG, a mixed-precision CG solver that treats tile-wise precision as an online control action rather than a fixed setting: a reinforcement-learning policy in the iteration loop selects per-tile precision from the evolving solver state, made profitable by co-design with a Tile-CSC unified mixed-precision SpMV kernel and a low-overhead in-loop runtime. Across 47 SPD matrices from eight scientific domains, EvoCG is the fastest solver overall, with geometric-mean speedups of 2.52x, 3.06x, 2.48x, 1.93x, and 6.99x over cuSPARSE, PETSc, Ginkgo, Mille-FP64, and Mille-Mixed. On the same substrate, it improves time-to-solution over EvoCG-FP64 by 1.28x at only 11.4% more iterations and 1.09% overhead, with FP64-recomputed final true-residual norms nearly identical to those of FP64, and extends to Jacobi-preconditioned CG without retraining, yielding a further 1.15x geometric-mean speedup over EvoCG-FP64.

cs.DC

版本更新 · v2arXiv:2610.28629

Mechanistic discovery in grain boundary structure and deformation driven by agentic AI

Yazhuo Liu, Kunqing Ding, Xiaoguo Gong, Zifeng Wang, Yichen Yang, Yifeng Che, Wen Chen, Josh Kacher 等 11 位作者

原文摘要

Agentic artificial intelligence (AI) systems hold immense potential for automating complex workflows in materials discovery and design, but extending these capabilities to domain-intensive mechanistic studies remains challenging. General grain boundaries (GBs) exemplify this challenge, as their structural complexity complicates experimental characterization and atomistic modeling. Here, we present GBClaw, an agentic AI framework for investigating the structure and deformation of general GBs, which are common in real polycrystals yet remain understudied. By integrating large language models into a modular architecture, GBClaw effectively combines systematic simulations with targeted mechanistic analysis through iterative workflow refinement and dynamic replanning. Applied to 14 general asymmetric tilt GBs in nickel, the framework characterized interfacial defect structures and deformation modes across these incommensurate boundaries. It established a general approach to identify previously unobserved, widely spaced secondary GB misfit dislocations (SGBMDs) alongside closely spaced primary GB misfit dislocations (PGBMDs) in simulated atomic configurations and experimental images. Comparisons of GB sliding with and without SGBMDs revealed substantial differences in shear strength, underscoring the critical role of misfit-dislocation hierarchies in sliding resistance. Researcher-guided follow-up calculations further elucidated the structural origins of shear asymmetry and an anomalous shear response. This work demonstrates that combining agentic AI with domain expertise bridges high-throughput computational screening and deep mechanistic discovery at complex material interfaces.

cond-mat.mtrl-sci · cond-mat.mes-hall · cs.AI · cs.MA