arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2603.16980math.NAcs.LGcs.NA
收藏

可解释的AI辅助早期可靠性预测用于双参数并行根查找方案

Interpretable AI-Assisted Early Reliability Prediction for a Two-Parameter Parallel Root-Finding Scheme

Faculty of Engineering, Free University of Bozen–Bolzano(博尔扎诺-博洛尼亚自由大学工程学院);Institute of Physics and Technology, Petrozavodsk State University(佩尔茨瓦多夫州立大学物理与技术学院);Department of Mathematics, Faculty of Arts and Science, Balikesir University(巴利克谢尔大学艺术与科学学院数学系);Department of Mathematics and Statistics, Riphah International University(里帕哈国际大学数学与统计学系)

Bruno Carpentieri, Andrei Velichko, Mudassir Shams, Paola Lecca

AI总结:

本文提出基于kNN-LLE代理稳定性分析的可解释AI辅助可靠性诊断框架,通过多时间尺度早期预测实现对参数化根查找方案稳定性的早期识别,实验表明该框架在少量迭代后即可实现较高的预测精度。

摘要:

我们提出了一种基于kNN-LLE代理稳定性分析的可解释AI辅助可靠性诊断框架,用于参数化根查找方案。该方法通过多时间尺度早期预测,为数值求解器添加了一个轻量级预测层,能够从迭代动态的短前缀估计求解器的可靠性,从而早期识别稳定和不稳定的参数区域。对于参数空间中的每个配置,构建了最大李雅普诺夫指数(LLE)估计器的原始和平滑代理轮廓,从中推导出基于收缩性的可靠性评分,总结有限时间收敛性。机器学习模型从代理轮廓的早期段预测可靠性评分,使框架能够确定求解器动态何时变得诊断性有用。实验表明,在双参数并行根查找方案中,仅在少量迭代后即可实现可靠的预测:最佳模型在T=1时R²=0.48,T=3时提升到R²=0.67,并在稳定性轮廓的特征最小尺度之前超过R²=0.89。预测精度在更大时间尺度上增加到R²=0.96,均方误差约为0.03,而推理成本保持极低(每样本微秒级)。该框架提供了可解释的稳定性指标,并支持求解器执行过程中的早期决策,如继续、重启或调整参数。

英文摘要:

We propose an interpretable AI-assisted reliability diagnostic framework for parameterized root-finding schemes based on kNN-LLE proxy stability profiling and multi-horizon early prediction. The approach augments a numerical solver with a lightweight predictive layer that estimates solver reliability from short prefixes of iteration dynamics, enabling early identification of stable and unstable parameter regimes. For each configuration in the parameter space, raw and smoothed proxy profiles of a largest Lyapunov exponent (LLE) estimator are constructed, from which contractivity-based reliability scores summarizing finite-time convergence are derived. Machine learning models predict the reliability score from early segments of the proxy profile, allowing the framework to determine when solver dynamics become diagnostically informative. Experiments on a two-parameter parallel root-finding scheme show reliable prediction after only a few iterations: the best models achieve R^2=0.48 at horizon T=1, improve to R^2=0.67 by T=3, and exceed R^2=0.89 before the characteristic minimum-location scale of the stability profile. Prediction accuracy increases to R^2=0.96 at larger horizons, with mean absolute errors around 0.03, while inference costs remain negligible (microseconds per sample). The framework provides interpretable stability indicators and supports early decisions during solver execution, such as continuing, restarting, or adjusting parameters.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑