Daily Tech Briefing
AI 科技速览
每天 5 分钟内学习 AI。获取最新的人工智能新闻,理解其重要性,并学习如何将其应用于您的工作。
arXiv AI · 2026/7/22 04:00:00
From Agent Failure Paths to Quantified Residual Risk: A Compositional Framework for Resilient Agentic AI
AI 中文解读
AI风险管理的“黑箱”终于被打开了!研究人员推出CPSAINT框架,能把AI系统内部故障路径一步步拆解,并转化为可量化的风险数值。以前要么只描述故障原因,要么只给个风险分数但不知道内部发生了什么,现在两件事能同时做。他们用七层结构(比如物理状态、传感器、数据、计算、执行器等)标出每个环节可能出错的点,再通过一个叫FRIESA-K的数学模型,把故障严重性变成具体数字。这套方法已在仓库机器人和金融助手两个截然不同的场景中验证,同样一套规则都能用。
这意味着未来使用AI时,我们不仅能知道“可能出问题”,还能清楚知道“出问题的概率有多大、后果多严重”。比如你家送货机器人突然卡住,系统能提前计算出是传感器故障还是环境干扰,并给出剩余风险值,厂商就能及时修补。金融机构使用AI做投资建议时,监管也能通过这套框架抓到具体风险点,而不是只看输出结果。总之,AI会变得更可靠,用户用起来也更放心。
arXiv:2607.18243v1 Announce Type: new
Abstract: Agentic AI is crossing trust boundaries faster than current risk models can represent. Existing approaches provide one of two partial views. They either describe failure mechanisms without producing a transferable residual-risk estimate, or they produce a risk estimate while treating the internal failure path as a black box. We couple those two views by proposing CPSAINT, a seven-layer integrity decomposition over Physical state, Sensors, Data, Compute, Actuators, Environment, and Time, paired with FRIESA-K, a residual-risk functional that maps each failure path to a quantified risk instance. FRIESA-K grounds the resistance term K in a controlled absorbing Markov model so that control effectiveness is derived from state dynamics rather than assigned as an informal score. The result is a concise mechanism-to magnitude pipeline for resilient agentic and embodied AI. We report governance observability through a separate additive penalty instead of inserting governance as a new variable in the resistance functional. We formalize structural composability linking valid failure paths to well-defined risk instances and show the framework on two contrasting scenarios a hard real-time warehouse robot and a governance-instrumented financial-services agent. Across both cases, the same layer grammar, variable semantics, and dynamic-resistance construction remain intact. Thus, we obtain a compact kernel that supports cross-domain reasoning, explicit assumptions, and quantitatively grounded formalism of composable trust.
分享
阅读原文 ↗